| /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 | bcache_ondisk.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 …]
|
| 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()
159 struct bkey *bch_keylist_pop(struct keylist *l) in bch_keylist_pop()
161 struct bkey *k = l->keys; in bch_keylist_pop()
184 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src, in bch_bkey_copy_single_ptr()
197 bool __bch_cut_front(const struct bkey *where, struct bkey *k) in __bch_cut_front()
217 bool __bch_cut_back(const struct bkey *where, struct bkey *k) in __bch_cut_back()
525 static struct bkey *cacheline_to_bkey(struct bset_tree *t, in cacheline_to_bkey()
[all …]
|
| D | btree.h | 200 void bkey_put(struct cache_set *c, struct bkey *k);
272 struct bkey *k, int level, bool write,
276 struct bkey *check_key);
278 atomic_t *journal_ref, struct bkey *replace_key);
284 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k);
379 struct bkey *from, btree_map_nodes_fn *fn, int flags);
382 struct bkey *from, btree_map_nodes_fn *fn) in bch_btree_map_nodes()
389 struct bkey *from, in bch_btree_map_leaf_nodes()
396 struct bkey *k);
398 struct bkey *from, btree_map_keys_fn *fn, int flags);
[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;
633 struct bkey gc_done;
742 struct bkey key;
808 const struct bkey *k, in PTR_BUCKET_NR()
815 const struct bkey *k, in PTR_BUCKET()
828 static inline uint8_t ptr_stale(struct cache_set *c, const struct bkey *k, in ptr_stale()
834 static inline bool ptr_available(struct cache_set *c, const struct bkey *k, in ptr_available()
972 struct bkey *k, unsigned int ptr);
[all …]
|
| D | btree.c | 128 void bkey_put(struct cache_set *c, struct bkey *k) in bkey_put()
543 static unsigned int btree_order(struct bkey *k) in btree_order()
548 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp) in mca_data_alloc()
563 struct bkey *k, gfp_t gfp) in mca_bucket_alloc()
824 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k) in mca_hash()
829 static struct btree *mca_find(struct cache_set *c, struct bkey *k) in mca_find()
861 struct bkey *k) in mca_cannibalize()
899 struct bkey *k, int level) in mca_alloc()
982 struct bkey *k, int level, bool write, in bch_btree_node_get()
1038 static void btree_node_prefetch(struct btree *parent, struct bkey *k) in btree_node_prefetch()
[all …]
|
| D | alloc.c | 480 void bch_bucket_free(struct cache_set *c, struct bkey *k) in bch_bucket_free()
489 struct bkey *k, bool wait) in __bch_bucket_alloc_set()
521 struct bkey *k, bool wait) in bch_bucket_alloc_set()
566 const struct bkey *search, in pick_data_bucket()
568 struct bkey *alloc) in pick_data_bucket()
607 struct bkey *k, in bch_alloc_sectors()
|
| D | writeback.c | 630 static bool dirty_pred(struct keybuf *buf, struct bkey *k) in dirty_pred()
693 struct bkey start = KEY(dc->disk.id, 0, 0); in refill_dirty()
694 struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0); in refill_dirty()
695 struct bkey start_pos; in refill_dirty()
844 struct bkey *k) in sectors_dirty_init_fn()
864 struct bkey *k) in bch_root_node_dirty_init()
902 struct bkey *k, *p; in bch_dirty_init_thread()
971 struct bkey *k = NULL; in bch_sectors_dirty_init()
|
| 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()
152 struct bkey *src = op->insert_keys.keys, *dst = op->insert_keys.keys; in bch_data_insert_error()
155 struct bkey *n = bkey_next(src); in bch_data_insert_error()
206 struct bkey *k; in bch_data_insert_start()
513 static int cache_lookup_fn(struct btree_op *op, struct btree *b, struct bkey *k) in cache_lookup_fn()
517 struct bkey *bio_key; in cache_lookup_fn()
973 struct bkey start = KEY(dc->disk.id, bio->bi_iter.bi_sector, 0); in cached_dev_write()
974 struct bkey end = KEY(dc->disk.id, bio_end_sector(bio), 0); in cached_dev_write()
|
| D | journal.c | 297 struct bkey *k; in bch_journal_mark()
353 struct bkey *k; in bch_journal_replay()
654 struct bkey *k = &c->journal.key; in journal_reclaim()
757 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 | debug.c | 166 static bool dump_pred(struct keybuf *buf, struct bkey *k) in dump_pred()
|
| D | movinggc.c | 22 static bool moving_pred(struct keybuf *buf, struct bkey *k) in moving_pred()
|
| D | super.c | 421 struct bkey *k, struct closure *parent) in uuid_io()
463 struct bkey *k = &j->uuid_bucket; in uuid_read()
1992 struct bkey *k; in run_cache_set()
|
| D | sysfs.c | 659 struct bkey *k; in bch_root_usage()
|
| /drivers/s390/cio/ |
| D | qdio_setup.c | 312 desc->bkey = PAGE_DEFAULT_KEY >> 4; in qdio_fill_qdr_desc()
|
| /drivers/net/ethernet/stmicro/stmmac/ |
| D | stmmac_selftests.c | 1453 struct flow_dissector_key_basic bkey; in __stmmac_test_l4filt() member
1509 keys.bkey.ip_proto = udp ? IPPROTO_UDP : IPPROTO_TCP; in __stmmac_test_l4filt()
|