Linux Kernel  3.7.1
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Data Fields
sci_remote_node_table Struct Reference

#include <remote_node_table.h>

Data Fields

u16 available_nodes_array_size
 
u16 group_array_size
 
u32 available_remote_nodes [(SCI_MAX_REMOTE_DEVICES/SCIC_SDS_REMOTE_NODES_PER_DWORD)+((SCI_MAX_REMOTE_DEVICES%SCIC_SDS_REMOTE_NODES_PER_DWORD)!=0)]
 
u32 remote_node_groups [SCU_STP_REMOTE_NODE_COUNT][(SCI_MAX_REMOTE_DEVICES/(32 *SCU_STP_REMOTE_NODE_COUNT))+((SCI_MAX_REMOTE_DEVICES%(32 *SCU_STP_REMOTE_NODE_COUNT))!=0)]
 

Detailed Description

struct sci_remote_node_table -

Definition at line 137 of file remote_node_table.h.

Field Documentation

u16 available_nodes_array_size

This field contains the array size in dwords

Definition at line 141 of file remote_node_table.h.

This field is the array of available remote node entries in bits. Because of the way STP remote node data is allocated on the SCU hardware the remote nodes must occupy three consecutive remote node context entries. For ease of allocation and de-allocation we have broken the sets of three into a single nibble. When the STP RNi is allocated all of the bits in the nibble are cleared. This math results in a table size of MAX_REMOTE_NODES / CONSECUTIVE RNi ENTRIES for STP / 2 entries per byte.

Definition at line 159 of file remote_node_table.h.

u16 group_array_size

This field contains the array size of the

Definition at line 146 of file remote_node_table.h.

This field is the nibble selector for the above table. There are three possible selectors each for fast lookup when trying to find one, two or three remote node entries.

Definition at line 169 of file remote_node_table.h.


The documentation for this struct was generated from the following file: