Lines Matching refs:root_
109 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
117 memset(root_, 0, sizeof(root_));
124 return root_[i1]->values[i2];
131 root_[i1]->values[i2] = v;
139 if (root_[i1] == NULL) {
143 root_[i1] = leaf;
161 if (!root_[i])
164 Leaf* l = reader(reinterpret_cast<Leaf*>(root_[i]));
173 if (root_[i])
174 visitor.visit(root_[i], sizeof(Leaf));
201 Node* root_; // Root of radix tree
217 root_ = NewNode();
225 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
233 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
242 if (root_->ptrs[i1] == NULL) {
245 root_->ptrs[i1] = n;
249 if (root_->ptrs[i1]->ptrs[i2] == NULL) {
253 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
267 Node* root = reader(root_);
286 visitor.visit(root_, sizeof(Node));
288 Node* root = reader(root_);
