Lines Matching refs:q
24 #define uv__queue_foreach(q, h) \ argument
25 for ((q) = (h)->next; (q) != (h); (q) = (q)->next)
27 static inline void uv__queue_init(struct uv__queue* q) { in uv__queue_init() argument
28 q->next = q; in uv__queue_init()
29 q->prev = q; in uv__queue_init()
32 static inline int uv__queue_empty(const struct uv__queue* q) { in uv__queue_empty() argument
33 return q == q->next; in uv__queue_empty()
36 static inline struct uv__queue* uv__queue_head(const struct uv__queue* q) { in uv__queue_head() argument
37 return q->next; in uv__queue_head()
40 static inline struct uv__queue* uv__queue_next(const struct uv__queue* q) { in uv__queue_next() argument
41 return q->next; in uv__queue_next()
52 struct uv__queue* q, in uv__queue_split() argument
56 n->next = q; in uv__queue_split()
57 h->prev = q->prev; in uv__queue_split()
59 q->prev = n; in uv__queue_split()
70 struct uv__queue* q) { in uv__queue_insert_head() argument
71 q->next = h->next; in uv__queue_insert_head()
72 q->prev = h; in uv__queue_insert_head()
73 q->next->prev = q; in uv__queue_insert_head()
74 h->next = q; in uv__queue_insert_head()
78 struct uv__queue* q) { in uv__queue_insert_tail() argument
79 q->next = h; in uv__queue_insert_tail()
80 q->prev = h->prev; in uv__queue_insert_tail()
81 q->prev->next = q; in uv__queue_insert_tail()
82 h->prev = q; in uv__queue_insert_tail()
85 static inline void uv__queue_remove(struct uv__queue* q) { in uv__queue_remove() argument
86 q->prev->next = q->next; in uv__queue_remove()
87 q->next->prev = q->prev; in uv__queue_remove()
