| /linux-6.1.9/drivers/md/bcache/ |
| D | extents.c | 230 struct bkey *replace_key) in bch_btree_ptr_insert_fixup() argument
326 struct bkey *replace_key) in bch_extent_insert_fixup() argument
363 if (replace_key && KEY_SIZE(k)) { in bch_extent_insert_fixup()
370 KEY_START(replace_key); in bch_extent_insert_fixup()
373 if (KEY_START(k) < KEY_START(replace_key) || in bch_extent_insert_fixup()
374 KEY_OFFSET(k) > KEY_OFFSET(replace_key)) in bch_extent_insert_fixup()
381 if (!bch_bkey_equal_header(k, replace_key)) in bch_extent_insert_fixup()
387 BUG_ON(!KEY_PTRS(replace_key)); in bch_extent_insert_fixup()
389 for (i = 0; i < KEY_PTRS(replace_key); i++) in bch_extent_insert_fixup()
390 if (k->ptr[i] != replace_key->ptr[i] + offset) in bch_extent_insert_fixup()
[all …]
|
| D | btree.c | 1324 struct bkey *replace_key);
2115 struct bkey *replace_key) in btree_insert_key() argument
2121 status = bch_btree_insert_key(&b->keys, k, replace_key); in btree_insert_key()
2124 replace_key ? "replace" : "insert"); in btree_insert_key()
2126 trace_bcache_btree_insert_key(b, k, replace_key != NULL, in btree_insert_key()
2148 struct bkey *replace_key) in bch_btree_insert_keys() argument
2163 ret |= btree_insert_key(b, k, replace_key); in bch_btree_insert_keys()
2172 ret |= btree_insert_key(b, &temp.key, replace_key); in bch_btree_insert_keys()
2190 struct bkey *replace_key) in btree_split() argument
2233 bch_btree_insert_keys(n1, op, insert_keys, replace_key); in btree_split()
[all …]
|
| D | request.h | 33 BKEY_PADDED(replace_key);
|
| D | bset.h | 197 struct bkey *replace_key);
305 struct bkey *replace_key);
|
| D | request.c | 62 struct bkey *replace_key = op->replace ? &op->replace_key : NULL; in bch_data_insert_keys() local
70 journal_ref, replace_key); in bch_data_insert_keys()
899 s->iop.replace_key = KEY(s->iop.inode, in cached_dev_cache_miss()
903 ret = bch_btree_insert_check_key(b, &s->op, &s->iop.replace_key); in cached_dev_cache_miss()
|
| D | movinggc.c | 107 bkey_copy(&op->replace_key, &io->w->key); in write_moving()
|
| D | btree.h | 278 atomic_t *journal_ref, struct bkey *replace_key);
|
| D | bset.c | 877 struct bkey *replace_key) in bch_btree_insert_key() argument
900 if (b->ops->insert_fixup(b, k, &iter, replace_key)) in bch_btree_insert_key()
|
| /linux-6.1.9/fs/reiserfs/ |
| D | do_balan.c | 95 replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); in balance_leaf_when_delete_del()
98 replace_key(tb, tb->CFL[0], tb->lkey[0], in balance_leaf_when_delete_del()
135 replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); in balance_leaf_when_delete_cut()
162 replace_key(tb, tb->CFL[0], in balance_leaf_when_delete_left()
183 replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); in balance_leaf_when_delete_left()
677 replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); in balance_leaf_insert_right()
700 replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); in balance_leaf_insert_right()
748 replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); in balance_leaf_paste_right_shift_dirent()
871 replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); in balance_leaf_paste_right_whole()
1272 replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); in balance_leaf_finish_node_insert()
[all …]
|
| D | ibalance.c | 515 replace_key(tb, cf, d_key_position, in internal_shift_left()
519 replace_key(tb, cf, d_key_position, src_bi.bi_bh, in internal_shift_left()
591 replace_key(tb, cf, d_key_position, tb->CFL[h], in internal_shift_right()
594 replace_key(tb, cf, d_key_position, src_bi.bi_bh, in internal_shift_right()
|
| D | lbalance.c | 769 replace_key(tb, tb->CFL[0], tb->lkey[0], in leaf_shift_left()
774 replace_key(tb, tb->CFL[0], tb->lkey[0], S0, 0); in leaf_shift_left()
807 replace_key(tb, tb->CFR[0], tb->rkey[0], tb->R[0], 0); in leaf_shift_right()
|
| D | reiserfs.h | 3254 void replace_key(struct tree_balance *tb, struct buffer_head *, int,
|