Lines Matching refs:n2
1222 struct bset *n2 = r[i - 1].b->sets->data; in btree_gc_coalesce() local
1240 keys = n2->keys; in btree_gc_coalesce()
1243 for (k = n2->start; in btree_gc_coalesce()
1244 k < end(n2); in btree_gc_coalesce()
1263 n2->start, in btree_gc_coalesce()
1264 (void *) node(n2, keys) - (void *) n2->start); in btree_gc_coalesce()
1268 memmove(n2->start, in btree_gc_coalesce()
1269 node(n2, keys), in btree_gc_coalesce()
1270 (void *) end(n2) - (void *) node(n2, keys)); in btree_gc_coalesce()
1272 n2->keys -= keys; in btree_gc_coalesce()
1275 r[i - 1].keys = n2->keys; in btree_gc_coalesce()
1920 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local
1938 n2 = bch_btree_node_alloc(b->c, b->level, &op->cl); in btree_split()
1939 if (IS_ERR(n2)) in btree_split()
1960 n2->sets[0].data->keys = n1->sets[0].data->keys - keys; in btree_split()
1963 memcpy(n2->sets[0].data->start, in btree_split()
1965 n2->sets[0].data->keys * sizeof(uint64_t)); in btree_split()
1967 bkey_copy_key(&n2->key, &b->key); in btree_split()
1969 bch_keylist_add(&op->keys, &n2->key); in btree_split()
1970 bch_btree_write(n2, true, op); in btree_split()
1971 rw_unlock(true, n2); in btree_split()
2014 __bkey_put(n2->c, &n2->key); in btree_split()
2015 btree_node_free(n2, op); in btree_split()
2016 rw_unlock(true, n2); in btree_split()
2023 n2 == ERR_PTR(-EAGAIN) || in btree_split()