Lines Matching refs:nodes
550 * Redistributes entries between two btree nodes to make them
579 * Redistribute entries between three nodes. Assumes the central
625 * Splits a node by creating a sibling node and shifting half the nodes
693 s->nodes[1] = left;
696 s->nodes[1] = right;
734 * Splits two nodes into three. This is more work, but results in fuller
735 * nodes, so saves metadata space.
801 s->nodes[1] = left;
805 s->nodes[1] = middle;
809 s->nodes[1] = right;
932 unlock_block(s->info, s->nodes[1]);
933 s->nodes[1] = sib;
942 * Redistributes a nodes entries with its right sibling.
963 unlock_block(s->info, s->nodes[1]);
964 s->nodes[1] = sib;
1047 * We need to split the node, normally we split two nodes
1076 * leaf nodes if we know it's an overwrite.
1471 struct cursor_node *n = c->nodes + c->depth - 1;
1486 struct cursor_node *n = c->nodes + c->depth - 1;
1495 struct cursor_node *n = c->nodes + c->depth;
1518 unlock_block(c->info, c->nodes[c->depth].b);
1530 n = c->nodes + c->depth - 1;
1551 n = c->nodes + c->depth - 1;
1624 struct cursor_node *n = c->nodes + c->depth - 1;