1344 		struct bset *n2 = btree_bset_first(new_nodes[i - 1]);  in btree_gc_coalesce()  local
1350 			for (k = n2->start;  in btree_gc_coalesce()
1351 			     k < bset_bkey_last(n2);  in btree_gc_coalesce()
1370 			if (__set_blocks(n1, n1->keys + n2->keys,  in btree_gc_coalesce()
1375 			keys = n2->keys;  in btree_gc_coalesce()
1387 		       n2->start,  in btree_gc_coalesce()
1388 		       (void *) bset_bkey_idx(n2, keys) - (void *) n2->start);  in btree_gc_coalesce()
1393 		memmove(n2->start,  in btree_gc_coalesce()
1394 			bset_bkey_idx(n2, keys),  in btree_gc_coalesce()
1395 			(void *) bset_bkey_last(n2) -  in btree_gc_coalesce()
1396 			(void *) bset_bkey_idx(n2, keys));  in btree_gc_coalesce()
1398 		n2->keys -= keys;  in btree_gc_coalesce()
1965 	struct btree *n1, *n2 = NULL, *n3 = NULL;  in btree_split()  local
1992 		n2 = bch_btree_node_alloc(b->c, op, b->level, b->parent);  in btree_split()
1993 		if (IS_ERR(n2))  in btree_split()
2003 		mutex_lock(&n2->write_lock);  in btree_split()
2020 		btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys;  in btree_split()
2023 		memcpy(btree_bset_first(n2)->start,  in btree_split()
2025 		       btree_bset_first(n2)->keys * sizeof(uint64_t));  in btree_split()
2027 		bkey_copy_key(&n2->key, &b->key);  in btree_split()
2029 		bch_keylist_add(&parent_keys, &n2->key);  in btree_split()
2030 		bch_btree_node_write(n2, &cl);  in btree_split()
2031 		mutex_unlock(&n2->write_lock);  in btree_split()
2032 		rw_unlock(true, n2);  in btree_split()
2076 	bkey_put(b->c, &n2->key);  in btree_split()
2077 	btree_node_free(n2);  in btree_split()
2078 	rw_unlock(true, n2);  in btree_split()
2087 	    n2 == ERR_PTR(-EAGAIN) ||  in btree_split()