bkey 43 arch/s390/include/asm/qdio.h u32 bkey : 4; bkey 481 drivers/md/bcache/alloc.c void bch_bucket_free(struct cache_set *c, struct bkey *k) bkey 491 drivers/md/bcache/alloc.c struct bkey *k, int n, bool wait) bkey 528 drivers/md/bcache/alloc.c struct bkey *k, int n, bool wait) bkey 573 drivers/md/bcache/alloc.c const struct bkey *search, bkey 575 drivers/md/bcache/alloc.c struct bkey *alloc) bkey 614 drivers/md/bcache/alloc.c struct bkey *k, bkey 232 drivers/md/bcache/bcache.h struct bkey last_scanned; bkey 240 drivers/md/bcache/bcache.h struct bkey start; bkey 241 drivers/md/bcache/bcache.h struct bkey end; bkey 630 drivers/md/bcache/bcache.h struct bkey gc_done; bkey 737 drivers/md/bcache/bcache.h struct bkey key; bkey 783 drivers/md/bcache/bcache.h const struct bkey *k, bkey 790 drivers/md/bcache/bcache.h const struct bkey *k, bkey 797 drivers/md/bcache/bcache.h const struct bkey *k, bkey 810 drivers/md/bcache/bcache.h static inline uint8_t ptr_stale(struct cache_set *c, const struct bkey *k, bkey 816 drivers/md/bcache/bcache.h static inline bool ptr_available(struct cache_set *c, const struct bkey *k, bkey 959 drivers/md/bcache/bcache.h struct bkey *k, unsigned int ptr); bkey 968 drivers/md/bcache/bcache.h void bch_bucket_free(struct cache_set *c, struct bkey *k); bkey 972 drivers/md/bcache/bcache.h struct bkey *k, int n, bool wait); bkey 974 drivers/md/bcache/bcache.h struct bkey *k, int n, bool wait); bkey 975 drivers/md/bcache/bcache.h bool bch_alloc_sectors(struct cache_set *c, struct bkey *k, bkey 23 drivers/md/bcache/bset.c struct bkey *k, *next; bkey 58 drivers/md/bcache/bset.c struct bkey *k; bkey 69 drivers/md/bcache/bset.c struct bkey *k, *p = NULL; bkey 113 drivers/md/bcache/bset.c struct bkey *k = iter->data->k, *next = bkey_next(k); bkey 158 drivers/md/bcache/bset.c struct bkey *bch_keylist_pop(struct keylist *l) bkey 160 drivers/md/bcache/bset.c struct bkey *k = l->keys; bkey 182 drivers/md/bcache/bset.c void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src, bkey 195 drivers/md/bcache/bset.c bool __bch_cut_front(const struct bkey *where, struct bkey *k) bkey 215 drivers/md/bcache/bset.c bool __bch_cut_back(const struct bkey *where, struct bkey *k) bkey 526 drivers/md/bcache/bset.c static struct bkey *cacheline_to_bkey(struct bset_tree *t, bkey 533 drivers/md/bcache/bset.c static unsigned int bkey_to_cacheline(struct bset_tree *t, struct bkey *k) bkey 540 drivers/md/bcache/bset.c struct bkey *k) bkey 545 drivers/md/bcache/bset.c static struct bkey *tree_to_bkey(struct bset_tree *t, unsigned int j) bkey 550 drivers/md/bcache/bset.c static struct bkey *tree_to_prev_bkey(struct bset_tree *t, unsigned int j) bkey 559 drivers/md/bcache/bset.c static struct bkey *table_to_bkey(struct bset_tree *t, unsigned int cacheline) bkey 585 drivers/md/bcache/bset.c static inline unsigned int bfloat_mantissa(const struct bkey *k, bkey 596 drivers/md/bcache/bset.c struct bkey *m = tree_to_bkey(t, j); bkey 597 drivers/md/bcache/bset.c struct bkey *p = tree_to_prev_bkey(t, j); bkey 599 drivers/md/bcache/bset.c struct bkey *l = is_power_of_2(j) bkey 603 drivers/md/bcache/bset.c struct bkey *r = is_power_of_2(j + 1) bkey 695 drivers/md/bcache/bset.c struct bkey *prev = NULL, *k = t->data->start; bkey 739 drivers/md/bcache/bset.c void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k) bkey 787 drivers/md/bcache/bset.c struct bkey *k) bkey 842 drivers/md/bcache/bset.c bool bch_bkey_try_merge(struct btree_keys *b, struct bkey *l, struct bkey *r) bkey 860 drivers/md/bcache/bset.c void bch_bset_insert(struct btree_keys *b, struct bkey *where, bkey 861 drivers/md/bcache/bset.c struct bkey *insert) bkey 880 drivers/md/bcache/bset.c unsigned int bch_btree_insert_key(struct btree_keys *b, struct bkey *k, bkey 881 drivers/md/bcache/bset.c struct bkey *replace_key) bkey 885 drivers/md/bcache/bset.c struct bkey *m, *prev = NULL; bkey 887 drivers/md/bcache/bset.c struct bkey preceding_key_on_stack = ZERO_KEY; bkey 888 drivers/md/bcache/bset.c struct bkey *preceding_key_p = &preceding_key_on_stack; bkey 939 drivers/md/bcache/bset.c struct bkey *l, *r; bkey 943 drivers/md/bcache/bset.c const struct bkey *search) bkey 963 drivers/md/bcache/bset.c const struct bkey *search) bkey 965 drivers/md/bcache/bset.c struct bkey *l, *r; bkey 1018 drivers/md/bcache/bset.c struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t, bkey 1019 drivers/md/bcache/bset.c const struct bkey *search) bkey 1098 drivers/md/bcache/bset.c void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k, bkey 1099 drivers/md/bcache/bset.c struct bkey *end) bkey 1107 drivers/md/bcache/bset.c static struct bkey *__bch_btree_iter_init(struct btree_keys *b, bkey 1109 drivers/md/bcache/bset.c struct bkey *search, bkey 1112 drivers/md/bcache/bset.c struct bkey *ret = NULL; bkey 1129 drivers/md/bcache/bset.c struct bkey *bch_btree_iter_init(struct btree_keys *b, bkey 1131 drivers/md/bcache/bset.c struct bkey *search) bkey 1137 drivers/md/bcache/bset.c static inline struct bkey *__bch_btree_iter_next(struct btree_iter *iter, bkey 1141 drivers/md/bcache/bset.c struct bkey *ret = NULL; bkey 1163 drivers/md/bcache/bset.c struct bkey *bch_btree_iter_next(struct btree_iter *iter) bkey 1170 drivers/md/bcache/bset.c struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter, bkey 1173 drivers/md/bcache/bset.c struct bkey *ret; bkey 1206 drivers/md/bcache/bset.c struct bkey *k, *last = NULL; bkey 1208 drivers/md/bcache/bset.c bool (*bad)(struct btree_keys *, const struct bkey *) = remove_stale bkey 172 drivers/md/bcache/bset.h struct bkey end; bkey 192 drivers/md/bcache/bset.h struct bkey *(*sort_fixup)(struct btree_iter *iter, bkey 193 drivers/md/bcache/bset.h struct bkey *tmp); bkey 195 drivers/md/bcache/bset.h struct bkey *insert, bkey 197 drivers/md/bcache/bset.h struct bkey *replace_key); bkey 199 drivers/md/bcache/bset.h const struct bkey *k); bkey 201 drivers/md/bcache/bset.h const struct bkey *k); bkey 203 drivers/md/bcache/bset.h struct bkey *l, struct bkey *r); bkey 206 drivers/md/bcache/bset.h const struct bkey *k); bkey 208 drivers/md/bcache/bset.h const struct bkey *k); bkey 244 drivers/md/bcache/bset.h static inline bool bkey_written(struct btree_keys *b, struct bkey *k) bkey 300 drivers/md/bcache/bset.h void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k); bkey 301 drivers/md/bcache/bset.h bool bch_bkey_try_merge(struct btree_keys *b, struct bkey *l, struct bkey *r); bkey 302 drivers/md/bcache/bset.h void bch_bset_insert(struct btree_keys *b, struct bkey *where, bkey 303 drivers/md/bcache/bset.h struct bkey *insert); bkey 304 drivers/md/bcache/bset.h unsigned int bch_btree_insert_key(struct btree_keys *b, struct bkey *k, bkey 305 drivers/md/bcache/bset.h struct bkey *replace_key); bkey 323 drivers/md/bcache/bset.h struct bkey *k, *end; bkey 327 drivers/md/bcache/bset.h typedef bool (*ptr_filter_fn)(struct btree_keys *b, const struct bkey *k); bkey 329 drivers/md/bcache/bset.h struct bkey *bch_btree_iter_next(struct btree_iter *iter); bkey 330 drivers/md/bcache/bset.h struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter, bkey 334 drivers/md/bcache/bset.h void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k, bkey 335 drivers/md/bcache/bset.h struct bkey *end); bkey 336 drivers/md/bcache/bset.h struct bkey *bch_btree_iter_init(struct btree_keys *b, bkey 338 drivers/md/bcache/bset.h struct bkey *search); bkey 340 drivers/md/bcache/bset.h struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t, bkey 341 drivers/md/bcache/bset.h const struct bkey *search); bkey 346 drivers/md/bcache/bset.h static inline struct bkey *bch_bset_search(struct btree_keys *b, bkey 348 drivers/md/bcache/bset.h const struct bkey *search) bkey 400 drivers/md/bcache/bset.h #define bset_bkey_last(i) bkey_idx((struct bkey *) (i)->d, \ bkey 403 drivers/md/bcache/bset.h static inline struct bkey *bset_bkey_idx(struct bset *i, unsigned int idx) bkey 408 drivers/md/bcache/bset.h static inline void bkey_init(struct bkey *k) bkey 413 drivers/md/bcache/bset.h static __always_inline int64_t bkey_cmp(const struct bkey *l, bkey 414 drivers/md/bcache/bset.h const struct bkey *r) bkey 421 drivers/md/bcache/bset.h void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src, bkey 423 drivers/md/bcache/bset.h bool __bch_cut_front(const struct bkey *where, struct bkey *k); bkey 424 drivers/md/bcache/bset.h bool __bch_cut_back(const struct bkey *where, struct bkey *k); bkey 426 drivers/md/bcache/bset.h static inline bool bch_cut_front(const struct bkey *where, struct bkey *k) bkey 432 drivers/md/bcache/bset.h static inline bool bch_cut_back(const struct bkey *where, struct bkey *k) bkey 447 drivers/md/bcache/bset.h static inline void preceding_key(struct bkey *k, struct bkey **preceding_key_p) bkey 459 drivers/md/bcache/bset.h static inline bool bch_ptr_invalid(struct btree_keys *b, const struct bkey *k) bkey 464 drivers/md/bcache/bset.h static inline bool bch_ptr_bad(struct btree_keys *b, const struct bkey *k) bkey 470 drivers/md/bcache/bset.h size_t size, const struct bkey *k) bkey 475 drivers/md/bcache/bset.h static inline bool bch_bkey_equal_header(const struct bkey *l, bkey 476 drivers/md/bcache/bset.h const struct bkey *r) bkey 487 drivers/md/bcache/bset.h struct bkey *keys; bkey 491 drivers/md/bcache/bset.h struct bkey *top; bkey 505 drivers/md/bcache/bset.h static inline void bch_keylist_init_single(struct keylist *l, struct bkey *k) bkey 516 drivers/md/bcache/bset.h static inline void bch_keylist_add(struct keylist *l, struct bkey *k) bkey 548 drivers/md/bcache/bset.h struct bkey *bch_keylist_pop(struct keylist *l); bkey 184 drivers/md/bcache/btree.c void bkey_put(struct cache_set *c, struct bkey *k) bkey 594 drivers/md/bcache/btree.c static unsigned int btree_order(struct bkey *k) bkey 599 drivers/md/bcache/btree.c static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp) bkey 614 drivers/md/bcache/btree.c struct bkey *k, gfp_t gfp) bkey 868 drivers/md/bcache/btree.c static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k) bkey 873 drivers/md/bcache/btree.c static struct btree *mca_find(struct cache_set *c, struct bkey *k) bkey 903 drivers/md/bcache/btree.c struct bkey *k) bkey 939 drivers/md/bcache/btree.c struct bkey *k, int level) bkey 1019 drivers/md/bcache/btree.c struct bkey *k, int level, bool write, bkey 1076 drivers/md/bcache/btree.c static void btree_node_prefetch(struct btree *parent, struct bkey *k) bkey 1193 drivers/md/bcache/btree.c static void make_btree_freeing_key(struct btree *b, struct bkey *k) bkey 1237 drivers/md/bcache/btree.c struct bkey *k) bkey 1290 drivers/md/bcache/btree.c void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k) bkey 1319 drivers/md/bcache/btree.c struct bkey *k; bkey 1367 drivers/md/bcache/btree.c struct bkey *replace_key); bkey 1376 drivers/md/bcache/btree.c struct bkey *k; bkey 1417 drivers/md/bcache/btree.c struct bkey *k, *last = NULL; bkey 1574 drivers/md/bcache/btree.c struct bkey *k; bkey 1615 drivers/md/bcache/btree.c struct bkey *k; bkey 1920 drivers/md/bcache/btree.c struct bkey *k, *p = NULL; bkey 2003 drivers/md/bcache/btree.c static bool btree_insert_key(struct btree *b, struct bkey *k, bkey 2004 drivers/md/bcache/btree.c struct bkey *replace_key) bkey 2037 drivers/md/bcache/btree.c struct bkey *replace_key) bkey 2043 drivers/md/bcache/btree.c struct bkey *k = insert_keys->keys; bkey 2079 drivers/md/bcache/btree.c struct bkey *replace_key) bkey 2214 drivers/md/bcache/btree.c struct bkey *replace_key) bkey 2268 drivers/md/bcache/btree.c struct bkey *check_key) bkey 2309 drivers/md/bcache/btree.c struct bkey *replace_key; bkey 2326 drivers/md/bcache/btree.c atomic_t *journal_ref, struct bkey *replace_key) bkey 2347 drivers/md/bcache/btree.c struct bkey *k; bkey 2386 drivers/md/bcache/btree.c struct bkey *from, bkey 2392 drivers/md/bcache/btree.c struct bkey *k; bkey 2415 drivers/md/bcache/btree.c struct bkey *from, btree_map_nodes_fn *fn, int flags) bkey 2421 drivers/md/bcache/btree.c struct bkey *from, btree_map_keys_fn *fn, bkey 2425 drivers/md/bcache/btree.c struct bkey *k; bkey 2448 drivers/md/bcache/btree.c struct bkey *from, btree_map_keys_fn *fn, int flags) bkey 2475 drivers/md/bcache/btree.c struct bkey *end; bkey 2480 drivers/md/bcache/btree.c struct bkey *k) bkey 2524 drivers/md/bcache/btree.c struct bkey *end, keybuf_pred_fn *pred) bkey 2526 drivers/md/bcache/btree.c struct bkey start = buf->last_scanned; bkey 2576 drivers/md/bcache/btree.c bool bch_keybuf_check_overlapping(struct keybuf *buf, struct bkey *start, bkey 2577 drivers/md/bcache/btree.c struct bkey *end) bkey 2625 drivers/md/bcache/btree.c struct bkey *end, bkey 199 drivers/md/bcache/btree.h void bkey_put(struct cache_set *c, struct bkey *k); bkey 252 drivers/md/bcache/btree.h struct bkey *k, int level, bool write, bkey 256 drivers/md/bcache/btree.h struct bkey *check_key); bkey 258 drivers/md/bcache/btree.h atomic_t *journal_ref, struct bkey *replace_key); bkey 264 drivers/md/bcache/btree.h void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k); bkey 299 drivers/md/bcache/btree.h struct bkey *from, btree_map_nodes_fn *fn, int flags); bkey 302 drivers/md/bcache/btree.h struct bkey *from, btree_map_nodes_fn *fn) bkey 309 drivers/md/bcache/btree.h struct bkey *from, bkey 316 drivers/md/bcache/btree.h struct bkey *k); bkey 318 drivers/md/bcache/btree.h struct bkey *from, btree_map_keys_fn *fn, int flags); bkey 320 drivers/md/bcache/btree.h typedef bool (keybuf_pred_fn)(struct keybuf *buf, struct bkey *k); bkey 324 drivers/md/bcache/btree.h struct bkey *end, keybuf_pred_fn *pred); bkey 325 drivers/md/bcache/btree.h bool bch_keybuf_check_overlapping(struct keybuf *buf, struct bkey *start, bkey 326 drivers/md/bcache/btree.h struct bkey *end); bkey 331 drivers/md/bcache/btree.h struct bkey *end, bkey 166 drivers/md/bcache/debug.c static bool dump_pred(struct keybuf *buf, struct bkey *k) bkey 47 drivers/md/bcache/extents.c static bool __ptr_invalid(struct cache_set *c, const struct bkey *k) bkey 68 drivers/md/bcache/extents.c static const char *bch_ptr_status(struct cache_set *c, const struct bkey *k) bkey 97 drivers/md/bcache/extents.c void bch_extent_to_text(char *buf, size_t size, const struct bkey *k) bkey 126 drivers/md/bcache/extents.c static void bch_bkey_dump(struct btree_keys *keys, const struct bkey *k) bkey 149 drivers/md/bcache/extents.c bool __bch_btree_ptr_invalid(struct cache_set *c, const struct bkey *k) bkey 166 drivers/md/bcache/extents.c static bool bch_btree_ptr_invalid(struct btree_keys *bk, const struct bkey *k) bkey 173 drivers/md/bcache/extents.c static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k) bkey 205 drivers/md/bcache/extents.c static bool bch_btree_ptr_bad(struct btree_keys *bk, const struct bkey *k) bkey 228 drivers/md/bcache/extents.c struct bkey *insert, bkey 230 drivers/md/bcache/extents.c struct bkey *replace_key) bkey 266 drivers/md/bcache/extents.c static struct bkey *bch_extent_sort_fixup(struct btree_iter *iter, bkey 267 drivers/md/bcache/extents.c struct bkey *tmp) bkey 313 drivers/md/bcache/extents.c static void bch_subtract_dirty(struct bkey *k, bkey 324 drivers/md/bcache/extents.c struct bkey *insert, bkey 326 drivers/md/bcache/extents.c struct bkey *replace_key) bkey 337 drivers/md/bcache/extents.c struct bkey *k = bch_btree_iter_next(iter); bkey 405 drivers/md/bcache/extents.c struct bkey *top; bkey 480 drivers/md/bcache/extents.c bool __bch_extent_invalid(struct cache_set *c, const struct bkey *k) bkey 500 drivers/md/bcache/extents.c static bool bch_extent_invalid(struct btree_keys *bk, const struct bkey *k) bkey 507 drivers/md/bcache/extents.c static bool bch_extent_bad_expensive(struct btree *b, const struct bkey *k, bkey 537 drivers/md/bcache/extents.c static bool bch_extent_bad(struct btree_keys *bk, const struct bkey *k) bkey 575 drivers/md/bcache/extents.c static uint64_t merge_chksums(struct bkey *l, struct bkey *r) bkey 582 drivers/md/bcache/extents.c struct bkey *l, bkey 583 drivers/md/bcache/extents.c struct bkey *r) bkey 8 drivers/md/bcache/extents.h struct bkey; bkey 11 drivers/md/bcache/extents.h void bch_extent_to_text(char *buf, size_t size, const struct bkey *k); bkey 12 drivers/md/bcache/extents.h bool __bch_btree_ptr_invalid(struct cache_set *c, const struct bkey *k); bkey 13 drivers/md/bcache/extents.h bool __bch_extent_invalid(struct cache_set *c, const struct bkey *k); bkey 46 drivers/md/bcache/io.c struct bkey *k, unsigned int ptr) bkey 303 drivers/md/bcache/journal.c struct bkey *k; bkey 361 drivers/md/bcache/journal.c struct bkey *k; bkey 641 drivers/md/bcache/journal.c struct bkey *k = &c->journal.key; bkey 761 drivers/md/bcache/journal.c struct bkey *k = &c->journal.key; bkey 22 drivers/md/bcache/movinggc.c static bool moving_pred(struct keybuf *buf, struct bkey *k) bkey 40 drivers/md/bcache/request.c static void bio_csum(struct bio *bio, struct bkey *k) bkey 62 drivers/md/bcache/request.c struct bkey *replace_key = op->replace ? &op->replace_key : NULL; bkey 164 drivers/md/bcache/request.c struct bkey *src = op->insert_keys.keys, *dst = op->insert_keys.keys; bkey 167 drivers/md/bcache/request.c struct bkey *n = bkey_next(src); bkey 218 drivers/md/bcache/request.c struct bkey *k; bkey 524 drivers/md/bcache/request.c static int cache_lookup_fn(struct btree_op *op, struct btree *b, struct bkey *k) bkey 528 drivers/md/bcache/request.c struct bkey *bio_key; bkey 987 drivers/md/bcache/request.c struct bkey start = KEY(dc->disk.id, bio->bi_iter.bi_sector, 0); bkey 988 drivers/md/bcache/request.c struct bkey end = KEY(dc->disk.id, bio_end_sector(bio), 0); bkey 340 drivers/md/bcache/super.c struct bkey *k, struct closure *parent) bkey 382 drivers/md/bcache/super.c struct bkey *k = &j->uuid_bucket; bkey 1863 drivers/md/bcache/super.c struct bkey *k; bkey 635 drivers/md/bcache/sysfs.c struct bkey *k; bkey 556 drivers/md/bcache/writeback.c static bool dirty_pred(struct keybuf *buf, struct bkey *k) bkey 619 drivers/md/bcache/writeback.c struct bkey start = KEY(dc->disk.id, 0, 0); bkey 620 drivers/md/bcache/writeback.c struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0); bkey 621 drivers/md/bcache/writeback.c struct bkey start_pos; bkey 759 drivers/md/bcache/writeback.c struct bkey start; bkey 763 drivers/md/bcache/writeback.c struct bkey *k) bkey 1414 drivers/net/ethernet/stmicro/stmmac/stmmac_selftests.c struct flow_dissector_key_basic bkey; bkey 1470 drivers/net/ethernet/stmicro/stmmac/stmmac_selftests.c keys.bkey.ip_proto = udp ? IPPROTO_UDP : IPPROTO_TCP; bkey 411 drivers/s390/cio/qdio_setup.c irq_ptr->qdr->qdf0[i + nr].bkey = PAGE_DEFAULT_KEY >> 4; bkey 3433 fs/xfs/libxfs/xfs_btree.c union xfs_btree_key bkey; /* key of block to insert */ bkey 3440 fs/xfs/libxfs/xfs_btree.c key = &bkey; bkey 41 include/trace/events/bcache.h DECLARE_EVENT_CLASS(bkey, bkey 42 include/trace/events/bcache.h TP_PROTO(struct bkey *k), bkey 187 include/trace/events/bcache.h DEFINE_EVENT(bkey, bcache_cache_insert, bkey 188 include/trace/events/bcache.h TP_PROTO(struct bkey *k), bkey 209 include/trace/events/bcache.h DEFINE_EVENT(bkey, bcache_journal_replay_key, bkey 210 include/trace/events/bcache.h TP_PROTO(struct bkey *k), bkey 321 include/trace/events/bcache.h DEFINE_EVENT(bkey, bcache_gc_copy, bkey 322 include/trace/events/bcache.h TP_PROTO(struct bkey *k), bkey 326 include/trace/events/bcache.h DEFINE_EVENT(bkey, bcache_gc_copy_collision, bkey 327 include/trace/events/bcache.h TP_PROTO(struct bkey *k), bkey 332 include/trace/events/bcache.h TP_PROTO(struct btree *b, struct bkey *k, unsigned op, unsigned status), bkey 491 include/trace/events/bcache.h DEFINE_EVENT(bkey, bcache_writeback, bkey 492 include/trace/events/bcache.h TP_PROTO(struct bkey *k), bkey 496 include/trace/events/bcache.h DEFINE_EVENT(bkey, bcache_writeback_collision, bkey 497 include/trace/events/bcache.h TP_PROTO(struct bkey *k), bkey 30 include/uapi/linux/bcache.h BITMASK(name, struct bkey, field, offset, size) bkey 33 include/uapi/linux/bcache.h static inline __u64 name(const struct bkey *k, unsigned int i) \ bkey 36 include/uapi/linux/bcache.h static inline void SET_##name(struct bkey *k, unsigned int i, __u64 v) \ bkey 56 include/uapi/linux/bcache.h static inline __u64 KEY_OFFSET(const struct bkey *k) bkey 61 include/uapi/linux/bcache.h static inline void SET_KEY_OFFSET(struct bkey *k, __u64 v) bkey 72 include/uapi/linux/bcache.h ((struct bkey) { \ bkey 99 include/uapi/linux/bcache.h static inline unsigned long bkey_u64s(const struct bkey *k) bkey 101 include/uapi/linux/bcache.h return (sizeof(struct bkey) / sizeof(__u64)) + KEY_PTRS(k); bkey 104 include/uapi/linux/bcache.h static inline unsigned long bkey_bytes(const struct bkey *k) bkey 111 include/uapi/linux/bcache.h static inline void bkey_copy_key(struct bkey *dest, const struct bkey *src) bkey 117 include/uapi/linux/bcache.h static inline struct bkey *bkey_next(const struct bkey *k) bkey 121 include/uapi/linux/bcache.h return (struct bkey *) (d + bkey_u64s(k)); bkey 124 include/uapi/linux/bcache.h static inline struct bkey *bkey_idx(const struct bkey *k, unsigned int nr_keys) bkey 128 include/uapi/linux/bcache.h return (struct bkey *) (d + nr_keys); bkey 134 include/uapi/linux/bcache.h union { struct bkey key; __u64 key ## _pad[BKEY_PAD]; } bkey 294 include/uapi/linux/bcache.h struct bkey start[0]; bkey 359 include/uapi/linux/bcache.h struct bkey start[0]; bkey 161 lib/btree.c longcpy(bkey(geo, node, n), key, geo->keylen); bkey 172 lib/btree.c longset(bkey(geo, node, n), 0, geo->keylen); bkey 219 lib/btree.c longcpy(key, bkey(geo, node, 0), geo->keylen); bkey 227 lib/btree.c return longcmp(bkey(geo, node, pos), key, geo->keylen); bkey 338 lib/btree.c retry_key = bkey(geo, oldnode, i); bkey 347 lib/btree.c longcpy(__key, bkey(geo, node, i), geo->keylen); bkey 424 lib/btree.c setkey(geo, node, 0, bkey(geo, head->node, fill - 1)); bkey 477 lib/btree.c bkey(geo, node, fill / 2 - 1), bkey 484 lib/btree.c setkey(geo, new, i, bkey(geo, node, i)); bkey 486 lib/btree.c setkey(geo, node, i, bkey(geo, node, i + fill / 2)); bkey 491 lib/btree.c setkey(geo, node, i, bkey(geo, node, fill - 1)); bkey 501 lib/btree.c setkey(geo, node, i, bkey(geo, node, i - 1)); bkey 529 lib/btree.c setkey(geo, left, lfill + i, bkey(geo, right, i)); bkey 536 lib/btree.c btree_remove_level(head, geo, bkey(geo, parent, lpos), level + 1); bkey 614 lib/btree.c setkey(geo, node, i, bkey(geo, node, i + 1)); bkey 694 lib/btree.c func(child, opaque, bkey(geo, node, i), count++,