Lines Matching refs:uintptr_t
25 uintptr_t lock_id) in lockdep_add_to_graph()
81 uintptr_t thread_id) in lockdep_add_edge()
103 uintptr_t *path;
128 static uintptr_t *lockdep_graph_get_shortest_cycle(struct lockdep_node *node) in lockdep_graph_get_shortest_cycle()
132 uintptr_t *ret = NULL; in lockdep_graph_get_shortest_cycle()
141 qe->path = malloc(sizeof(uintptr_t)); in lockdep_graph_get_shortest_cycle()
158 uintptr_t *tmp = NULL; in lockdep_graph_get_shortest_cycle()
166 nlen * sizeof(uintptr_t)); in lockdep_graph_get_shortest_cycle()
190 nqe->path = malloc(nlen * sizeof(uintptr_t)); in lockdep_graph_get_shortest_cycle()
195 qe->pathlen * sizeof(uintptr_t)); in lockdep_graph_get_shortest_cycle()
255 uintptr_t from, uintptr_t to) in lockdep_find_edge()
268 static void lockdep_print_edge_info(uintptr_t from __maybe_unused, in lockdep_print_edge_info()
271 uintptr_t __maybe_unused to = edge->to->lock_id; in lockdep_print_edge_info()
296 uintptr_t *cycle = NULL; in lockdep_print_cycle_info()
297 uintptr_t *p = NULL; in lockdep_print_cycle_info()
298 uintptr_t from = 0; in lockdep_print_cycle_info()
299 uintptr_t to = 0; in lockdep_print_cycle_info()
336 uintptr_t id) in __lockdep_lock_acquire()
350 acq_stack, (uintptr_t)owned); in __lockdep_lock_acquire()
381 uintptr_t id) in __lockdep_lock_tryacquire()
403 TEE_Result __lockdep_lock_release(struct lockdep_lock_head *owned, uintptr_t id) in __lockdep_lock_release()
502 void lockdep_lock_destroy(struct lockdep_node_head *graph, uintptr_t lock_id) in lockdep_lock_destroy()