Lines Matching defs:node
70 arena_node_t *node;
77 node = (arena_node_t *) qb;
80 node->an_address,
81 node->an_address+node->an_length,
82 node->an_type);
128 * Locate the arena node containing a particular point in the
129 * address space. This routine walks the list and finds the node
137 * arena node pointer, or NULL if no node found
160 * Split the node containing the specified point. When we carve
176 arena_node_t *node;
189 node = arena_find(arena,splitpoint);
190 if (node == NULL) return -1; /* should not happen */
195 if (node->an_address == splitpoint) return 0;
198 * Allocate a new node and adjust the length of the node we're
204 newnode->an_length = node->an_length - (splitpoint - node->an_address);
205 node->an_length = splitpoint - node->an_address;
207 newnode->an_type = node->an_type;
210 * Put the new node in the arena
213 q_enqueue(node->an_next.q_next,(queue_t *) newnode);
234 arena_node_t *node;
244 node = (arena_node_t *) qb;
245 nextnode = (arena_node_t *) node->an_next.q_next;
249 if (node->an_type == nextnode->an_type) {
250 node->an_length += nextnode->an_length;
284 arena_node_t *node;
319 node = (arena_node_t *) qb;
321 if ((node->an_address >= address) &&
322 ((node->an_address + node->an_length) <= (address+length))) {
323 node->an_type = type;
324 node->an_descr = descr;