| /linux-6.15/fs/bcachefs/ |
| H A D | btree_journal_iter.h | 9 enum btree_id btree_id; member
32 static inline int __journal_key_btree_cmp(enum btree_id l_btree_id, in __journal_key_btree_cmp()
37 cmp_int(l_btree_id, r->btree_id); in __journal_key_btree_cmp()
40 static inline int __journal_key_cmp(enum btree_id l_btree_id, in __journal_key_cmp()
51 return __journal_key_cmp(l->btree_id, l->level, l->k->k.p, r); in journal_key_cmp()
54 struct bkey_i *bch2_journal_keys_peek_max(struct bch_fs *, enum btree_id,
58 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *, enum btree_id,
64 int bch2_journal_key_insert_take(struct bch_fs *, enum btree_id,
66 int bch2_journal_key_insert(struct bch_fs *, enum btree_id,
68 int bch2_journal_key_delete(struct bch_fs *, enum btree_id,
[all …]
|
| H A D | bkey_methods.h | 31 int (*trigger)(struct btree_trans *, enum btree_id, unsigned,
34 void (*compat)(enum btree_id id, unsigned version,
81 enum btree_id btree, unsigned level, in bch2_key_trigger()
93 enum btree_id btree_id, unsigned level, in bch2_key_trigger_old() argument
102 return bch2_key_trigger(trans, btree_id, level, old, bkey_i_to_s(&deleted), in bch2_key_trigger_old()
107 enum btree_id btree_id, unsigned level, in bch2_key_trigger_new() argument
116 return bch2_key_trigger(trans, btree_id, level, bkey_i_to_s_c(&deleted), new, in bch2_key_trigger_new()
122 void __bch2_bkey_compat(unsigned, enum btree_id, unsigned, unsigned,
125 static inline void bch2_bkey_compat(unsigned level, enum btree_id btree_id, in bch2_bkey_compat() argument
134 __bch2_bkey_compat(level, btree_id, version, in bch2_bkey_compat()
|
| H A D | btree_update.h | 71 enum btree_id btree, struct bpos pos) in bch2_btree_delete_at_buffered()
87 enum btree_id btree, in bch2_insert_snapshot_whiteouts()
103 enum btree_id, struct bpos);
130 enum btree_id, struct bkey_i *);
133 enum btree_id btree, in bch2_trans_update_buffered()
289 unsigned btree_id, struct bpos pos, in __bch2_bkey_get_mut_noupdate() argument
294 btree_id, pos, flags|BTREE_ITER_intent, type); in __bch2_bkey_get_mut_noupdate()
305 unsigned btree_id, struct bpos pos, in bch2_bkey_get_mut_noupdate() argument
313 unsigned btree_id, struct bpos pos, in __bch2_bkey_get_mut() argument
335 unsigned btree_id, struct bpos pos, in bch2_bkey_get_mut_minsize() argument
[all …]
|
| H A D | btree_io.h | 133 int bch2_btree_root_read(struct bch_fs *, enum btree_id,
136 int bch2_btree_node_scrub(struct btree_trans *, enum btree_id, unsigned,
163 static inline void compat_bformat(unsigned level, enum btree_id btree_id, in compat_bformat() argument
168 btree_id == BTREE_ID_inodes) { in compat_bformat()
176 (level || btree_type_has_snapshots(btree_id))) { in compat_bformat()
186 static inline void compat_bpos(unsigned level, enum btree_id btree_id, in compat_bpos() argument
194 btree_id == BTREE_ID_inodes) in compat_bpos()
198 static inline void compat_btree_node(unsigned level, enum btree_id btree_id, in compat_btree_node() argument
204 btree_id_is_extents(btree_id) && in compat_btree_node()
213 compat_bpos(level, btree_id, version, big_endian, write, &bn->min_key); in compat_btree_node()
[all …]
|
| H A D | btree_journal_iter.c | 45 enum btree_id id, unsigned level, in __bch2_journal_key_search()
68 enum btree_id id, unsigned level, in bch2_journal_key_search()
75 struct bkey_i *bch2_journal_keys_peek_max(struct bch_fs *c, enum btree_id btree_id, in bch2_journal_keys_peek_max() argument
131 struct bkey_i *bch2_journal_keys_peek_prev_min(struct bch_fs *c, enum btree_id btree_id, in bch2_journal_keys_peek_prev_min() argument
186 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *c, enum btree_id btree_id, in bch2_journal_keys_peek_slot() argument
229 new_key->btree_id == iter->btree_id && in journal_iters_fix()
254 .btree_id = id, in bch2_journal_key_insert_take()
364 keys->data[idx].btree_id == btree && in bch2_key_deleted_in_journal()
498 iter->btree_id = id; in bch2_journal_iter_init()
731 .btree_id = entry->btree_id, in bch2_journal_keys_sort()
[all …]
|
| H A D | btree_update.c | 94 enum btree_id btree_id, struct bpos pos) in need_whiteout_for_snapshot() argument
124 enum btree_id id, in __bch2_insert_snapshot_whiteouts()
192 enum btree_id btree_id = iter->btree_id; in bch2_trans_update_extent_overwrite() local
254 } else if (btree_type_has_snapshots(btree_id)) { in bch2_trans_update_extent_overwrite()
292 enum btree_id btree_id = orig_iter->btree_id; in bch2_trans_update_extent() local
402 .btree_id = path->btree_id, in bch2_trans_update_by_path()
541 btree_id_cached(trans->c, path->btree_id)) { in bch2_trans_update()
553 enum btree_id btree, in bch2_btree_insert_clone_trans()
592 enum btree_id btree, struct bpos end) in bch2_bkey_get_empty_slot()
627 enum btree_id btree, struct bkey_i *k, in bch2_btree_insert_nonextent()
[all …]
|
| H A D | btree_cache.h | 22 unsigned, enum btree_id);
27 void bch2_btree_node_update_key_early(struct btree_trans *, enum btree_id, unsigned,
41 enum btree_id, unsigned, bool);
44 const struct bkey_i *, enum btree_id, unsigned);
141 struct btree_root *r = bch2_btree_id_root(c, b->c.btree_id); in btree_node_root()
146 const char *bch2_btree_id_str(enum btree_id); /* avoid */
147 void bch2_btree_id_to_text(struct printbuf *, enum btree_id);
148 void bch2_btree_id_level_to_text(struct printbuf *, enum btree_id, unsigned);
151 enum btree_id, unsigned, struct bkey_s_c);
|
| H A D | trace.h | 109 __entry->btree_id = b->c.btree_id;
136 __entry->btree_id = b->c.btree_id;
625 __entry->btree_id = path->btree_id;
694 __entry->btree_id = path->btree_id;
1098 __entry->btree_id = path->btree_id;
1149 __entry->btree_id = path->btree_id;
1301 __field(enum btree_id, btree_id )
1311 __entry->btree_id = path->btree_id;
1510 __entry->btree_id = path->btree_id;
1547 __entry->btree_id = b->btree_id;
[all …]
|
| H A D | backpointers.c | 71 enum btree_id btree_id, unsigned level, in extent_matches_bp() argument
270 bp.v->btree_id, in __bch2_backpointer_get_node()
310 bp.v->btree_id, in __bch2_backpointer_get_key()
615 bp->v.btree_id, orig_k, in check_bp_exists()
658 enum btree_id btree, unsigned level, in check_extent_to_backpointers()
695 enum btree_id btree_id, in check_btree_root_to_backpointers() argument
728 .btree = bp.btree_id, in bp_to_bbpos()
765 for (enum btree_id btree = start.btree; in bch2_get_btree_in_memory_pos()
800 for (enum btree_id btree_id = 0; in bch2_check_extents_to_backpointers_pass() local
801 btree_id < btree_id_nr_alive(c); in bch2_check_extents_to_backpointers_pass()
[all …]
|
| H A D | btree_iter.h | 470 unsigned btree_id, in bch2_btree_iter_flags() argument
481 btree_id_is_extents(btree_id)) in bch2_btree_iter_flags()
489 btree_type_has_snapshots(btree_id)) in bch2_btree_iter_flags()
500 unsigned btree_id, struct bpos pos, in bch2_trans_iter_init_common() argument
508 iter->btree_id = btree_id; in bch2_trans_iter_init_common()
527 unsigned btree_id, struct bpos pos, in bch2_trans_iter_init() argument
530 if (__builtin_constant_p(btree_id) && in bch2_trans_iter_init()
540 enum btree_id, struct bpos,
585 unsigned btree_id, struct bpos pos, in __bch2_bkey_get_iter() argument
602 unsigned btree_id, struct bpos pos, in bch2_bkey_get_iter() argument
[all …]
|
| H A D | btree_node_scan.c | 27 bch2_btree_id_level_to_text(out, n->btree_id, n->level); in found_btree_node_to_text()
116 return cmp_int(l->btree_id, r->btree_id) ?: in found_btree_node_cmp_cookie()
137 return cmp_int(l->btree_id, r->btree_id) ?: in found_btree_node_cmp_pos()
206 .btree_id = BTREE_NODE_ID(bn), in try_read_btree_node()
325 return (l->btree_id == r->btree_id && in nodes_overlap()
490 return cmp_int(l->btree_id, r->btree_id) ?: in found_btree_node_range_start_cmp()
500 (_f)->nodes.data[_idx].btree_id == _search.btree_id && \
510 .btree_id = b->c.btree_id, in bch2_btree_node_is_stale()
525 .btree_id = btree, in bch2_btree_has_scanned_nodes()
536 int bch2_get_scanned_nodes(struct bch_fs *c, enum btree_id btree, in bch2_get_scanned_nodes()
[all …]
|
| H A D | btree_types.h | 68 u8 btree_id; member
322 enum btree_id btree_id:5; member
374 enum btree_id btree_id:8; member
427 enum btree_id btree_id:8; member
757 return __btree_node_type(b->c.level, b->c.btree_id); in btree_node_type()
796 static inline bool btree_id_is_extents(enum btree_id btree) in btree_id_is_extents()
812 static inline bool btree_type_has_snapshots(enum btree_id btree) in btree_type_has_snapshots()
823 static inline bool btree_type_has_snapshot_field(enum btree_id btree) in btree_type_has_snapshot_field()
834 static inline bool btree_type_has_ptrs(enum btree_id btree) in btree_type_has_ptrs()
845 static inline bool btree_type_uses_write_buffer(enum btree_id btree) in btree_type_uses_write_buffer()
[all …]
|
| H A D | btree_key_cache.c | 17 static inline bool btree_uses_pcpu_readers(enum btree_id id) in btree_uses_pcpu_readers()
30 return ck->key.btree_id != key->btree_id || in bch2_btree_key_cache_cmp_fn()
53 bch2_btree_key_cache_find(struct bch_fs *c, enum btree_id btree_id, struct bpos pos) in bch2_btree_key_cache_find() argument
56 .btree_id = btree_id, in bch2_btree_key_cache_find()
140 bool pcpu_readers = btree_uses_pcpu_readers(path->btree_id); in bkey_cached_alloc()
231 bch2_btree_id_str(ck_path->btree_id)); in btree_key_cache_create()
237 ck->c.btree_id = ck_path->btree_id; in btree_key_cache_create()
238 ck->key.btree_id = ck_path->btree_id; in btree_key_cache_create()
249 bch2_btree_id_str(ck->key.btree_id), key_u64s); in btree_key_cache_create()
366 if (ck->key.btree_id != path->btree_id || in btree_path_traverse_cached_fast()
[all …]
|
| H A D | btree_write_buffer.h | 46 enum btree_id, struct bkey_i_accounting *);
49 enum btree_id btree, struct bkey_i_accounting *k) in bch2_accounting_key_to_wb()
70 enum btree_id, struct bkey_i *);
74 enum btree_id btree, struct bkey_i *k) in __bch2_journal_key_to_wb()
90 enum btree_id btree, struct bkey_i *k) in bch2_journal_key_to_wb()
|
| H A D | btree_cache.c | 268 if (b->c.btree_id < BTREE_ID_NR) in __bch2_btree_node_hash_remove()
269 --bc->nr_by_btree[b->c.btree_id]; in __bch2_btree_node_hash_remove()
291 if (b->c.btree_id < BTREE_ID_NR) in __bch2_btree_node_hash_insert()
306 b->c.btree_id = id; in bch2_btree_node_hash_insert()
900 enum btree_id btree_id, in bch2_btree_node_fill() argument
1140 EBUG_ON(b->c.btree_id != path->btree_id); in __bch2_btree_node_get()
1230 EBUG_ON(b->c.btree_id != path->btree_id); in bch2_btree_node_get()
1239 enum btree_id btree_id, in bch2_btree_node_get_noiter() argument
1283 b->c.btree_id != btree_id || in bch2_btree_node_get_noiter()
1313 EBUG_ON(b->c.btree_id != btree_id); in bch2_btree_node_get_noiter()
[all …]
|
| H A D | btree_gc.c | 54 static bool btree_id_important(enum btree_id btree) in btree_id_important()
364 b->c.btree_id, b->c.level - 1, in bch2_btree_repair_topology_recurse()
379 ret = bch2_journal_key_delete(c, b->c.btree_id, in bch2_btree_repair_topology_recurse()
384 ret = bch2_btree_lost_data(c, b->c.btree_id); in bch2_btree_repair_topology_recurse()
398 ret = bch2_journal_key_delete(c, b->c.btree_id, in bch2_btree_repair_topology_recurse()
415 ret = bch2_journal_key_delete(c, b->c.btree_id, in bch2_btree_repair_topology_recurse()
477 b->c.btree_id, b->c.level - 1, in bch2_btree_repair_topology_recurse()
604 static int bch2_gc_mark_key(struct btree_trans *trans, enum btree_id btree_id, in bch2_gc_mark_key() argument
684 enum btree_id btree, bool initial) in bch2_gc_btree()
738 static inline int btree_id_gc_phase_cmp(enum btree_id l, enum btree_id r) in btree_id_gc_phase_cmp()
[all …]
|
| H A D | btree_write_buffer_types.h | 17 enum btree_id btree:8;
19 enum btree_id btree:8;
39 enum btree_id btree:8;
|
| H A D | data_update.h | 42 enum btree_id btree_id; member
75 enum btree_id, struct bkey_s_c);
|
| H A D | reflink.h | 9 int bch2_trigger_reflink_p(struct btree_trans *, enum btree_id, unsigned,
24 int bch2_trigger_reflink_v(struct btree_trans *, enum btree_id, unsigned,
41 enum btree_id, unsigned,
|
| H A D | btree_trans_commit.c | 53 bch2_journal_keys_peek_slot(c, i->btree_id, i->level, i->k->k.p); in verify_update_old_key()
339 BUG_ON(i->btree_id != path->btree_id); in btree_insert_entry_checks()
342 btree_type_has_snapshots(i->btree_id) && in btree_insert_entry_checks()
395 bch2_btree_id_str(path->btree_id), new_u64s); in btree_key_can_insert_cached_slowpath()
474 return bch2_key_trigger(trans, i->btree_id, i->level, in run_one_mem_trigger()
478 return bch2_key_trigger_new(trans, i->btree_id, i->level, in run_one_mem_trigger()
480 bch2_key_trigger_old(trans, i->btree_id, i->level, in run_one_mem_trigger()
713 validate_context.btree = i->btree_id; in bch2_trans_commit_write_locked()
740 i->btree_id, i->level, in bch2_trans_commit_write_locked()
748 i->btree_id, i->level, in bch2_trans_commit_write_locked()
[all …]
|
| H A D | btree_node_scan.h | 7 bool bch2_btree_has_scanned_nodes(struct bch_fs *, enum btree_id);
8 int bch2_get_scanned_nodes(struct bch_fs *, enum btree_id, unsigned, struct bpos, struct bpos);
|
| H A D | io_read.h | 64 enum btree_id data_btree;
82 enum btree_id *data_btree, in bch2_read_indirect_extent()
131 struct bvec_iter, struct bpos, enum btree_id,
137 enum btree_id data_btree, struct bkey_s_c k, in bch2_read_extent()
|
| H A D | bbpos_types.h | 6 enum btree_id btree;
10 static inline struct bbpos BBPOS(enum btree_id btree, struct bpos pos) in BBPOS()
|
| H A D | btree_journal_iter_types.h | 12 enum btree_id btree_id:8; member
|
| H A D | btree_update_interior.h | 59 enum btree_id btree_id; member
173 enum btree_id, unsigned,
188 int bch2_btree_root_alloc_fake_trans(struct btree_trans *, enum btree_id, unsigned);
189 void bch2_btree_root_alloc_fake(struct bch_fs *, enum btree_id, unsigned);
|