Home
last modified time | relevance | path

Searched refs:bkey (Results 1 - 25 of 52) sorted by relevance

123

/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dbset.h14 * A bkey contains a key, a size field, a variable number of pointers, and some
35 * front or the back of a bkey - this is mainly used for fixing overlapping
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 *
[all...]
H A 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 *
[all...]
H A Dbtree.h12 * In the interior nodes, a struct bkey always points to a child btree node, and
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 *
[all...]
H A 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_ke in bch_btree_ptr_insert_fixup()
[all...]
H A 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);
H A Dbcache.h232 struct bkey last_scanned;
240 struct bkey start;
241 struct bkey end;
630 struct bkey gc_done;
739 struct bkey key;
805 const struct bkey *k, in PTR_CACHE()
812 const struct bkey *k, in PTR_BUCKET_NR()
819 const struct bkey *k, in PTR_BUCKET()
832 static inline uint8_t ptr_stale(struct cache_set *c, const struct bkey *k, in ptr_stale()
838 static inline bool ptr_available(struct cache_set *c, const struct bkey *
[all...]
H A 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()
982 struct bkey *k, int level, bool write, in bch_btree_node_get()
1038 static void btree_node_prefetch(struct btree *parent, struct bkey *
[all...]
/kernel/linux/linux-6.6/drivers/md/bcache/
H A Dbset.h14 * A bkey contains a key, a size field, a variable number of pointers, and some
35 * front or the back of a bkey - this is mainly used for fixing overlapping
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 *
[all...]
H A Dbcache_ondisk.h23 struct bkey { struct
30 BITMASK(name, struct bkey, field, offset, size)
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 *
[all...]
H A 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 *
[all...]
H A Dbtree.h12 * In the interior nodes, a struct bkey always points to a child btree node, and
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 *
[all...]
H A 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_ke in bch_btree_ptr_insert_fixup()
[all...]
H A 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);
H A Dbcache.h232 struct bkey last_scanned;
240 struct bkey start;
241 struct bkey end;
636 struct bkey gc_done;
745 struct bkey key;
811 const struct bkey *k, in PTR_BUCKET_NR()
818 const struct bkey *k, in PTR_BUCKET()
831 static inline uint8_t ptr_stale(struct cache_set *c, const struct bkey *k, in ptr_stale()
837 static inline bool ptr_available(struct cache_set *c, const struct bkey *k, in ptr_available()
975 struct bkey *
[all...]
H A 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()
584 struct bkey *k, gfp_t gfp) in mca_bucket_alloc()
845 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k) in mca_hash()
850 static struct btree *mca_find(struct cache_set *c, struct bkey *k) in mca_find()
882 struct bkey *k) in mca_cannibalize()
920 struct bkey *k, int level) in mca_alloc()
1003 struct bkey *k, int level, bool write, in bch_btree_node_get()
1059 static void btree_node_prefetch(struct btree *parent, struct bkey *
[all...]
/kernel/linux/linux-5.10/include/uapi/linux/
H A Dbcache.h23 struct bkey { struct
30 BITMASK(name, struct bkey, field, offset, size)
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 *
[all...]
/kernel/linux/patches/linux-4.19/prebuilts/usr/include/linux/
H A Dbcache.h18 struct bkey { struct
24 BITMASK(name, struct bkey, field, offset, size)
26 static inline __u64 name(const struct bkey *k, unsigned int i) \
29 static inline void SET_##name(struct bkey *k, unsigned int i, __u64 v) \
43 static inline __u64 KEY_OFFSET(const struct bkey *k) in KEY_OFFSET()
47 static inline void SET_KEY_OFFSET(struct bkey *k, __u64 v) in SET_KEY_OFFSET()
52 ((struct bkey) { \
69 static inline unsigned long bkey_u64s(const struct bkey *k) in bkey_u64s()
71 return (sizeof(struct bkey) / sizeof(__u64)) + KEY_PTRS(k); in bkey_u64s()
73 static inline unsigned long bkey_bytes(const struct bkey * in bkey_u64s()
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/progs/
H A Dtest_lookup_key.c28 struct bpf_key *bkey; in BPF_PROG() local
36 bkey = bpf_lookup_user_key(key_serial, flags); in BPF_PROG()
38 bkey = bpf_lookup_system_key(key_id); in BPF_PROG()
40 if (!bkey) in BPF_PROG()
43 bpf_key_put(bkey); in BPF_PROG()
H A Drcu_read_lock.c247 struct bpf_key *bkey; in BPF_PROG() local
251 bkey = bpf_lookup_user_key(key_serial, flags); in BPF_PROG()
253 if (!bkey) in BPF_PROG()
255 bpf_key_put(bkey); in BPF_PROG()
/kernel/linux/linux-6.6/include/trace/events/
H A 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 *
[all...]
/kernel/linux/patches/linux-5.10/prebuilts/usr/include/linux/
H A Dbcache.h26 struct bkey { struct
31 #define KEY_FIELD(name,field,offset,size) BITMASK(name, struct bkey, field, offset, size)
32 #define PTR_FIELD(name,offset,size) static inline __u64 name(const struct bkey * k, unsigned int i) \
33 { return(k->ptr[i] >> offset) & ~(~0ULL << size); } static inline void SET_ ##name(struct bkey * k, unsigned int i, __u64 v) \
39 ((struct bkey) {.high = (1ULL << 63) | ((__u64) (size) << 20) | (inode),.low = (offset) \
52 #define BKEY_PADDED(key) union { struct bkey key; __u64 key ##_pad[BKEY_PAD]; }
170 struct bkey start[0];
209 struct bkey start[0];
/kernel/linux/patches/linux-6.6/prebuilts/usr/include/linux/
H A Dbcache.h26 struct bkey { struct
31 #define KEY_FIELD(name,field,offset,size) BITMASK(name, struct bkey, field, offset, size)
32 #define PTR_FIELD(name,offset,size) static inline __u64 name(const struct bkey * k, unsigned int i) \
33 { return(k->ptr[i] >> offset) & ~(~0ULL << size); } static inline void SET_ ##name(struct bkey * k, unsigned int i, __u64 v) \
39 ((struct bkey) {.high = (1ULL << 63) | ((__u64) (size) << 20) | (inode),.low = (offset) \
52 #define BKEY_PADDED(key) union { struct bkey key; __u64 key ##_pad[BKEY_PAD]; }
170 struct bkey start[0];
209 struct bkey start[0];
/kernel/linux/linux-5.10/include/trace/events/
H A 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 *
[all...]
/kernel/linux/linux-5.10/lib/
H A 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(ge in btree_insert_level()
[all...]
/kernel/linux/linux-6.6/lib/
H A 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()
334 retry_key = bkey(geo, oldnode, i); in btree_get_prev()
343 longcpy(__key, bkey(geo, node, i), geo->keylen); in btree_get_prev()
420 setkey(geo, node, 0, bkey(geo, head->node, fill - 1)); in btree_grow()
473 bkey(geo, node, fill / 2 - 1), in btree_insert_level()
480 setkey(geo, new, i, bkey(ge in btree_insert_level()
[all...]

Completed in 22 milliseconds

123