Searched refs:l_edge (Results 1 – 2 of 2) sorted by relevance
65 struct edge l_edge; /* edge for adj and in lists */ member319 ((lock)->l_edge.edge_adj_next == &(lock)->l_edge && !IS_GRANTED(lock))371 ((lock)->l_edge.edge_in_next == &(lock)->l_edge)379 #define FIRST_IN(lock) ((lock)->l_edge.edge_in_next)380 #define FIRST_ADJ(lock) ((lock)->l_edge.edge_adj_next)381 #define HEAD(lock) (&(lock)->l_edge)386 (lock)->l_edge.edge_adj_next = (lock)->l_edge.edge_adj_prev = &(lock)->l_edge; \387 (lock)->l_edge.edge_in_next = (lock)->l_edge.edge_in_prev = &(lock)->l_edge; \
345 lock_request->l_edge.edge_in_next = &lock_request->l_edge; in ofdlock()346 lock_request->l_edge.edge_in_prev = &lock_request->l_edge; in ofdlock()347 lock_request->l_edge.edge_adj_next = &lock_request->l_edge; in ofdlock()348 lock_request->l_edge.edge_adj_prev = &lock_request->l_edge; in ofdlock()567 lock_request->l_edge.edge_in_next = &lock_request->l_edge; in reclock()568 lock_request->l_edge.edge_in_prev = &lock_request->l_edge; in reclock()569 lock_request->l_edge.edge_adj_next = &lock_request->l_edge; in reclock()570 lock_request->l_edge.edge_adj_prev = &lock_request->l_edge; in reclock()994 l->l_edge.edge_in_next = &l->l_edge; in flk_get_lock()995 l->l_edge.edge_in_prev = &l->l_edge; in flk_get_lock()[all …]