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