55 	u32		flows_cnt;	/* number of flows */  member
73 	return reciprocal_scale(skb_get_hash(skb), q->flows_cnt);  in fq_codel_hash()
86 	    TC_H_MIN(skb->priority) <= q->flows_cnt)  in fq_codel_classify()
107 		if (TC_H_MIN(res.classid) <= q->flows_cnt)  in fq_codel_classify()
154 	for (i = 0; i < q->flows_cnt; i++) {  in fq_codel_drop()
342 	for (i = 0; i < q->flows_cnt; i++) {  in fq_codel_reset()
349 	memset(q->backlogs, 0, q->flows_cnt * sizeof(u32));  in fq_codel_reset()
383 		q->flows_cnt = nla_get_u32(tb[TCA_FQ_CODEL_FLOWS]);  in fq_codel_change()
384 		if (!q->flows_cnt ||  in fq_codel_change()
385 		    q->flows_cnt > 65536)  in fq_codel_change()
463 	q->flows_cnt = 1024;  in fq_codel_init()
485 		q->flows = kvcalloc(q->flows_cnt,  in fq_codel_init()
492 		q->backlogs = kvcalloc(q->flows_cnt, sizeof(u32), GFP_KERNEL);  in fq_codel_init()
497 		for (i = 0; i < q->flows_cnt; i++) {  in fq_codel_init()
514 	q->flows_cnt = 0;  in fq_codel_init()
542 			q->flows_cnt))  in fq_codel_dump()
628 	if (idx < q->flows_cnt) {  in fq_codel_dump_class_stats()
662 	if (idx < q->flows_cnt)  in fq_codel_dump_class_stats()
675 	for (i = 0; i < q->flows_cnt; i++) {  in fq_codel_walk()