| /linux-6.15/fs/bcachefs/ |
| H A D | keylist.h | 28 bkey_copy(l->top, k); in bch2_keylist_add()
|
| H A D | bkey_buf.h | 36 bkey_copy(s->k, src); in bch2_bkey_buf_copy()
|
| H A D | btree_write_buffer.h | 82 bkey_copy(&wb_k->k, k); in __bch2_journal_key_to_wb()
|
| H A D | btree_update_interior.c | 313 bkey_copy(&tmp.k, &a->k); in __bch2_btree_node_alloc()
350 bkey_copy(&b->key, &tmp.k); in __bch2_btree_node_alloc()
490 bkey_copy(&a->k, &b->key); in bch2_btree_reserve_put()
586 bkey_copy(keys->top, k); in btree_update_add_key()
2440 bkey_copy(&new_hash->key, new_key); in __bch2_btree_node_update_key()
2493 bkey_copy(&b->key, new_key); in __bch2_btree_node_update_key()
2498 bkey_copy(&b->key, new_key); in __bch2_btree_node_update_key()
2702 bkey_copy(&r->key, (struct bkey_i *) entry->start); in bch2_journal_entry_to_btree_root()
|
| H A D | btree_gc.c | 127 bkey_copy(&dst->k_i, &b->key); in btree_ptr_to_v2()
166 bkey_copy(&b->key, &new->k_i); in set_node_min()
210 bkey_copy(&b->key, &new->k_i); in set_node_max()
|
| H A D | btree_update.h | 164 bkey_copy(e->start, k); in bch2_trans_update_buffered()
|
| H A D | btree_write_buffer.c | 711 bkey_copy(&new.k, &k->k_i); in bch2_accounting_key_to_wb_slowpath()
753 bkey_copy(&wb_k->k, k); in bch2_journal_key_to_wb_slowpath()
|
| H A D | btree_update.c | 561 bkey_copy(n, k); in bch2_btree_insert_clone_trans()
858 bkey_copy(e->start, k); in bch2_trans_log_bkey()
|
| H A D | bkey.h | 43 static inline void bkey_copy(struct bkey_i *dst, const struct bkey_i *src) in bkey_copy() function
|
| H A D | btree_cache.c | 333 bkey_copy(&b->key, new); in bch2_btree_node_update_key_early()
956 bkey_copy(&b->key, k); in bch2_btree_node_fill()
|
| H A D | btree_key_cache.c | 575 bkey_copy(ck->k, insert); in bch2_btree_insert_key_cached()
|
| H A D | btree_journal_iter.c | 336 bkey_copy(n, k); in bch2_journal_key_insert()
|
| H A D | btree_io.c | 1794 bkey_copy(&b->key, k); in __bch2_btree_root_read()
2222 bkey_copy(&tmp.k, &wbio->key); in btree_write_submit()
2464 bkey_copy(&wbio->key, &b->key); in __bch2_btree_node_write()
|
| H A D | debug.c | 163 bkey_copy(&v->key, &b->key); in __bch2_btree_verify()
|
| H A D | recovery.c | 485 bkey_copy(&r->key, (struct bkey_i *) entry->start); in journal_replay_entry_early()
|
| /linux-6.15/drivers/md/bcache/ |
| H A D | extents.c | 304 bkey_copy(tmp, top->k); in bch_extent_sort_fixup()
435 bkey_copy(&temp.key, k); in bch_extent_insert_fixup()
|
| H A D | bset.c | 876 bkey_copy(where, insert); in bch_bset_insert()
934 copy: bkey_copy(m, k); in bch_btree_insert_key()
1246 bkey_copy(last, k); in btree_mergesort()
1249 bkey_copy(last, k); in btree_mergesort()
|
| H A D | debug.c | 47 bkey_copy(&v->key, &b->key); in bch_btree_verify()
|
| H A D | movinggc.c | 107 bkey_copy(&op->replace_key, &io->w->key); in CLOSURE_CALLBACK()
|
| H A D | bcache_ondisk.h | 109 #define bkey_copy(_dest, _src) unsafe_memcpy(_dest, _src, bkey_bytes(_src), \ macro
|
| H A D | bset.h | 520 bkey_copy(l->top, k); in bch_keylist_add()
|
| H A D | journal.c | 779 bkey_copy(&w->data->btree_root, &c->root->key);
780 bkey_copy(&w->data->uuid_bucket, &c->uuid_bucket);
|
| H A D | btree.c | 371 bkey_copy(&k.key, &b->key); in do_btree_node_write()
965 bkey_copy(&b->key, k); in mca_alloc()
1194 bkey_copy(k, &b->key); in make_btree_freeing_key()
2229 bkey_copy(&temp.key, insert_keys->keys); in bch_btree_insert_keys()
2682 bkey_copy(&w->key, k); in refill_keybuf_fn()
|
| H A D | alloc.c | 602 bkey_copy(&ret->key, alloc); in pick_data_bucket()
|
| H A D | writeback.c | 367 bkey_copy(keys.top, &w->key); in CLOSURE_CALLBACK()
|