| /linux-master/drivers/md/persistent-data/ |
| H A D | dm-btree-internal.h | 40 struct btree_node { struct
52 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n,
75 struct btree_node *ro_node(struct ro_spine *s);
109 static inline __le64 *key_ptr(struct btree_node *n, uint32_t index)
114 static inline void *value_base(struct btree_node *n)
119 static inline void *value_ptr(struct btree_node *n, uint32_t index)
129 static inline uint64_t value64(struct btree_node *n, uint32_t index)
139 int lower_bound(struct btree_node *n, uint64_t key);
|
| H A D | dm-btree-remove.c | 60 static void node_shift(struct btree_node *n, int shift)
86 static int node_copy(struct btree_node *left, struct btree_node *right, int shift)
129 static void delete_at(struct btree_node *n, unsigned int index)
150 static unsigned int merge_threshold(struct btree_node *n)
158 struct btree_node *n;
162 struct btree_node *parent,
192 static int shift(struct btree_node *left, struct btree_node *right, int count)
236 static int __rebalance2(struct dm_btree_info *info, struct btree_node *paren
[all...] |
| H A D | dm-btree.c | 44 static int bsearch(struct btree_node *n, uint64_t key, int want_hi)
64 int lower_bound(struct btree_node *n, uint64_t key)
69 static int upper_bound(struct btree_node *n, uint64_t key)
74 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n,
86 static int insert_at(size_t value_size, struct btree_node *node, unsigned int index,
133 struct btree_node *n;
167 struct btree_node *n;
344 int (*search_fn)(struct btree_node *, uint64_t),
425 struct btree_node *n;
507 static void copy_entries(struct btree_node *des
[all...] |
| H A D | dm-btree-spine.c | 23 struct btree_node *n = dm_block_data(b);
36 struct btree_node *n = dm_block_data(b);
85 .name = "btree_node",
164 struct btree_node *ro_node(struct ro_spine *s)
|
| H A D | dm-space-map-common.c | 544 static bool contains_key(struct btree_node *n, uint64_t key, int index)
555 struct btree_node *n;
587 struct btree_node *n;
775 struct btree_node *n;
812 struct btree_node *n;
|
| /linux-master/fs/bcachefs/ |
| H A D | btree_cache.h | 84 return (btree_buf_bytes(b) - sizeof(struct btree_node)) / sizeof(u64);
89 return (c->opts.btree_node_size - sizeof(struct btree_node)) / sizeof(u64);
|
| H A D | btree_io.h | 109 struct btree_node *bn = container_of(i, struct btree_node, keys);
197 struct btree_node *bn)
|
| H A D | bcachefs_format.h | 48 * 128k-256k) and log structured. We use struct btree_node for writing the first
1595 struct btree_node { struct
1619 LE64_BITMASK(BTREE_NODE_ID_LO, struct btree_node, flags, 0, 4);
1620 LE64_BITMASK(BTREE_NODE_LEVEL, struct btree_node, flags, 4, 8);
1622 struct btree_node, flags, 8, 9);
1623 LE64_BITMASK(BTREE_NODE_ID_HI, struct btree_node, flags, 9, 25);
1625 LE64_BITMASK(BTREE_NODE_SEQ, struct btree_node, flags, 32, 64);
1627 static inline __u64 BTREE_NODE_ID(struct btree_node *n)
1632 static inline void SET_BTREE_NODE_ID(struct btree_node *n, __u64 v)
|
| H A D | trace.h | 121 DECLARE_EVENT_CLASS(btree_node,
411 DEFINE_EVENT(btree_node, btree_node_read,
436 DEFINE_EVENT(btree_node, btree_node_alloc,
441 DEFINE_EVENT(btree_node, btree_node_free,
474 DEFINE_EVENT(btree_node, btree_node_compact,
479 DEFINE_EVENT(btree_node, btree_node_merge,
484 DEFINE_EVENT(btree_node, btree_node_split,
489 DEFINE_EVENT(btree_node, btree_node_rewrite,
494 DEFINE_EVENT(btree_node, btree_node_set_root,
|
| H A D | btree_io.c | 294 struct btree_node *out;
317 : __vstruct_bytes(struct btree_node, u64s);
740 struct btree_node *bn =
741 container_of(i, struct btree_node, keys);
980 struct btree_node *sorted;
1386 struct btree_node *bn = data;
1409 struct btree_node *bn = data;
1441 struct btree_node *bn = ra->buf[i];
1482 struct btree_node *bn = ra->buf[i];
1974 struct btree_node *b
[all...] |
| H A D | debug.c | 37 struct btree_node *n_ondisk = c->verify_ondisk;
38 struct btree_node *n_sorted = c->verify_data->data;
185 struct btree_node *n_ondisk = NULL;
|
| H A D | btree_types.h | 86 struct btree_node *data;
|
| H A D | btree_node_scan.c | 122 struct bio *bio, struct btree_node *bn, u64 offset)
|
| H A D | bcachefs.h | 1091 struct btree_node *verify_ondisk;
|
| H A D | btree_cache.c | 1232 btree_buf_bytes(b) - sizeof(struct btree_node),
|
| H A D | btree_update_interior.c | 218 return __vstruct_bytes(struct btree_node, u64s) < btree_buf_bytes(b);
1505 if (__vstruct_bytes(struct btree_node, u64s) > btree_buf_bytes(b))
|
| /linux-master/include/trace/events/ |
| H A D | bcache.h | 63 DECLARE_EVENT_CLASS(btree_node,
257 DEFINE_EVENT(btree_node, bcache_btree_read,
282 DEFINE_EVENT(btree_node, bcache_btree_node_alloc,
292 DEFINE_EVENT(btree_node, bcache_btree_node_free,
337 __field(u64, btree_node )
348 __entry->btree_node = PTR_BUCKET_NR(b->c, &b->key, 0);
360 __entry->btree_node, __entry->btree_level,
392 DEFINE_EVENT(btree_node, bcache_btree_set_root,
|