61 	u32		flows_cnt;	/* number of flows */  member
79 	return reciprocal_scale(skb_get_hash(skb), q->flows_cnt);  in fq_codel_hash()
92 	    TC_H_MIN(skb->priority) <= q->flows_cnt)  in fq_codel_classify()
112 		if (TC_H_MIN(res.classid) <= q->flows_cnt)  in fq_codel_classify()
159 	for (i = 0; i < q->flows_cnt; i++) {  in fq_codel_drop()
354 	for (i = 0; i < q->flows_cnt; i++) {  in fq_codel_reset()
361 	memset(q->backlogs, 0, q->flows_cnt * sizeof(u32));  in fq_codel_reset()
395 		q->flows_cnt = nla_get_u32(tb[TCA_FQ_CODEL_FLOWS]);  in fq_codel_change()
396 		if (!q->flows_cnt ||  in fq_codel_change()
397 		    q->flows_cnt > 65536)  in fq_codel_change()
467 	q->flows_cnt = 1024;  in fq_codel_init()
489 		q->flows = kvzalloc(q->flows_cnt *  in fq_codel_init()
493 		q->backlogs = kvzalloc(q->flows_cnt * sizeof(u32), GFP_KERNEL);  in fq_codel_init()
496 		for (i = 0; i < q->flows_cnt; i++) {  in fq_codel_init()
534 			q->flows_cnt))  in fq_codel_dump()
621 	if (idx < q->flows_cnt) {  in fq_codel_dump_class_stats()
655 	if (idx < q->flows_cnt)  in fq_codel_dump_class_stats()
668 	for (i = 0; i < q->flows_cnt; i++) {  in fq_codel_walk()