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

123

/linux-master/drivers/md/bcache/
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 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)
61 static inline void SET_KEY_OFFSET(struct bkey *k, __u64 v)
72 ((struct bkey) { \
99 static inline unsigned long bkey_u64s(const struct bkey *k)
101 return (sizeof(struct bkey) / sizeof(__u64)) + KEY_PTRS(k);
104 static inline unsigned long bkey_bytes(const 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)
389 struct bkey *from,
396 struct bkey *
[all...]
H A Dbset.c23 struct bkey *k, *next;
58 struct bkey *k;
69 struct bkey *k, *p = NULL;
113 struct bkey *k = iter->data->k, *next = bkey_next(k);
159 struct bkey *bch_keylist_pop(struct keylist *l)
161 struct bkey *k = l->keys;
184 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src,
197 bool __bch_cut_front(const struct bkey *where, struct bkey *
[all...]
H A Dextents.c47 static bool __ptr_invalid(struct cache_set *c, const struct bkey *k)
68 static const char *bch_ptr_status(struct cache_set *c, const struct bkey *k)
97 void bch_extent_to_text(char *buf, size_t size, const struct bkey *k)
126 static void bch_bkey_dump(struct btree_keys *keys, const struct bkey *k)
149 bool __bch_btree_ptr_invalid(struct cache_set *c, const struct bkey *k)
166 static bool bch_btree_ptr_invalid(struct btree_keys *bk, const struct bkey *k)
173 static bool btree_ptr_bad_expensive(struct btree *b, const struct bkey *k)
205 static bool bch_btree_ptr_bad(struct btree_keys *bk, const struct bkey *k)
228 struct bkey *insert,
230 struct bkey *replace_ke
[all...]
H A Dbcache.h232 struct bkey last_scanned;
240 struct bkey start;
241 struct bkey end;
638 struct bkey gc_done;
747 struct bkey key;
813 const struct bkey *k,
820 const struct bkey *k,
833 static inline uint8_t ptr_stale(struct cache_set *c, const struct bkey *k,
839 static inline bool ptr_available(struct cache_set *c, const struct bkey *k,
977 struct bkey *
[all...]
H A Dbtree.c128 void bkey_put(struct cache_set *c, struct bkey *k)
543 static unsigned int btree_order(struct bkey *k)
548 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp)
584 struct bkey *k, gfp_t gfp)
850 static struct hlist_head *mca_hash(struct cache_set *c, struct bkey *k)
855 static struct btree *mca_find(struct cache_set *c, struct bkey *k)
887 struct bkey *k)
925 struct bkey *k, int level)
1008 struct bkey *k, int level, bool write,
1064 static void btree_node_prefetch(struct btree *parent, struct bkey *
[all...]
H A Dalloc.c480 void bch_bucket_free(struct cache_set *c, struct bkey *k)
489 struct bkey *k, bool wait)
521 struct bkey *k, bool wait)
566 const struct bkey *search,
568 struct bkey *alloc)
607 struct bkey *k,
H A Dwriteback.c641 static bool dirty_pred(struct keybuf *buf, struct bkey *k)
704 struct bkey start = KEY(dc->disk.id, 0, 0);
705 struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0);
706 struct bkey start_pos;
854 struct bkey *k)
874 struct bkey *k)
912 struct bkey *k, *p;
981 struct bkey *k = NULL;
H A Drequest.c40 static void bio_csum(struct bio *bio, struct bkey *k)
62 struct bkey *replace_key = op->replace ? &op->replace_key : NULL;
152 struct bkey *src = op->insert_keys.keys, *dst = op->insert_keys.keys;
155 struct bkey *n = bkey_next(src);
206 struct bkey *k;
513 static int cache_lookup_fn(struct btree_op *op, struct btree *b, struct bkey *k)
517 struct bkey *bio_key;
971 struct bkey start = KEY(dc->disk.id, bio->bi_iter.bi_sector, 0);
972 struct bkey end = KEY(dc->disk.id, bio_end_sector(bio), 0);
H A Dio.c47 struct bkey *k, unsigned int ptr)
/linux-master/tools/testing/selftests/bpf/progs/
H A Dtest_lookup_key.c28 struct bpf_key *bkey; local
36 bkey = bpf_lookup_user_key(key_serial, flags);
38 bkey = bpf_lookup_system_key(key_id);
40 if (!bkey)
43 bpf_key_put(bkey);
H A Drcu_read_lock.c247 struct bpf_key *bkey; local
251 bkey = bpf_lookup_user_key(key_serial, flags);
253 if (!bkey)
255 bpf_key_put(bkey);
/linux-master/fs/bcachefs/
H A Dbkey_types.h8 * bkey_i - bkey with inline value
9 * bkey_s - bkey with split value
10 * bkey_s_c - bkey with split value, const
22 static inline size_t bkey_val_bytes(const struct bkey *k)
27 static inline void set_bkey_val_u64s(struct bkey *k, unsigned val_u64s)
35 static inline void set_bkey_val_bytes(struct bkey *k, unsigned bytes)
47 /* bkey with split value, const */
49 const struct bkey *k;
53 /* bkey with split value */
57 struct bkey *
[all...]
H A Dbkey_cmp.h5 #include "bkey.h"
113 struct bkey unpacked;
126 return bpos_cmp(((struct bkey *) l)->p, ((struct bkey *) r)->p);
H A Dbkey_methods.h5 #include "bkey.h"
10 struct bkey;
60 void bch2_bkey_to_text(struct printbuf *, const struct bkey *);
70 static inline bool bch2_bkey_maybe_mergable(const struct bkey *l, const struct bkey *r)
H A Dbkey.h224 * It's safe to treat an unpacked bkey as a packed one, but not the reverse
241 static inline const struct bkey *packed_to_bkey_c(const struct bkey_packed *k)
243 return bkey_packed(k) ? NULL : (const struct bkey *) k;
295 static inline u64 bkey_start_offset(const struct bkey *k)
300 static inline struct bpos bkey_start_pos(const struct bkey *k)
357 struct bkey __bch2_bkey_unpack_key(const struct bkey_format *,
365 bool bch2_bkey_pack_key(struct bkey_packed *, const struct bkey *,
388 typedef void (*compiled_unpack_fn)(struct bkey *, const struct bkey_packed *);
392 struct bkey *dst,
401 struct bkey dst
[all...]
H A Dextents.h6 #include "bkey.h"
152 bch2_extent_crc_unpack(const struct bkey *k, const union bch_extent_crc *crc)
473 static inline bool bkey_is_btree_ptr(const struct bkey *k)
484 static inline bool bkey_extent_is_direct_data(const struct bkey *k)
497 static inline bool bkey_extent_is_inline_data(const struct bkey *k)
503 static inline unsigned bkey_inline_data_offset(const struct bkey *k)
515 static inline unsigned bkey_inline_data_bytes(const struct bkey *k)
522 static inline bool bkey_extent_is_data(const struct bkey *k)
532 static inline bool bkey_extent_is_allocation(const struct bkey *k)
705 static inline enum bch_extent_overlap bch2_extent_overlap(const struct bkey *
[all...]
H A Dbtree_journal_iter.h21 struct bkey unpacked;
H A Dbkey.c4 #include "bkey.h"
53 const struct bkey *unpacked,
56 struct bkey tmp;
65 if (memcmp(&tmp, unpacked, sizeof(struct bkey))) {
100 const struct bkey *unpacked,
266 struct bkey __bch2_bkey_unpack_key(const struct bkey_format *format,
270 struct bkey out;
317 bool bch2_bkey_pack_key(struct bkey_packed *out, const struct bkey *in,
1003 offsetof(struct bkey, field), \
1004 sizeof(((struct bkey *) NUL
[all...]
H A DMakefile9 bkey.o \
H A Dbcachefs_format.h58 * BTREE KEYS (struct bkey):
198 struct bkey { struct
232 * The big-endian version of bkey can't be compiled by rustc with the "aligned"
239 * Specifically, when i was designing bkey, I wanted the header to be no
245 * as a single multi word, variable length integer. And bkey, the unpacked
247 * bkey code will work on keys in any packed format, the in-memory
250 * So that constrains the key part of a bkig endian bkey to start right
288 * and it's legal to cast a bkey to a bkey_packed - so padding it out
289 * to the same size as struct bkey should hopefully be safest.
291 __u8 pad[sizeof(struct bkey)
[all...]
/linux-master/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...]
/linux-master/lib/
H A Dbtree.c148 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) function
161 longcpy(bkey(geo, node, n), key, geo->keylen);
172 longset(bkey(geo, node, n), 0, geo->keylen);
219 longcpy(key, bkey(geo, node, 0), geo->keylen);
227 return longcmp(bkey(geo, node, pos), key, geo->keylen);
334 retry_key = bkey(geo, oldnode, i);
343 longcpy(__key, bkey(geo, node, i), geo->keylen);
420 setkey(geo, node, 0, bkey(geo, head->node, fill - 1));
473 bkey(geo, node, fill / 2 - 1),
480 setkey(geo, new, i, bkey(ge
[all...]

Completed in 451 milliseconds

123