| /linux-4.4.14/drivers/md/bcache/ |
| D | bset.h | 171 struct bkey end;
191 struct bkey *(*sort_fixup)(struct btree_iter *, struct bkey *);
192 bool (*insert_fixup)(struct btree_keys *, struct bkey *,
193 struct btree_iter *, struct bkey *);
195 const struct bkey *);
196 bool (*key_bad)(struct btree_keys *, const struct bkey *);
198 struct bkey *, struct bkey *);
199 void (*key_to_text)(char *, size_t, const struct bkey *);
200 void (*key_dump)(struct btree_keys *, const struct bkey *);
236 static inline bool bkey_written(struct btree_keys *b, struct bkey *k) in bkey_written()
[all …]
|
| D | btree.h | 196 void bkey_put(struct cache_set *c, struct bkey *k);
248 struct bkey *, int, bool, struct btree *);
251 struct bkey *);
253 atomic_t *, struct bkey *);
259 void bch_initial_mark_key(struct cache_set *, int, struct bkey *);
277 struct bkey *, btree_map_nodes_fn *, int);
280 struct bkey *from, btree_map_nodes_fn *fn) in bch_btree_map_nodes()
287 struct bkey *from, in bch_btree_map_leaf_nodes()
294 struct bkey *);
296 struct bkey *, btree_map_keys_fn *, int);
[all …]
|
| D | bset.c | 21 struct bkey *k, *next; in bch_dump_bset()
56 struct bkey *k; in __bch_count_data()
67 struct bkey *k, *p = NULL; in __bch_check_keys()
111 struct bkey *k = iter->data->k, *next = bkey_next(k); in bch_btree_iter_next_check()
156 struct bkey *bch_keylist_pop(struct keylist *l) in bch_keylist_pop()
158 struct bkey *k = l->keys; in bch_keylist_pop()
180 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src, in bch_bkey_copy_single_ptr()
193 bool __bch_cut_front(const struct bkey *where, struct bkey *k) in __bch_cut_front()
213 bool __bch_cut_back(const struct bkey *where, struct bkey *k) in __bch_cut_back()
503 static struct bkey *cacheline_to_bkey(struct bset_tree *t, unsigned cacheline, in cacheline_to_bkey()
[all …]
|
| D | extents.c | 46 static bool __ptr_invalid(struct cache_set *c, const struct bkey *k) in __ptr_invalid()
67 static const char *bch_ptr_status(struct cache_set *c, const struct bkey *k) in bch_ptr_status()
96 void bch_extent_to_text(char *buf, size_t size, const struct bkey *k) in bch_extent_to_text()
125 static void bch_bkey_dump(struct btree_keys *keys, const struct bkey *k) in bch_bkey_dump()
148 bool __bch_btree_ptr_invalid(struct cache_set *c, const struct bkey *k) in __bch_btree_ptr_invalid()
165 static bool bch_btree_ptr_invalid(struct btree_keys *bk, const struct bkey *k) in bch_btree_ptr_invalid()
171 static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k) in btree_ptr_bad_expensive()
203 static bool bch_btree_ptr_bad(struct btree_keys *bk, const struct bkey *k) in bch_btree_ptr_bad()
226 struct bkey *insert, in bch_btree_ptr_insert_fixup()
228 struct bkey *replace_key) in bch_btree_ptr_insert_fixup()
[all …]
|
| D | extents.h | 7 struct bkey;
10 void bch_extent_to_text(char *, size_t, const struct bkey *);
11 bool __bch_btree_ptr_invalid(struct cache_set *, const struct bkey *);
12 bool __bch_extent_invalid(struct cache_set *, const struct bkey *);
|
| D | bcache.h | 229 struct bkey last_scanned;
237 struct bkey start;
238 struct bkey end;
586 struct bkey gc_done;
670 struct bkey key;
716 const struct bkey *k, in PTR_CACHE()
723 const struct bkey *k, in PTR_BUCKET_NR()
730 const struct bkey *k, in PTR_BUCKET()
742 static inline uint8_t ptr_stale(struct cache_set *c, const struct bkey *k, in ptr_stale()
748 static inline bool ptr_available(struct cache_set *c, const struct bkey *k, in ptr_available()
[all …]
|
| D | btree.c | 178 void bkey_put(struct cache_set *c, struct bkey *k) in bkey_put()
581 static unsigned btree_order(struct bkey *k) in btree_order()
586 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp) in mca_data_alloc()
601 struct bkey *k, gfp_t gfp) in mca_bucket_alloc()
818 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k) in mca_hash()
823 static struct btree *mca_find(struct cache_set *c, struct bkey *k) in mca_find()
853 struct bkey *k) in mca_cannibalize()
889 struct bkey *k, int level) in mca_alloc()
969 struct bkey *k, int level, bool write, in bch_btree_node_get()
1026 static void btree_node_prefetch(struct btree *parent, struct bkey *k) in btree_node_prefetch()
[all …]
|
| D | alloc.c | 453 void bch_bucket_free(struct cache_set *c, struct bkey *k) in bch_bucket_free()
463 struct bkey *k, int n, bool wait) in __bch_bucket_alloc_set()
496 struct bkey *k, int n, bool wait) in bch_bucket_alloc_set()
534 const struct bkey *search, in pick_data_bucket()
536 struct bkey *alloc) in pick_data_bucket()
571 bool bch_alloc_sectors(struct cache_set *c, struct bkey *k, unsigned sectors, in bch_alloc_sectors()
|
| D | writeback.c | 324 static bool dirty_pred(struct keybuf *buf, struct bkey *k) in dirty_pred()
385 struct bkey start = KEY(dc->disk.id, 0, 0); in refill_dirty()
386 struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0); in refill_dirty()
387 struct bkey start_pos; in refill_dirty()
477 struct bkey *k) in sectors_dirty_init_fn()
|
| D | request.c | 39 static void bio_csum(struct bio *bio, struct bkey *k) in bio_csum()
60 struct bkey *replace_key = op->replace ? &op->replace_key : NULL; in bch_data_insert_keys()
159 struct bkey *src = op->insert_keys.keys, *dst = op->insert_keys.keys; in bch_data_insert_error()
162 struct bkey *n = bkey_next(src); in bch_data_insert_error()
215 struct bkey *k; in bch_data_insert_start()
508 static int cache_lookup_fn(struct btree_op *op, struct btree *b, struct bkey *k) in cache_lookup_fn()
512 struct bkey *bio_key; in cache_lookup_fn()
880 struct bkey start = KEY(dc->disk.id, bio->bi_iter.bi_sector, 0); in cached_dev_write()
881 struct bkey end = KEY(dc->disk.id, bio_end_sector(bio), 0); in cached_dev_write()
|
| D | journal.c | 269 struct bkey *k; in bch_journal_mark()
315 struct bkey *k; in bch_journal_replay()
469 struct bkey *k = &c->journal.key; in journal_reclaim()
585 struct bkey *k = &c->journal.key; in journal_write_unlocked()
|
| D | io.c | 47 struct bkey *k, unsigned ptr) in bch_submit_bbio()
|
| D | debug.c | 156 static bool dump_pred(struct keybuf *buf, struct bkey *k) in dump_pred()
|
| D | movinggc.c | 21 static bool moving_pred(struct keybuf *buf, struct bkey *k) in moving_pred()
|
| D | super.c | 337 struct bkey *k, struct closure *parent) in uuid_io()
378 struct bkey *k = &j->uuid_bucket; in uuid_read()
1553 struct bkey *k; in run_cache_set()
|
| D | sysfs.c | 447 struct bkey *k; in bch_root_usage()
|
| /linux-4.4.14/include/uapi/linux/ |
| D | bcache.h | 22 struct bkey { struct
29 BITMASK(name, struct bkey, field, offset, size) argument
32 static inline __u64 name(const struct bkey *k, unsigned i) \
35 static inline void SET_##name(struct bkey *k, unsigned i, __u64 v) \
55 static inline __u64 KEY_OFFSET(const struct bkey *k) in KEY_OFFSET()
60 static inline void SET_KEY_OFFSET(struct bkey *k, __u64 v) in SET_KEY_OFFSET()
71 ((struct bkey) { \
98 static inline unsigned long bkey_u64s(const struct bkey *k) in bkey_u64s()
100 return (sizeof(struct bkey) / sizeof(__u64)) + KEY_PTRS(k); in bkey_u64s()
103 static inline unsigned long bkey_bytes(const struct bkey *k) in bkey_bytes()
[all …]
|
| /linux-4.4.14/include/trace/events/ |
| D | bcache.h | 40 DECLARE_EVENT_CLASS(bkey,
41 TP_PROTO(struct bkey *k),
186 DEFINE_EVENT(bkey, bcache_cache_insert,
187 TP_PROTO(struct bkey *k),
208 DEFINE_EVENT(bkey, bcache_journal_replay_key,
209 TP_PROTO(struct bkey *k),
299 DEFINE_EVENT(bkey, bcache_gc_copy,
300 TP_PROTO(struct bkey *k),
304 DEFINE_EVENT(bkey, bcache_gc_copy_collision,
305 TP_PROTO(struct bkey *k),
[all …]
|
| /linux-4.4.14/lib/ |
| D | btree.c | 148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() function
161 longcpy(bkey(geo, node, n), key, geo->keylen); in setkey()
172 longset(bkey(geo, node, n), 0, geo->keylen); in clearpair()
219 longcpy(key, bkey(geo, node, 0), geo->keylen); in btree_last()
227 return longcmp(bkey(geo, node, pos), key, geo->keylen); in keycmp()
338 retry_key = bkey(geo, oldnode, i); in btree_get_prev()
347 longcpy(__key, bkey(geo, node, i), geo->keylen); in btree_get_prev()
424 setkey(geo, node, 0, bkey(geo, head->node, fill - 1)); in btree_grow()
477 bkey(geo, node, fill / 2 - 1), in btree_insert_level()
484 setkey(geo, new, i, bkey(geo, node, i)); in btree_insert_level()
[all …]
|
| /linux-4.4.14/arch/s390/include/asm/ |
| D | qdio.h | 41 u32 bkey : 4; member
|
| /linux-4.4.14/drivers/s390/cio/ |
| D | qdio_setup.c | 410 irq_ptr->qdr->qdf0[i + nr].bkey = PAGE_DEFAULT_KEY >> 4; in __qdio_allocate_fill_qdr()
|