Lines Matching refs:new_nodes
1324 struct btree *new_nodes[GC_MERGE_NODES]; in btree_gc_coalesce() local
1334 memset(new_nodes, 0, sizeof(new_nodes)); in btree_gc_coalesce()
1348 new_nodes[i] = btree_node_alloc_replacement(r[i].b, NULL); in btree_gc_coalesce()
1349 if (IS_ERR_OR_NULL(new_nodes[i])) in btree_gc_coalesce()
1363 mutex_lock(&new_nodes[i]->write_lock); in btree_gc_coalesce()
1366 struct bset *n1 = btree_bset_first(new_nodes[i]); in btree_gc_coalesce()
1367 struct bset *n2 = btree_bset_first(new_nodes[i - 1]); in btree_gc_coalesce()
1395 btree_blocks(new_nodes[i])) in btree_gc_coalesce()
1404 btree_blocks(new_nodes[i])); in btree_gc_coalesce()
1407 bkey_copy_key(&new_nodes[i]->key, last); in btree_gc_coalesce()
1424 bkey_u64s(&new_nodes[i]->key))) in btree_gc_coalesce()
1427 bch_btree_node_write(new_nodes[i], &cl); in btree_gc_coalesce()
1428 bch_keylist_add(&keylist, &new_nodes[i]->key); in btree_gc_coalesce()
1432 mutex_unlock(&new_nodes[i]->write_lock); in btree_gc_coalesce()
1437 BUG_ON(btree_bset_first(new_nodes[0])->keys); in btree_gc_coalesce()
1438 btree_node_free(new_nodes[0]); in btree_gc_coalesce()
1439 rw_unlock(true, new_nodes[0]); in btree_gc_coalesce()
1440 new_nodes[0] = NULL; in btree_gc_coalesce()
1457 r[i].b = new_nodes[i]; in btree_gc_coalesce()
1480 if (!IS_ERR_OR_NULL(new_nodes[i])) { in btree_gc_coalesce()
1481 btree_node_free(new_nodes[i]); in btree_gc_coalesce()
1482 rw_unlock(true, new_nodes[i]); in btree_gc_coalesce()