Lines Matching defs:buffers
46 * character buffers. This facility is designed principally as
57 * The queue is contained in a list of fixed sized buffers. New nodes
63 CqCharBuff *next; /* The next node in the list of buffers */
69 * buffers.
75 CqCharBuff *head; /* The head of the list of output buffers */
76 CqCharBuff *tail; /* The tail of the list of output buffers */
77 } buffers;
110 cq->buffers.head = NULL;
111 cq->buffers.tail = NULL;
176 * buffers, so loop for each buffer.
180 int nleft; /* The amount of space remaining in cq->buffers.tail */
181 int nnew; /* The number of characters to append to cq->buffers.tail */
235 if(cq->buffers.tail)
236 cq->buffers.tail->next = node;
238 cq->buffers.head = node;
239 cq->buffers.tail = node;
256 memcpy(cq->buffers.tail->bytes + boff, chars + ndone, nnew);
282 cq->buffers.head = cq->buffers.tail = NULL;
297 return (cq && cq->buffers.head) ? (cq->ntotal - cq->nflush) : 0;
334 * If possible keep writing until all of the chained buffers have been
337 while(cq->buffers.head) {
341 int is_tail = cq->buffers.head == cq->buffers.tail;
364 int nnew = write_fn(data, cq->buffers.head->bytes +
390 CqCharBuff *node = cq->buffers.head;
394 cq->buffers.head = node->next;