Lines Matching defs:nodes
43 char *nodes; /* The array of free-list nodes */
48 unsigned blocking_factor; /* The number of nodes per block */
49 long nbusy; /* The number of nodes that are in use */
50 long ntotal; /* The total number of nodes in the free list */
52 void *free_list; /* The free-list of nodes */
64 * node_size size_t The size of the free-list nodes to be returned
78 * pointer. This, plus the fact that the array of nodes is obtained via
118 * Add the new list of nodes to the free-list.
120 fl->free_list = fl->block->nodes;
128 * Re-thread a freelist to reclaim all allocated nodes.
130 * of the currently allocated nodes are still being used.
140 * Re-thread the nodes of each block into individual free-lists.
152 char *last_node = block->nodes + fl->node_size *
160 fl->free_list = block->nodes;
163 * All allocated nodes have now been returned to the freelist.
176 * of nodes have not been returned to the free-list.
178 * whether any nodes are still in use and will
188 * Check whether any nodes are in use.
236 * another block of nodes.
248 * Add the new list of nodes to the free-list.
250 fl->free_list = fl->block->nodes;
298 * Return a count of the number of nodes that are currently allocated.
303 * return long The number of nodes (or 0 if fl==NULL).
311 * Query the number of allocated nodes in the freelist which are
317 * return long The number of unused nodes (or 0 if fl==NULL).
325 * Allocate a new list of free-list nodes. On return the nodes will
332 * return FreeListBlock * The new linked block of free-list nodes,
350 block->nodes = NULL;
352 * Allocate the block of nodes.
354 block->nodes = (char *) malloc(fl->node_size * fl->blocking_factor);
355 if(!block->nodes)
362 * Update the record of the number of nodes in the freelist.
377 char *mem = block->nodes;
396 if(fl->nodes)
397 free(fl->nodes);
398 fl->nodes = NULL;