28  * SFB uses two B[l][n] : L x N arrays of bins (L levels, N bins per level)
34 #define SFB_NUMBUCKETS	(1 << SFB_BUCKET_SHIFT) /* N bins per Level */
49 	struct sfb_bucket bins[SFB_LEVELS][SFB_NUMBUCKETS];  member
69 	u8		slot;		/* current active bins (0 or 1) */
71 	struct sfb_bins bins[2];  member
84  * Each queued skb might be hashed on one or two bins
126 	struct sfb_bucket *b = &q->bins[slot].bins[0][0];  in increment_one_qlen()
155 	struct sfb_bucket *b = &q->bins[slot].bins[0][0];  in decrement_one_qlen()
192 	memset(&q->bins, 0, sizeof(q->bins));  in sfb_zero_all_buckets()
202 	const struct sfb_bucket *b = &q->bins[q->slot].bins[0][0];  in sfb_compute_qlen()
220 	get_random_bytes(&q->bins[slot].perturbation,  in sfb_init_perturbation()
221 			 sizeof(q->bins[slot].perturbation));  in sfb_init_perturbation()
321 		sfbhash = siphash_1u32(salt, &q->bins[slot].perturbation);  in sfb_enqueue()
323 		sfbhash = skb_get_hash_perturb(skb, &q->bins[slot].perturbation);  in sfb_enqueue()
333 		struct sfb_bucket *b = &q->bins[slot].bins[i][hash];  in sfb_enqueue()
359 			    &q->bins[slot].perturbation);  in sfb_enqueue()
366 				struct sfb_bucket *b = &q->bins[slot].bins[i][hash];  in sfb_enqueue()