blob: 5a62c67e18f5825985796a3e689f42c8c0f3c4b7 [file] [log] [blame]
wdenk012771d2002-03-08 21:31:05 +00001#ifndef _ADDRESS_TABLE_H
2#define _ADDRESS_TABLE_H 1
3
4/*
5 * ----------------------------------------------------------------------------
6 * addressTable.h - this file has all the declarations of the address table
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 * XXX_MIKE - potential sign-extension bugs lurk here...
26 */
27#define NIBBLE_SWAPPING_32_BIT(X) ( (((X) & 0xf0f0f0f0) >> 4) \
wdenk8bde7f72003-06-27 21:31:46 +000028 | (((X) & 0x0f0f0f0f) << 4) )
wdenk012771d2002-03-08 21:31:05 +000029
30#define NIBBLE_SWAPPING_16_BIT(X) ( (((X) & 0x0000f0f0) >> 4) \
wdenk8bde7f72003-06-27 21:31:46 +000031 | (((X) & 0x00000f0f) << 4) )
wdenk012771d2002-03-08 21:31:05 +000032
33#define FLIP_4_BITS(X) ( (((X) & 0x01) << 3) | (((X) & 0x002) << 1) \
wdenk8bde7f72003-06-27 21:31:46 +000034 | (((X) & 0x04) >> 1) | (((X) & 0x008) >> 3) )
wdenk012771d2002-03-08 21:31:05 +000035
36#define FLIP_6_BITS(X) ( (((X) & 0x01) << 5) | (((X) & 0x020) >> 5) \
wdenk8bde7f72003-06-27 21:31:46 +000037 | (((X) & 0x02) << 3) | (((X) & 0x010) >> 3) \
38 | (((X) & 0x04) << 1) | (((X) & 0x008) >> 1) )
wdenk012771d2002-03-08 21:31:05 +000039
40#define FLIP_9_BITS(X) ( (((X) & 0x01) << 8) | (((X) & 0x100) >> 8) \
wdenk8bde7f72003-06-27 21:31:46 +000041 | (((X) & 0x02) << 6) | (((X) & 0x080) >> 6) \
42 | (((X) & 0x04) << 4) | (((X) & 0x040) >> 4) \
43 | ((X) & 0x10) | (((X) & 0x08) << 2) | (((X) & 0x020) >> 2) )
wdenk012771d2002-03-08 21:31:05 +000044
45/*
46 * V: value we're operating on
47 * O: offset of rightmost bit in field
48 * W: width of field to shift
49 * S: distance to shift left
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 * Push to main memory all cache lines associated with
58 * the specified range of virtual memory addresses
59 *
60 * A: Address of first byte in range to flush
61 * N: Number of bytes to flush
62 * Note - flush_dcache_range() does a "sync", does NOT invalidate
63 */
64#define DCACHE_FLUSH_N_SYNC( A, N ) flush_dcache_range( (A), ((A)+(N)) )
65
66
wdenk012771d2002-03-08 21:31:05 +000067typedef 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 /* #ifndef _ADDRESS_TABLE_H */