Lines Matching full:hash

33 #define TLB_HASH_TABLE_SIZE 256	/* The size of the clients hash table.
35 				 * because the key hash table is BYTE wide !
57 				 * packets to a Client that the Hash function
70 	u32 next;		/* The next Hash table entry index, assigned
73 	u32 prev;		/* The previous Hash table entry index,
80  * connection. This is the Clients Hash Table entry struct.
81  * Note that this is not a proper hash table; if a new client's IP address
82  * hash collides with an existing client entry, the old entry is replaced.
85  * linking all the used entries of the hash table. This allows updating
88  * There are also linked lists of entries with identical hash(ip_src). These
100 	/* list of used hash table entries, starting at rx_hashtbl_used_head */
105 	u32 src_next;	/* next entry with same hash(ip_src) */
106 	u32 src_prev;	/* prev entry with same hash(ip_src) */
107 	u32 src_first;	/* first entry with hash(ip_src) == this entry's index */
117 			 * hash table entries list. The entries in the list
133 	struct rlb_client_info	*rx_hashtbl;	/* Receive hash table */