1639 static void shift_keys(struct btree *b, struct bkey *where, struct bkey *insert)  in shift_keys()  argument
1643 	memmove((uint64_t *) where + bkey_u64s(insert),  in shift_keys()
1647 	i->keys += bkey_u64s(insert);  in shift_keys()
1648 	bkey_copy(where, insert);  in shift_keys()
1653 				    struct bkey *insert,  in fix_overlapping_extents()  argument
1670 		    bkey_cmp(&START_KEY(k), insert) >= 0)  in fix_overlapping_extents()
1673 		if (bkey_cmp(k, &START_KEY(insert)) <= 0)  in fix_overlapping_extents()
1702 			if (KEY_START(k) > KEY_START(insert) + sectors_found)  in fix_overlapping_extents()
1717 			sectors_found = KEY_OFFSET(k) - KEY_START(insert);  in fix_overlapping_extents()
1720 		if (bkey_cmp(insert, k) < 0 &&  in fix_overlapping_extents()
1721 		    bkey_cmp(&START_KEY(insert), &START_KEY(k)) > 0) {  in fix_overlapping_extents()
1731 			subtract_dirty(k, KEY_SIZE(insert));  in fix_overlapping_extents()
1747 						      insert);  in fix_overlapping_extents()
1756 			bch_cut_front(insert, top);  in fix_overlapping_extents()
1757 			bch_cut_back(&START_KEY(insert), k);  in fix_overlapping_extents()
1762 		if (bkey_cmp(insert, k) < 0) {  in fix_overlapping_extents()
1763 			bch_cut_front(insert, k);  in fix_overlapping_extents()
1766 			    bkey_cmp(&START_KEY(insert), &START_KEY(k)) <= 0) {  in fix_overlapping_extents()
1773 				__bch_cut_back(&START_KEY(insert), k);  in fix_overlapping_extents()
1786 		} else if (sectors_found < KEY_SIZE(insert)) {  in fix_overlapping_extents()
1787 			SET_KEY_OFFSET(insert, KEY_OFFSET(insert) -  in fix_overlapping_extents()
1788 				       (KEY_SIZE(insert) - sectors_found));  in fix_overlapping_extents()
1789 			SET_KEY_SIZE(insert, sectors_found);  in fix_overlapping_extents()
1831 			goto insert;  in btree_insert_key()
1851 insert:	shift_keys(b, m, k);  in btree_insert_key()
2036 		struct bkey *insert = op->keys.bottom;  in bch_btree_insert_recurse()  local
2037 		struct bkey *k = bch_next_recurse_key(b, &START_KEY(insert));  in bch_btree_insert_recurse()
2047 		if (bkey_cmp(insert, k) > 0) {  in bch_btree_insert_recurse()
2051 				__bkey_put(b->c, insert);  in bch_btree_insert_recurse()
2057 			for (i = 0; i < KEY_PTRS(insert); i++)  in bch_btree_insert_recurse()
2058 				atomic_inc(&PTR_BUCKET(b->c, insert, i)->pin);  in bch_btree_insert_recurse()
2060 			bkey_copy(stack_keys->top, insert);  in bch_btree_insert_recurse()
2062 			bch_cut_back(k, insert);  in bch_btree_insert_recurse()