Searched refs:l_edge (Results 1 – 2 of 2) sorted by relevance
66 struct edge l_edge; /* edge for adj and in lists */ member318 ((lock)->l_edge.edge_adj_next == &(lock)->l_edge && !IS_GRANTED(lock))370 ((lock)->l_edge.edge_in_next == &(lock)->l_edge)378 #define FIRST_IN(lock) ((lock)->l_edge.edge_in_next)379 #define FIRST_ADJ(lock) ((lock)->l_edge.edge_adj_next)380 #define HEAD(lock) (&(lock)->l_edge)385 (lock)->l_edge.edge_adj_next = (lock)->l_edge.edge_adj_prev = &(lock)->l_edge; \386 (lock)->l_edge.edge_in_next = (lock)->l_edge.edge_in_prev = &(lock)->l_edge; \
282 lock_request->l_edge.edge_in_next = &lock_request->l_edge; in reclock()283 lock_request->l_edge.edge_in_prev = &lock_request->l_edge; in reclock()284 lock_request->l_edge.edge_adj_next = &lock_request->l_edge; in reclock()285 lock_request->l_edge.edge_adj_prev = &lock_request->l_edge; in reclock()707 l->l_edge.edge_in_next = &l->l_edge; in flk_get_lock()708 l->l_edge.edge_in_prev = &l->l_edge; in flk_get_lock()709 l->l_edge.edge_adj_next = &l->l_edge; in flk_get_lock()710 l->l_edge.edge_adj_prev = &l->l_edge; in flk_get_lock()1221 from_lock->l_edge.edge_adj_next->edge_adj_prev = edge; in flk_add_edge()1222 edge->edge_adj_next = from_lock->l_edge.edge_adj_next; in flk_add_edge()[all …]