• Home
  • Raw
  • Download

Lines Matching refs:n1

1381 		struct bset *n1 = btree_bset_first(new_nodes[i]);  in btree_gc_coalesce()  local
1391 if (__set_blocks(n1, n1->keys + keys + in btree_gc_coalesce()
1408 if (__set_blocks(n1, n1->keys + n2->keys, in btree_gc_coalesce()
1418 BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c->cache)) > in btree_gc_coalesce()
1424 memcpy(bset_bkey_last(n1), in btree_gc_coalesce()
1428 n1->keys += keys; in btree_gc_coalesce()
1429 r[i].keys = n1->keys; in btree_gc_coalesce()
2213 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local
2228 n1 = btree_node_alloc_replacement(b, op); in btree_split()
2229 if (IS_ERR(n1)) in btree_split()
2232 split = set_blocks(btree_bset_first(n1), in btree_split()
2233 block_bytes(n1->c->cache)) > (btree_blocks(b) * 4) / 5; in btree_split()
2238 trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys); in btree_split()
2250 mutex_lock(&n1->write_lock); in btree_split()
2253 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
2260 while (keys < (btree_bset_first(n1)->keys * 3) / 5) in btree_split()
2261 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), in btree_split()
2264 bkey_copy_key(&n1->key, in btree_split()
2265 bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()
2266 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys)); in btree_split()
2268 btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys; in btree_split()
2269 btree_bset_first(n1)->keys = keys; in btree_split()
2272 bset_bkey_last(btree_bset_first(n1)), in btree_split()
2282 trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys); in btree_split()
2284 mutex_lock(&n1->write_lock); in btree_split()
2285 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
2288 bch_keylist_add(&parent_keys, &n1->key); in btree_split()
2289 bch_btree_node_write(n1, &cl); in btree_split()
2290 mutex_unlock(&n1->write_lock); in btree_split()
2306 bch_btree_set_root(n1); in btree_split()
2318 rw_unlock(true, n1); in btree_split()
2328 bkey_put(b->c, &n1->key); in btree_split()
2329 btree_node_free(n1); in btree_split()
2330 rw_unlock(true, n1); in btree_split()
2336 n1 == ERR_PTR(-EAGAIN)) in btree_split()