Home
last modified time | relevance | path

Searched refs:btree_id (Results 1 – 25 of 71) sorted by relevance

123

/linux/fs/bcachefs/
A Dbtree_journal_iter.h9 enum btree_id btree_id; member
31 static inline int __journal_key_cmp(enum btree_id l_btree_id, in __journal_key_cmp()
36 return (cmp_int(l_btree_id, r->btree_id) ?: in __journal_key_cmp()
43 return __journal_key_cmp(l->btree_id, l->level, l->k->k.p, r); in journal_key_cmp()
46 struct bkey_i *bch2_journal_keys_peek_upto(struct bch_fs *, enum btree_id,
48 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *, enum btree_id,
54 int bch2_journal_key_insert_take(struct bch_fs *, enum btree_id,
56 int bch2_journal_key_insert(struct bch_fs *, enum btree_id,
58 int bch2_journal_key_delete(struct bch_fs *, enum btree_id,
61 void bch2_journal_key_overwritten(struct bch_fs *, enum btree_id, unsigned, struct bpos);
[all …]
A Dbkey_methods.h31 int (*trigger)(struct btree_trans *, enum btree_id, unsigned,
34 void (*compat)(enum btree_id id, unsigned version,
80 enum btree_id btree, unsigned level, in bch2_key_trigger()
92 enum btree_id btree_id, unsigned level, in bch2_key_trigger_old() argument
101 return bch2_key_trigger(trans, btree_id, level, old, bkey_i_to_s(&deleted), in bch2_key_trigger_old()
106 enum btree_id btree_id, unsigned level, in bch2_key_trigger_new() argument
115 return bch2_key_trigger(trans, btree_id, level, bkey_i_to_s_c(&deleted), new, in bch2_key_trigger_new()
121 void __bch2_bkey_compat(unsigned, enum btree_id, unsigned, unsigned,
124 static inline void bch2_bkey_compat(unsigned level, enum btree_id btree_id, in bch2_bkey_compat() argument
133 __bch2_bkey_compat(level, btree_id, version, in bch2_bkey_compat()
A Dbtree_update.h66 int bch2_btree_delete_range(struct bch_fs *, enum btree_id,
73 enum btree_id btree, struct bpos pos) in bch2_btree_delete_at_buffered()
89 enum btree_id btree, in bch2_insert_snapshot_whiteouts()
105 enum btree_id, struct bpos);
132 enum btree_id btree, in bch2_trans_update_buffered()
276 unsigned btree_id, struct bpos pos, in __bch2_bkey_get_mut_noupdate() argument
280 btree_id, pos, flags|BTREE_ITER_intent, type); in __bch2_bkey_get_mut_noupdate()
291 unsigned btree_id, struct bpos pos, in bch2_bkey_get_mut_noupdate() argument
299 unsigned btree_id, struct bpos pos, in __bch2_bkey_get_mut() argument
320 unsigned btree_id, struct bpos pos, in bch2_bkey_get_mut_minsize() argument
[all …]
A Dbtree_journal_iter.c34 enum btree_id id, unsigned level, in __bch2_journal_key_search()
64 struct bkey_i *bch2_journal_keys_peek_upto(struct bch_fs *c, enum btree_id btree_id, in bch2_journal_keys_peek_upto() argument
110 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *c, enum btree_id btree_id, in bch2_journal_keys_peek_slot() argument
129 int cmp = cmp_int(k->btree_id, iter->btree_id) ?: in journal_iter_verify()
152 new_key->btree_id == iter->btree_id && in journal_iters_fix()
177 .btree_id = id, in bch2_journal_key_insert_take()
287 keys->data[idx].btree_id == btree && in bch2_key_deleted_in_journal()
322 int cmp = cmp_int(k->btree_id, iter->btree_id) ?: in bch2_journal_iter_peek()
347 iter->btree_id = id; in bch2_journal_iter_init()
571 .btree_id = entry->btree_id, in bch2_journal_keys_sort()
[all …]
A Dbtree_io.h132 int bch2_btree_root_read(struct bch_fs *, enum btree_id,
157 static inline void compat_bformat(unsigned level, enum btree_id btree_id, in compat_bformat() argument
162 btree_id == BTREE_ID_inodes) { in compat_bformat()
170 (level || btree_type_has_snapshots(btree_id))) { in compat_bformat()
180 static inline void compat_bpos(unsigned level, enum btree_id btree_id, in compat_bpos() argument
188 btree_id == BTREE_ID_inodes) in compat_bpos()
192 static inline void compat_btree_node(unsigned level, enum btree_id btree_id, in compat_btree_node() argument
198 btree_id_is_extents(btree_id) && in compat_btree_node()
207 compat_bpos(level, btree_id, version, big_endian, write, &bn->min_key); in compat_btree_node()
208 compat_bpos(level, btree_id, version, big_endian, write, &bn->max_key); in compat_btree_node()
[all …]
A Dbtree_update.c20 return cmp_int(l->btree_id, r->btree_id) ?: in btree_insert_entry_cmp()
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
401 .btree_id = path->btree_id, in bch2_trans_update_by_path()
550 enum btree_id btree, in bch2_btree_insert_clone_trans()
589 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 …]
A Dbtree_cache.h22 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);
138 return bch2_btree_id_root(c, b->c.btree_id)->b; in btree_node_root()
141 const char *bch2_btree_id_str(enum btree_id);
142 void bch2_btree_id_to_text(struct printbuf *, enum btree_id);
A Dbackpointers.c18 enum btree_id btree_id, unsigned level, in extent_matches_bp() argument
85 bch2_btree_id_str(bp->btree_id), in bch2_backpointer_to_text()
323 bp.btree_id, in bch2_backpointer_get_key()
364 bp.btree_id, in bch2_backpointer_get_node()
615 …ret = check_extent_checksum(trans, other_bp.btree_id, other_extent, bp.btree_id, orig_k, bucket.in… in check_bp_exists()
623 …ret = check_extent_checksum(trans, bp.btree_id, orig_k, other_bp.btree_id, other_extent, bucket.in… in check_bp_exists()
698 enum btree_id btree_id, in check_btree_root_to_backpointers() argument
731 .btree = bp.btree_id, in bp_to_bbpos()
868 for (enum btree_id btree_id = 0; in bch2_check_extents_to_backpointers_pass() local
869 btree_id < btree_id_nr_alive(c); in bch2_check_extents_to_backpointers_pass()
[all …]
A Dtrace.h109 __entry->btree_id = b->c.btree_id;
136 __entry->btree_id = b->c.btree_id;
577 __entry->btree_id = path->btree_id;
646 __entry->btree_id = path->btree_id;
1089 __entry->btree_id = path->btree_id;
1140 __entry->btree_id = path->btree_id;
1292 __field(enum btree_id, btree_id )
1302 __entry->btree_id = path->btree_id;
1466 __entry->btree_id = path->btree_id;
1503 __entry->btree_id = b->btree_id;
[all …]
A Dbtree_iter.h447 unsigned btree_id, in __bch2_btree_iter_flags() argument
451 btree_id_is_extents(btree_id)) in __bch2_btree_iter_flags()
459 btree_type_has_snapshots(btree_id)) in __bch2_btree_iter_flags()
469 unsigned btree_id, in bch2_btree_iter_flags() argument
492 iter->btree_id = btree_id; in bch2_trans_iter_init_common()
511 unsigned btree_id, struct bpos pos, in bch2_trans_iter_init() argument
514 if (__builtin_constant_p(btree_id) && in bch2_trans_iter_init()
524 enum btree_id, struct bpos,
569 unsigned btree_id, struct bpos pos, in __bch2_bkey_get_iter() argument
586 unsigned btree_id, struct bpos pos, in bch2_bkey_get_iter() argument
[all …]
A Dbtree_trans_commit.c338 BUG_ON(i->btree_id != path->btree_id); in btree_insert_entry_checks()
521 static int run_btree_triggers(struct btree_trans *trans, enum btree_id btree_id, in run_btree_triggers() argument
535 i < trans->nr_updates && trans->updates[i].btree_id <= btree_id; in run_btree_triggers()
537 if (trans->updates[i].btree_id != btree_id) in run_btree_triggers()
564 for (btree_id = 0; btree_id < BTREE_ID_NR; btree_id++) { in bch2_trans_commit_run_triggers()
565 if (btree_id == BTREE_ID_alloc) in bch2_trans_commit_run_triggers()
569 trans->updates[btree_id_start].btree_id < btree_id) in bch2_trans_commit_run_triggers()
580 if (i->btree_id > BTREE_ID_alloc) in bch2_trans_commit_run_triggers()
582 if (i->btree_id == BTREE_ID_alloc) { in bch2_trans_commit_run_triggers()
792 i->btree_id, i->level, in bch2_trans_commit_write_locked()
[all …]
A Dbtree_node_scan.c26 bch2_btree_id_str(n->btree_id), n->level, n->seq, 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()
179 .btree_id = BTREE_NODE_ID(bn), in try_read_btree_node()
312 n->btree_id == start->btree_id && in handle_overwrites()
441 return cmp_int(l->btree_id, r->btree_id) ?: in found_btree_node_range_start_cmp()
451 (_f)->nodes.data[_idx].btree_id == _search.btree_id && \
461 .btree_id = b->c.btree_id, in bch2_btree_node_is_stale()
476 .btree_id = btree, in bch2_btree_has_scanned_nodes()
487 int bch2_get_scanned_nodes(struct bch_fs *c, enum btree_id btree, in bch2_get_scanned_nodes()
[all …]
A Dbtree_key_cache.c17 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()
229 bch2_btree_id_str(path->btree_id)); in btree_key_cache_create()
235 ck->c.btree_id = path->btree_id; in btree_key_cache_create()
236 ck->key.btree_id = path->btree_id; in btree_key_cache_create()
247 bch2_btree_id_str(ck->key.btree_id), key_u64s); in btree_key_cache_create()
336 if (ck->key.btree_id != path->btree_id || in btree_path_traverse_cached_fast()
[all …]
A Dbackpointers.h138 enum btree_id btree_id, unsigned level, in __bch2_extent_ptr_to_bp() argument
147 .btree_id = btree_id, in __bch2_extent_ptr_to_bp()
158 enum btree_id btree_id, unsigned level, in bch2_extent_ptr_to_bp() argument
165 __bch2_extent_ptr_to_bp(c, ca, btree_id, level, k, p, entry, bucket_pos, bp, sectors); in bch2_extent_ptr_to_bp()
A Dbtree_write_buffer.h46 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()
A Dbtree_cache.c266 if (b->c.btree_id < BTREE_ID_NR) in __bch2_btree_node_hash_remove()
267 --bc->nr_by_btree[b->c.btree_id]; in __bch2_btree_node_hash_remove()
289 if (b->c.btree_id < BTREE_ID_NR) in __bch2_btree_node_hash_insert()
304 b->c.btree_id = id; in bch2_btree_node_hash_insert()
897 enum btree_id btree_id, in bch2_btree_node_fill() argument
1139 EBUG_ON(b->c.btree_id != path->btree_id); in __bch2_btree_node_get()
1229 EBUG_ON(b->c.btree_id != path->btree_id); in bch2_btree_node_get()
1238 enum btree_id btree_id, in bch2_btree_node_get_noiter() argument
1282 b->c.btree_id != btree_id || in bch2_btree_node_get_noiter()
1312 EBUG_ON(b->c.btree_id != btree_id); in bch2_btree_node_get_noiter()
[all …]
A Dbtree_types.h68 u8 btree_id; member
322 enum btree_id btree_id:5;
375 enum btree_id btree_id:8;
427 enum btree_id btree_id:8;
743 static inline enum btree_node_type __btree_node_type(unsigned level, enum btree_id id) in __btree_node_type()
751 return __btree_node_type(b->c.level, b->c.btree_id); in btree_node_type()
801 static inline bool btree_id_is_extents(enum btree_id btree) in btree_id_is_extents()
806 static inline bool btree_type_has_snapshots(enum btree_id id) in btree_type_has_snapshots()
817 static inline bool btree_type_has_snapshot_field(enum btree_id id) in btree_type_has_snapshot_field()
828 static inline bool btree_type_has_ptrs(enum btree_id id) in btree_type_has_ptrs()
A Ddata_update.h25 enum btree_id btree_id; member
52 enum btree_id, struct bkey_s_c);
A Dbtree_write_buffer_types.h17 enum btree_id btree:8;
19 enum btree_id btree:8;
39 enum btree_id btree:8;
A Dio_read.h63 enum btree_id data_btree;
86 enum btree_id *data_btree, in bch2_read_indirect_extent()
111 struct bvec_iter, struct bpos, enum btree_id,
117 enum btree_id data_btree, struct bkey_s_c k, in bch2_read_extent()
A Dbtree_gc.c213 bch2_btree_id_str(b->c.btree_id), b->c.level); in btree_check_node_boundaries()
339 b->c.btree_id, b->c.level - 1, in bch2_btree_repair_topology_recurse()
350 bch2_btree_id_str(b->c.btree_id), in bch2_btree_repair_topology_recurse()
355 ret = bch2_journal_key_delete(c, b->c.btree_id, in bch2_btree_repair_topology_recurse()
360 if (!btree_id_is_alloc(b->c.btree_id)) { in bch2_btree_repair_topology_recurse()
376 ret = bch2_journal_key_delete(c, b->c.btree_id, in bch2_btree_repair_topology_recurse()
455 b->c.btree_id, b->c.level - 1, in bch2_btree_repair_topology_recurse()
487 bch2_btree_id_str(b->c.btree_id), in bch2_btree_repair_topology_recurse()
576 static int bch2_gc_mark_key(struct btree_trans *trans, enum btree_id btree_id, in bch2_gc_mark_key() argument
707 static inline int btree_id_gc_phase_cmp(enum btree_id l, enum btree_id r) in btree_id_gc_phase_cmp()
[all …]
A Dreflink.h10 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,
A Dbtree_node_scan.h7 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);
A Dbbpos_types.h6 enum btree_id btree;
10 static inline struct bbpos BBPOS(enum btree_id btree, struct bpos pos) in BBPOS()
A Dbtree_iter.c112 return path->btree_id == b->c.btree_id && in btree_path_pos_in_node()
131 BUG_ON(ck->key.btree_id != path->btree_id || in bch2_btree_path_verify_cached()
647 i->btree_id == b->c.btree_id && in bch2_trans_revalidate_updates_in_node()
1752 path->btree_id = btree_id; in bch2_path_get()
1791 enum btree_id btree_id, in bch2_path_get_unlocked_mut() argument
1832 EBUG_ON(path->btree_id != ck->key.btree_id || in bch2_btree_path_peek_slot()
2060 i->btree_id == iter->btree_id && in bch2_btree_trans_peek_prev_updates()
2077 i->btree_id == iter->btree_id && in bch2_btree_trans_peek_updates()
2091 i->btree_id == iter->btree_id && in bch2_btree_trans_peek_slot_updates()
2901 enum btree_id btree_id, struct bpos pos, in bch2_trans_iter_init_outlined() argument
[all …]

Completed in 49 milliseconds

123