Lines Matching refs:queue
56 } queue;
59 * - the queue is a circular queue. The first element (q->elem[q->start])
129 queue_insert(queue *q, int after, gssint_uint64 seqnum)
163 queue *q;
165 if ((q = (queue *) MALLOC(sizeof(queue))) == NULL)
184 queue *q;
188 q = (queue *) (*vqueue);
256 queue *q;
258 q = (queue *) (*vqueue);
260 FREE (q, sizeof (queue));
273 *sizep += sizeof(queue);
280 (void) memcpy(*buf, vqueue, sizeof(queue));
281 *buf += sizeof(queue);
282 *lenremain -= sizeof(queue);
292 if ((q = (void *) MALLOC(sizeof(queue))) == 0)
294 (void) memcpy(q, *buf, sizeof(queue));
295 *buf += sizeof(queue);
296 *lenremain -= sizeof(queue);