3 #include <galileo/gt64260R.h>
4 #include <galileo/core.h>
7 #include "eth_addrtbl.h"
14 #ifdef CONFIG_GT_USE_MAC_HASH_TABLE
16 static u32 addressTableHashMode[ GAL_ETH_DEVS ] = { 0, };
17 static u32 addressTableHashSize[ GAL_ETH_DEVS ] = { 0, };
18 static addrTblEntry *addressTableBase[ GAL_ETH_DEVS ] = { 0, };
19 static void *realAddrTableBase[ GAL_ETH_DEVS ] = { 0, };
21 static const u32 hashLength[ 2 ] = {
22 (0x8000), /* 8K * 4 entries */
23 (0x8000/16), /* 512 * 4 entries */
26 /* Initialize the address table for a port, if needed */
27 unsigned int initAddressTable( u32 port, u32 hashMode, u32 hashSizeSelector)
29 unsigned int tableBase;
31 if( port < 0 || port >= GAL_ETH_DEVS ) {
32 printf("%s: Invalid port number %d\n", __FUNCTION__, port );
37 printf("%s: Invalid Hash Mode %d\n", __FUNCTION__, port );
41 if ( realAddrTableBase[port] &&
42 ( addressTableHashSize[port] != hashSizeSelector )) {
43 /* we have been here before,
44 * but now we want a different sized table
46 free( realAddrTableBase[port] );
47 realAddrTableBase[port] = 0;
48 addressTableBase[port] = 0;
52 tableBase = (unsigned int)addressTableBase[port];
53 /* we get called for every probe, so only do this once */
55 int bytes = hashLength[hashSizeSelector] * sizeof(addrTblEntry);
57 tableBase = (unsigned int)realAddrTableBase[port] = malloc(bytes+64);
61 printf("%s: alloc memory failed \n", __FUNCTION__);
65 /* align to octal byte */
66 if(tableBase&63) tableBase=(tableBase+63) & ~63;
68 addressTableHashMode[port] = hashMode;
69 addressTableHashSize[port] = hashSizeSelector;
70 addressTableBase[port] = (addrTblEntry *)tableBase;
72 memset((void *)tableBase,0,bytes);
79 * ----------------------------------------------------------------------------
80 * This function will calculate the hash function of the address.
81 * depends on the hash mode and hash size.
83 * macH - the 2 most significant bytes of the MAC address.
84 * macL - the 4 least significant bytes of the MAC address.
85 * hashMode - hash mode 0 or hash mode 1.
86 * hashSizeSelector - indicates number of hash table entries (0=0x8000,1=0x800)
88 * return the calculated entry.
91 hashTableFunction( u32 macH, u32 macL, u32 HashSize, u32 hash_mode)
104 addrH = NIBBLE_SWAPPING_16_BIT( macH );
105 addrL = NIBBLE_SWAPPING_32_BIT( macL );
107 addrHSwapped = FLIP_4_BITS( addrH & 0xf )
108 + ((FLIP_4_BITS( (addrH >> 4) & 0xf)) << 4)
109 + ((FLIP_4_BITS( (addrH >> 8) & 0xf)) << 8)
110 + ((FLIP_4_BITS( (addrH >> 12) & 0xf)) << 12);
112 addrLSwapped = FLIP_4_BITS( addrL & 0xf )
113 + ((FLIP_4_BITS( (addrL >> 4) & 0xf)) << 4)
114 + ((FLIP_4_BITS( (addrL >> 8) & 0xf)) << 8)
115 + ((FLIP_4_BITS( (addrL >> 12) & 0xf)) << 12)
116 + ((FLIP_4_BITS( (addrL >> 16) & 0xf)) << 16)
117 + ((FLIP_4_BITS( (addrL >> 20) & 0xf)) << 20)
118 + ((FLIP_4_BITS( (addrL >> 24) & 0xf)) << 24)
119 + ((FLIP_4_BITS( (addrL >> 28) & 0xf)) << 28);
121 addrH = addrHSwapped;
122 addrL = addrLSwapped;
124 if( hash_mode == 0 ) {
125 addr0 = (addrL >> 2) & 0x03f;
126 addr1 = (addrL & 0x003) | ((addrL >> 8) & 0x7f) << 2;
127 addr2 = (addrL >> 15) & 0x1ff;
128 addr3 = ((addrL >> 24) & 0x0ff) | ((addrH & 1) << 8);
130 addr0 = FLIP_6_BITS( addrL & 0x03f );
131 addr1 = FLIP_9_BITS( ((addrL >> 6) & 0x1ff));
132 addr2 = FLIP_9_BITS( (addrL >> 15) & 0x1ff);
133 addr3 = FLIP_9_BITS( (((addrL >> 24) & 0x0ff) | ((addrH & 0x1) << 8)));
136 hashResult = (addr0 << 9) | (addr1 ^ addr2 ^ addr3);
138 if( HashSize == _8K_TABLE ) {
139 hashResult = hashResult & 0xffff;
141 hashResult = hashResult & 0x07ff;
144 return( hashResult );
149 * ----------------------------------------------------------------------------
150 * This function will add an entry to the address table.
151 * depends on the hash mode and hash size that was initialized.
153 * port - ETHERNET port number.
154 * macH - the 2 most significant bytes of the MAC address.
155 * macL - the 4 least significant bytes of the MAC address.
156 * skip - if 1, skip this address.
157 * rd - the RD field in the address table.
159 * address table entry is added.
161 * FALSE if table full
164 addAddressTableEntry(
176 newLo = (((macH >> 4) & 0xf) << 15)
177 | (((macH >> 0) & 0xf) << 11)
178 | (((macH >> 12) & 0xf) << 7)
179 | (((macH >> 8) & 0xf) << 3)
180 | (((macL >> 20) & 0x1) << 31)
181 | (((macL >> 16) & 0xf) << 27)
182 | (((macL >> 28) & 0xf) << 23)
183 | (((macL >> 24) & 0xf) << 19)
184 | (skip << SKIP_BIT) | (rd << 2) | VALID;
186 newHi = (((macL >> 4) & 0xf) << 15)
187 | (((macL >> 0) & 0xf) << 11)
188 | (((macL >> 12) & 0xf) << 7)
189 | (((macL >> 8) & 0xf) << 3)
190 | (((macL >> 21) & 0x7) << 0);
193 * Pick the appropriate table, start scanning for free/reusable
194 * entries at the index obtained by hashing the specified MAC address
196 entry = addressTableBase[port];
197 entry += hashTableFunction( macH, macL, addressTableHashSize[port],
198 addressTableHashMode[port] );
199 for( i = 0; i < HOP_NUMBER; i++, entry++ ) {
200 if( !(entry->lo & VALID) /*|| (entry->lo & SKIP)*/ ) {
202 } else { /* if same address put in same position */
203 if( ((entry->lo & 0xfffffff8) == (newLo & 0xfffffff8))
204 && (entry->hi == newHi) )
211 if( i == HOP_NUMBER ) {
212 PRINTF( "addGT64260addressTableEntry: table section is full\n" );
217 * Update the selected entry
221 DCACHE_FLUSH_N_SYNC( (u32)entry, MAC_ENTRY_SIZE );
225 #endif /* CONFIG_GT_USE_MAC_HASH_TABLE */