78 	struct list_head edges;  member
157 		INIT_LIST_HEAD(&vertex->edges);  in unix_add_edge()
165 	list_add_tail(&edge->vertex_entry, &vertex->edges);  in unix_add_edge()
215 		edge = fpl->edges + i++;  in unix_add_edges()
245 		struct unix_edge *edge = fpl->edges + i++;  in unix_del_edges()
251 		receiver = fpl->edges[0].successor;  in unix_del_edges()
295 	fpl->edges = kvmalloc_array(fpl->count_unix, sizeof(*fpl->edges),  in unix_prepare_fpl()
297 	if (!fpl->edges)  in unix_prepare_fpl()
312 	kvfree(fpl->edges);  in unix_destroy_fpl()
322 	list_for_each_entry(edge, &vertex->edges, vertex_entry) {  in unix_vertex_dead()
338 	edge = list_first_entry(&vertex->edges, typeof(*edge), vertex_entry);  in unix_vertex_dead()
358 		edge = list_first_entry(&vertex->edges, typeof(*edge), vertex_entry);  in unix_collect_skb()
394 	list_for_each_entry(edge, &vertex->edges, vertex_entry) {  in unix_scc_cyclic()
424 	list_for_each_entry(edge, &vertex->edges, vertex_entry) {  in __unix_walk_scc()