Lines Matching refs:from
77 static TEE_Result lockdep_add_edge(struct lockdep_node *from, in lockdep_add_edge() argument
85 STAILQ_FOREACH(edge, &from->edges, link) in lockdep_add_edge()
96 STAILQ_INSERT_TAIL(&from->edges, edge, link); in lockdep_add_edge()
255 uintptr_t from, uintptr_t to) in lockdep_find_edge() argument
261 if (node->lock_id == from) in lockdep_find_edge()
268 static void lockdep_print_edge_info(uintptr_t from __maybe_unused, in lockdep_print_edge_info()
284 from, acq_msg); in lockdep_print_edge_info()
298 uintptr_t from = 0; in lockdep_print_cycle_info() local
309 from = to; in lockdep_print_cycle_info()
311 edge = lockdep_find_edge(graph, from, to); in lockdep_print_cycle_info()
312 lockdep_print_edge_info(from, edge); in lockdep_print_cycle_info()
316 from = to; in lockdep_print_cycle_info()
319 edge = lockdep_find_edge(graph, from, to); in lockdep_print_cycle_info()
320 lockdep_print_edge_info(from, edge); in lockdep_print_cycle_info()
465 struct lockdep_node *from = NULL; in lockdep_node_destroy() local
473 TAILQ_FOREACH(from, graph, link) { in lockdep_node_destroy()
474 edge = STAILQ_FIRST(&from->edges); in lockdep_node_destroy()
476 STAILQ_REMOVE_HEAD(&from->edges, link); in lockdep_node_destroy()
478 edge = STAILQ_FIRST(&from->edges); in lockdep_node_destroy()
487 STAILQ_REMOVE_AFTER(&from->edges, edge, link); in lockdep_node_destroy()