Lines Matching full:n1
1404 struct bset *n1 = btree_bset_first(new_nodes[i]); in btree_gc_coalesce() local
1414 if (__set_blocks(n1, n1->keys + keys + in btree_gc_coalesce()
1431 if (__set_blocks(n1, n1->keys + n2->keys, in btree_gc_coalesce()
1441 BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c->cache)) > in btree_gc_coalesce()
1447 memcpy(bset_bkey_last(n1), in btree_gc_coalesce()
1451 n1->keys += keys; in btree_gc_coalesce()
1452 r[i].keys = n1->keys; in btree_gc_coalesce()
2242 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local
2257 n1 = btree_node_alloc_replacement(b, op); in btree_split()
2258 if (IS_ERR(n1)) in btree_split()
2261 split = set_blocks(btree_bset_first(n1), in btree_split()
2262 block_bytes(n1->c->cache)) > (btree_blocks(b) * 4) / 5; in btree_split()
2267 trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys); in btree_split()
2279 mutex_lock(&n1->write_lock); in btree_split()
2282 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
2289 while (keys < (btree_bset_first(n1)->keys * 3) / 5) in btree_split()
2290 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), in btree_split()
2293 bkey_copy_key(&n1->key, in btree_split()
2294 bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()
2295 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()
2297 btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys; in btree_split()
2298 btree_bset_first(n1)->keys = keys; in btree_split()
2301 bset_bkey_last(btree_bset_first(n1)), in btree_split()
2311 trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys); in btree_split()
2313 mutex_lock(&n1->write_lock); in btree_split()
2314 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
2317 bch_keylist_add(&parent_keys, &n1->key); in btree_split()
2318 bch_btree_node_write(n1, &cl); in btree_split()
2319 mutex_unlock(&n1->write_lock); in btree_split()
2335 bch_btree_set_root(n1); in btree_split()
2347 rw_unlock(true, n1); in btree_split()
2357 bkey_put(b->c, &n1->key); in btree_split()
2358 btree_node_free(n1); in btree_split()
2359 rw_unlock(true, n1); in btree_split()
2365 n1 == ERR_PTR(-EAGAIN)) in btree_split()