Lines Matching defs:n2
1438 * Move keys from n1 (original replacement node, now lower node) to n2 (higher
1583 struct btree *n1, *n2 = NULL, *n3 = NULL;
1604 n[1] = n2 = bch2_btree_node_alloc(as, trans, b->c.level);
1610 btree_split_insert_keys(as, trans, path, n2, keys);
1614 bch2_btree_build_aux_trees(n2);
1618 bch2_btree_update_add_new_node(as, n2);
1619 six_unlock_write(&n2->c.lock);
1627 path2 = get_unlocked_mut_path(trans, as->btree_id, n2->c.level, n2->key.k.p);
1628 six_lock_increment(&n2->c.lock, SIX_LOCK_intent);
1629 mark_btree_node_locked(trans, trans->paths + path2, n2->c.level, BTREE_NODE_INTENT_LOCKED);
1630 bch2_btree_path_level_init(trans, trans->paths + path2, n2);
1638 bch2_keylist_add(&as->parent_keys, &n2->key);
1700 if (n2) {
1701 bch2_btree_update_get_open_buckets(as, n2);
1702 bch2_btree_node_write(c, n2, SIX_LOCK_intent, 0);
1717 if (n2)
1718 bch2_trans_node_add(trans, trans->paths + path2, n2);
1723 if (n2)
1724 six_unlock_intent(&n2->c.lock);
1738 bch2_time_stats_update(&c->times[n2
1746 if (n2)
1747 bch2_btree_node_free_never_used(as, trans, n2);