19 	struct fq_tin *tin = flow->tin;  in fq_adjust_removal()  local
21 	tin->backlog_bytes -= skb->len;  in fq_adjust_removal()
22 	tin->backlog_packets--;  in fq_adjust_removal()
64 				      struct fq_tin *tin,  in fq_tin_dequeue()  argument
74 	head = &tin->new_flows;  in fq_tin_dequeue()
76 		head = &tin->old_flows;  in fq_tin_dequeue()
86 			       &tin->old_flows);  in fq_tin_dequeue()
90 	skb = dequeue_func(fq, tin, flow);  in fq_tin_dequeue()
93 		if ((head == &tin->new_flows) &&  in fq_tin_dequeue()
94 		    !list_empty(&tin->old_flows)) {  in fq_tin_dequeue()
95 			list_move_tail(&flow->flowchain, &tin->old_flows);  in fq_tin_dequeue()
98 			flow->tin = NULL;  in fq_tin_dequeue()
104 	tin->tx_bytes += skb->len;  in fq_tin_dequeue()
105 	tin->tx_packets++;  in fq_tin_dequeue()
111 					struct fq_tin *tin,  in fq_flow_classify()  argument
125 	if (flow->tin && flow->tin != tin) {  in fq_flow_classify()
126 		flow = get_default_func(fq, tin, idx, skb);  in fq_flow_classify()
127 		tin->collisions++;  in fq_flow_classify()
131 	if (!flow->tin)  in fq_flow_classify()
132 		tin->flows++;  in fq_flow_classify()
138 			      struct fq_tin *tin,  in fq_recalc_backlog()  argument
156 			   struct fq_tin *tin,  in fq_tin_enqueue()  argument
166 	flow = fq_flow_classify(fq, tin, skb, get_default_func);  in fq_tin_enqueue()
168 	flow->tin = tin;  in fq_tin_enqueue()
170 	tin->backlog_bytes += skb->len;  in fq_tin_enqueue()
171 	tin->backlog_packets++;  in fq_tin_enqueue()
175 	fq_recalc_backlog(fq, tin, flow);  in fq_tin_enqueue()
180 			      &tin->new_flows);  in fq_tin_enqueue()
196 		free_func(fq, flow->tin, flow, skb);  in fq_tin_enqueue()
198 		flow->tin->overlimit++;  in fq_tin_enqueue()
213 	struct fq_tin *tin = flow->tin;  in fq_flow_filter()  local
219 		if (!filter_func(fq, tin, flow, skb, filter_data))  in fq_flow_filter()
224 		free_func(fq, tin, flow, skb);  in fq_flow_filter()
231 			  struct fq_tin *tin,  in fq_tin_filter()  argument
240 	list_for_each_entry(flow, &tin->new_flows, flowchain)  in fq_tin_filter()
242 	list_for_each_entry(flow, &tin->old_flows, flowchain)  in fq_tin_filter()
253 		free_func(fq, flow->tin, flow, skb);  in fq_flow_reset()
261 	flow->tin = NULL;  in fq_flow_reset()
267 			 struct fq_tin *tin,  in fq_tin_reset()  argument
274 		head = &tin->new_flows;  in fq_tin_reset()
276 			head = &tin->old_flows;  in fq_tin_reset()
285 	WARN_ON_ONCE(tin->backlog_bytes);  in fq_tin_reset()
286 	WARN_ON_ONCE(tin->backlog_packets);  in fq_tin_reset()
296 static void fq_tin_init(struct fq_tin *tin)  in fq_tin_init()  argument
298 	INIT_LIST_HEAD(&tin->new_flows);  in fq_tin_init()
299 	INIT_LIST_HEAD(&tin->old_flows);  in fq_tin_init()