Lines Matching defs:node
133 StringSegment *node;
137 for(node=sg->head; node; node=node->next) {
138 if(node->block)
139 free(node->block);
140 node->block = NULL;
230 StringSegment *node; /* A node of the list of string segments */
239 * string segments. Do this by advancing the node pointer until we find
240 * a node with length+1 bytes unused, or we get to the end of the list.
242 for(node=sg->head; node && node->unused <= length; node=node->next)
247 if(!node) {
248 node = (StringSegment *) _new_FreeListNode(sg->node_mem);
249 if(!node)
254 node->next = NULL;
255 node->block = NULL;
256 node->unused = sg->block_size;
260 node->block = (char *) malloc(sg->block_size);
261 if(!node->block)
264 * Prepend the node to the list.
266 node->next = sg->head;
267 sg->head = node;
272 copy = node->block + sg->block_size - node->unused;
273 node->unused -= length + 1;
289 StringSegment *node; /* A node in the list of string segments */
293 for(node=sg->head; node; node=node->next)
294 node->unused = sg->block_size;