Lines Matching refs:root
100 rbtree->root = LDNS_RBTREE_NULL;
132 rbtree->root = right;
159 rbtree->root = left;
170 /* While not at the root and need fixing... */
171 while (node != rbtree->root && node->parent->color == RED) {
225 rbtree->root->color = BLACK;
247 /* We start at the root of the tree */
248 ldns_rbnode_t *node = rbtree->root;
280 rbtree->root = data;
322 if(rbtree->root == old) rbtree->root = new;
426 /* removed parent==black from root, every path, so ok */
519 /* We start at root... */
520 node = rbtree->root;
550 ldns_rbnode_t *node = rbtree->root;
552 if (rbtree->root != LDNS_RBTREE_NULL) {
553 for (node = rbtree->root; node->left != LDNS_RBTREE_NULL; node = node->left);
561 ldns_rbnode_t *node = rbtree->root;
563 if (rbtree->root != LDNS_RBTREE_NULL) {
564 for (node = rbtree->root; node->right != LDNS_RBTREE_NULL; node = node->right);
669 traverse_post(func, arg, tree->root);