Home
last modified time | relevance | path

Searched refs:edge_adj_next (Results 1 – 2 of 2) sorted by relevance

/illumos-gate/usr/src/uts/common/sys/
H A Dflock_impl.h52 struct edge *edge_adj_next; /* adjacency list next */ member
314 (ep)->edge_adj_next->edge_adj_prev = (ep)->edge_adj_prev; \
315 (ep)->edge_adj_prev->edge_adj_next = (ep)->edge_adj_next; \
319 ((lock)->l_edge.edge_adj_next == &(lock)->l_edge && !IS_GRANTED(lock))
380 #define FIRST_ADJ(lock) ((lock)->l_edge.edge_adj_next)
382 #define NEXT_ADJ(ep) ((ep)->edge_adj_next)
386 (lock)->l_edge.edge_adj_next = (lock)->l_edge.edge_adj_prev = &(lock)->l_edge; \
/illumos-gate/usr/src/uts/common/os/
H A Dflock.c347 lock_request->l_edge.edge_adj_next = &lock_request->l_edge; in ofdlock()
569 lock_request->l_edge.edge_adj_next = &lock_request->l_edge; in reclock()
996 l->l_edge.edge_adj_next = &l->l_edge; in flk_get_lock()
1516 from_lock->l_edge.edge_adj_next->edge_adj_prev = edge; in flk_add_edge()
1517 edge->edge_adj_next = from_lock->l_edge.edge_adj_next; in flk_add_edge()
1519 from_lock->l_edge.edge_adj_next = edge; in flk_add_edge()