Lines Matching defs:node
45 * Set the number of bytes allocated to each node of the list of
63 CqCharBuff *next; /* The next node in the list of buffers */
64 char bytes[GL_CQ_SIZE]; /* The fixed size buffer of this node */
193 * If allocating this new node will require a call to malloc(), as
194 * opposed to using a currently unused node in the freelist, first try
197 * bigger than a single buffer node. When it is non-blocking, it helps
220 * Allocate the new node.
222 CqCharBuff *node = (CqCharBuff *) _new_FreeListNode(cq->bufmem);
223 if(!node) {
229 * Initialize the node.
231 node->next = NULL;
233 * Append the new node to the tail of the list.
236 cq->buffers.tail->next = node;
238 cq->buffers.head = node;
239 cq->buffers.tail = node;
242 * How much room is there for new characters in the current tail node?
250 * How many characters should we append to the current tail node?
339 * Are we looking at the only node in the list?
381 * If we just emptied the last node left in the list, then the queue is
388 * Get the node to be removed from the head of the list.
390 CqCharBuff *node = cq->buffers.head;
392 * Make the node that follows it the new head of the queue.
394 cq->buffers.head = node->next;
398 node = (CqCharBuff *) _del_FreeListNode(cq->bufmem, node);