File Manager

003 File Manager

Current Path: /usr/src/sys/dev/isci/scil

📁 ..
📄 intel_ata.h(25.31 KB)
📄 intel_pci.h(3.08 KB)
📄 intel_sas.h(30.43 KB)
📄 intel_sat.h(3.79 KB)
📄 intel_sata.h(8.02 KB)
📄 intel_scsi.h(20.25 KB)
📄 sati.c(39.3 KB)
📄 sati.h(10.92 KB)
📄 sati_abort_task_set.c(6.05 KB)
📄 sati_abort_task_set.h(3.27 KB)
📄 sati_atapi.c(8.5 KB)
📄 sati_atapi.h(7.71 KB)
📄 sati_callbacks.h(16.32 KB)
📄 sati_design.h(7.36 KB)
📄 sati_device.c(8.93 KB)
📄 sati_device.h(6.68 KB)
📄 sati_inquiry.c(27.11 KB)
📄 sati_inquiry.h(4.15 KB)
📄 sati_log_sense.c(24.41 KB)
📄 sati_log_sense.h(3.44 KB)
📄 sati_lun_reset.c(4.82 KB)
📄 sati_lun_reset.h(3.16 KB)
📄 sati_mode_pages.c(9.41 KB)
📄 sati_mode_pages.h(4.89 KB)
📄 sati_mode_select.c(37.17 KB)
📄 sati_mode_select.h(3.29 KB)
📄 sati_mode_sense.c(29.7 KB)
📄 sati_mode_sense.h(5.1 KB)
📄 sati_mode_sense_10.c(19.27 KB)
📄 sati_mode_sense_10.h(4.23 KB)
📄 sati_mode_sense_6.c(15.91 KB)
📄 sati_mode_sense_6.h(4.22 KB)
📄 sati_move.c(22.63 KB)
📄 sati_move.h(4.43 KB)
📄 sati_passthrough.c(17.55 KB)
📄 sati_passthrough.h(3.36 KB)
📄 sati_read.c(11.59 KB)
📄 sati_read.h(3.45 KB)
📄 sati_read_buffer.c(8.13 KB)
📄 sati_read_buffer.h(3.15 KB)
📄 sati_read_capacity.c(13.36 KB)
📄 sati_read_capacity.h(3.55 KB)
📄 sati_reassign_blocks.c(21.91 KB)
📄 sati_reassign_blocks.h(3.12 KB)
📄 sati_report_luns.c(5.04 KB)
📄 sati_report_luns.h(3.11 KB)
📄 sati_request_sense.c(12.11 KB)
📄 sati_request_sense.h(3.41 KB)
📄 sati_start_stop_unit.c(14.45 KB)
📄 sati_start_stop_unit.h(4.2 KB)
📄 sati_synchronize_cache.c(4.66 KB)
📄 sati_synchronize_cache.h(2.94 KB)
📄 sati_test_unit_ready.c(6.63 KB)
📄 sati_test_unit_ready.h(3.18 KB)
📄 sati_translator_sequence.h(10.92 KB)
📄 sati_types.h(5.14 KB)
📄 sati_unmap.c(22.99 KB)
📄 sati_unmap.h(4.66 KB)
📄 sati_util.c(72.2 KB)
📄 sati_util.h(13.53 KB)
📄 sati_verify.c(10.08 KB)
📄 sati_verify.h(3.23 KB)
📄 sati_write.c(11.64 KB)
📄 sati_write.h(3.45 KB)
📄 sati_write_and_verify.c(8.64 KB)
📄 sati_write_and_verify.h(3.45 KB)
📄 sati_write_buffer.c(8.94 KB)
📄 sati_write_buffer.h(3.06 KB)
📄 sati_write_long.c(8.25 KB)
📄 sati_write_long.h(3.2 KB)
📄 sci_abstract_list.c(15.87 KB)
📄 sci_abstract_list.h(36.67 KB)
📄 sci_base_controller.c(4.18 KB)
📄 sci_base_controller.h(11.67 KB)
📄 sci_base_domain.c(3.36 KB)
📄 sci_base_domain.h(9.88 KB)
📄 sci_base_iterator.c(5.56 KB)
📄 sci_base_iterator.h(4.34 KB)
📄 sci_base_library.c(3.71 KB)
📄 sci_base_library.h(6.19 KB)
📄 sci_base_logger.c(9.68 KB)
📄 sci_base_logger.h(4.12 KB)
📄 sci_base_memory_descriptor_list.c(5.99 KB)
📄 sci_base_memory_descriptor_list.h(5.97 KB)
📄 sci_base_memory_descriptor_list_decorator.c(5.42 KB)
📄 sci_base_object.c(4.06 KB)
📄 sci_base_object.h(4.74 KB)
📄 sci_base_observer.c(3.79 KB)
📄 sci_base_observer.h(5.39 KB)
📄 sci_base_phy.c(3.32 KB)
📄 sci_base_phy.h(6.67 KB)
📄 sci_base_port.c(3.29 KB)
📄 sci_base_port.h(7.1 KB)
📄 sci_base_remote_device.c(3 KB)
📄 sci_base_remote_device.h(9.65 KB)
📄 sci_base_request.c(2.98 KB)
📄 sci_base_request.h(6.48 KB)
📄 sci_base_state.h(3.6 KB)
📄 sci_base_state_machine.c(7.36 KB)
📄 sci_base_state_machine.h(5.04 KB)
📄 sci_base_state_machine_logger.c(8.77 KB)
📄 sci_base_state_machine_logger.h(5.47 KB)
📄 sci_base_state_machine_observer.c(3.81 KB)
📄 sci_base_state_machine_observer.h(4.67 KB)
📄 sci_base_subject.c(4.91 KB)
📄 sci_base_subject.h(4.8 KB)
📄 sci_controller.h(4.38 KB)
📄 sci_controller_constants.h(7.19 KB)
📄 sci_fast_list.h(11.91 KB)
📄 sci_iterator.h(4.23 KB)
📄 sci_library.h(3.71 KB)
📄 sci_logger.h(9.93 KB)
📄 sci_memory_descriptor_list.h(6.25 KB)
📄 sci_memory_descriptor_list_decorator.h(5.28 KB)
📄 sci_object.h(5.19 KB)
📄 sci_overview.h(10.95 KB)
📄 sci_pool.h(6.18 KB)
📄 sci_simple_list.h(11.04 KB)
📄 sci_status.h(14.61 KB)
📄 sci_types.h(8.59 KB)
📄 sci_util.c(2.72 KB)
📄 sci_util.h(5.54 KB)
📄 scic_config_parameters.h(11.02 KB)
📄 scic_controller.h(35.07 KB)
📄 scic_io_request.h(27 KB)
📄 scic_library.h(9.29 KB)
📄 scic_logger.h(5.26 KB)
📄 scic_overview.h(3.58 KB)
📄 scic_phy.h(15.08 KB)
📄 scic_port.h(8.01 KB)
📄 scic_remote_device.h(16.95 KB)
📄 scic_sds_controller.c(219.91 KB)
📄 scic_sds_controller.h(25.17 KB)
📄 scic_sds_controller_registers.h(15.37 KB)
📄 scic_sds_library.c(8.78 KB)
📄 scic_sds_library.h(3.81 KB)
📄 scic_sds_logger.h(3.33 KB)
📄 scic_sds_pci.c(8.47 KB)
📄 scic_sds_pci.h(4.64 KB)
📄 scic_sds_phy.c(120.86 KB)
📄 scic_sds_phy.h(14.08 KB)
📄 scic_sds_phy_registers.h(9.56 KB)
📄 scic_sds_port.c(104.9 KB)
📄 scic_sds_port.h(16.3 KB)
📄 scic_sds_port_configuration_agent.c(38.16 KB)
📄 scic_sds_port_configuration_agent.h(4.26 KB)
📄 scic_sds_port_registers.h(4.69 KB)
📄 scic_sds_remote_device.c(85.08 KB)
📄 scic_sds_remote_device.h(20.58 KB)
📄 scic_sds_remote_node_context.c(45.54 KB)
📄 scic_sds_remote_node_context.h(12.77 KB)
📄 scic_sds_remote_node_table.c(22.19 KB)
📄 scic_sds_remote_node_table.h(6.63 KB)
📄 scic_sds_request.c(88.54 KB)
📄 scic_sds_request.h(16.53 KB)
📄 scic_sds_sgpio.c(8.43 KB)
📄 scic_sds_smp_remote_device.c(12.13 KB)
📄 scic_sds_smp_request.c(29.64 KB)
📄 scic_sds_smp_request.h(3.01 KB)
📄 scic_sds_ssp_request.c(11.96 KB)
📄 scic_sds_stp_packet_request.c(32.87 KB)
📄 scic_sds_stp_packet_request.h(6.06 KB)
📄 scic_sds_stp_pio_request.h(4.49 KB)
📄 scic_sds_stp_remote_device.c(35.79 KB)
📄 scic_sds_stp_request.c(80.59 KB)
📄 scic_sds_stp_request.h(8.91 KB)
📄 scic_sds_unsolicited_frame_control.c(14.8 KB)
📄 scic_sds_unsolicited_frame_control.h(9.62 KB)
📄 scic_sgpio.h(9.79 KB)
📄 scic_task_request.h(7.41 KB)
📄 scic_user_callback.h(41.37 KB)
📄 scif_config_parameters.h(6.19 KB)
📄 scif_controller.h(17.94 KB)
📄 scif_domain.h(7.18 KB)
📄 scif_io_request.h(10.26 KB)
📄 scif_library.h(6.96 KB)
📄 scif_logger.h(4.54 KB)
📄 scif_overview.h(5.27 KB)
📄 scif_remote_device.h(12.12 KB)
📄 scif_sas_constants.h(2.97 KB)
📄 scif_sas_controller.c(39.23 KB)
📄 scif_sas_controller.h(9.32 KB)
📄 scif_sas_controller_state_handlers.c(66.96 KB)
📄 scif_sas_controller_states.c(13.31 KB)
📄 scif_sas_design.h(15.75 KB)
📄 scif_sas_domain.c(49.41 KB)
📄 scif_sas_domain.h(9.6 KB)
📄 scif_sas_domain_state_handlers.c(58.4 KB)
📄 scif_sas_domain_states.c(20.18 KB)
📄 scif_sas_high_priority_request_queue.c(5.86 KB)
📄 scif_sas_high_priority_request_queue.h(4.5 KB)
📄 scif_sas_internal_io_request.c(9.31 KB)
📄 scif_sas_internal_io_request.h(5.11 KB)
📄 scif_sas_io_request.c(27.08 KB)
📄 scif_sas_io_request.h(5.08 KB)
📄 scif_sas_io_request_state_handlers.c(13.93 KB)
📄 scif_sas_io_request_states.c(8.65 KB)
📄 scif_sas_library.c(8.96 KB)
📄 scif_sas_library.h(3.54 KB)
📄 scif_sas_logger.h(3.33 KB)
📄 scif_sas_remote_device.c(26.69 KB)
📄 scif_sas_remote_device.h(16.3 KB)
📄 scif_sas_remote_device_ready_substate_handlers.c(28.59 KB)
📄 scif_sas_remote_device_ready_substates.c(9.95 KB)
📄 scif_sas_remote_device_starting_substate_handlers.c(11.85 KB)
📄 scif_sas_remote_device_starting_substates.c(5.1 KB)
📄 scif_sas_remote_device_state_handlers.c(43.12 KB)
📄 scif_sas_remote_device_states.c(17.46 KB)
📄 scif_sas_request.c(6.87 KB)
📄 scif_sas_request.h(6.91 KB)
📄 scif_sas_sati_binding.h(11.21 KB)
📄 scif_sas_smp_activity_clear_affiliation.c(8.52 KB)
📄 scif_sas_smp_io_request.c(19.84 KB)
📄 scif_sas_smp_io_request.h(4.87 KB)
📄 scif_sas_smp_phy.c(11.61 KB)
📄 scif_sas_smp_phy.h(5.88 KB)
📄 scif_sas_smp_remote_device.c(92.85 KB)
📄 scif_sas_smp_remote_device.h(13.24 KB)
📄 scif_sas_stp_io_request.c(21.64 KB)
📄 scif_sas_stp_io_request.h(3.7 KB)
📄 scif_sas_stp_remote_device.c(7.46 KB)
📄 scif_sas_stp_remote_device.h(3.99 KB)
📄 scif_sas_stp_task_request.c(9.92 KB)
📄 scif_sas_stp_task_request.h(3.73 KB)
📄 scif_sas_task_request.c(16.16 KB)
📄 scif_sas_task_request.h(4.92 KB)
📄 scif_sas_task_request_state_handlers.c(13.5 KB)
📄 scif_sas_task_request_states.c(8.87 KB)
📄 scif_sas_timer.c(4.4 KB)
📄 scif_task_request.h(5.28 KB)
📄 scif_user_callback.h(37.98 KB)
📄 scu_bios_definitions.h(36.53 KB)
📄 scu_completion_codes.h(10.96 KB)
📄 scu_constants.h(6.55 KB)
📄 scu_event_codes.h(11.77 KB)
📄 scu_registers.h(83.65 KB)
📄 scu_remote_node_context.h(7.11 KB)
📄 scu_task_context.h(26.33 KB)
📄 scu_unsolicited_frame.h(4.1 KB)
📄 scu_viit_data.h(6.23 KB)

Editing: scic_sds_remote_node_table.c

/*-
 * SPDX-License-Identifier: BSD-2-Clause OR GPL-2.0
 *
 * This file is provided under a dual BSD/GPLv2 license.  When using or
 * redistributing this file, you may do so under either license.
 *
 * GPL LICENSE SUMMARY
 *
 * Copyright(c) 2008 - 2011 Intel Corporation. All rights reserved.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of version 2 of the GNU General Public License as
 * published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
 * The full GNU General Public License is included in this distribution
 * in the file called LICENSE.GPL.
 *
 * BSD LICENSE
 *
 * Copyright(c) 2008 - 2011 Intel Corporation. All rights reserved.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 *   * Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *   * Redistributions in binary form must reproduce the above copyright
 *     notice, this list of conditions and the following disclaimer in
 *     the documentation and/or other materials provided with the
 *     distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");

/**
 * @file
 *
 * @brief This file contains the implementation of the
 *        SCIC_SDS_REMOTE_NODE_TABLE public, protected, and private methods.
 */

#include <dev/isci/scil/scic_sds_remote_node_table.h>
#include <dev/isci/scil/scic_sds_remote_node_context.h>

/**
 * This routine will find the bit position in absolute bit terms of the next
 * available bit for selection.  The absolute bit is index * 32 + bit
 * position.  If there are available bits in the first U32 then it is just bit
 * position.
 *  @param[in] remote_node_table This is the remote node index table from
 *       which the selection will be made.
 * @param[in] group_table_index This is the index to the group table from
 *       which to search for an available selection.
 *
 * @return U32 This is the absolute bit position for an available group.
 */
static
U32 scic_sds_remote_node_table_get_group_index(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        group_table_index
)
{
   U32   dword_index;
   U32 * group_table;
   U32   bit_index;

group_table = remote_node_table->remote_node_groups[group_table_index];

for (dword_index = 0; dword_index < remote_node_table->group_array_size; dword_index++)
   {
      if (group_table[dword_index] != 0)
      {
         for (bit_index = 0; bit_index < 32; bit_index++)
         {
            if ((group_table[dword_index] & (1 << bit_index)) != 0)
            {
               return (dword_index * 32) + bit_index;
            }
         }
      }
   }

return SCIC_SDS_REMOTE_NODE_TABLE_INVALID_INDEX;
}

/**
 * This method will clear the group index entry in the specified group index
 * table.
 *
 * @param[in out] remote_node_table This the remote node table in which to
 *       clear the selector.
 * @param[in] set_index This is the remote node selector in which the change
 *       will be made.
 * @param[in] group_index This is the bit index in the table to be modified.
 *
 * @return none
 */
static
void scic_sds_remote_node_table_clear_group_index(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        group_table_index,
   U32                        group_index
)
{
   U32   dword_index;
   U32   bit_index;
   U32 * group_table;

ASSERT(group_table_index < SCU_STP_REMOTE_NODE_COUNT);
   ASSERT(group_index < (U32)(remote_node_table->group_array_size * 32));

dword_index = group_index / 32;
   bit_index   = group_index % 32;
   group_table = remote_node_table->remote_node_groups[group_table_index];

group_table[dword_index] = group_table[dword_index] & ~(1 << bit_index);
}

/**
 * This method will set the group index bit entry in the specified group index
 * table.
 *
 * @param[in out] remote_node_table This the remote node table in which to set
 *       the selector.
 * @param[in] group_table_index This is the remote node selector in which the
 *       change will be made.
 * @param[in] group_index This is the bit position in the table to be
 *       modified.
 *
 * @return none
 */
static
void scic_sds_remote_node_table_set_group_index(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        group_table_index,
   U32                        group_index
)
{
   U32   dword_index;
   U32   bit_index;
   U32 * group_table;

ASSERT(group_table_index < SCU_STP_REMOTE_NODE_COUNT);
   ASSERT(group_index < (U32)(remote_node_table->group_array_size * 32));

dword_index = group_index / 32;
   bit_index   = group_index % 32;
   group_table = remote_node_table->remote_node_groups[group_table_index];

group_table[dword_index] = group_table[dword_index] | (1 << bit_index);
}

/**
 * This method will set the remote to available in the remote node allocation
 * table.
 *
 * @param[in out] remote_node_table This is the remote node table in which to
 *       modify the remote node availability.
 * @param[in] remote_node_index This is the remote node index that is being
 *       returned to the table.
 *
 * @return none
 */
static
void scic_sds_remote_node_table_set_node_index(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        remote_node_index
)
{
   U32 dword_location;
   U32 dword_remainder;
   U32 slot_normalized;
   U32 slot_position;

ASSERT(
        (remote_node_table->available_nodes_array_size * SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD)
      > (remote_node_index / SCU_STP_REMOTE_NODE_COUNT)
   );

dword_location  = remote_node_index / SCIC_SDS_REMOTE_NODES_PER_DWORD;
   dword_remainder = remote_node_index % SCIC_SDS_REMOTE_NODES_PER_DWORD;
   slot_normalized = (dword_remainder / SCU_STP_REMOTE_NODE_COUNT) * sizeof(U32);
   slot_position   = remote_node_index % SCU_STP_REMOTE_NODE_COUNT;

remote_node_table->available_remote_nodes[dword_location] |=
      1 << (slot_normalized + slot_position);
}

/**
 * This method clears the remote node index from the table of available remote
 * nodes.
 *
 * @param[in out] remote_node_table This is the remote node table from which
 *       to clear the available remote node bit.
 * @param[in] remote_node_index This is the remote node index which is to be
 *       cleared from the table.
 *
 * @return none
 */
static
void scic_sds_remote_node_table_clear_node_index(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        remote_node_index
)
{
   U32 dword_location;
   U32 dword_remainder;
   U32 slot_position;
   U32 slot_normalized;

ASSERT(
        (remote_node_table->available_nodes_array_size * SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD)
      > (remote_node_index / SCU_STP_REMOTE_NODE_COUNT)
   );

remote_node_table->available_remote_nodes[dword_location] &=
      ~(1 << (slot_normalized + slot_position));
}

/**
 * This method clears the entire table slot at the specified slot index.
 *
 * @param[in out] remote_node_table The remote node table from which the slot
 *       will be cleared.
 * @param[in] group_index The index for the slot that is to be cleared.
 *
 * @return none
 */
static
void scic_sds_remote_node_table_clear_group(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        group_index
)
{
   U32 dword_location;
   U32 dword_remainder;
   U32 dword_value;

ASSERT(
        (remote_node_table->available_nodes_array_size * SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD)
      > (group_index / SCU_STP_REMOTE_NODE_COUNT)
   );

dword_location  = group_index / SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD;
   dword_remainder = group_index % SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD;

dword_value = remote_node_table->available_remote_nodes[dword_location];
   dword_value &= ~(SCIC_SDS_REMOTE_NODE_TABLE_FULL_SLOT_VALUE << (dword_remainder * 4));
   remote_node_table->available_remote_nodes[dword_location] = dword_value;
}

/**
 * THis method sets an entire remote node group in the remote node table.
 *
 * @param[in] remote_node_table
 * @param[in] group_index
 */
static
void scic_sds_remote_node_table_set_group(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        group_index
)
{
   U32 dword_location;
   U32 dword_remainder;
   U32 dword_value;

ASSERT(
        (remote_node_table->available_nodes_array_size * SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD)
      > (group_index / SCU_STP_REMOTE_NODE_COUNT)
   );

dword_location  = group_index / SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD;
   dword_remainder = group_index % SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD;

dword_value = remote_node_table->available_remote_nodes[dword_location];
   dword_value |= (SCIC_SDS_REMOTE_NODE_TABLE_FULL_SLOT_VALUE << (dword_remainder * 4));
   remote_node_table->available_remote_nodes[dword_location] = dword_value;
}

/**
 * This method will return the group value for the specified group index.
 *
 * @param[in] remote_node_table This is the remote node table that for which
 *       the group value is to be returned.
 * @param[in] group_index This is the group index to use to find the group
 *       value.
 *
 * @return The bit values at the specified remote node group index.
 */
static
U8 scic_sds_remote_node_table_get_group_value(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        group_index
)
{
   U32 dword_location;
   U32 dword_remainder;
   U32 dword_value;

dword_location  = group_index / SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD;
   dword_remainder = group_index % SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD;

dword_value = remote_node_table->available_remote_nodes[dword_location];
   dword_value &= (SCIC_SDS_REMOTE_NODE_TABLE_FULL_SLOT_VALUE << (dword_remainder * 4));
   dword_value = dword_value >> (dword_remainder * 4);

return (U8)dword_value;
}

/**
 * This method will initialize the remote node table for use.
 *
 * @param[in out] remote_node_table The remote that which is to be
 *       initialized.
 * @param[in] remote_node_entries The number of entries to put in the table.
 *
 * @return none
 */
void scic_sds_remote_node_table_initialize(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        remote_node_entries
)
{
   U32 index;

// Initialize the raw data we could improve the speed by only initializing
   // those entries that we are actually going to be used
   memset(
      remote_node_table->available_remote_nodes,
      0x00,
      sizeof(remote_node_table->available_remote_nodes)
   );

memset(
      remote_node_table->remote_node_groups,
      0x00,
      sizeof(remote_node_table->remote_node_groups)
   );

// Initialize the available remote node sets
   remote_node_table->available_nodes_array_size = (U16)
        (remote_node_entries / SCIC_SDS_REMOTE_NODES_PER_DWORD)
      + ((remote_node_entries % SCIC_SDS_REMOTE_NODES_PER_DWORD) != 0);

// Initialize each full DWORD to a FULL SET of remote nodes
   for (index = 0; index < remote_node_entries; index++)
   {
      scic_sds_remote_node_table_set_node_index(remote_node_table, index);
   }

remote_node_table->group_array_size = (U16)
        (remote_node_entries / (SCU_STP_REMOTE_NODE_COUNT * 32))
      + ((remote_node_entries % (SCU_STP_REMOTE_NODE_COUNT * 32)) != 0);

for (index = 0; index < (remote_node_entries / SCU_STP_REMOTE_NODE_COUNT); index++)
   {
      // These are all guaranteed to be full slot values so fill them in the
      // available sets of 3 remote nodes
      scic_sds_remote_node_table_set_group_index(remote_node_table, 2, index);
   }

// Now fill in any remainders that we may find
   if ((remote_node_entries % SCU_STP_REMOTE_NODE_COUNT) == 2)
   {
      scic_sds_remote_node_table_set_group_index(remote_node_table, 1, index);
   }
   else if ((remote_node_entries % SCU_STP_REMOTE_NODE_COUNT) == 1)
   {
      scic_sds_remote_node_table_set_group_index(remote_node_table, 0, index);
   }
}

/**
 * This method will allocate a single RNi from the remote node table.  The
 * table index will determine from which remote node group table to search.
 * This search may fail and another group node table can be specified.  The
 * function is designed to allow a serach of the available single remote node
 * group up to the triple remote node group.  If an entry is found in the
 * specified table the remote node is removed and the remote node groups are
 * updated.
 *
 * @param[in out] remote_node_table The remote node table from which to
 *       allocate a remote node.
 * @param[in] table_index The group index that is to be used for the search.
 *
 * @return The RNi value or an invalid remote node context if an RNi can not
 *         be found.
 */
static
U16 scic_sds_remote_node_table_allocate_single_remote_node(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        group_table_index
)
{
   U8  index;
   U8  group_value;
   U32 group_index;
   U16 remote_node_index = SCIC_SDS_REMOTE_NODE_CONTEXT_INVALID_INDEX;

group_index = scic_sds_remote_node_table_get_group_index(
                                             remote_node_table, group_table_index);

// We could not find an available slot in the table selector 0
   if (group_index != SCIC_SDS_REMOTE_NODE_TABLE_INVALID_INDEX)
   {
      group_value = scic_sds_remote_node_table_get_group_value(
                                    remote_node_table, group_index);

for (index = 0; index < SCU_STP_REMOTE_NODE_COUNT; index++)
      {
         if (((1 << index) & group_value) != 0)
         {
            // We have selected a bit now clear it
            remote_node_index = (U16) (group_index * SCU_STP_REMOTE_NODE_COUNT
                                       + index);

scic_sds_remote_node_table_clear_group_index(
               remote_node_table, group_table_index, group_index
            );

scic_sds_remote_node_table_clear_node_index(
               remote_node_table, remote_node_index
            );

if (group_table_index > 0)
            {
               scic_sds_remote_node_table_set_group_index(
                  remote_node_table, group_table_index - 1, group_index
               );
            }

break;
         }
      }
   }

return remote_node_index;
}

/**
 * This method will allocate three consecutive remote node context entries. If
 * there are no remaining triple entries the function will return a failure.
 *
 * @param[in] remote_node_table This is the remote node table from which to
 *       allocate the remote node entries.
 * @param[in] group_table_index THis is the group table index which must equal
 *       two (2) for this operation.
 *
 * @return The remote node index that represents three consecutive remote node
 *         entries or an invalid remote node context if none can be found.
 */
static
U16 scic_sds_remote_node_table_allocate_triple_remote_node(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        group_table_index
)
{
   U32 group_index;
   U16 remote_node_index = SCIC_SDS_REMOTE_NODE_CONTEXT_INVALID_INDEX;

group_index = scic_sds_remote_node_table_get_group_index(
                                             remote_node_table, group_table_index);

if (group_index != SCIC_SDS_REMOTE_NODE_TABLE_INVALID_INDEX)
   {
      remote_node_index = (U16) group_index * SCU_STP_REMOTE_NODE_COUNT;

scic_sds_remote_node_table_clear_group_index(
         remote_node_table, group_table_index, group_index
      );

scic_sds_remote_node_table_clear_group(
         remote_node_table, group_index
      );
   }

return remote_node_index;
}

/**
 * This method will allocate a remote node that mataches the remote node count
 * specified by the caller.  Valid values for remote node count is
 * SCU_SSP_REMOTE_NODE_COUNT(1) or SCU_STP_REMOTE_NODE_COUNT(3).
 *
 * @param[in] remote_node_table This is the remote node table from which the
 *       remote node allocation is to take place.
 * @param[in] remote_node_count This is ther remote node count which is one of
 *       SCU_SSP_REMOTE_NODE_COUNT(1) or SCU_STP_REMOTE_NODE_COUNT(3).
 *
 * @return U16 This is the remote node index that is returned or an invalid
 *         remote node context.
 */
U16 scic_sds_remote_node_table_allocate_remote_node(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        remote_node_count
)
{
   U16 remote_node_index = SCIC_SDS_REMOTE_NODE_CONTEXT_INVALID_INDEX;

if (remote_node_count == SCU_SSP_REMOTE_NODE_COUNT)
   {
      remote_node_index =
         scic_sds_remote_node_table_allocate_single_remote_node(
                                                         remote_node_table, 0);

if (remote_node_index == SCIC_SDS_REMOTE_NODE_CONTEXT_INVALID_INDEX)
      {
         remote_node_index =
            scic_sds_remote_node_table_allocate_single_remote_node(
                                                         remote_node_table, 2);
      }
   }
   else if (remote_node_count == SCU_STP_REMOTE_NODE_COUNT)
   {
      remote_node_index =
         scic_sds_remote_node_table_allocate_triple_remote_node(
                                                         remote_node_table, 2);
   }

return remote_node_index;
}

/**
 * This method will free a single remote node index back to the remote node
 * table.  This routine will update the remote node groups
 *
 * @param[in] remote_node_table
 * @param[in] remote_node_index
 */
static
void scic_sds_remote_node_table_release_single_remote_node(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U16                        remote_node_index
)
{
   U32 group_index;
   U8  group_value;

group_index = remote_node_index / SCU_STP_REMOTE_NODE_COUNT;

group_value = scic_sds_remote_node_table_get_group_value(remote_node_table, group_index);

// Assert that we are not trying to add an entry to a slot that is already
   // full.
   ASSERT(group_value != SCIC_SDS_REMOTE_NODE_TABLE_FULL_SLOT_VALUE);

if (group_value == 0x00)
   {
      // There are no entries in this slot so it must be added to the single
      // slot table.
      scic_sds_remote_node_table_set_group_index(remote_node_table, 0, group_index);
   }
   else if ((group_value & (group_value -1)) == 0)
   {
      // There is only one entry in this slot so it must be moved from the
      // single slot table to the dual slot table
      scic_sds_remote_node_table_clear_group_index(remote_node_table, 0, group_index);
      scic_sds_remote_node_table_set_group_index(remote_node_table, 1, group_index);
   }
   else
   {
      // There are two entries in the slot so it must be moved from the dual
      // slot table to the tripple slot table.
      scic_sds_remote_node_table_clear_group_index(remote_node_table, 1, group_index);
      scic_sds_remote_node_table_set_group_index(remote_node_table, 2, group_index);
   }

scic_sds_remote_node_table_set_node_index(remote_node_table, remote_node_index);
}

/**
 * This method will release a group of three consecutive remote nodes back to
 * the free remote nodes.
 *
 * @param[in] remote_node_table This is the remote node table to which the
 *       remote node index is to be freed.
 * @param[in] remote_node_index This is the remote node index which is being
 *       freed.
 */
static
void scic_sds_remote_node_table_release_triple_remote_node(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U16                        remote_node_index
)
{
   U32 group_index;

group_index = remote_node_index / SCU_STP_REMOTE_NODE_COUNT;

scic_sds_remote_node_table_set_group_index(
      remote_node_table, 2, group_index
   );

scic_sds_remote_node_table_set_group(remote_node_table, group_index);
}

/**
 * This method will release the remote node index back into the remote node
 * table free pool.
 *
 * @param[in] remote_node_table The remote node table to which the remote node
 *       index is to be freed.
 * @param[in] remote_node_count This is the count of consecutive remote nodes
 *       that are to be freed.
 * @param[in] remote_node_index This is the remote node index of the start of
 *       the number of remote nodes to be freed.
 */
void scic_sds_remote_node_table_release_remote_node_index(
   SCIC_REMOTE_NODE_TABLE_T * remote_node_table,
   U32                        remote_node_count,
   U16                        remote_node_index
)
{
   if (remote_node_count == SCU_SSP_REMOTE_NODE_COUNT)
   {
      scic_sds_remote_node_table_release_single_remote_node(
                                       remote_node_table, remote_node_index);
   }
   else if (remote_node_count == SCU_STP_REMOTE_NODE_COUNT)
   {
      scic_sds_remote_node_table_release_triple_remote_node(
                                       remote_node_table, remote_node_index);
   }
}

003 File Manager

Editing: scic_sds_remote_node_table.c

Upload File

Create Folder