Lines Matching defs:kid
121 * @param kid The node we may want to move to.
127 goesAfter(Node **parent, Node *kid, Key key, Key new_mask)
129 if (kid && kid->matches(key) && (kid->mask & new_mask) == kid->mask) {
130 *parent = kid;
218 Node *&kid = node->kids[i];
220 if (!kid) {
221 // No kid. Add a new one.
224 kid = new_node;
235 done = ((key & cur_mask) != (kid->key & cur_mask)) ||
247 kid->parent = new_node;
248 new_node->kids[0] = kid;
249 kid = new_node;
259 new_node->parent = kid;
260 kid->kids[1] = new_node;
303 // If there's a kid, fix up it's parent pointer.
306 // Figure out which kid we are, and update our parent's pointers.
312 panic("Trie: Inconsistent parent/kid relationship.\n");
313 // Make sure if the parent only has one kid, it's kid[0].