Home
last modified time | relevance | path

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

/linux/drivers/md/bcache/
A Dbset.h172 struct bkey end;
203 struct bkey *l, struct bkey *r);
323 struct bkey *k, *end;
335 struct bkey *end);
421 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src,
423 bool __bch_cut_front(const struct bkey *where, struct bkey *k);
424 bool __bch_cut_back(const struct bkey *where, struct bkey *k);
426 static inline bool bch_cut_front(const struct bkey *where, struct bkey *k) in bch_cut_front()
432 static inline bool bch_cut_back(const struct bkey *where, struct bkey *k) in bch_cut_back()
487 struct bkey *keys;
[all …]
A Dbcache_ondisk.h23 struct bkey { struct
30 BITMASK(name, struct bkey, field, offset, size) argument
56 static inline __u64 KEY_OFFSET(const struct bkey *k) in KEY_OFFSET()
72 ((struct bkey) { \
111 static inline void bkey_copy_key(struct bkey *dest, const struct bkey *src) in bkey_copy_key()
117 static inline struct bkey *bkey_next(const struct bkey *k) in bkey_next()
121 return (struct bkey *) (d + bkey_u64s(k)); in bkey_next()
124 static inline struct bkey *bkey_idx(const struct bkey *k, unsigned int nr_keys) in bkey_idx()
128 return (struct bkey *) (d + nr_keys); in bkey_idx()
362 struct bkey start[0];
[all …]
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()
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()
539 struct bkey *k) in bkey_to_cacheline_offset()
936 struct bkey *l, *r;
962 struct bkey *l, *r; in bset_search_tree()
1095 struct bkey *end) in bch_btree_iter_push()
[all …]
A 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);
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);
399 struct bkey *from, btree_map_keys_fn *fn,
406 struct bkey *end, keybuf_pred_fn *pred);
408 struct bkey *end);
[all …]
A Dextents.c228 struct bkey *insert, in bch_btree_ptr_insert_fixup()
230 struct bkey *replace_key) in bch_btree_ptr_insert_fixup()
267 struct bkey *tmp) in bch_extent_sort_fixup()
313 static void bch_subtract_dirty(struct bkey *k, in bch_subtract_dirty()
324 struct bkey *insert, in bch_extent_insert_fixup()
326 struct bkey *replace_key) in bch_extent_insert_fixup()
337 struct bkey *k = bch_btree_iter_next(iter); in bch_extent_insert_fixup()
405 struct bkey *top; in bch_extent_insert_fixup()
575 static uint64_t merge_chksums(struct bkey *l, struct bkey *r) in merge_chksums()
582 struct bkey *l, in bch_extent_merge()
[all …]
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);
A Dbcache.h232 struct bkey last_scanned;
240 struct bkey start;
241 struct bkey end;
628 struct bkey gc_done;
737 struct bkey key;
803 const struct bkey *k, in PTR_BUCKET_NR()
810 const struct bkey *k, in PTR_BUCKET()
967 struct bkey *k, unsigned int ptr);
976 void bch_bucket_free(struct cache_set *c, struct bkey *k);
980 struct bkey *k, bool wait);
[all …]
A Dbtree.c1194 struct bkey *k) in __bch_btree_mark_key()
1276 struct bkey *k; in btree_gc_mark_node()
1333 struct bkey *k; in btree_gc_coalesce()
1535 struct bkey *k; in btree_gc_count_keys()
1576 struct bkey *k; in btree_gc_recurse()
1917 struct bkey *k, *p; in bch_btree_check_thread()
2461 struct bkey *k; in bch_btree_insert()
2506 struct bkey *k; in bch_btree_map_nodes_recurse()
2539 struct bkey *k; in bch_btree_map_keys_recurse()
2590 struct bkey *end;
[all …]
A Dwriteback.c599 static bool dirty_pred(struct keybuf *buf, struct bkey *k) in dirty_pred()
662 struct bkey start = KEY(dc->disk.id, 0, 0); in refill_dirty()
663 struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0); in refill_dirty()
664 struct bkey start_pos; in refill_dirty()
811 struct bkey start;
815 struct bkey *k) in sectors_dirty_init_fn()
838 struct bkey *k) in bch_root_node_dirty_init()
874 struct bkey *k, *p; in bch_dirty_init_thread()
944 struct bkey *k = NULL; in bch_sectors_dirty_init()
A 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()
A 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()
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()
A Djournal.c297 struct bkey *k; in bch_journal_mark()
353 struct bkey *k; in bch_journal_replay()
630 struct bkey *k = &c->journal.key; in journal_reclaim()
736 struct bkey *k = &c->journal.key; in journal_write_unlocked()
A Dio.c46 struct bkey *k, unsigned int ptr) in bch_submit_bbio()
A Ddebug.c165 static bool dump_pred(struct keybuf *buf, struct bkey *k) in dump_pred()
A Dmovinggc.c22 static bool moving_pred(struct keybuf *buf, struct bkey *k) in moving_pred()
A Dsuper.c421 struct bkey *k, struct closure *parent) in uuid_io()
463 struct bkey *k = &j->uuid_bucket; in uuid_read()
1990 struct bkey *k; in run_cache_set()
A Dsysfs.c659 struct bkey *k; in bch_root_usage()
/linux/include/trace/events/
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),
210 TP_PROTO(struct bkey *k),
322 DEFINE_EVENT(bkey, bcache_gc_copy,
323 TP_PROTO(struct bkey *k),
328 TP_PROTO(struct bkey *k),
492 DEFINE_EVENT(bkey, bcache_writeback,
493 TP_PROTO(struct bkey *k),
[all …]
/linux/lib/
A Dbtree.c161 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()
338 retry_key = bkey(geo, oldnode, i); in btree_get_prev()
347 longcpy(__key, bkey(geo, node, i), geo->keylen); in btree_get_prev()
477 bkey(geo, node, fill / 2 - 1), in btree_insert_level()
484 setkey(geo, new, i, bkey(geo, node, i)); in btree_insert_level()
491 setkey(geo, node, i, bkey(geo, node, fill - 1)); in btree_insert_level()
501 setkey(geo, node, i, bkey(geo, node, i - 1)); in btree_insert_level()
614 setkey(geo, node, i, bkey(geo, node, i + 1)); in btree_remove_level()
[all …]
/linux/arch/s390/include/asm/
A Dqdio.h43 u32 bkey : 4; member
/linux/drivers/s390/cio/
A Dqdio_setup.c299 desc->bkey = PAGE_DEFAULT_KEY >> 4; in qdio_fill_qdr_desc()
/linux/drivers/net/ethernet/stmicro/stmmac/
A Dstmmac_selftests.c1454 struct flow_dissector_key_basic bkey; in __stmmac_test_l4filt() member
1510 keys.bkey.ip_proto = udp ? IPPROTO_UDP : IPPROTO_TCP; in __stmmac_test_l4filt()
/linux/fs/xfs/libxfs/
A Dxfs_btree.c3403 union xfs_btree_key bkey; /* key of block to insert */ in xfs_btree_insert() local
3410 key = &bkey; in xfs_btree_insert()

Completed in 69 milliseconds