25 				uintptr_t lock_id)  in lockdep_add_to_graph()  argument
31 		if (node->lock_id == lock_id)  in lockdep_add_to_graph()
38 	node->lock_id = lock_id;  in lockdep_add_to_graph()
144 	qe->path[0] = node->lock_id;  in lockdep_graph_get_shortest_cycle()
157 			if (e->to->lock_id == node->lock_id) {  in lockdep_graph_get_shortest_cycle()
196 				nqe->path[nlen - 1] = e->to->lock_id;  in lockdep_graph_get_shortest_cycle()
261 		if (node->lock_id == from)  in lockdep_find_edge()
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()
408 		if (lock->node->lock_id == id) {  in __lockdep_lock_release()
502 void lockdep_lock_destroy(struct lockdep_node_head *graph, uintptr_t lock_id)  in lockdep_lock_destroy()  argument
508 		if (node->lock_id == lock_id) {  in lockdep_lock_destroy()