Lines Matching refs:link
30 TAILQ_FOREACH(node, graph, link) in lockdep_add_to_graph()
40 TAILQ_INSERT_TAIL(graph, node, link); in lockdep_add_to_graph()
85 STAILQ_FOREACH(edge, &from->edges, link) in lockdep_add_edge()
96 STAILQ_INSERT_TAIL(&from->edges, edge, link); in lockdep_add_edge()
105 TAILQ_ENTRY(lockdep_bfs) link;
115 TAILQ_FOREACH_SAFE(cur, queue, link, next) { in lockdep_bfs_queue_delete()
116 TAILQ_REMOVE(queue, cur, link); in lockdep_bfs_queue_delete()
146 TAILQ_INSERT_TAIL(&queue, qe, link); in lockdep_graph_get_shortest_cycle()
154 TAILQ_REMOVE(&queue, qe, link); in lockdep_graph_get_shortest_cycle()
156 STAILQ_FOREACH(e, &n->edges, link) { in lockdep_graph_get_shortest_cycle()
197 TAILQ_INSERT_TAIL(&queue, nqe, link); in lockdep_graph_get_shortest_cycle()
223 STAILQ_FOREACH(e, &node->edges, link) { in lockdep_visit()
238 TAILQ_FOREACH(node, graph, link) { in lockdep_graph_sort()
248 TAILQ_FOREACH(node, graph, link) in lockdep_graph_sort()
260 TAILQ_FOREACH(node, graph, link) in lockdep_find_edge()
262 STAILQ_FOREACH(edge, &node->edges, link) in lockdep_find_edge()
348 TAILQ_FOREACH(lock, owned, link) { in __lockdep_lock_acquire()
369 TAILQ_INSERT_TAIL(owned, lock, link); in __lockdep_lock_acquire()
398 TAILQ_INSERT_TAIL(owned, lock, link); in __lockdep_lock_tryacquire()
407 TAILQ_FOREACH_REVERSE(lock, owned, lockdep_lock_head, link) { in __lockdep_lock_release()
409 TAILQ_REMOVE(owned, lock, link); in __lockdep_lock_release()
432 STAILQ_FOREACH_SAFE(edge, &node->edges, link, next) in lockdep_node_delete()
443 TAILQ_FOREACH_SAFE(node, graph, link, next) { in lockdep_graph_delete()
444 TAILQ_REMOVE(graph, node, link); in lockdep_graph_delete()
454 TAILQ_FOREACH_SAFE(lock, owned, link, next) { in lockdep_queue_delete()
455 TAILQ_REMOVE(owned, lock, link); in lockdep_queue_delete()
467 TAILQ_REMOVE(graph, node, link); in lockdep_node_destroy()
473 TAILQ_FOREACH(from, graph, link) { in lockdep_node_destroy()
476 STAILQ_REMOVE_HEAD(&from->edges, link); in lockdep_node_destroy()
484 next = STAILQ_NEXT(edge, link); in lockdep_node_destroy()
487 STAILQ_REMOVE_AFTER(&from->edges, edge, link); in lockdep_node_destroy()
492 next = STAILQ_NEXT(edge, link); in lockdep_node_destroy()
496 STAILQ_FOREACH_SAFE(edge, &node->edges, link, next) in lockdep_node_destroy()
507 TAILQ_FOREACH(node, graph, link) { in lockdep_lock_destroy()