16 struct bucket {  struct
25 #define BUCKET_NEXT(bucket)						\  argument
26 	((void *) ((bucket)->next & (~1LU)))
28 #define BUCKET_NEXT_VALID(bucket)					\  argument
29 	((bucket)->next & 1LU)
31 #define BUCKET_NEXT_SET(bucket, bucket_next)				\  argument
33 	(bucket)->next = (((uintptr_t) ((void *) (bucket_next))) | 1LU);\
36 #define BUCKET_NEXT_SET_NULL(bucket)					\  argument
38 	(bucket)->next = 0;						\
41 #define BUCKET_NEXT_COPY(bucket, bucket2)				\  argument
43 	(bucket)->next = (bucket2)->next;				\
61 	struct bucket *bkt;
92 	struct bucket *buckets;
93 	struct bucket *buckets_ext;
179 		(sizeof(struct bucket) != (RTE_CACHE_LINE_SIZE / 2)))  in rte_table_hash_ext_create()
202 	bucket_sz = RTE_CACHE_LINE_ROUNDUP(p->n_buckets * sizeof(struct bucket));  in rte_table_hash_ext_create()
204 		RTE_CACHE_LINE_ROUNDUP(n_buckets_ext * sizeof(struct bucket));  in rte_table_hash_ext_create()
259 	t->buckets = (struct bucket *) &t->memory[bucket_offset];  in rte_table_hash_ext_create()
260 	t->buckets_ext = (struct bucket *) &t->memory[bucket_ext_offset];  in rte_table_hash_ext_create()
303 	struct bucket *bkt0, *bkt, *bkt_prev;  in rte_table_hash_ext_entry_add()
404 	struct bucket *bkt0, *bkt, *bkt_prev;  in rte_table_hash_ext_entry_delete()
445 					memset(bkt, 0, sizeof(struct bucket));  in rte_table_hash_ext_entry_delete()
475 		struct bucket *bkt0, *bkt;  in rte_table_hash_ext_lookup_unoptimized()
562 #define lookup_cmp_sig(mbuf_sig, bucket, match, match_many, match_pos)	\  argument
566 	bucket_sig[0] = bucket->sig[0];					\
567 	bucket_sig[1] = bucket->sig[1];					\
568 	bucket_sig[2] = bucket->sig[2];					\
569 	bucket_sig[3] = bucket->sig[3];					\
716 	struct bucket *bkt10, *bkt11, *buckets = t->buckets;		\
752 	struct bucket *bkt20, *bkt21;					\