Lines Matching refs:to
78 struct lockdep_node *to, in lockdep_add_edge() argument
86 if (edge->to == to) in lockdep_add_edge()
92 edge->to = to; in lockdep_add_edge()
157 if (e->to->lock_id == node->lock_id) { in lockdep_graph_get_shortest_cycle()
179 if (!(e->to->flags & LOCKDEP_NODE_BFS_VISITED)) { in lockdep_graph_get_shortest_cycle()
183 e->to->flags |= LOCKDEP_NODE_BFS_VISITED; in lockdep_graph_get_shortest_cycle()
189 nqe->node = e->to; in lockdep_graph_get_shortest_cycle()
196 nqe->path[nlen - 1] = e->to->lock_id; in lockdep_graph_get_shortest_cycle()
224 TEE_Result res = lockdep_visit(e->to); in lockdep_visit()
255 uintptr_t from, uintptr_t to) in lockdep_find_edge() argument
263 if (edge->to->lock_id == to) in lockdep_find_edge()
271 uintptr_t __maybe_unused to = edge->to->lock_id; in lockdep_print_edge_info() local
281 edge->thread_id, to, at_msg); in lockdep_print_edge_info()
299 uintptr_t to = 0; in lockdep_print_cycle_info() local
309 from = to; in lockdep_print_cycle_info()
310 to = cycle[0]; in lockdep_print_cycle_info()
311 edge = lockdep_find_edge(graph, from, to); in lockdep_print_cycle_info()
316 from = to; in lockdep_print_cycle_info()
317 to = *p; in lockdep_print_cycle_info()
319 edge = lockdep_find_edge(graph, from, to); in lockdep_print_cycle_info()
475 while (edge && edge->to == node) { in lockdep_node_destroy()
486 if (next->to == node) { in lockdep_node_destroy()