Lines Matching defs:root
97 // Put 32 entries in the root and (2^BITS)/32 entries in each leaf.
175 // There's no node at this index. Move on to the next index at the root level,
300 Node* root = reader(root_);
307 if (!root->ptrs[rootIndex]) {
308 // There's no node at this index. Move on to the next index at the root level, clearing the
315 intermediateNode = reader(root->ptrs[rootIndex]);
343 Node* root = reader(root_);
345 if (!root->ptrs[i])
348 visitor.visit(root->ptrs[i], sizeof(Node));
349 Node* n = reader(root->ptrs[i]);