Lines Matching refs:n2
1373 struct bset *n2 = btree_bset_first(new_nodes[i - 1]); in btree_gc_coalesce() local
1379 for (k = n2->start; in btree_gc_coalesce()
1380 k < bset_bkey_last(n2); in btree_gc_coalesce()
1399 if (__set_blocks(n1, n1->keys + n2->keys, in btree_gc_coalesce()
1404 keys = n2->keys; in btree_gc_coalesce()
1416 n2->start, in btree_gc_coalesce()
1417 (void *) bset_bkey_idx(n2, keys) - (void *) n2->start); in btree_gc_coalesce()
1422 memmove(n2->start, in btree_gc_coalesce()
1423 bset_bkey_idx(n2, keys), in btree_gc_coalesce()
1424 (void *) bset_bkey_last(n2) - in btree_gc_coalesce()
1425 (void *) bset_bkey_idx(n2, keys)); in btree_gc_coalesce()
1427 n2->keys -= keys; in btree_gc_coalesce()
2196 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local
2223 n2 = bch_btree_node_alloc(b->c, op, b->level, b->parent); in btree_split()
2224 if (IS_ERR(n2)) in btree_split()
2234 mutex_lock(&n2->write_lock); in btree_split()
2251 btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys; in btree_split()
2254 memcpy(btree_bset_first(n2)->start, in btree_split()
2256 btree_bset_first(n2)->keys * sizeof(uint64_t)); in btree_split()
2258 bkey_copy_key(&n2->key, &b->key); in btree_split()
2260 bch_keylist_add(&parent_keys, &n2->key); in btree_split()
2261 bch_btree_node_write(n2, &cl); in btree_split()
2262 mutex_unlock(&n2->write_lock); in btree_split()
2263 rw_unlock(true, n2); in btree_split()
2307 bkey_put(b->c, &n2->key); in btree_split()
2308 btree_node_free(n2); in btree_split()
2309 rw_unlock(true, n2); in btree_split()
2318 n2 == ERR_PTR(-EAGAIN) || in btree_split()