Lines Matching defs:root
179 * Points to root node of the binary search
183 struct node *root;
209 for (nodep = s->root; nodep && nodep->left; nodep = nodep->left)
278 struct node *root;
280 /* Duplicate the node at the root of the subtree */
281 root = calloc(1, sizeof(*root));
282 if (!root) {
287 root->idx = subtree->idx;
288 root->mask = subtree->mask;
289 root->num_after = subtree->num_after;
293 root->left = node_copy_subtree(subtree->left);
294 root->left->parent = root;
298 root->right = node_copy_subtree(subtree->right);
299 root->right->parent = root;
302 return root;
315 for (nodep = s->root; nodep;
346 /* If no nodes, set it up as the root node. */
347 if (!s->root) {
348 s->root = nodep;
356 parentp = s->root;
403 return s->root && s->num_set == 0;
434 s->root = nodep->left;
456 s->root = nodep->right;
476 s->root = NULL;
783 for (nodep = s->root; nodep;
878 node_type = "root";
928 fprintf(stream, "%*sroot: %p\n", indent, "", s->root);
931 if (s->root)
932 dump_nodes(stream, s->root, indent);
977 if (s->root) {
978 d->root = node_copy_subtree(s->root);
1056 if (!s->root)
1061 * just assure that the root node has a non-zero mask,
1064 assert(s->root->mask != 0);
1066 (s->root->num_after == ((sparsebit_num_t) 0) - MASK_BITS &&
1067 s->root->mask == ~(mask_t) 0));
1179 for (nodep = s->root; nodep;) {
1793 if (s->root != nodep) {
1794 fprintf(stderr, "Unexpected root node, "
1795 "s->root: %p nodep: %p",
1796 s->root, nodep);