321 		 * another SCC.  in unix_vertex_dead()
327 	/* No receiver exists out of the same SCC. */  in unix_vertex_dead()
340 static void unix_collect_skb(struct list_head *scc, struct sk_buff_head *hitlist)  in unix_collect_skb()  argument
344 	list_for_each_entry_reverse(vertex, scc, scc_entry) {  in unix_collect_skb()
373 static bool unix_scc_cyclic(struct list_head *scc)  in unix_scc_cyclic()  argument
378 	/* SCC containing multiple vertices ? */  in unix_scc_cyclic()
379 	if (!list_is_singular(scc))  in unix_scc_cyclic()
382 	vertex = list_first_entry(scc, typeof(*vertex), scc_entry);  in unix_scc_cyclic()
406 	 * The vertex will be popped when finalising SCC later.  in __unix_walk_scc()
443 			 * are in the same SCC, so propagate the smaller scc_index  in __unix_walk_scc()
444 			 * to skip SCC finalisation.  in __unix_walk_scc()
451 			 * the same SCC.  If the successor has a smaller *scc_index*,  in __unix_walk_scc()
452 			 * propagate it to skip SCC finalisation.  in __unix_walk_scc()
456 			/* The successor was already grouped as another SCC */  in __unix_walk_scc()
462 		struct list_head scc;  in __unix_walk_scc()  local
465 		/* SCC finalised.  in __unix_walk_scc()
468 		 * vertex_stack are in the same SCC.  Group them using scc_entry.  in __unix_walk_scc()
470 		__list_cut_position(&scc, &vertex_stack, &vertex->scc_entry);  in __unix_walk_scc()
472 		list_for_each_entry_reverse(v, &scc, scc_entry) {  in __unix_walk_scc()
484 			unix_collect_skb(&scc, hitlist);  in __unix_walk_scc()
486 			unix_graph_maybe_cyclic = unix_scc_cyclic(&scc);  in __unix_walk_scc()
488 		list_del(&scc);  in __unix_walk_scc()
524 		struct list_head scc;  in unix_walk_scc_fast()  local
528 		list_add(&scc, &vertex->scc_entry);  in unix_walk_scc_fast()
530 		list_for_each_entry_reverse(vertex, &scc, scc_entry) {  in unix_walk_scc_fast()
538 			unix_collect_skb(&scc, hitlist);  in unix_walk_scc_fast()
540 			unix_graph_maybe_cyclic = unix_scc_cyclic(&scc);  in unix_walk_scc_fast()
542 		list_del(&scc);  in unix_walk_scc_fast()