200 	struct hh_flow_state *flow, *next;  in seek_list()  local
206 	list_for_each_entry_safe(flow, next, head, flowchain) {  in seek_list()
207 		u32 prev = flow->hit_timestamp + q->hhf_evict_timeout;  in seek_list()
213 			if (list_is_last(&flow->flowchain, head))  in seek_list()
215 			list_del(&flow->flowchain);  in seek_list()
216 			kfree(flow);  in seek_list()
218 		} else if (flow->hash_id == hash) {  in seek_list()
219 			return flow;  in seek_list()
231 	struct hh_flow_state *flow;  in alloc_new_hh()  local
236 		list_for_each_entry(flow, head, flowchain) {  in alloc_new_hh()
237 			u32 prev = flow->hit_timestamp + q->hhf_evict_timeout;  in alloc_new_hh()
240 				return flow;  in alloc_new_hh()
249 	flow = kzalloc(sizeof(struct hh_flow_state), GFP_ATOMIC);  in alloc_new_hh()
250 	if (!flow)  in alloc_new_hh()
254 	INIT_LIST_HEAD(&flow->flowchain);  in alloc_new_hh()
255 	list_add_tail(&flow->flowchain, head);  in alloc_new_hh()
257 	return flow;  in alloc_new_hh()
268 	struct hh_flow_state *flow;  in hhf_classify()  local
287 	flow = seek_list(hash, &q->hh_flows[flow_pos], q);  in hhf_classify()
288 	if (flow) { /* found its HH flow */  in hhf_classify()
289 		flow->hit_timestamp = now;  in hhf_classify()
323 		flow = alloc_new_hh(&q->hh_flows[flow_pos], q);  in hhf_classify()
324 		if (!flow) /* memory alloc problem */  in hhf_classify()
326 		flow->hash_id = hash;  in hhf_classify()
327 		flow->hit_timestamp = now;  in hhf_classify()
511 		struct hh_flow_state *flow, *next;  in hhf_destroy()  local
516 		list_for_each_entry_safe(flow, next, head, flowchain) {  in hhf_destroy()
517 			list_del(&flow->flowchain);  in hhf_destroy()
518 			kfree(flow);  in hhf_destroy()