1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BTREE_ITER_H
3 #define _BCACHEFS_BTREE_ITER_H
6 #include "btree_types.h"
8 #include <trace/events/bcachefs.h>
10 static inline void __btree_path_get(struct btree_path *path, bool intent)
13 path->intent_ref += intent;
16 static inline bool __btree_path_put(struct btree_path *path, bool intent)
19 EBUG_ON(!path->intent_ref && intent);
20 path->intent_ref -= intent;
21 return --path->ref == 0;
24 static inline void btree_path_set_dirty(struct btree_path *path,
25 enum btree_path_uptodate u)
27 path->uptodate = max_t(unsigned, path->uptodate, u);
30 static inline struct btree *btree_path_node(struct btree_path *path,
33 return level < BTREE_MAX_DEPTH ? path->l[level].b : NULL;
36 static inline bool btree_node_lock_seq_matches(const struct btree_path *path,
37 const struct btree *b, unsigned level)
40 * We don't compare the low bits of the lock sequence numbers because
41 * @path might have taken a write lock on @b, and we don't want to skip
42 * the linked path if the sequence numbers were equal before taking that
43 * write lock. The lock sequence number is incremented by taking and
44 * releasing write locks and is even when unlocked:
46 return path->l[level].lock_seq >> 1 == b->c.lock.state.seq >> 1;
49 static inline struct btree *btree_node_parent(struct btree_path *path,
52 return btree_path_node(path, b->c.level + 1);
55 /* Iterate over paths within a transaction: */
57 void __bch2_btree_trans_sort_paths(struct btree_trans *);
59 static inline void btree_trans_sort_paths(struct btree_trans *trans)
61 if (!IS_ENABLED(CONFIG_BCACHEFS_DEBUG) &&
64 __bch2_btree_trans_sort_paths(trans);
67 static inline struct btree_path *
68 __trans_next_path(struct btree_trans *trans, unsigned idx)
72 if (idx == BTREE_ITER_MAX)
75 l = trans->paths_allocated >> idx;
80 EBUG_ON(idx >= BTREE_ITER_MAX);
81 EBUG_ON(trans->paths[idx].idx != idx);
82 return &trans->paths[idx];
85 #define trans_for_each_path_from(_trans, _path, _start) \
86 for (_path = __trans_next_path((_trans), _start); \
88 _path = __trans_next_path((_trans), (_path)->idx + 1))
90 #define trans_for_each_path(_trans, _path) \
91 trans_for_each_path_from(_trans, _path, 0)
93 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path)
95 unsigned idx = path ? path->sorted_idx + 1 : 0;
97 EBUG_ON(idx > trans->nr_sorted);
99 return idx < trans->nr_sorted
100 ? trans->paths + trans->sorted[idx]
104 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path)
106 unsigned idx = path ? path->sorted_idx : trans->nr_sorted;
109 ? trans->paths + trans->sorted[idx - 1]
113 #define trans_for_each_path_inorder(_trans, _path, _i) \
115 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) < (_trans)->nr_sorted;\
118 #define trans_for_each_path_inorder_reverse(_trans, _path, _i) \
119 for (_i = trans->nr_sorted - 1; \
120 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) >= 0;\
123 static inline bool __path_has_node(const struct btree_path *path,
124 const struct btree *b)
126 return path->l[b->c.level].b == b &&
127 btree_node_lock_seq_matches(path, b, b->c.level);
130 static inline struct btree_path *
131 __trans_next_path_with_node(struct btree_trans *trans, struct btree *b,
134 struct btree_path *path = __trans_next_path(trans, idx);
136 while (path && !__path_has_node(path, b))
137 path = __trans_next_path(trans, path->idx + 1);
142 #define trans_for_each_path_with_node(_trans, _b, _path) \
143 for (_path = __trans_next_path_with_node((_trans), (_b), 0); \
145 _path = __trans_next_path_with_node((_trans), (_b), \
148 struct btree_path *__bch2_btree_path_make_mut(struct btree_trans *, struct btree_path *,
149 bool, unsigned long);
151 static inline struct btree_path * __must_check
152 bch2_btree_path_make_mut(struct btree_trans *trans,
153 struct btree_path *path, bool intent,
156 if (path->ref > 1 || path->preserve)
157 path = __bch2_btree_path_make_mut(trans, path, intent, ip);
158 path->should_be_locked = false;
162 struct btree_path * __must_check
163 __bch2_btree_path_set_pos(struct btree_trans *, struct btree_path *,
164 struct bpos, bool, unsigned long, int);
166 static inline struct btree_path * __must_check
167 bch2_btree_path_set_pos(struct btree_trans *trans,
168 struct btree_path *path, struct bpos new_pos,
169 bool intent, unsigned long ip)
171 int cmp = bpos_cmp(new_pos, path->pos);
174 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip, cmp)
178 int __must_check bch2_btree_path_traverse_one(struct btree_trans *, struct btree_path *,
179 unsigned, unsigned long);
181 static inline int __must_check bch2_btree_path_traverse(struct btree_trans *trans,
182 struct btree_path *path, unsigned flags)
184 if (path->uptodate < BTREE_ITER_NEED_RELOCK)
187 return bch2_btree_path_traverse_one(trans, path, flags, _RET_IP_);
190 int __must_check bch2_btree_path_traverse(struct btree_trans *,
191 struct btree_path *, unsigned);
192 struct btree_path *bch2_path_get(struct btree_trans *, enum btree_id, struct bpos,
193 unsigned, unsigned, unsigned, unsigned long);
194 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *, struct bkey *);
196 struct bkey_i *bch2_btree_journal_peek_slot(struct btree_trans *,
197 struct btree_iter *, struct bpos);
199 void bch2_btree_path_level_init(struct btree_trans *, struct btree_path *, struct btree *);
201 #ifdef CONFIG_BCACHEFS_DEBUG
202 void bch2_trans_verify_paths(struct btree_trans *);
203 void bch2_assert_pos_locked(struct btree_trans *, enum btree_id,
206 static inline void bch2_trans_verify_paths(struct btree_trans *trans) {}
207 static inline void bch2_assert_pos_locked(struct btree_trans *trans, enum btree_id id,
208 struct bpos pos, bool key_cache) {}
211 void bch2_btree_path_fix_key_modified(struct btree_trans *trans,
212 struct btree *, struct bkey_packed *);
213 void bch2_btree_node_iter_fix(struct btree_trans *trans, struct btree_path *,
214 struct btree *, struct btree_node_iter *,
215 struct bkey_packed *, unsigned, unsigned);
217 int bch2_btree_path_relock_intent(struct btree_trans *, struct btree_path *);
219 void bch2_path_put(struct btree_trans *, struct btree_path *, bool);
221 int bch2_trans_relock(struct btree_trans *);
222 int bch2_trans_relock_notrace(struct btree_trans *);
223 void bch2_trans_unlock(struct btree_trans *);
224 bool bch2_trans_locked(struct btree_trans *);
226 static inline bool trans_was_restarted(struct btree_trans *trans, u32 restart_count)
228 return restart_count != trans->restart_count;
231 void bch2_trans_restart_error(struct btree_trans *, u32);
233 static inline void bch2_trans_verify_not_restarted(struct btree_trans *trans,
236 if (trans_was_restarted(trans, restart_count))
237 bch2_trans_restart_error(trans, restart_count);
240 void bch2_trans_in_restart_error(struct btree_trans *);
242 static inline void bch2_trans_verify_not_in_restart(struct btree_trans *trans)
244 if (trans->restarted)
245 bch2_trans_in_restart_error(trans);
249 static inline int btree_trans_restart_nounlock(struct btree_trans *trans, int err)
252 BUG_ON(!bch2_err_matches(err, BCH_ERR_transaction_restart));
254 trans->restarted = err;
259 static inline int btree_trans_restart(struct btree_trans *trans, int err)
261 btree_trans_restart_nounlock(trans, err);
265 bool bch2_btree_node_upgrade(struct btree_trans *,
266 struct btree_path *, unsigned);
268 void __bch2_btree_path_downgrade(struct btree_trans *, struct btree_path *, unsigned);
270 static inline void bch2_btree_path_downgrade(struct btree_trans *trans,
271 struct btree_path *path)
273 unsigned new_locks_want = path->level + !!path->intent_ref;
275 if (path->locks_want > new_locks_want)
276 __bch2_btree_path_downgrade(trans, path, new_locks_want);
279 void bch2_trans_downgrade(struct btree_trans *);
281 void bch2_trans_node_add(struct btree_trans *trans, struct btree *);
282 void bch2_trans_node_reinit_iter(struct btree_trans *, struct btree *);
284 int __must_check __bch2_btree_iter_traverse(struct btree_iter *iter);
285 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
287 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
288 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
290 struct bkey_s_c bch2_btree_iter_peek_upto(struct btree_iter *, struct bpos);
291 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
293 struct bkey_s_c bch2_btree_iter_peek_all_levels(struct btree_iter *);
295 static inline struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *iter)
297 return bch2_btree_iter_peek_upto(iter, SPOS_MAX);
300 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *);
301 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
303 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
304 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
305 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
307 bool bch2_btree_iter_advance(struct btree_iter *);
308 bool bch2_btree_iter_rewind(struct btree_iter *);
310 static inline void __bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
312 iter->k.type = KEY_TYPE_deleted;
313 iter->k.p.inode = iter->pos.inode = new_pos.inode;
314 iter->k.p.offset = iter->pos.offset = new_pos.offset;
315 iter->k.p.snapshot = iter->pos.snapshot = new_pos.snapshot;
319 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
321 if (unlikely(iter->update_path))
322 bch2_path_put(iter->trans, iter->update_path,
323 iter->flags & BTREE_ITER_INTENT);
324 iter->update_path = NULL;
326 if (!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS))
327 new_pos.snapshot = iter->snapshot;
329 __bch2_btree_iter_set_pos(iter, new_pos);
332 static inline void bch2_btree_iter_set_pos_to_extent_start(struct btree_iter *iter)
334 BUG_ON(!(iter->flags & BTREE_ITER_IS_EXTENTS));
335 iter->pos = bkey_start_pos(&iter->k);
338 static inline void bch2_btree_iter_set_snapshot(struct btree_iter *iter, u32 snapshot)
340 struct bpos pos = iter->pos;
342 iter->snapshot = snapshot;
343 pos.snapshot = snapshot;
344 bch2_btree_iter_set_pos(iter, pos);
347 void bch2_trans_iter_exit(struct btree_trans *, struct btree_iter *);
349 static inline unsigned __bch2_btree_iter_flags(struct btree_trans *trans,
353 if (flags & BTREE_ITER_ALL_LEVELS)
354 flags |= BTREE_ITER_ALL_SNAPSHOTS|__BTREE_ITER_ALL_SNAPSHOTS;
356 if (!(flags & (BTREE_ITER_ALL_SNAPSHOTS|BTREE_ITER_NOT_EXTENTS)) &&
357 btree_node_type_is_extents(btree_id))
358 flags |= BTREE_ITER_IS_EXTENTS;
360 if (!(flags & __BTREE_ITER_ALL_SNAPSHOTS) &&
361 !btree_type_has_snapshots(btree_id))
362 flags &= ~BTREE_ITER_ALL_SNAPSHOTS;
364 if (!(flags & BTREE_ITER_ALL_SNAPSHOTS) &&
365 btree_type_has_snapshots(btree_id))
366 flags |= BTREE_ITER_FILTER_SNAPSHOTS;
368 if (trans->journal_replay_not_finished)
369 flags |= BTREE_ITER_WITH_JOURNAL;
374 static inline unsigned bch2_btree_iter_flags(struct btree_trans *trans,
378 if (!btree_id_cached(trans->c, btree_id)) {
379 flags &= ~BTREE_ITER_CACHED;
380 flags &= ~BTREE_ITER_WITH_KEY_CACHE;
381 } else if (!(flags & BTREE_ITER_CACHED))
382 flags |= BTREE_ITER_WITH_KEY_CACHE;
384 return __bch2_btree_iter_flags(trans, btree_id, flags);
387 static inline void bch2_trans_iter_init_common(struct btree_trans *trans,
388 struct btree_iter *iter,
389 unsigned btree_id, struct bpos pos,
395 memset(iter, 0, sizeof(*iter));
397 iter->btree_id = btree_id;
399 iter->snapshot = pos.snapshot;
403 #ifdef CONFIG_BCACHEFS_DEBUG
404 iter->ip_allocated = ip;
406 iter->path = bch2_path_get(trans, btree_id, iter->pos,
407 locks_want, depth, flags, ip);
410 void bch2_trans_iter_init_outlined(struct btree_trans *, struct btree_iter *,
411 unsigned, struct bpos, unsigned);
413 static inline void bch2_trans_iter_init(struct btree_trans *trans,
414 struct btree_iter *iter,
415 unsigned btree_id, struct bpos pos,
418 if (__builtin_constant_p(btree_id) &&
419 __builtin_constant_p(flags))
420 bch2_trans_iter_init_common(trans, iter, btree_id, pos, 0, 0,
421 bch2_btree_iter_flags(trans, btree_id, flags),
424 bch2_trans_iter_init_outlined(trans, iter, btree_id, pos, flags);
427 void bch2_trans_node_iter_init(struct btree_trans *, struct btree_iter *,
428 enum btree_id, struct bpos,
429 unsigned, unsigned, unsigned);
430 void bch2_trans_copy_iter(struct btree_iter *, struct btree_iter *);
432 static inline void set_btree_iter_dontneed(struct btree_iter *iter)
434 if (!iter->trans->restarted)
435 iter->path->preserve = false;
438 void *__bch2_trans_kmalloc(struct btree_trans *, size_t);
440 static inline void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size)
442 size = roundup(size, 8);
444 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
445 void *p = trans->mem + trans->mem_top;
447 trans->mem_top += size;
451 return __bch2_trans_kmalloc(trans, size);
455 static inline void *bch2_trans_kmalloc_nomemzero(struct btree_trans *trans, size_t size)
457 size = roundup(size, 8);
459 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
460 void *p = trans->mem + trans->mem_top;
462 trans->mem_top += size;
465 return __bch2_trans_kmalloc(trans, size);
469 static inline struct bkey_i *bch2_bkey_make_mut(struct btree_trans *trans, struct bkey_s_c k)
471 struct bkey_i *mut = bch2_trans_kmalloc_nomemzero(trans, bkey_bytes(k.k));
474 bkey_reassemble(mut, k);
478 static inline struct bkey_i *bch2_bkey_get_mut(struct btree_trans *trans,
479 struct btree_iter *iter)
481 struct bkey_s_c k = bch2_btree_iter_peek_slot(iter);
483 return unlikely(IS_ERR(k.k))
485 : bch2_bkey_make_mut(trans, k);
488 #define bch2_bkey_get_mut_typed(_trans, _iter, _type) \
490 struct bkey_i *_k = bch2_bkey_get_mut(_trans, _iter); \
491 struct bkey_i_##_type *_ret; \
494 _ret = ERR_CAST(_k); \
495 else if (unlikely(_k->k.type != KEY_TYPE_##_type)) \
496 _ret = ERR_PTR(-ENOENT); \
498 _ret = bkey_i_to_##_type(_k); \
502 #define bch2_bkey_alloc(_trans, _iter, _type) \
504 struct bkey_i_##_type *_k = bch2_trans_kmalloc_nomemzero(_trans, sizeof(*_k));\
506 bkey_##_type##_init(&_k->k_i); \
507 _k->k.p = (_iter)->pos; \
512 u32 bch2_trans_begin(struct btree_trans *);
514 static inline struct btree *
515 __btree_iter_peek_node_and_restart(struct btree_trans *trans, struct btree_iter *iter)
519 while (b = bch2_btree_iter_peek_node(iter),
520 bch2_err_matches(PTR_ERR_OR_ZERO(b), BCH_ERR_transaction_restart))
521 bch2_trans_begin(trans);
528 * this does not handle transaction restarts from bch2_btree_iter_next_node()
531 #define __for_each_btree_node(_trans, _iter, _btree_id, _start, \
532 _locks_want, _depth, _flags, _b, _ret) \
533 for (bch2_trans_node_iter_init((_trans), &(_iter), (_btree_id), \
534 _start, _locks_want, _depth, _flags); \
535 (_b) = __btree_iter_peek_node_and_restart((_trans), &(_iter)),\
536 !((_ret) = PTR_ERR_OR_ZERO(_b)) && (_b); \
537 (_b) = bch2_btree_iter_next_node(&(_iter)))
539 #define for_each_btree_node(_trans, _iter, _btree_id, _start, \
541 __for_each_btree_node(_trans, _iter, _btree_id, _start, \
542 0, 0, _flags, _b, _ret)
544 static inline int bkey_err(struct bkey_s_c k)
546 return PTR_ERR_OR_ZERO(k.k);
549 static inline struct bkey_s_c bch2_btree_iter_peek_prev_type(struct btree_iter *iter,
552 BUG_ON(flags & BTREE_ITER_ALL_LEVELS);
554 return flags & BTREE_ITER_SLOTS ? bch2_btree_iter_peek_slot(iter) :
555 bch2_btree_iter_peek_prev(iter);
558 static inline struct bkey_s_c bch2_btree_iter_peek_type(struct btree_iter *iter,
561 return flags & BTREE_ITER_ALL_LEVELS ? bch2_btree_iter_peek_all_levels(iter) :
562 flags & BTREE_ITER_SLOTS ? bch2_btree_iter_peek_slot(iter) :
563 bch2_btree_iter_peek(iter);
566 static inline struct bkey_s_c bch2_btree_iter_peek_upto_type(struct btree_iter *iter,
570 if (!(flags & BTREE_ITER_SLOTS))
571 return bch2_btree_iter_peek_upto(iter, end);
573 if (bkey_gt(iter->pos, end))
574 return bkey_s_c_null;
576 return bch2_btree_iter_peek_slot(iter);
579 static inline int btree_trans_too_many_iters(struct btree_trans *trans)
581 if (hweight64(trans->paths_allocated) > BTREE_ITER_MAX - 8) {
582 trace_and_count(trans->c, trans_restart_too_many_iters, trans, _THIS_IP_);
583 return btree_trans_restart(trans, BCH_ERR_transaction_restart_too_many_iters);
589 static inline struct bkey_s_c
590 __bch2_btree_iter_peek_and_restart(struct btree_trans *trans,
591 struct btree_iter *iter, unsigned flags)
595 while (btree_trans_too_many_iters(trans) ||
596 (k = bch2_btree_iter_peek_type(iter, flags),
597 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
598 bch2_trans_begin(trans);
603 static inline struct bkey_s_c
604 __bch2_btree_iter_peek_upto_and_restart(struct btree_trans *trans,
605 struct btree_iter *iter,
611 while (btree_trans_too_many_iters(trans) ||
612 (k = bch2_btree_iter_peek_upto_type(iter, end, flags),
613 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
614 bch2_trans_begin(trans);
619 #define lockrestart_do(_trans, _do) \
621 u32 _restart_count; \
625 _restart_count = bch2_trans_begin(_trans); \
627 } while (bch2_err_matches(_ret, BCH_ERR_transaction_restart)); \
630 bch2_trans_verify_not_restarted(_trans, _restart_count);\
636 * nested_lockrestart_do(), nested_commit_do():
638 * These are like lockrestart_do() and commit_do(), with two differences:
640 * - We don't call bch2_trans_begin() unless we had a transaction restart
641 * - We return -BCH_ERR_transaction_restart_nested if we succeeded after a
642 * transaction restart
644 #define nested_lockrestart_do(_trans, _do) \
646 u32 _restart_count, _orig_restart_count; \
649 _restart_count = _orig_restart_count = (_trans)->restart_count; \
651 while (bch2_err_matches(_ret = (_do), BCH_ERR_transaction_restart))\
652 _restart_count = bch2_trans_begin(_trans); \
655 bch2_trans_verify_not_restarted(_trans, _restart_count);\
657 if (!_ret && trans_was_restarted(_trans, _orig_restart_count)) \
658 _ret = -BCH_ERR_transaction_restart_nested; \
663 #define for_each_btree_key2(_trans, _iter, _btree_id, \
664 _start, _flags, _k, _do) \
668 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
669 (_start), (_flags)); \
672 u32 _restart_count = bch2_trans_begin(_trans); \
675 (_k) = bch2_btree_iter_peek_type(&(_iter), (_flags)); \
679 _ret = bkey_err(_k) ?: (_do); \
680 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
684 bch2_trans_verify_not_restarted(_trans, _restart_count);\
685 if (!bch2_btree_iter_advance(&(_iter))) \
689 bch2_trans_iter_exit((_trans), &(_iter)); \
693 #define for_each_btree_key2_upto(_trans, _iter, _btree_id, \
694 _start, _end, _flags, _k, _do) \
698 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
699 (_start), (_flags)); \
702 u32 _restart_count = bch2_trans_begin(_trans); \
705 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, (_flags));\
709 _ret = bkey_err(_k) ?: (_do); \
710 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
714 bch2_trans_verify_not_restarted(_trans, _restart_count);\
715 if (!bch2_btree_iter_advance(&(_iter))) \
719 bch2_trans_iter_exit((_trans), &(_iter)); \
723 #define for_each_btree_key_reverse(_trans, _iter, _btree_id, \
724 _start, _flags, _k, _do) \
728 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
729 (_start), (_flags)); \
732 u32 _restart_count = bch2_trans_begin(_trans); \
733 (_k) = bch2_btree_iter_peek_prev_type(&(_iter), (_flags));\
739 _ret = bkey_err(_k) ?: (_do); \
740 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
744 bch2_trans_verify_not_restarted(_trans, _restart_count);\
745 if (!bch2_btree_iter_rewind(&(_iter))) \
749 bch2_trans_iter_exit((_trans), &(_iter)); \
753 #define for_each_btree_key_commit(_trans, _iter, _btree_id, \
754 _start, _iter_flags, _k, \
755 _disk_res, _journal_seq, _commit_flags,\
757 for_each_btree_key2(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
758 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
759 (_journal_seq), (_commit_flags)))
761 #define for_each_btree_key_upto_commit(_trans, _iter, _btree_id, \
762 _start, _end, _iter_flags, _k, \
763 _disk_res, _journal_seq, _commit_flags,\
765 for_each_btree_key2_upto(_trans, _iter, _btree_id, _start, _end, _iter_flags, _k,\
766 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
767 (_journal_seq), (_commit_flags)))
769 #define for_each_btree_key(_trans, _iter, _btree_id, \
770 _start, _flags, _k, _ret) \
771 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
772 (_start), (_flags)); \
773 (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
774 !((_ret) = bkey_err(_k)) && (_k).k; \
775 bch2_btree_iter_advance(&(_iter)))
777 #define for_each_btree_key_upto(_trans, _iter, _btree_id, \
778 _start, _end, _flags, _k, _ret) \
779 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
780 (_start), (_flags)); \
781 (_k) = __bch2_btree_iter_peek_upto_and_restart((_trans), \
782 &(_iter), _end, _flags),\
783 !((_ret) = bkey_err(_k)) && (_k).k; \
784 bch2_btree_iter_advance(&(_iter)))
786 #define for_each_btree_key_norestart(_trans, _iter, _btree_id, \
787 _start, _flags, _k, _ret) \
788 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
789 (_start), (_flags)); \
790 (_k) = bch2_btree_iter_peek_type(&(_iter), _flags), \
791 !((_ret) = bkey_err(_k)) && (_k).k; \
792 bch2_btree_iter_advance(&(_iter)))
794 #define for_each_btree_key_upto_norestart(_trans, _iter, _btree_id, \
795 _start, _end, _flags, _k, _ret) \
796 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
797 (_start), (_flags)); \
798 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),\
799 !((_ret) = bkey_err(_k)) && (_k).k; \
800 bch2_btree_iter_advance(&(_iter)))
802 #define for_each_btree_key_continue(_trans, _iter, _flags, _k, _ret) \
804 (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
805 !((_ret) = bkey_err(_k)) && (_k).k; \
806 bch2_btree_iter_advance(&(_iter)))
808 #define for_each_btree_key_continue_norestart(_iter, _flags, _k, _ret) \
810 (_k) = bch2_btree_iter_peek_type(&(_iter), _flags), \
811 !((_ret) = bkey_err(_k)) && (_k).k; \
812 bch2_btree_iter_advance(&(_iter)))
814 #define for_each_btree_key_upto_continue_norestart(_iter, _end, _flags, _k, _ret)\
816 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags), \
817 !((_ret) = bkey_err(_k)) && (_k).k; \
818 bch2_btree_iter_advance(&(_iter)))
820 /* new multiple iterator interface: */
822 void bch2_trans_updates_to_text(struct printbuf *, struct btree_trans *);
823 void bch2_btree_path_to_text(struct printbuf *, struct btree_path *);
824 void bch2_trans_paths_to_text(struct printbuf *, struct btree_trans *);
825 void bch2_dump_trans_updates(struct btree_trans *);
826 void bch2_dump_trans_paths_updates(struct btree_trans *);
827 void __bch2_trans_init(struct btree_trans *, struct bch_fs *, unsigned);
828 void bch2_trans_exit(struct btree_trans *);
830 extern const char *bch2_btree_transaction_fns[BCH_TRANSACTIONS_NR];
831 unsigned bch2_trans_get_fn_idx(const char *);
833 #define bch2_trans_init(_trans, _c, _nr_iters, _mem) \
835 static unsigned trans_fn_idx; \
837 if (unlikely(!trans_fn_idx)) \
838 trans_fn_idx = bch2_trans_get_fn_idx(__func__); \
840 __bch2_trans_init(_trans, _c, trans_fn_idx); \
843 void bch2_btree_trans_to_text(struct printbuf *, struct btree_trans *);
845 void bch2_fs_btree_iter_exit(struct bch_fs *);
846 int bch2_fs_btree_iter_init(struct bch_fs *);
848 #endif /* _BCACHEFS_BTREE_ITER_H */