Lines Matching defs:backlogs
54 u32 *backlogs; /* backlog table [flows_cnt] */
155 if (q->backlogs[i] > maxbacklog) {
156 maxbacklog = q->backlogs[i];
176 q->backlogs[idx] -= len;
206 q->backlogs[idx] += qdisc_pkt_len(skb);
226 * in q->backlogs[] to find a fat flow.
240 * but in this case, our parents wont increase their backlogs.
265 q->backlogs[flow - q->flows] -= qdisc_pkt_len(skb);
349 memset(q->backlogs, 0, q->flows_cnt * sizeof(u32));
451 kvfree(q->backlogs);
492 q->backlogs = kvcalloc(q->flows_cnt, sizeof(u32), GFP_KERNEL);
493 if (!q->backlogs) {
657 qs.backlog = q->backlogs[idx];