148 		INIT_LIST_HEAD(&vertex->edges);  in unix_add_edge()
156 	list_add_tail(&edge->vertex_entry, &vertex->edges);  in unix_add_edge()
206 		edge = fpl->edges + i++;  in unix_add_edges()
236 		struct unix_edge *edge = fpl->edges + i++;  in unix_del_edges()
242 		receiver = fpl->edges[0].successor;  in unix_del_edges()
286 	fpl->edges = kvmalloc_array(fpl->count_unix, sizeof(*fpl->edges),  in unix_prepare_fpl()
288 	if (!fpl->edges)  in unix_prepare_fpl()
303 	kvfree(fpl->edges);  in unix_destroy_fpl()
313 	list_for_each_entry(edge, &vertex->edges, vertex_entry) {  in unix_vertex_dead()
329 	edge = list_first_entry(&vertex->edges, typeof(*edge), vertex_entry);  in unix_vertex_dead()
349 		edge = list_first_entry(&vertex->edges, typeof(*edge), vertex_entry);  in unix_collect_skb()
385 	list_for_each_entry(edge, &vertex->edges, vertex_entry) {  in unix_scc_cyclic()
415 	list_for_each_entry(edge, &vertex->edges, vertex_entry) {  in __unix_walk_scc()