226 	struct qdf_lro_desc_entry *entry;  in qdf_lro_desc_find()  local
246 		entry = list_entry(ptr, struct qdf_lro_desc_entry, lro_node);  in qdf_lro_desc_find()
247 		tmp_lro_desc = entry->lro_desc;  in qdf_lro_desc_find()
248 			if (qdf_lro_tcp_flow_match(entry->lro_desc, iph, tcph)) {  in qdf_lro_desc_find()
249 				*lro_desc = entry->lro_desc;  in qdf_lro_desc_find()
256 	entry = list_first_entry_or_null(  in qdf_lro_desc_find()
259 	if (unlikely(!entry)) {  in qdf_lro_desc_find()
265 	list_del_init(&entry->lro_node);  in qdf_lro_desc_find()
267 	if (unlikely(!entry->lro_desc)) {  in qdf_lro_desc_find()
273 	memset(entry->lro_desc, 0, sizeof(struct net_lro_desc));  in qdf_lro_desc_find()
279 	list_add_tail(&entry->lro_node,  in qdf_lro_desc_find()
282 	*lro_desc = entry->lro_desc;  in qdf_lro_desc_find()
366 	struct qdf_lro_desc_entry *entry;  in qdf_lro_desc_free()  local
393 	entry = &desc_info->lro_desc_pool.lro_desc_array[i];  in qdf_lro_desc_free()
395 	list_del_init(&entry->lro_node);  in qdf_lro_desc_free()
397 	list_add_tail(&entry->lro_node, &desc_info->  in qdf_lro_desc_free()