1367 		struct bset *n2 = btree_bset_first(new_nodes[i - 1]);  in btree_gc_coalesce()  local
1373 			for (k = n2->start;  in btree_gc_coalesce()
1374 			     k < bset_bkey_last(n2);  in btree_gc_coalesce()
1393 			if (__set_blocks(n1, n1->keys + n2->keys,  in btree_gc_coalesce()
1398 			keys = n2->keys;  in btree_gc_coalesce()
1410 		       n2->start,  in btree_gc_coalesce()
1411 		       (void *) bset_bkey_idx(n2, keys) - (void *) n2->start);  in btree_gc_coalesce()
1416 		memmove(n2->start,  in btree_gc_coalesce()
1417 			bset_bkey_idx(n2, keys),  in btree_gc_coalesce()
1418 			(void *) bset_bkey_last(n2) -  in btree_gc_coalesce()
1419 			(void *) bset_bkey_idx(n2, keys));  in btree_gc_coalesce()
1421 		n2->keys -= keys;  in btree_gc_coalesce()
2033 	struct btree *n1, *n2 = NULL, *n3 = NULL;  in btree_split()  local
2060 		n2 = bch_btree_node_alloc(b->c, op, b->level, b->parent);  in btree_split()
2061 		if (IS_ERR(n2))  in btree_split()
2071 		mutex_lock(&n2->write_lock);  in btree_split()
2088 		btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys;  in btree_split()
2091 		memcpy(btree_bset_first(n2)->start,  in btree_split()
2093 		       btree_bset_first(n2)->keys * sizeof(uint64_t));  in btree_split()
2095 		bkey_copy_key(&n2->key, &b->key);  in btree_split()
2097 		bch_keylist_add(&parent_keys, &n2->key);  in btree_split()
2098 		bch_btree_node_write(n2, &cl);  in btree_split()
2099 		mutex_unlock(&n2->write_lock);  in btree_split()
2100 		rw_unlock(true, n2);  in btree_split()
2144 	bkey_put(b->c, &n2->key);  in btree_split()
2145 	btree_node_free(n2);  in btree_split()
2146 	rw_unlock(true, n2);  in btree_split()
2155 	    n2 == ERR_PTR(-EAGAIN) ||  in btree_split()