110 static void lockdep_bfs_queue_delete(struct lockdep_bfs_head *queue)  in lockdep_bfs_queue_delete()  argument
115 	TAILQ_FOREACH_SAFE(cur, queue, link, next) {  in lockdep_bfs_queue_delete()
116 		TAILQ_REMOVE(queue, cur, link);  in lockdep_bfs_queue_delete()
130 	struct lockdep_bfs_head queue;  in lockdep_graph_get_shortest_cycle()  local
134 	TAILQ_INIT(&queue);  in lockdep_graph_get_shortest_cycle()
146 	TAILQ_INSERT_TAIL(&queue, qe, link);  in lockdep_graph_get_shortest_cycle()
148 	while (!TAILQ_EMPTY(&queue)) {  in lockdep_graph_get_shortest_cycle()
152 		qe = TAILQ_FIRST(&queue);  in lockdep_graph_get_shortest_cycle()
154 		TAILQ_REMOVE(&queue, qe, link);  in lockdep_graph_get_shortest_cycle()
197 				TAILQ_INSERT_TAIL(&queue, nqe, link);  in lockdep_graph_get_shortest_cycle()
207 	lockdep_bfs_queue_delete(&queue);  in lockdep_graph_get_shortest_cycle()