remote_node_table.h 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189
  1. /*
  2. * This file is provided under a dual BSD/GPLv2 license. When using or
  3. * redistributing this file, you may do so under either license.
  4. *
  5. * GPL LICENSE SUMMARY
  6. *
  7. * Copyright(c) 2008 - 2011 Intel Corporation. All rights reserved.
  8. *
  9. * This program is free software; you can redistribute it and/or modify
  10. * it under the terms of version 2 of the GNU General Public License as
  11. * published by the Free Software Foundation.
  12. *
  13. * This program is distributed in the hope that it will be useful, but
  14. * WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
  21. * The full GNU General Public License is included in this distribution
  22. * in the file called LICENSE.GPL.
  23. *
  24. * BSD LICENSE
  25. *
  26. * Copyright(c) 2008 - 2011 Intel Corporation. All rights reserved.
  27. * All rights reserved.
  28. *
  29. * Redistribution and use in source and binary forms, with or without
  30. * modification, are permitted provided that the following conditions
  31. * are met:
  32. *
  33. * * Redistributions of source code must retain the above copyright
  34. * notice, this list of conditions and the following disclaimer.
  35. * * Redistributions in binary form must reproduce the above copyright
  36. * notice, this list of conditions and the following disclaimer in
  37. * the documentation and/or other materials provided with the
  38. * distribution.
  39. * * Neither the name of Intel Corporation nor the names of its
  40. * contributors may be used to endorse or promote products derived
  41. * from this software without specific prior written permission.
  42. *
  43. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  44. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  45. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  46. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  47. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  48. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  49. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  50. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  51. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  52. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  53. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  54. */
  55. #ifndef _SCIC_SDS_REMOTE_NODE_TABLE_H_
  56. #define _SCIC_SDS_REMOTE_NODE_TABLE_H_
  57. #include "isci.h"
  58. /**
  59. *
  60. *
  61. * Remote node sets are sets of remote node index in the remtoe node table The
  62. * SCU hardware requires that STP remote node entries take three consecutive
  63. * remote node index so the table is arranged in sets of three. The bits are
  64. * used as 0111 0111 to make a byte and the bits define the set of three remote
  65. * nodes to use as a sequence.
  66. */
  67. #define SCIC_SDS_REMOTE_NODE_SETS_PER_BYTE 2
  68. /**
  69. *
  70. *
  71. * Since the remote node table is organized as DWORDS take the remote node sets
  72. * in bytes and represent them in DWORDs. The lowest ordered bits are the ones
  73. * used in case full DWORD is not being used. i.e. 0000 0000 0000 0000 0111
  74. * 0111 0111 0111 // if only a single WORD is in use in the DWORD.
  75. */
  76. #define SCIC_SDS_REMOTE_NODE_SETS_PER_DWORD \
  77. (sizeof(u32) * SCIC_SDS_REMOTE_NODE_SETS_PER_BYTE)
  78. /**
  79. *
  80. *
  81. * This is a count of the numeber of remote nodes that can be represented in a
  82. * byte
  83. */
  84. #define SCIC_SDS_REMOTE_NODES_PER_BYTE \
  85. (SCU_STP_REMOTE_NODE_COUNT * SCIC_SDS_REMOTE_NODE_SETS_PER_BYTE)
  86. /**
  87. *
  88. *
  89. * This is a count of the number of remote nodes that can be represented in a
  90. * DWROD
  91. */
  92. #define SCIC_SDS_REMOTE_NODES_PER_DWORD \
  93. (sizeof(u32) * SCIC_SDS_REMOTE_NODES_PER_BYTE)
  94. /**
  95. *
  96. *
  97. * This is the number of bits in a remote node group
  98. */
  99. #define SCIC_SDS_REMOTE_NODES_BITS_PER_GROUP 4
  100. #define SCIC_SDS_REMOTE_NODE_TABLE_INVALID_INDEX (0xFFFFFFFF)
  101. #define SCIC_SDS_REMOTE_NODE_TABLE_FULL_SLOT_VALUE (0x07)
  102. #define SCIC_SDS_REMOTE_NODE_TABLE_EMPTY_SLOT_VALUE (0x00)
  103. /**
  104. *
  105. *
  106. * Expander attached sata remote node count
  107. */
  108. #define SCU_STP_REMOTE_NODE_COUNT 3
  109. /**
  110. *
  111. *
  112. * Expander or direct attached ssp remote node count
  113. */
  114. #define SCU_SSP_REMOTE_NODE_COUNT 1
  115. /**
  116. *
  117. *
  118. * Direct attached STP remote node count
  119. */
  120. #define SCU_SATA_REMOTE_NODE_COUNT 1
  121. /**
  122. * struct sci_remote_node_table -
  123. *
  124. *
  125. */
  126. struct sci_remote_node_table {
  127. /**
  128. * This field contains the array size in dwords
  129. */
  130. u16 available_nodes_array_size;
  131. /**
  132. * This field contains the array size of the
  133. */
  134. u16 group_array_size;
  135. /**
  136. * This field is the array of available remote node entries in bits.
  137. * Because of the way STP remote node data is allocated on the SCU hardware
  138. * the remote nodes must occupy three consecutive remote node context
  139. * entries. For ease of allocation and de-allocation we have broken the
  140. * sets of three into a single nibble. When the STP RNi is allocated all
  141. * of the bits in the nibble are cleared. This math results in a table size
  142. * of MAX_REMOTE_NODES / CONSECUTIVE RNi ENTRIES for STP / 2 entries per byte.
  143. */
  144. u32 available_remote_nodes[
  145. (SCI_MAX_REMOTE_DEVICES / SCIC_SDS_REMOTE_NODES_PER_DWORD)
  146. + ((SCI_MAX_REMOTE_DEVICES % SCIC_SDS_REMOTE_NODES_PER_DWORD) != 0)];
  147. /**
  148. * This field is the nibble selector for the above table. There are three
  149. * possible selectors each for fast lookup when trying to find one, two or
  150. * three remote node entries.
  151. */
  152. u32 remote_node_groups[
  153. SCU_STP_REMOTE_NODE_COUNT][
  154. (SCI_MAX_REMOTE_DEVICES / (32 * SCU_STP_REMOTE_NODE_COUNT))
  155. + ((SCI_MAX_REMOTE_DEVICES % (32 * SCU_STP_REMOTE_NODE_COUNT)) != 0)];
  156. };
  157. /* --------------------------------------------------------------------------- */
  158. void sci_remote_node_table_initialize(
  159. struct sci_remote_node_table *remote_node_table,
  160. u32 remote_node_entries);
  161. u16 sci_remote_node_table_allocate_remote_node(
  162. struct sci_remote_node_table *remote_node_table,
  163. u32 remote_node_count);
  164. void sci_remote_node_table_release_remote_node_index(
  165. struct sci_remote_node_table *remote_node_table,
  166. u32 remote_node_count,
  167. u16 remote_node_index);
  168. #endif /* _SCIC_SDS_REMOTE_NODE_TABLE_H_ */