Lines Matching refs:root
679 // initialize b+tree root node
809 const bplustree_node* root;
810 status_t status = cached.SetTo(fHeader.RootNode(), &root, true);
814 status = _ValidateChildren(check, 0, fHeader.RootNode(), NULL, 0, root);
844 // Reset the header, and root node
1105 following the key, from the root node to the leaf node that could
1112 // set the root node to begin with
1745 // do we need to allocate a new root node? if so, then do
1749 bplustree_node* root;
1750 status_t status = cachedNewRoot.Allocate(transaction, &root,
1776 // free root node & other node here
1796 // create a new root if necessary
1798 bplustree_node* root = cachedNewRoot.Node();
1800 _InsertKey(root, 0, keyBuffer, keyLength,
1802 root->overflow_link = HOST_ENDIAN_TO_BFS_INT64(
1811 // finally, update header to point to the new root
2157 // if it's an empty root node, we have to convert it
2168 // if we've made a leaf node out of the root node, we need