1#ifndef _ADDRESS_TABLE_H
2#define _ADDRESS_TABLE_H 1
3
4
5
6
7
8
9#define _8K_TABLE 0
10#define ADDRESS_TABLE_ALIGNMENT 8
11#define HASH_DEFAULT_MODE 14
12#define HASH_MODE 13
13#define HASH_SIZE 12
14#define HOP_NUMBER 12
15#define MAC_ADDRESS_STRING_SIZE 12
16#define MAC_ENTRY_SIZE sizeof(addrTblEntry)
17#define MAX_NUMBER_OF_ADDRESSES_TO_STORE 1000
18#define PROMISCUOUS_MODE 0
19#define SKIP 1<<1
20#define SKIP_BIT 1
21#define VALID 1
22
23
24
25
26
27#define NIBBLE_SWAPPING_32_BIT(X) ( (((X) & 0xf0f0f0f0) >> 4) \
28 | (((X) & 0x0f0f0f0f) << 4) )
29
30#define NIBBLE_SWAPPING_16_BIT(X) ( (((X) & 0x0000f0f0) >> 4) \
31 | (((X) & 0x00000f0f) << 4) )
32
33#define FLIP_4_BITS(X) ( (((X) & 0x01) << 3) | (((X) & 0x002) << 1) \
34 | (((X) & 0x04) >> 1) | (((X) & 0x008) >> 3) )
35
36#define FLIP_6_BITS(X) ( (((X) & 0x01) << 5) | (((X) & 0x020) >> 5) \
37 | (((X) & 0x02) << 3) | (((X) & 0x010) >> 3) \
38 | (((X) & 0x04) << 1) | (((X) & 0x008) >> 1) )
39
40#define FLIP_9_BITS(X) ( (((X) & 0x01) << 8) | (((X) & 0x100) >> 8) \
41 | (((X) & 0x02) << 6) | (((X) & 0x080) >> 6) \
42 | (((X) & 0x04) << 4) | (((X) & 0x040) >> 4) \
43 | ((X) & 0x10) | (((X) & 0x08) << 2) | (((X) & 0x020) >> 2) )
44
45
46
47
48
49
50
51#define MASK( fieldWidth ) ((1 << (fieldWidth)) - 1)
52#define leftShiftedBitfield( V,O,W,S) (((V) & (MASK(W) << (O))) << (S))
53#define rightShiftedBitfield(V,O,W,S) (((u32)((V) & (MASK(W) << (O)))) >> (S))
54
55
56
57
58
59
60
61
62
63
64#define DCACHE_FLUSH_N_SYNC( A, N ) flush_dcache_range( (A), ((A)+(N)) )
65
66
67typedef struct addressTableEntryStruct {
68 u32 hi;
69 u32 lo;
70} addrTblEntry;
71
72u32
73uncachedPages( u32 pages );
74u32
75hashTableFunction( u32 macH, u32 macL, u32 HashSize, u32 hash_mode );
76
77unsigned int
78initAddressTable( u32 port, u32 hashMode, u32 hashSize );
79
80int
81addAddressTableEntry( u32 port, u32 macH, u32 macL, u32 rd, u32 skip );
82
83#endif
84