Lines Matching refs:n_children
146 if (n->n_children[i] != NULL) {
147 n->n_children[i]->n_parent = n;
165 memset(&n->n_children, 0, sizeof(n->n_children));
166 n->n_children[0] = t->t_root;
192 memset(&n->n_children, 0, sizeof(n->n_children));
205 memcpy(n->n_children, cur->n_children, sizeof(n->n_children));
214 where = &cur->n_children[idx];
256 if (parent->n_children[i] == n) {
260 KASSERT(parent->n_children[i] == n);
261 return &parent->n_children[i];
284 c = cur->n_children[i];
307 * swap selected->n_children and cur->n_children.
309 memcpy(tmp, selected->n_children, sizeof(tmp));
310 memcpy(selected->n_children, cur->n_children, sizeof(tmp));
311 memcpy(cur->n_children, tmp, sizeof(tmp));
326 where = &selected->n_children[selected_idx];
484 idx = where - n->n_children + 1;
490 next = n->n_children[idx];
532 rpst_dump_node(n->n_children[i], depth + 1);