24 				struct lockdep_node_head *graph,  in lockdep_add_to_graph()  argument
29 	assert(graph);  in lockdep_add_to_graph()
30 	TAILQ_FOREACH(node, graph, link)  in lockdep_add_to_graph()
40 	TAILQ_INSERT_TAIL(graph, node, link);  in lockdep_add_to_graph()
234 static TEE_Result lockdep_graph_sort(struct lockdep_node_head *graph)  in lockdep_graph_sort()  argument
238 	TAILQ_FOREACH(node, graph, link) {  in lockdep_graph_sort()
248 	TAILQ_FOREACH(node, graph, link)  in lockdep_graph_sort()
254 static struct lockdep_edge *lockdep_find_edge(struct lockdep_node_head *graph,  in lockdep_find_edge()  argument
260 	TAILQ_FOREACH(node, graph, link)  in lockdep_find_edge()
292 static void lockdep_print_cycle_info(struct lockdep_node_head *graph,  in lockdep_print_cycle_info()  argument
311 			edge = lockdep_find_edge(graph, from, to);  in lockdep_print_cycle_info()
319 			edge = lockdep_find_edge(graph, from, to);  in lockdep_print_cycle_info()
334 TEE_Result __lockdep_lock_acquire(struct lockdep_node_head *graph,  in __lockdep_lock_acquire()  argument
338 	struct lockdep_node *node = lockdep_add_to_graph(graph, id);  in __lockdep_lock_acquire()
355 	res = lockdep_graph_sort(graph);  in __lockdep_lock_acquire()
359 		lockdep_print_cycle_info(graph, node);  in __lockdep_lock_acquire()
379 TEE_Result __lockdep_lock_tryacquire(struct lockdep_node_head *graph,  in __lockdep_lock_tryacquire()  argument
383 	struct lockdep_node *node = lockdep_add_to_graph(graph, id);  in __lockdep_lock_tryacquire()
438 void lockdep_graph_delete(struct lockdep_node_head *graph)  in lockdep_graph_delete()  argument
443 	TAILQ_FOREACH_SAFE(node, graph, link, next) {  in lockdep_graph_delete()
444 		TAILQ_REMOVE(graph, node, link);  in lockdep_graph_delete()
460 static void lockdep_node_destroy(struct lockdep_node_head *graph,  in lockdep_node_destroy()  argument
467 	TAILQ_REMOVE(graph, node, link);  in lockdep_node_destroy()
473 	TAILQ_FOREACH(from, graph, link) {  in lockdep_node_destroy()
502 void lockdep_lock_destroy(struct lockdep_node_head *graph, uintptr_t lock_id)  in lockdep_lock_destroy()  argument
506 	assert(graph);  in lockdep_lock_destroy()
507 	TAILQ_FOREACH(node, graph, link) {  in lockdep_lock_destroy()
509 			lockdep_node_destroy(graph, node);  in lockdep_lock_destroy()