Lines Matching refs:tin
18 struct fq_tin *tin = flow->tin;
20 tin->backlog_bytes -= skb->len;
21 tin->backlog_packets--;
63 struct fq_tin *tin,
73 head = &tin->new_flows;
75 head = &tin->old_flows;
85 &tin->old_flows);
89 skb = dequeue_func(fq, tin, flow);
92 if ((head == &tin->new_flows) &&
93 !list_empty(&tin->old_flows)) {
94 list_move_tail(&flow->flowchain, &tin->old_flows);
97 flow->tin = NULL;
103 tin->tx_bytes += skb->len;
104 tin->tx_packets++;
117 struct fq_tin *tin, u32 idx,
126 if (flow->tin && flow->tin != tin) {
127 flow = get_default_func(fq, tin, idx, skb);
128 tin->collisions++;
132 if (!flow->tin)
133 tin->flows++;
139 struct fq_tin *tin,
157 struct fq_tin *tin, u32 idx,
167 flow = fq_flow_classify(fq, tin, idx, skb, get_default_func);
169 flow->tin = tin;
171 tin->backlog_bytes += skb->len;
172 tin->backlog_packets++;
176 fq_recalc_backlog(fq, tin, flow);
181 &tin->new_flows);
197 free_func(fq, flow->tin, flow, skb);
199 flow->tin->overlimit++;
214 struct fq_tin *tin = flow->tin;
220 if (!filter_func(fq, tin, flow, skb, filter_data))
225 free_func(fq, tin, flow, skb);
232 struct fq_tin *tin,
241 list_for_each_entry(flow, &tin->new_flows, flowchain)
243 list_for_each_entry(flow, &tin->old_flows, flowchain)
254 free_func(fq, flow->tin, flow, skb);
262 flow->tin = NULL;
268 struct fq_tin *tin,
275 head = &tin->new_flows;
277 head = &tin->old_flows;
286 WARN_ON_ONCE(tin->backlog_bytes);
287 WARN_ON_ONCE(tin->backlog_packets);
297 static void fq_tin_init(struct fq_tin *tin)
299 INIT_LIST_HEAD(&tin->new_flows);
300 INIT_LIST_HEAD(&tin->old_flows);