193 bool __bch_cut_front(const struct bkey *where, struct bkey *k)  in __bch_cut_front()  argument
197 	if (bkey_cmp(where, &START_KEY(k)) <= 0)  in __bch_cut_front()
200 	if (bkey_cmp(where, k) < 0)  in __bch_cut_front()
201 		len = KEY_OFFSET(k) - KEY_OFFSET(where);  in __bch_cut_front()
203 		bkey_copy_key(k, where);  in __bch_cut_front()
213 bool __bch_cut_back(const struct bkey *where, struct bkey *k)  in __bch_cut_back()  argument
217 	if (bkey_cmp(where, k) >= 0)  in __bch_cut_back()
220 	BUG_ON(KEY_INODE(where) != KEY_INODE(k));  in __bch_cut_back()
222 	if (bkey_cmp(where, &START_KEY(k)) > 0)  in __bch_cut_back()
223 		len = KEY_OFFSET(where) - KEY_START(k);  in __bch_cut_back()
225 	bkey_copy_key(k, where);  in __bch_cut_back()
799 void bch_bset_insert(struct btree_keys *b, struct bkey *where,  in bch_bset_insert()  argument
809 	memmove((uint64_t *) where + bkey_u64s(insert),  in bch_bset_insert()
810 		where,  in bch_bset_insert()
811 		(void *) bset_bkey_last(t->data) - (void *) where);  in bch_bset_insert()
814 	bkey_copy(where, insert);  in bch_bset_insert()
815 	bch_bset_fix_lookup_table(b, t, where);  in bch_bset_insert()