1343 		struct bset *n1 = btree_bset_first(new_nodes[i]);  in btree_gc_coalesce()  local
1353 				if (__set_blocks(n1, n1->keys + keys +  in btree_gc_coalesce()
1370 			if (__set_blocks(n1, n1->keys + n2->keys,  in btree_gc_coalesce()
1380 		BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c)) >  in btree_gc_coalesce()
1386 		memcpy(bset_bkey_last(n1),  in btree_gc_coalesce()
1390 		n1->keys += keys;  in btree_gc_coalesce()
1391 		r[i].keys = n1->keys;  in btree_gc_coalesce()
1965 	struct btree *n1, *n2 = NULL, *n3 = NULL;  in btree_split()  local
1980 	n1 = btree_node_alloc_replacement(b, op);  in btree_split()
1981 	if (IS_ERR(n1))  in btree_split()
1984 	split = set_blocks(btree_bset_first(n1),  in btree_split()
1985 			   block_bytes(n1->c)) > (btree_blocks(b) * 4) / 5;  in btree_split()
1990 		trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys);  in btree_split()
2002 		mutex_lock(&n1->write_lock);  in btree_split()
2005 		bch_btree_insert_keys(n1, op, insert_keys, replace_key);  in btree_split()
2012 		while (keys < (btree_bset_first(n1)->keys * 3) / 5)  in btree_split()
2013 			keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1),  in btree_split()
2016 		bkey_copy_key(&n1->key,  in btree_split()
2017 			      bset_bkey_idx(btree_bset_first(n1), keys));  in btree_split()
2018 		keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys));  in btree_split()
2020 		btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys;  in btree_split()
2021 		btree_bset_first(n1)->keys = keys;  in btree_split()
2024 		       bset_bkey_last(btree_bset_first(n1)),  in btree_split()
2034 		trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys);  in btree_split()
2036 		mutex_lock(&n1->write_lock);  in btree_split()
2037 		bch_btree_insert_keys(n1, op, insert_keys, replace_key);  in btree_split()
2040 	bch_keylist_add(&parent_keys, &n1->key);  in btree_split()
2041 	bch_btree_node_write(n1, &cl);  in btree_split()
2042 	mutex_unlock(&n1->write_lock);  in btree_split()
2058 		bch_btree_set_root(n1);  in btree_split()
2070 	rw_unlock(true, n1);  in btree_split()
2080 	bkey_put(b->c, &n1->key);  in btree_split()
2081 	btree_node_free(n1);  in btree_split()
2082 	rw_unlock(true, n1);  in btree_split()
2088 	    n1 == ERR_PTR(-EAGAIN))  in btree_split()