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