Home
last modified time | relevance | path

Searched refs:bkey (Results 1 – 23 of 23) sorted by relevance

/linux-5.19.10/drivers/md/bcache/
Dbset.h172 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 …]
Dbcache_ondisk.h23 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 …]
Dbset.c23 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 …]
Dbtree.h200 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);
378 struct bkey *from, btree_map_nodes_fn *fn, int flags);
381 struct bkey *from, btree_map_nodes_fn *fn) in bch_btree_map_nodes()
388 struct bkey *from, in bch_btree_map_leaf_nodes()
395 struct bkey *k);
397 struct bkey *from, btree_map_keys_fn *fn, int flags);
[all …]
Dextents.c47 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 …]
Dextents.h8 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);
Dbcache.h232 struct bkey last_scanned;
240 struct bkey start;
241 struct bkey end;
635 struct bkey gc_done;
744 struct bkey key;
810 const struct bkey *k, in PTR_BUCKET_NR()
817 const struct bkey *k, in PTR_BUCKET()
830 static inline uint8_t ptr_stale(struct cache_set *c, const struct bkey *k, in ptr_stale()
836 static inline bool ptr_available(struct cache_set *c, const struct bkey *k, in ptr_available()
974 struct bkey *k, unsigned int ptr);
[all …]
Dbtree.c128 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()
979 struct bkey *k, int level, bool write, in bch_btree_node_get()
1035 static void btree_node_prefetch(struct btree *parent, struct bkey *k) in btree_node_prefetch()
[all …]
Dalloc.c480 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()
Dwriteback.c610 static bool dirty_pred(struct keybuf *buf, struct bkey *k) in dirty_pred()
673 struct bkey start = KEY(dc->disk.id, 0, 0); in refill_dirty()
674 struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0); in refill_dirty()
675 struct bkey start_pos; in refill_dirty()
824 struct bkey *k) in sectors_dirty_init_fn()
844 struct bkey *k) in bch_root_node_dirty_init()
872 struct bkey *k, *p; in bch_dirty_init_thread()
940 struct bkey *k = NULL; in bch_sectors_dirty_init()
Drequest.c40 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()
971 struct bkey start = KEY(dc->disk.id, bio->bi_iter.bi_sector, 0); in cached_dev_write()
972 struct bkey end = KEY(dc->disk.id, bio_end_sector(bio), 0); in cached_dev_write()
Djournal.c295 struct bkey *k; in bch_journal_mark()
351 struct bkey *k; in bch_journal_replay()
650 struct bkey *k = &c->journal.key; in journal_reclaim()
753 struct bkey *k = &c->journal.key; in journal_write_unlocked()
Dio.c47 struct bkey *k, unsigned int ptr) in bch_submit_bbio()
Ddebug.c167 static bool dump_pred(struct keybuf *buf, struct bkey *k) in dump_pred()
Dmovinggc.c22 static bool moving_pred(struct keybuf *buf, struct bkey *k) in moving_pred()
Dsuper.c418 struct bkey *k, struct closure *parent) in uuid_io()
460 struct bkey *k = &j->uuid_bucket; in uuid_read()
1986 struct bkey *k; in run_cache_set()
Dsysfs.c661 struct bkey *k; in bch_root_usage()
/linux-5.19.10/include/trace/events/
Dbcache.h41 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),
322 DEFINE_EVENT(bkey, bcache_gc_copy,
323 TP_PROTO(struct bkey *k),
327 DEFINE_EVENT(bkey, bcache_gc_copy_collision,
328 TP_PROTO(struct bkey *k),
[all …]
/linux-5.19.10/lib/
Dbtree.c148 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-5.19.10/arch/s390/include/asm/
Dqdio.h42 u32 bkey : 4; member
/linux-5.19.10/drivers/s390/cio/
Dqdio_setup.c299 desc->bkey = PAGE_DEFAULT_KEY >> 4; in qdio_fill_qdr_desc()
/linux-5.19.10/drivers/net/ethernet/stmicro/stmmac/
Dstmmac_selftests.c1453 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()
/linux-5.19.10/fs/xfs/libxfs/
Dxfs_btree.c3483 union xfs_btree_key bkey; /* key of block to insert */ in xfs_btree_insert() local
3490 key = &bkey; in xfs_btree_insert()