/Linux-v4.19/drivers/md/bcache/ |
D | bset.h | 172 struct bkey end; 192 struct bkey *(*sort_fixup)(struct btree_iter *iter, 193 struct bkey *tmp); 195 struct bkey *insert, 197 struct bkey *replace_key); 199 const struct bkey *k); 201 const struct bkey *k); 203 struct bkey *l, struct bkey *r); 206 const struct bkey *k); 208 const struct bkey *k); [all …]
|
D | btree.h | 197 void bkey_put(struct cache_set *c, struct bkey *k); 250 struct bkey *k, int level, bool write, 254 struct bkey *check_key); 256 atomic_t *journal_ref, struct bkey *replace_key); 262 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k); 279 struct bkey *from, btree_map_nodes_fn *fn, int flags); 282 struct bkey *from, btree_map_nodes_fn *fn) in bch_btree_map_nodes() 289 struct bkey *from, in bch_btree_map_leaf_nodes() 296 struct bkey *k); 298 struct bkey *from, btree_map_keys_fn *fn, int flags); [all …]
|
D | bset.c | 23 struct bkey *k, *next; in bch_dump_bset() 58 struct bkey *k; in __bch_count_data() 69 struct bkey *k, *p = NULL; in __bch_check_keys() 113 struct bkey *k = iter->data->k, *next = bkey_next(k); in bch_btree_iter_next_check() 158 struct bkey *bch_keylist_pop(struct keylist *l) in bch_keylist_pop() 160 struct bkey *k = l->keys; in bch_keylist_pop() 182 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src, in bch_bkey_copy_single_ptr() 195 bool __bch_cut_front(const struct bkey *where, struct bkey *k) in __bch_cut_front() 215 bool __bch_cut_back(const struct bkey *where, struct bkey *k) in __bch_cut_back() 529 static struct bkey *cacheline_to_bkey(struct bset_tree *t, in cacheline_to_bkey() [all …]
|
D | extents.c | 47 static bool __ptr_invalid(struct cache_set *c, const struct bkey *k) in __ptr_invalid() 68 static const char *bch_ptr_status(struct cache_set *c, const struct bkey *k) in bch_ptr_status() 97 void bch_extent_to_text(char *buf, size_t size, const struct bkey *k) in bch_extent_to_text() 126 static void bch_bkey_dump(struct btree_keys *keys, const struct bkey *k) in bch_bkey_dump() 149 bool __bch_btree_ptr_invalid(struct cache_set *c, const struct bkey *k) in __bch_btree_ptr_invalid() 166 static bool bch_btree_ptr_invalid(struct btree_keys *bk, const struct bkey *k) in bch_btree_ptr_invalid() 173 static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k) in btree_ptr_bad_expensive() 205 static bool bch_btree_ptr_bad(struct btree_keys *bk, const struct bkey *k) in bch_btree_ptr_bad() 228 struct bkey *insert, in bch_btree_ptr_insert_fixup() 230 struct bkey *replace_key) in bch_btree_ptr_insert_fixup() [all …]
|
D | extents.h | 8 struct bkey; 11 void bch_extent_to_text(char *buf, size_t size, const struct bkey *k); 12 bool __bch_btree_ptr_invalid(struct cache_set *c, const struct bkey *k); 13 bool __bch_extent_invalid(struct cache_set *c, const struct bkey *k);
|
D | bcache.h | 232 struct bkey last_scanned; 240 struct bkey start; 241 struct bkey end; 627 struct bkey gc_done; 718 struct bkey key; 764 const struct bkey *k, in PTR_CACHE() 771 const struct bkey *k, in PTR_BUCKET_NR() 778 const struct bkey *k, in PTR_BUCKET() 791 static inline uint8_t ptr_stale(struct cache_set *c, const struct bkey *k, in ptr_stale() 797 static inline bool ptr_available(struct cache_set *c, const struct bkey *k, in ptr_available() [all …]
|
D | btree.c | 184 void bkey_put(struct cache_set *c, struct bkey *k) in bkey_put() 588 static unsigned int btree_order(struct bkey *k) in btree_order() 593 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp) in mca_data_alloc() 608 struct bkey *k, gfp_t gfp) in mca_bucket_alloc() 833 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k) in mca_hash() 838 static struct btree *mca_find(struct cache_set *c, struct bkey *k) in mca_find() 868 struct bkey *k) in mca_cannibalize() 904 struct bkey *k, int level) in mca_alloc() 984 struct bkey *k, int level, bool write, in bch_btree_node_get() 1041 static void btree_node_prefetch(struct btree *parent, struct bkey *k) in btree_node_prefetch() [all …]
|
D | alloc.c | 472 void bch_bucket_free(struct cache_set *c, struct bkey *k) in bch_bucket_free() 482 struct bkey *k, int n, bool wait) in __bch_bucket_alloc_set() 515 struct bkey *k, int n, bool wait) in bch_bucket_alloc_set() 560 const struct bkey *search, in pick_data_bucket() 562 struct bkey *alloc) in pick_data_bucket() 601 struct bkey *k, in bch_alloc_sectors()
|
D | writeback.c | 543 static bool dirty_pred(struct keybuf *buf, struct bkey *k) in dirty_pred() 606 struct bkey start = KEY(dc->disk.id, 0, 0); in refill_dirty() 607 struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0); in refill_dirty() 608 struct bkey start_pos; in refill_dirty() 725 struct bkey start; 729 struct bkey *k) in sectors_dirty_init_fn()
|
D | request.c | 40 static void bio_csum(struct bio *bio, struct bkey *k) in bio_csum() 62 struct bkey *replace_key = op->replace ? &op->replace_key : NULL; in bch_data_insert_keys() 164 struct bkey *src = op->insert_keys.keys, *dst = op->insert_keys.keys; in bch_data_insert_error() 167 struct bkey *n = bkey_next(src); in bch_data_insert_error() 218 struct bkey *k; in bch_data_insert_start() 515 static int cache_lookup_fn(struct btree_op *op, struct btree *b, struct bkey *k) in cache_lookup_fn() 519 struct bkey *bio_key; in cache_lookup_fn() 962 struct bkey start = KEY(dc->disk.id, bio->bi_iter.bi_sector, 0); in cached_dev_write() 963 struct bkey end = KEY(dc->disk.id, bio_end_sector(bio), 0); in cached_dev_write()
|
D | journal.c | 277 struct bkey *k; in bch_journal_mark() 323 struct bkey *k; in bch_journal_replay() 494 struct bkey *k = &c->journal.key; in journal_reclaim() 613 struct bkey *k = &c->journal.key; in journal_write_unlocked()
|
D | io.c | 46 struct bkey *k, unsigned int ptr) in bch_submit_bbio()
|
D | movinggc.c | 22 static bool moving_pred(struct keybuf *buf, struct bkey *k) in moving_pred()
|
D | debug.c | 166 static bool dump_pred(struct keybuf *buf, struct bkey *k) in dump_pred()
|
D | super.c | 336 struct bkey *k, struct closure *parent) in uuid_io() 378 struct bkey *k = &j->uuid_bucket; in uuid_read() 1792 struct bkey *k; in run_cache_set()
|
D | sysfs.c | 543 struct bkey *k; in bch_root_usage()
|
/Linux-v4.19/include/uapi/linux/ |
D | bcache.h | 23 struct bkey { struct 30 BITMASK(name, struct bkey, field, offset, size) argument 33 static inline __u64 name(const struct bkey *k, unsigned int i) \ 36 static inline void SET_##name(struct bkey *k, unsigned int i, __u64 v) \ 56 static inline __u64 KEY_OFFSET(const struct bkey *k) in KEY_OFFSET() 61 static inline void SET_KEY_OFFSET(struct bkey *k, __u64 v) in SET_KEY_OFFSET() 72 ((struct bkey) { \ 99 static inline unsigned long bkey_u64s(const struct bkey *k) in bkey_u64s() 101 return (sizeof(struct bkey) / sizeof(__u64)) + KEY_PTRS(k); in bkey_u64s() 104 static inline unsigned long bkey_bytes(const struct bkey *k) in bkey_bytes() [all …]
|
/Linux-v4.19/include/trace/events/ |
D | bcache.h | 41 DECLARE_EVENT_CLASS(bkey, 42 TP_PROTO(struct bkey *k), 187 DEFINE_EVENT(bkey, bcache_cache_insert, 188 TP_PROTO(struct bkey *k), 209 DEFINE_EVENT(bkey, bcache_journal_replay_key, 210 TP_PROTO(struct bkey *k), 300 DEFINE_EVENT(bkey, bcache_gc_copy, 301 TP_PROTO(struct bkey *k), 305 DEFINE_EVENT(bkey, bcache_gc_copy_collision, 306 TP_PROTO(struct bkey *k), [all …]
|
/Linux-v4.19/lib/ |
D | btree.c | 150 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() function 163 longcpy(bkey(geo, node, n), key, geo->keylen); in setkey() 174 longset(bkey(geo, node, n), 0, geo->keylen); in clearpair() 221 longcpy(key, bkey(geo, node, 0), geo->keylen); in btree_last() 229 return longcmp(bkey(geo, node, pos), key, geo->keylen); in keycmp() 340 retry_key = bkey(geo, oldnode, i); in btree_get_prev() 349 longcpy(__key, bkey(geo, node, i), geo->keylen); in btree_get_prev() 426 setkey(geo, node, 0, bkey(geo, head->node, fill - 1)); in btree_grow() 479 bkey(geo, node, fill / 2 - 1), in btree_insert_level() 486 setkey(geo, new, i, bkey(geo, node, i)); in btree_insert_level() [all …]
|
/Linux-v4.19/arch/s390/include/asm/ |
D | qdio.h | 42 u32 bkey : 4; member
|
/Linux-v4.19/drivers/s390/cio/ |
D | qdio_setup.c | 410 irq_ptr->qdr->qdf0[i + nr].bkey = PAGE_DEFAULT_KEY >> 4; in __qdio_allocate_fill_qdr()
|
/Linux-v4.19/fs/xfs/libxfs/ |
D | xfs_btree.c | 3444 union xfs_btree_key bkey; /* key of block to insert */ in xfs_btree_insert() local 3451 key = &bkey; in xfs_btree_insert()
|