Lines Matching refs:q
41 queue_init(queue_node_t * q) in queue_init() argument
43 q->next_p = q->prev_p = q; in queue_init()
53 queue_prepend(queue_node_t * h, queue_node_t * q) in queue_prepend() argument
56 return ((q) ? q : NULL); in queue_prepend()
58 if (q) { in queue_prepend()
59 queue_node_t *qtail_p = q->prev_p; in queue_prepend()
63 h->next_p = q; in queue_prepend()
65 q->prev_p = h; in queue_prepend()
78 queue_append(queue_node_t * h, queue_node_t * q) in queue_append() argument
81 return ((q) ? q : NULL); in queue_append()
83 if (q) { in queue_append()
85 queue_node_t *qtail_p = q->prev_p; in queue_append()
88 htail_p->next_p = q; in queue_append()
90 q->prev_p = htail_p; in queue_append()
104 queue_remove(queue_node_t * q) in queue_remove() argument
108 n = q->next_p; in queue_remove()
110 if (queue_isempty(q)) in queue_remove()
113 q->next_p->prev_p = q->prev_p; in queue_remove()
114 q->prev_p->next_p = q->next_p; in queue_remove()
116 q->next_p = q->prev_p = q; in queue_remove()
128 queue_isempty(queue_node_t * q) in queue_isempty() argument
130 return ((q->next_p == q)); in queue_isempty()
141 queue_next(queue_node_t * h, queue_node_t * q) in queue_next() argument
146 if (!q) in queue_next()
149 if (q->next_p == h) in queue_next()
152 return (q->next_p); in queue_next()