Lines Matching refs:new_nodes
1371 struct btree *new_nodes[GC_MERGE_NODES]; in btree_gc_coalesce() local
1381 memset(new_nodes, 0, sizeof(new_nodes)); in btree_gc_coalesce()
1395 new_nodes[i] = btree_node_alloc_replacement(r[i].b, NULL); in btree_gc_coalesce()
1396 if (IS_ERR_OR_NULL(new_nodes[i])) in btree_gc_coalesce()
1410 mutex_lock(&new_nodes[i]->write_lock); in btree_gc_coalesce()
1413 struct bset *n1 = btree_bset_first(new_nodes[i]); in btree_gc_coalesce()
1414 struct bset *n2 = btree_bset_first(new_nodes[i - 1]); in btree_gc_coalesce()
1442 btree_blocks(new_nodes[i])) in btree_gc_coalesce()
1451 btree_blocks(new_nodes[i])); in btree_gc_coalesce()
1454 bkey_copy_key(&new_nodes[i]->key, last); in btree_gc_coalesce()
1471 bkey_u64s(&new_nodes[i]->key))) in btree_gc_coalesce()
1474 bch_btree_node_write(new_nodes[i], &cl); in btree_gc_coalesce()
1475 bch_keylist_add(&keylist, &new_nodes[i]->key); in btree_gc_coalesce()
1479 mutex_unlock(&new_nodes[i]->write_lock); in btree_gc_coalesce()
1484 BUG_ON(btree_bset_first(new_nodes[0])->keys); in btree_gc_coalesce()
1485 btree_node_free(new_nodes[0]); in btree_gc_coalesce()
1486 rw_unlock(true, new_nodes[0]); in btree_gc_coalesce()
1487 new_nodes[0] = NULL; in btree_gc_coalesce()
1504 r[i].b = new_nodes[i]; in btree_gc_coalesce()
1527 if (!IS_ERR_OR_NULL(new_nodes[i])) { in btree_gc_coalesce()
1528 btree_node_free(new_nodes[i]); in btree_gc_coalesce()
1529 rw_unlock(true, new_nodes[i]); in btree_gc_coalesce()