Lines Matching defs:flow
16 __fq_adjust_removal(struct fq *fq, struct fq_flow *flow, unsigned int packets,
19 struct fq_tin *tin = flow->tin;
24 flow->backlog -= bytes;
28 if (flow->backlog)
31 if (flow == &tin->default_flow) {
36 idx = flow - fq->flows;
41 struct fq_flow *flow,
44 __fq_adjust_removal(fq, flow, 1, skb->len, skb->truesize);
48 struct fq_flow *flow)
54 skb = __skb_dequeue(&flow->queue);
58 fq_adjust_removal(fq, flow, skb);
63 static int fq_flow_drop(struct fq *fq, struct fq_flow *flow,
67 struct fq_tin *tin = flow->tin;
73 pending = min_t(int, 32, skb_queue_len(&flow->queue) / 2);
75 skb = __skb_dequeue(&flow->queue);
82 free_func(fq, tin, flow, skb);
85 __fq_adjust_removal(fq, flow, packets, bytes, truesize);
94 struct fq_flow *flow;
108 flow = list_first_entry(head, struct fq_flow, flowchain);
110 if (flow->deficit <= 0) {
111 flow->deficit += fq->quantum;
112 list_move_tail(&flow->flowchain,
117 skb = dequeue_func(fq, tin, flow);
122 list_move_tail(&flow->flowchain, &tin->old_flows);
124 list_del_init(&flow->flowchain);
125 flow->tin = NULL;
130 flow->deficit -= skb->len;
148 struct fq_flow *flow;
152 flow = &fq->flows[idx];
153 if (flow->tin && flow->tin != tin) {
154 flow = &tin->default_flow;
159 if (!flow->tin)
162 return flow;
168 struct fq_flow *flow = NULL;
180 flow = cur;
190 flow = &tin->default_flow;
194 return flow;
202 struct fq_flow *flow;
208 flow = fq_flow_classify(fq, tin, idx, skb);
210 if (!flow->backlog) {
211 if (flow != &tin->default_flow)
217 flow->tin = tin;
220 flow->backlog += skb->len;
225 __skb_queue_tail(&flow->queue, skb);
228 if (list_empty(&flow->flowchain)) {
229 flow->deficit = fq->quantum;
230 list_add_tail(&flow->flowchain,
236 flow = fq_find_fattest_flow(fq);
237 if (!flow)
240 if (!fq_flow_drop(fq, flow, free_func))
243 flow->tin->overlimit++;
253 struct fq_flow *flow,
258 struct fq_tin *tin = flow->tin;
263 skb_queue_walk_safe(&flow->queue, skb, tmp) {
264 if (!filter_func(fq, tin, flow, skb, filter_data))
267 __skb_unlink(skb, &flow->queue);
268 fq_adjust_removal(fq, flow, skb);
269 free_func(fq, tin, flow, skb);
279 struct fq_flow *flow;
283 list_for_each_entry(flow, &tin->new_flows, flowchain)
284 fq_flow_filter(fq, flow, filter_func, filter_data, free_func);
285 list_for_each_entry(flow, &tin->old_flows, flowchain)
286 fq_flow_filter(fq, flow, filter_func, filter_data, free_func);
290 struct fq_flow *flow,
293 struct fq_tin *tin = flow->tin;
296 while ((skb = fq_flow_dequeue(fq, flow)))
297 free_func(fq, tin, flow, skb);
299 if (!list_empty(&flow->flowchain)) {
300 list_del_init(&flow->flowchain);
306 flow->tin = NULL;
308 WARN_ON_ONCE(flow->backlog);
316 struct fq_flow *flow;
326 flow = list_first_entry(head, struct fq_flow, flowchain);
327 fq_flow_reset(fq, flow, free_func);
335 static void fq_flow_init(struct fq_flow *flow)
337 INIT_LIST_HEAD(&flow->flowchain);
338 __skb_queue_head_init(&flow->queue);