1352 		struct bset *n1 = btree_bset_first(new_nodes[i]);  in btree_gc_coalesce()  local
1362 				if (__set_blocks(n1, n1->keys + keys +  in btree_gc_coalesce()
1379 			if (__set_blocks(n1, n1->keys + n2->keys,  in btree_gc_coalesce()
1389 		BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c)) >  in btree_gc_coalesce()
1395 		memcpy(bset_bkey_last(n1),  in btree_gc_coalesce()
1399 		n1->keys += keys;  in btree_gc_coalesce()
1400 		r[i].keys = n1->keys;  in btree_gc_coalesce()
1981 	struct btree *n1, *n2 = NULL, *n3 = NULL;  in btree_split()  local
1996 	n1 = btree_node_alloc_replacement(b, op);  in btree_split()
1997 	if (IS_ERR(n1))  in btree_split()
2000 	split = set_blocks(btree_bset_first(n1),  in btree_split()
2001 			   block_bytes(n1->c)) > (btree_blocks(b) * 4) / 5;  in btree_split()
2006 		trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys);  in btree_split()
2018 		mutex_lock(&n1->write_lock);  in btree_split()
2021 		bch_btree_insert_keys(n1, op, insert_keys, replace_key);  in btree_split()
2028 		while (keys < (btree_bset_first(n1)->keys * 3) / 5)  in btree_split()
2029 			keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1),  in btree_split()
2032 		bkey_copy_key(&n1->key,  in btree_split()
2033 			      bset_bkey_idx(btree_bset_first(n1), keys));  in btree_split()
2034 		keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys));  in btree_split()
2036 		btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys;  in btree_split()
2037 		btree_bset_first(n1)->keys = keys;  in btree_split()
2040 		       bset_bkey_last(btree_bset_first(n1)),  in btree_split()
2050 		trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys);  in btree_split()
2052 		mutex_lock(&n1->write_lock);  in btree_split()
2053 		bch_btree_insert_keys(n1, op, insert_keys, replace_key);  in btree_split()
2056 	bch_keylist_add(&parent_keys, &n1->key);  in btree_split()
2057 	bch_btree_node_write(n1, &cl);  in btree_split()
2058 	mutex_unlock(&n1->write_lock);  in btree_split()
2074 		bch_btree_set_root(n1);  in btree_split()
2086 	rw_unlock(true, n1);  in btree_split()
2096 	bkey_put(b->c, &n1->key);  in btree_split()
2097 	btree_node_free(n1);  in btree_split()
2098 	rw_unlock(true, n1);  in btree_split()
2104 	    n1 == ERR_PTR(-EAGAIN))  in btree_split()