Lines Matching defs:node
47 size_t node_size; /* The size of a free-list node */
76 * When a free-list node is on the free-list, it is used as a (void *)
80 * ensure that the first sizeof(void *) bytes of each node will be
150 * Locate the last node of the current block.
155 * Make the link-field of the last node point to the first
156 * node of the current freelist, then make the first node of the
228 void *node; /* The node to be returned */
253 * Remove and return a node from the front of the free list.
255 node = fl->free_list;
256 fl->free_list = *(void **)node;
258 * Record the loss of a node from the free-list.
262 * Return the node.
264 return node;
272 * object void * The node to be returned.
284 * Return the node to the head of the free list.
290 * Record the return of the node to the free-list.
326 * be linked together as a list starting with the node at the lowest
369 * Link each node of a freelist block to the node that follows it.
380 *(void **)mem = mem + fl->node_size; /* Link to the next node */