Searched refs:backlogs (Results 1 - 2 of 2) sorted by relevance

/linux-master/net/sched/
H A Dsch_fq_codel.c54 u32 *backlogs; /* backlog table [flows_cnt] */ member in struct:fq_codel_sched_data
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));
455 kvfree(q->backlogs);
[all...]
H A Dsch_cake.c152 u32 backlogs[CAKE_QUEUES]; member in struct:cake_tin_data
1413 return q->tins[ii.t].backlogs[ii.b];
1539 b->backlogs[idx] -= len;
1768 b->backlogs[idx] += slen;
1803 b->backlogs[idx] += len;
1922 b->backlogs[q->cur_flow] -= len;
3008 qs.backlog = b->backlogs[idx % CAKE_QUEUES];

Completed in 151 milliseconds