126 	struct sfb_bucket *b = &q->bins[slot].bins[0][0];  in increment_one_qlen()  local
132 		if (b[hash].qlen < 0xFFFF)  in increment_one_qlen()
133 			b[hash].qlen++;  in increment_one_qlen()
134 		b += SFB_NUMBUCKETS; /* next level */  in increment_one_qlen()
155 	struct sfb_bucket *b = &q->bins[slot].bins[0][0];  in decrement_one_qlen()  local
161 		if (b[hash].qlen > 0)  in decrement_one_qlen()
162 			b[hash].qlen--;  in decrement_one_qlen()
163 		b += SFB_NUMBUCKETS; /* next level */  in decrement_one_qlen()
180 static void decrement_prob(struct sfb_bucket *b, struct sfb_sched_data *q)  in decrement_prob()  argument
182 	b->p_mark = prob_minus(b->p_mark, q->decrement);  in decrement_prob()
185 static void increment_prob(struct sfb_bucket *b, struct sfb_sched_data *q)  in increment_prob()  argument
187 	b->p_mark = prob_plus(b->p_mark, q->increment);  in increment_prob()
202 	const struct sfb_bucket *b = &q->bins[q->slot].bins[0][0];  in sfb_compute_qlen()  local
205 		if (qlen < b->qlen)  in sfb_compute_qlen()
206 			qlen = b->qlen;  in sfb_compute_qlen()
207 		totalpm += b->p_mark;  in sfb_compute_qlen()
208 		if (prob < b->p_mark)  in sfb_compute_qlen()
209 			prob = b->p_mark;  in sfb_compute_qlen()
210 		b++;  in sfb_compute_qlen()
332 		struct sfb_bucket *b = &q->bins[slot].bins[i][hash];  in sfb_enqueue()  local
335 		if (b->qlen == 0)  in sfb_enqueue()
336 			decrement_prob(b, q);  in sfb_enqueue()
337 		else if (b->qlen >= q->bin_size)  in sfb_enqueue()
338 			increment_prob(b, q);  in sfb_enqueue()
339 		if (minqlen > b->qlen)  in sfb_enqueue()
340 			minqlen = b->qlen;  in sfb_enqueue()
341 		if (p_min > b->p_mark)  in sfb_enqueue()
342 			p_min = b->p_mark;  in sfb_enqueue()
365 				struct sfb_bucket *b = &q->bins[slot].bins[i][hash];  in sfb_enqueue()  local
368 				if (b->qlen == 0)  in sfb_enqueue()
369 					decrement_prob(b, q);  in sfb_enqueue()
370 				else if (b->qlen >= q->bin_size)  in sfb_enqueue()
371 					increment_prob(b, q);  in sfb_enqueue()