Lines Matching defs:queue
54 } queue;
57 * - the queue is a circular queue. The first element (q->elem[q->start])
129 queue_insert(queue *q, int after, uint64_t seqnum)
163 queue *q;
165 if ((q = (queue *) malloc(sizeof(queue))) == NULL)
190 queue *q;
194 q = (queue *) (*vqueue);
265 queue *q;
267 q = (queue *) (*vqueue);
281 *sizep += sizeof(queue);
288 if (*lenremain < sizeof(queue))
290 (void) memcpy(*buf, vqueue, sizeof(queue));
291 *buf += sizeof(queue);
292 *lenremain -= sizeof(queue);
302 if (*lenremain < sizeof(queue))
304 if ((q = malloc(sizeof(queue))) == 0)
306 (void) memcpy(q, *buf, sizeof(queue));
307 *buf += sizeof(queue);
308 *lenremain -= sizeof(queue);