Lines Matching refs:n3
1588 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local
1645 n3 = __btree_root_alloc(as, trans, b->c.level + 1); in btree_split()
1647 bch2_btree_update_add_new_node(as, n3); in btree_split()
1648 six_unlock_write(&n3->c.lock); in btree_split()
1651 BUG_ON(btree_node_locked(trans->paths + path2, n3->c.level)); in btree_split()
1652 six_lock_increment(&n3->c.lock, SIX_LOCK_intent); in btree_split()
1653 mark_btree_node_locked(trans, trans->paths + path2, n3->c.level, BTREE_NODE_INTENT_LOCKED); in btree_split()
1654 bch2_btree_path_level_init(trans, trans->paths + path2, n3); in btree_split()
1656 n3->sib_u64s[0] = U16_MAX; in btree_split()
1657 n3->sib_u64s[1] = U16_MAX; in btree_split()
1659 btree_split_insert_keys(as, trans, path, n3, &as->parent_keys); in btree_split()
1689 } else if (n3) { in btree_split()
1690 ret = bch2_btree_set_root(as, trans, trans->paths + path, n3, false); in btree_split()
1701 if (n3) { in btree_split()
1702 bch2_btree_update_get_open_buckets(as, n3); in btree_split()
1703 bch2_btree_node_write_trans(trans, n3, SIX_LOCK_intent, 0); in btree_split()
1720 if (n3) in btree_split()
1721 bch2_trans_node_add(trans, trans->paths + path, n3); in btree_split()
1726 if (n3) in btree_split()
1727 six_unlock_intent(&n3->c.lock); in btree_split()
1749 if (n3) in btree_split()
1750 bch2_btree_node_free_never_used(as, trans, n3); in btree_split()