1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BTREE_ITER_H
3 #define _BCACHEFS_BTREE_ITER_H
6 #include "btree_types.h"
9 static inline int __bkey_err(const struct bkey *k)
11 return PTR_ERR_OR_ZERO(k);
14 #define bkey_err(_k) __bkey_err((_k).k)
16 static inline void __btree_path_get(struct btree_path *path, bool intent)
19 path->intent_ref += intent;
22 static inline bool __btree_path_put(struct btree_path *path, bool intent)
25 EBUG_ON(!path->intent_ref && intent);
26 path->intent_ref -= intent;
27 return --path->ref == 0;
30 static inline void btree_path_set_dirty(struct btree_path *path,
31 enum btree_path_uptodate u)
33 path->uptodate = max_t(unsigned, path->uptodate, u);
36 static inline struct btree *btree_path_node(struct btree_path *path,
39 return level < BTREE_MAX_DEPTH ? path->l[level].b : NULL;
42 static inline bool btree_node_lock_seq_matches(const struct btree_path *path,
43 const struct btree *b, unsigned level)
46 * We don't compare the low bits of the lock sequence numbers because
47 * @path might have taken a write lock on @b, and we don't want to skip
48 * the linked path if the sequence numbers were equal before taking that
49 * write lock. The lock sequence number is incremented by taking and
50 * releasing write locks and is even when unlocked:
52 return path->l[level].lock_seq >> 1 == b->c.lock.state.seq >> 1;
55 static inline struct btree *btree_node_parent(struct btree_path *path,
58 return btree_path_node(path, b->c.level + 1);
61 /* Iterate over paths within a transaction: */
63 void __bch2_btree_trans_sort_paths(struct btree_trans *);
65 static inline void btree_trans_sort_paths(struct btree_trans *trans)
67 if (!IS_ENABLED(CONFIG_BCACHEFS_DEBUG) &&
70 __bch2_btree_trans_sort_paths(trans);
73 static inline struct btree_path *
74 __trans_next_path(struct btree_trans *trans, unsigned idx)
78 if (idx == BTREE_ITER_MAX)
81 l = trans->paths_allocated >> idx;
86 EBUG_ON(idx >= BTREE_ITER_MAX);
87 EBUG_ON(trans->paths[idx].idx != idx);
88 return &trans->paths[idx];
91 #define trans_for_each_path_from(_trans, _path, _start) \
92 for (_path = __trans_next_path((_trans), _start); \
94 _path = __trans_next_path((_trans), (_path)->idx + 1))
96 #define trans_for_each_path(_trans, _path) \
97 trans_for_each_path_from(_trans, _path, 0)
99 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path)
101 unsigned idx = path ? path->sorted_idx + 1 : 0;
103 EBUG_ON(idx > trans->nr_sorted);
105 return idx < trans->nr_sorted
106 ? trans->paths + trans->sorted[idx]
110 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path)
112 unsigned idx = path ? path->sorted_idx : trans->nr_sorted;
115 ? trans->paths + trans->sorted[idx - 1]
119 #define trans_for_each_path_inorder(_trans, _path, _i) \
121 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) < (_trans)->nr_sorted;\
124 #define trans_for_each_path_inorder_reverse(_trans, _path, _i) \
125 for (_i = trans->nr_sorted - 1; \
126 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) >= 0;\
129 static inline bool __path_has_node(const struct btree_path *path,
130 const struct btree *b)
132 return path->l[b->c.level].b == b &&
133 btree_node_lock_seq_matches(path, b, b->c.level);
136 static inline struct btree_path *
137 __trans_next_path_with_node(struct btree_trans *trans, struct btree *b,
140 struct btree_path *path = __trans_next_path(trans, idx);
142 while (path && !__path_has_node(path, b))
143 path = __trans_next_path(trans, path->idx + 1);
148 #define trans_for_each_path_with_node(_trans, _b, _path) \
149 for (_path = __trans_next_path_with_node((_trans), (_b), 0); \
151 _path = __trans_next_path_with_node((_trans), (_b), \
154 struct btree_path *__bch2_btree_path_make_mut(struct btree_trans *, struct btree_path *,
155 bool, unsigned long);
157 static inline struct btree_path * __must_check
158 bch2_btree_path_make_mut(struct btree_trans *trans,
159 struct btree_path *path, bool intent,
162 if (path->ref > 1 || path->preserve)
163 path = __bch2_btree_path_make_mut(trans, path, intent, ip);
164 path->should_be_locked = false;
168 struct btree_path * __must_check
169 __bch2_btree_path_set_pos(struct btree_trans *, struct btree_path *,
170 struct bpos, bool, unsigned long, int);
172 static inline struct btree_path * __must_check
173 bch2_btree_path_set_pos(struct btree_trans *trans,
174 struct btree_path *path, struct bpos new_pos,
175 bool intent, unsigned long ip)
177 int cmp = bpos_cmp(new_pos, path->pos);
180 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip, cmp)
184 int __must_check bch2_btree_path_traverse_one(struct btree_trans *, struct btree_path *,
185 unsigned, unsigned long);
187 static inline int __must_check bch2_btree_path_traverse(struct btree_trans *trans,
188 struct btree_path *path, unsigned flags)
190 if (path->uptodate < BTREE_ITER_NEED_RELOCK)
193 return bch2_btree_path_traverse_one(trans, path, flags, _RET_IP_);
196 int __must_check bch2_btree_path_traverse(struct btree_trans *,
197 struct btree_path *, unsigned);
198 struct btree_path *bch2_path_get(struct btree_trans *, enum btree_id, struct bpos,
199 unsigned, unsigned, unsigned, unsigned long);
200 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *, struct bkey *);
202 struct bkey_i *bch2_btree_journal_peek_slot(struct btree_trans *,
203 struct btree_iter *, struct bpos);
205 void bch2_btree_path_level_init(struct btree_trans *, struct btree_path *, struct btree *);
207 int __bch2_trans_mutex_lock(struct btree_trans *, struct mutex *);
209 static inline int bch2_trans_mutex_lock(struct btree_trans *trans, struct mutex *lock)
211 return mutex_trylock(lock)
213 : __bch2_trans_mutex_lock(trans, lock);
216 #ifdef CONFIG_BCACHEFS_DEBUG
217 void bch2_trans_verify_paths(struct btree_trans *);
218 void bch2_assert_pos_locked(struct btree_trans *, enum btree_id,
221 static inline void bch2_trans_verify_paths(struct btree_trans *trans) {}
222 static inline void bch2_assert_pos_locked(struct btree_trans *trans, enum btree_id id,
223 struct bpos pos, bool key_cache) {}
226 void bch2_btree_path_fix_key_modified(struct btree_trans *trans,
227 struct btree *, struct bkey_packed *);
228 void bch2_btree_node_iter_fix(struct btree_trans *trans, struct btree_path *,
229 struct btree *, struct btree_node_iter *,
230 struct bkey_packed *, unsigned, unsigned);
232 int bch2_btree_path_relock_intent(struct btree_trans *, struct btree_path *);
234 void bch2_path_put(struct btree_trans *, struct btree_path *, bool);
236 int bch2_trans_relock(struct btree_trans *);
237 int bch2_trans_relock_notrace(struct btree_trans *);
238 void bch2_trans_unlock(struct btree_trans *);
239 bool bch2_trans_locked(struct btree_trans *);
241 static inline bool trans_was_restarted(struct btree_trans *trans, u32 restart_count)
243 return restart_count != trans->restart_count;
246 void bch2_trans_restart_error(struct btree_trans *, u32);
248 static inline void bch2_trans_verify_not_restarted(struct btree_trans *trans,
251 if (trans_was_restarted(trans, restart_count))
252 bch2_trans_restart_error(trans, restart_count);
255 void bch2_trans_in_restart_error(struct btree_trans *);
257 static inline void bch2_trans_verify_not_in_restart(struct btree_trans *trans)
259 if (trans->restarted)
260 bch2_trans_in_restart_error(trans);
264 static inline int btree_trans_restart_nounlock(struct btree_trans *trans, int err)
267 BUG_ON(!bch2_err_matches(err, BCH_ERR_transaction_restart));
269 trans->restarted = err;
270 trans->last_restarted_ip = _THIS_IP_;
275 static inline int btree_trans_restart(struct btree_trans *trans, int err)
277 btree_trans_restart_nounlock(trans, err);
281 bool bch2_btree_node_upgrade(struct btree_trans *,
282 struct btree_path *, unsigned);
284 void __bch2_btree_path_downgrade(struct btree_trans *, struct btree_path *, unsigned);
286 static inline void bch2_btree_path_downgrade(struct btree_trans *trans,
287 struct btree_path *path)
289 unsigned new_locks_want = path->level + !!path->intent_ref;
291 if (path->locks_want > new_locks_want)
292 __bch2_btree_path_downgrade(trans, path, new_locks_want);
295 void bch2_trans_downgrade(struct btree_trans *);
297 void bch2_trans_node_add(struct btree_trans *trans, struct btree *);
298 void bch2_trans_node_reinit_iter(struct btree_trans *, struct btree *);
300 int __must_check __bch2_btree_iter_traverse(struct btree_iter *iter);
301 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
303 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
304 struct btree *bch2_btree_iter_peek_node_and_restart(struct btree_iter *);
305 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
307 struct bkey_s_c bch2_btree_iter_peek_upto(struct btree_iter *, struct bpos);
308 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
310 struct bkey_s_c bch2_btree_iter_peek_all_levels(struct btree_iter *);
312 static inline struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *iter)
314 return bch2_btree_iter_peek_upto(iter, SPOS_MAX);
317 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *);
318 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
320 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
321 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
322 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
324 bool bch2_btree_iter_advance(struct btree_iter *);
325 bool bch2_btree_iter_rewind(struct btree_iter *);
327 static inline void __bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
329 iter->k.type = KEY_TYPE_deleted;
330 iter->k.p.inode = iter->pos.inode = new_pos.inode;
331 iter->k.p.offset = iter->pos.offset = new_pos.offset;
332 iter->k.p.snapshot = iter->pos.snapshot = new_pos.snapshot;
336 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
338 if (unlikely(iter->update_path))
339 bch2_path_put(iter->trans, iter->update_path,
340 iter->flags & BTREE_ITER_INTENT);
341 iter->update_path = NULL;
343 if (!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS))
344 new_pos.snapshot = iter->snapshot;
346 __bch2_btree_iter_set_pos(iter, new_pos);
349 static inline void bch2_btree_iter_set_pos_to_extent_start(struct btree_iter *iter)
351 BUG_ON(!(iter->flags & BTREE_ITER_IS_EXTENTS));
352 iter->pos = bkey_start_pos(&iter->k);
355 static inline void bch2_btree_iter_set_snapshot(struct btree_iter *iter, u32 snapshot)
357 struct bpos pos = iter->pos;
359 iter->snapshot = snapshot;
360 pos.snapshot = snapshot;
361 bch2_btree_iter_set_pos(iter, pos);
364 void bch2_trans_iter_exit(struct btree_trans *, struct btree_iter *);
366 static inline unsigned __bch2_btree_iter_flags(struct btree_trans *trans,
370 if (flags & BTREE_ITER_ALL_LEVELS)
371 flags |= BTREE_ITER_ALL_SNAPSHOTS|__BTREE_ITER_ALL_SNAPSHOTS;
373 if (!(flags & (BTREE_ITER_ALL_SNAPSHOTS|BTREE_ITER_NOT_EXTENTS)) &&
374 btree_node_type_is_extents(btree_id))
375 flags |= BTREE_ITER_IS_EXTENTS;
377 if (!(flags & __BTREE_ITER_ALL_SNAPSHOTS) &&
378 !btree_type_has_snapshots(btree_id))
379 flags &= ~BTREE_ITER_ALL_SNAPSHOTS;
381 if (!(flags & BTREE_ITER_ALL_SNAPSHOTS) &&
382 btree_type_has_snapshots(btree_id))
383 flags |= BTREE_ITER_FILTER_SNAPSHOTS;
385 if (trans->journal_replay_not_finished)
386 flags |= BTREE_ITER_WITH_JOURNAL;
391 static inline unsigned bch2_btree_iter_flags(struct btree_trans *trans,
395 if (!btree_id_cached(trans->c, btree_id)) {
396 flags &= ~BTREE_ITER_CACHED;
397 flags &= ~BTREE_ITER_WITH_KEY_CACHE;
398 } else if (!(flags & BTREE_ITER_CACHED))
399 flags |= BTREE_ITER_WITH_KEY_CACHE;
401 return __bch2_btree_iter_flags(trans, btree_id, flags);
404 static inline void bch2_trans_iter_init_common(struct btree_trans *trans,
405 struct btree_iter *iter,
406 unsigned btree_id, struct bpos pos,
412 memset(iter, 0, sizeof(*iter));
414 iter->btree_id = btree_id;
416 iter->snapshot = pos.snapshot;
420 #ifdef CONFIG_BCACHEFS_DEBUG
421 iter->ip_allocated = ip;
423 iter->path = bch2_path_get(trans, btree_id, iter->pos,
424 locks_want, depth, flags, ip);
427 void bch2_trans_iter_init_outlined(struct btree_trans *, struct btree_iter *,
428 unsigned, struct bpos, unsigned);
430 static inline void bch2_trans_iter_init(struct btree_trans *trans,
431 struct btree_iter *iter,
432 unsigned btree_id, struct bpos pos,
435 if (__builtin_constant_p(btree_id) &&
436 __builtin_constant_p(flags))
437 bch2_trans_iter_init_common(trans, iter, btree_id, pos, 0, 0,
438 bch2_btree_iter_flags(trans, btree_id, flags),
441 bch2_trans_iter_init_outlined(trans, iter, btree_id, pos, flags);
444 void bch2_trans_node_iter_init(struct btree_trans *, struct btree_iter *,
445 enum btree_id, struct bpos,
446 unsigned, unsigned, unsigned);
447 void bch2_trans_copy_iter(struct btree_iter *, struct btree_iter *);
449 static inline void set_btree_iter_dontneed(struct btree_iter *iter)
451 if (!iter->trans->restarted)
452 iter->path->preserve = false;
455 void *__bch2_trans_kmalloc(struct btree_trans *, size_t);
457 static inline void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size)
459 size = roundup(size, 8);
461 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
462 void *p = trans->mem + trans->mem_top;
464 trans->mem_top += size;
468 return __bch2_trans_kmalloc(trans, size);
472 static inline void *bch2_trans_kmalloc_nomemzero(struct btree_trans *trans, size_t size)
474 size = roundup(size, 8);
476 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
477 void *p = trans->mem + trans->mem_top;
479 trans->mem_top += size;
482 return __bch2_trans_kmalloc(trans, size);
486 static inline struct bkey_s_c __bch2_bkey_get_iter(struct btree_trans *trans,
487 struct btree_iter *iter,
488 unsigned btree_id, struct bpos pos,
489 unsigned flags, unsigned type)
493 bch2_trans_iter_init(trans, iter, btree_id, pos, flags);
494 k = bch2_btree_iter_peek_slot(iter);
496 if (!bkey_err(k) && type && k.k->type != type)
497 k = bkey_s_c_err(-ENOENT);
498 if (unlikely(bkey_err(k)))
499 bch2_trans_iter_exit(trans, iter);
503 static inline struct bkey_s_c bch2_bkey_get_iter(struct btree_trans *trans,
504 struct btree_iter *iter,
505 unsigned btree_id, struct bpos pos,
508 return __bch2_bkey_get_iter(trans, iter, btree_id, pos, flags, 0);
511 #define bch2_bkey_get_iter_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\
512 bkey_s_c_to_##_type(__bch2_bkey_get_iter(_trans, _iter, \
513 _btree_id, _pos, _flags, KEY_TYPE_##_type))
515 static inline int __bch2_bkey_get_val_typed(struct btree_trans *trans,
516 unsigned btree_id, struct bpos pos,
517 unsigned flags, unsigned type,
518 unsigned val_size, void *val)
520 struct btree_iter iter;
524 k = __bch2_bkey_get_iter(trans, &iter, btree_id, pos, flags, type);
527 unsigned b = min_t(unsigned, bkey_val_bytes(k.k), val_size);
530 if (unlikely(b < sizeof(*val)))
531 memset((void *) val + b, 0, sizeof(*val) - b);
532 bch2_trans_iter_exit(trans, &iter);
538 #define bch2_bkey_get_val_typed(_trans, _btree_id, _pos, _flags, _type, _val)\
539 __bch2_bkey_get_val_typed(_trans, _btree_id, _pos, _flags, \
540 KEY_TYPE_##_type, sizeof(*_val), _val)
542 u32 bch2_trans_begin(struct btree_trans *);
546 * this does not handle transaction restarts from bch2_btree_iter_next_node()
549 #define __for_each_btree_node(_trans, _iter, _btree_id, _start, \
550 _locks_want, _depth, _flags, _b, _ret) \
551 for (bch2_trans_node_iter_init((_trans), &(_iter), (_btree_id), \
552 _start, _locks_want, _depth, _flags); \
553 (_b) = bch2_btree_iter_peek_node_and_restart(&(_iter)), \
554 !((_ret) = PTR_ERR_OR_ZERO(_b)) && (_b); \
555 (_b) = bch2_btree_iter_next_node(&(_iter)))
557 #define for_each_btree_node(_trans, _iter, _btree_id, _start, \
559 __for_each_btree_node(_trans, _iter, _btree_id, _start, \
560 0, 0, _flags, _b, _ret)
562 static inline struct bkey_s_c bch2_btree_iter_peek_prev_type(struct btree_iter *iter,
565 BUG_ON(flags & BTREE_ITER_ALL_LEVELS);
567 return flags & BTREE_ITER_SLOTS ? bch2_btree_iter_peek_slot(iter) :
568 bch2_btree_iter_peek_prev(iter);
571 static inline struct bkey_s_c bch2_btree_iter_peek_type(struct btree_iter *iter,
574 return flags & BTREE_ITER_ALL_LEVELS ? bch2_btree_iter_peek_all_levels(iter) :
575 flags & BTREE_ITER_SLOTS ? bch2_btree_iter_peek_slot(iter) :
576 bch2_btree_iter_peek(iter);
579 static inline struct bkey_s_c bch2_btree_iter_peek_upto_type(struct btree_iter *iter,
583 if (!(flags & BTREE_ITER_SLOTS))
584 return bch2_btree_iter_peek_upto(iter, end);
586 if (bkey_gt(iter->pos, end))
587 return bkey_s_c_null;
589 return bch2_btree_iter_peek_slot(iter);
592 static inline int btree_trans_too_many_iters(struct btree_trans *trans)
594 if (hweight64(trans->paths_allocated) > BTREE_ITER_MAX - 8) {
595 trace_and_count(trans->c, trans_restart_too_many_iters, trans, _THIS_IP_);
596 return btree_trans_restart(trans, BCH_ERR_transaction_restart_too_many_iters);
602 struct bkey_s_c bch2_btree_iter_peek_and_restart_outlined(struct btree_iter *);
604 static inline struct bkey_s_c
605 __bch2_btree_iter_peek_and_restart(struct btree_trans *trans,
606 struct btree_iter *iter, unsigned flags)
610 while (btree_trans_too_many_iters(trans) ||
611 (k = bch2_btree_iter_peek_type(iter, flags),
612 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
613 bch2_trans_begin(trans);
618 static inline struct bkey_s_c
619 __bch2_btree_iter_peek_upto_and_restart(struct btree_trans *trans,
620 struct btree_iter *iter,
626 while (btree_trans_too_many_iters(trans) ||
627 (k = bch2_btree_iter_peek_upto_type(iter, end, flags),
628 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
629 bch2_trans_begin(trans);
634 #define lockrestart_do(_trans, _do) \
636 u32 _restart_count; \
640 _restart_count = bch2_trans_begin(_trans); \
642 } while (bch2_err_matches(_ret, BCH_ERR_transaction_restart)); \
645 bch2_trans_verify_not_restarted(_trans, _restart_count);\
651 * nested_lockrestart_do(), nested_commit_do():
653 * These are like lockrestart_do() and commit_do(), with two differences:
655 * - We don't call bch2_trans_begin() unless we had a transaction restart
656 * - We return -BCH_ERR_transaction_restart_nested if we succeeded after a
657 * transaction restart
659 #define nested_lockrestart_do(_trans, _do) \
661 u32 _restart_count, _orig_restart_count; \
664 _restart_count = _orig_restart_count = (_trans)->restart_count; \
666 while (bch2_err_matches(_ret = (_do), BCH_ERR_transaction_restart))\
667 _restart_count = bch2_trans_begin(_trans); \
670 bch2_trans_verify_not_restarted(_trans, _restart_count);\
672 if (!_ret && trans_was_restarted(_trans, _orig_restart_count)) \
673 _ret = -BCH_ERR_transaction_restart_nested; \
678 #define for_each_btree_key2(_trans, _iter, _btree_id, \
679 _start, _flags, _k, _do) \
683 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
684 (_start), (_flags)); \
687 u32 _restart_count = bch2_trans_begin(_trans); \
690 (_k) = bch2_btree_iter_peek_type(&(_iter), (_flags)); \
694 _ret = bkey_err(_k) ?: (_do); \
695 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
699 bch2_trans_verify_not_restarted(_trans, _restart_count);\
700 if (!bch2_btree_iter_advance(&(_iter))) \
704 bch2_trans_iter_exit((_trans), &(_iter)); \
708 #define for_each_btree_key2_upto(_trans, _iter, _btree_id, \
709 _start, _end, _flags, _k, _do) \
713 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
714 (_start), (_flags)); \
717 u32 _restart_count = bch2_trans_begin(_trans); \
720 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, (_flags));\
724 _ret = bkey_err(_k) ?: (_do); \
725 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
729 bch2_trans_verify_not_restarted(_trans, _restart_count);\
730 if (!bch2_btree_iter_advance(&(_iter))) \
734 bch2_trans_iter_exit((_trans), &(_iter)); \
738 #define for_each_btree_key_reverse(_trans, _iter, _btree_id, \
739 _start, _flags, _k, _do) \
743 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
744 (_start), (_flags)); \
747 u32 _restart_count = bch2_trans_begin(_trans); \
748 (_k) = bch2_btree_iter_peek_prev_type(&(_iter), (_flags));\
754 _ret = bkey_err(_k) ?: (_do); \
755 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
759 bch2_trans_verify_not_restarted(_trans, _restart_count);\
760 if (!bch2_btree_iter_rewind(&(_iter))) \
764 bch2_trans_iter_exit((_trans), &(_iter)); \
768 #define for_each_btree_key_commit(_trans, _iter, _btree_id, \
769 _start, _iter_flags, _k, \
770 _disk_res, _journal_seq, _commit_flags,\
772 for_each_btree_key2(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
773 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
774 (_journal_seq), (_commit_flags)))
776 #define for_each_btree_key_upto_commit(_trans, _iter, _btree_id, \
777 _start, _end, _iter_flags, _k, \
778 _disk_res, _journal_seq, _commit_flags,\
780 for_each_btree_key2_upto(_trans, _iter, _btree_id, _start, _end, _iter_flags, _k,\
781 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
782 (_journal_seq), (_commit_flags)))
784 #define for_each_btree_key(_trans, _iter, _btree_id, \
785 _start, _flags, _k, _ret) \
786 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
787 (_start), (_flags)); \
788 (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
789 !((_ret) = bkey_err(_k)) && (_k).k; \
790 bch2_btree_iter_advance(&(_iter)))
792 #define for_each_btree_key_upto(_trans, _iter, _btree_id, \
793 _start, _end, _flags, _k, _ret) \
794 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
795 (_start), (_flags)); \
796 (_k) = __bch2_btree_iter_peek_upto_and_restart((_trans), \
797 &(_iter), _end, _flags),\
798 !((_ret) = bkey_err(_k)) && (_k).k; \
799 bch2_btree_iter_advance(&(_iter)))
801 #define for_each_btree_key_norestart(_trans, _iter, _btree_id, \
802 _start, _flags, _k, _ret) \
803 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
804 (_start), (_flags)); \
805 (_k) = bch2_btree_iter_peek_type(&(_iter), _flags), \
806 !((_ret) = bkey_err(_k)) && (_k).k; \
807 bch2_btree_iter_advance(&(_iter)))
809 #define for_each_btree_key_upto_norestart(_trans, _iter, _btree_id, \
810 _start, _end, _flags, _k, _ret) \
811 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
812 (_start), (_flags)); \
813 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),\
814 !((_ret) = bkey_err(_k)) && (_k).k; \
815 bch2_btree_iter_advance(&(_iter)))
817 #define for_each_btree_key_continue(_trans, _iter, _flags, _k, _ret) \
819 (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
820 !((_ret) = bkey_err(_k)) && (_k).k; \
821 bch2_btree_iter_advance(&(_iter)))
823 #define for_each_btree_key_continue_norestart(_iter, _flags, _k, _ret) \
825 (_k) = bch2_btree_iter_peek_type(&(_iter), _flags), \
826 !((_ret) = bkey_err(_k)) && (_k).k; \
827 bch2_btree_iter_advance(&(_iter)))
829 #define for_each_btree_key_upto_continue_norestart(_iter, _end, _flags, _k, _ret)\
831 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags), \
832 !((_ret) = bkey_err(_k)) && (_k).k; \
833 bch2_btree_iter_advance(&(_iter)))
835 /* new multiple iterator interface: */
837 void bch2_trans_updates_to_text(struct printbuf *, struct btree_trans *);
838 void bch2_btree_path_to_text(struct printbuf *, struct btree_path *);
839 void bch2_trans_paths_to_text(struct printbuf *, struct btree_trans *);
840 void bch2_dump_trans_updates(struct btree_trans *);
841 void bch2_dump_trans_paths_updates(struct btree_trans *);
842 void __bch2_trans_init(struct btree_trans *, struct bch_fs *, unsigned);
843 void bch2_trans_exit(struct btree_trans *);
845 extern const char *bch2_btree_transaction_fns[BCH_TRANSACTIONS_NR];
846 unsigned bch2_trans_get_fn_idx(const char *);
848 #define bch2_trans_init(_trans, _c, _nr_iters, _mem) \
850 static unsigned trans_fn_idx; \
852 if (unlikely(!trans_fn_idx)) \
853 trans_fn_idx = bch2_trans_get_fn_idx(__func__); \
855 __bch2_trans_init(_trans, _c, trans_fn_idx); \
858 void bch2_btree_trans_to_text(struct printbuf *, struct btree_trans *);
860 void bch2_fs_btree_iter_exit(struct bch_fs *);
861 int bch2_fs_btree_iter_init(struct bch_fs *);
863 #endif /* _BCACHEFS_BTREE_ITER_H */