Lines Matching defs:root_
116 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes
124 memset(root_, 0, sizeof(root_));
131 return root_[i1]->values[i2];
138 root_[i1]->values[i2] = v;
146 if (root_[i1] == NULL) {
150 root_[i1] = leaf;
169 if (!root_[i])
172 Leaf* l = reader(reinterpret_cast<Leaf*>(root_[i]));
181 if (root_[i])
182 visitor.visit(root_[i], sizeof(Leaf));
210 Node* root_; // Root of radix tree
226 root_ = NewNode();
234 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
242 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
251 if (root_->ptrs[i1] == NULL) {
254 root_->ptrs[i1] = n;
258 if (root_->ptrs[i1]->ptrs[i2] == NULL) {
262 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
277 Node* root = reader(root_);
296 visitor.visit(root_, sizeof(Node));
298 Node* root = reader(root_);
