Lines Matching refs:node
168 /* Update parent and sibling's links to the reallocated node. */
533 * The allocator consists of a parent node (2K buffer), which requires
536 * the parent node in order to release all its children.
543 * The linear parent node is always the first buffer and keeps track of all
599 linear_header *node;
606 node = ralloc_size(ralloc_ctx, sizeof(linear_header) + min_size);
607 if (unlikely(!node))
611 node->magic = LMAGIC;
613 node->offset = 0;
614 node->size = min_size;
615 node->ralloc_parent = ralloc_ctx;
616 node->next = NULL;
617 node->latest = node;
618 return node;
637 /* allocate a new node */
659 linear_header *node;
666 node = create_linear_node(ralloc_ctx, size);
667 if (unlikely(!node))
670 return linear_alloc_child((char*)node +
698 linear_header *node;
703 node = LINEAR_PARENT_TO_HEADER(ptr);
704 assert(node->magic == LMAGIC);
706 while (node) {
707 void *ptr = node;
709 node = node->next;
717 linear_header *node;
722 node = LINEAR_PARENT_TO_HEADER(ptr);
723 assert(node->magic == LMAGIC);
725 while (node) {
726 ralloc_steal(new_ralloc_ctx, node);
727 node->ralloc_parent = new_ralloc_ctx;
728 node = node->next;
735 linear_header *node = LINEAR_PARENT_TO_HEADER(ptr);
736 assert(node->magic == LMAGIC);
737 return node->ralloc_parent;