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)
45 return path->l[level].lock_seq == six_lock_seq(&b->c.lock);
48 static inline struct btree *btree_node_parent(struct btree_path *path,
51 return btree_path_node(path, b->c.level + 1);
54 /* Iterate over paths within a transaction: */
56 void __bch2_btree_trans_sort_paths(struct btree_trans *);
58 static inline void btree_trans_sort_paths(struct btree_trans *trans)
60 if (!IS_ENABLED(CONFIG_BCACHEFS_DEBUG) &&
63 __bch2_btree_trans_sort_paths(trans);
66 static inline struct btree_path *
67 __trans_next_path(struct btree_trans *trans, unsigned idx)
71 if (idx == BTREE_ITER_MAX)
74 l = trans->paths_allocated >> idx;
79 EBUG_ON(idx >= BTREE_ITER_MAX);
80 EBUG_ON(trans->paths[idx].idx != idx);
81 return &trans->paths[idx];
84 #define trans_for_each_path_from(_trans, _path, _start) \
85 for (_path = __trans_next_path((_trans), _start); \
87 _path = __trans_next_path((_trans), (_path)->idx + 1))
89 #define trans_for_each_path(_trans, _path) \
90 trans_for_each_path_from(_trans, _path, 0)
92 static inline struct btree_path *
93 __trans_next_path_safe(struct btree_trans *trans, unsigned *idx)
97 if (*idx == BTREE_ITER_MAX)
100 l = trans->paths_allocated >> *idx;
105 EBUG_ON(*idx >= BTREE_ITER_MAX);
106 return &trans->paths[*idx];
110 * This version is intended to be safe for use on a btree_trans that is owned by
111 * another thread, for bch2_btree_trans_to_text();
113 #define trans_for_each_path_safe_from(_trans, _path, _idx, _start) \
114 for (_idx = _start; \
115 (_path = __trans_next_path_safe((_trans), &_idx)); \
118 #define trans_for_each_path_safe(_trans, _path, _idx) \
119 trans_for_each_path_safe_from(_trans, _path, _idx, 0)
121 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path)
123 unsigned idx = path ? path->sorted_idx + 1 : 0;
125 EBUG_ON(idx > trans->nr_sorted);
127 return idx < trans->nr_sorted
128 ? trans->paths + trans->sorted[idx]
132 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path)
134 unsigned idx = path ? path->sorted_idx : trans->nr_sorted;
137 ? trans->paths + trans->sorted[idx - 1]
141 #define trans_for_each_path_inorder(_trans, _path, _i) \
143 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) < (_trans)->nr_sorted;\
146 #define trans_for_each_path_inorder_reverse(_trans, _path, _i) \
147 for (_i = trans->nr_sorted - 1; \
148 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) >= 0;\
151 static inline bool __path_has_node(const struct btree_path *path,
152 const struct btree *b)
154 return path->l[b->c.level].b == b &&
155 btree_node_lock_seq_matches(path, b, b->c.level);
158 static inline struct btree_path *
159 __trans_next_path_with_node(struct btree_trans *trans, struct btree *b,
162 struct btree_path *path = __trans_next_path(trans, idx);
164 while (path && !__path_has_node(path, b))
165 path = __trans_next_path(trans, path->idx + 1);
170 #define trans_for_each_path_with_node(_trans, _b, _path) \
171 for (_path = __trans_next_path_with_node((_trans), (_b), 0); \
173 _path = __trans_next_path_with_node((_trans), (_b), \
176 struct btree_path *__bch2_btree_path_make_mut(struct btree_trans *, struct btree_path *,
177 bool, unsigned long);
179 static inline struct btree_path * __must_check
180 bch2_btree_path_make_mut(struct btree_trans *trans,
181 struct btree_path *path, bool intent,
184 if (path->ref > 1 || path->preserve)
185 path = __bch2_btree_path_make_mut(trans, path, intent, ip);
186 path->should_be_locked = false;
190 struct btree_path * __must_check
191 __bch2_btree_path_set_pos(struct btree_trans *, struct btree_path *,
192 struct bpos, bool, unsigned long, int);
194 static inline struct btree_path * __must_check
195 bch2_btree_path_set_pos(struct btree_trans *trans,
196 struct btree_path *path, struct bpos new_pos,
197 bool intent, unsigned long ip)
199 int cmp = bpos_cmp(new_pos, path->pos);
202 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip, cmp)
206 int __must_check bch2_btree_path_traverse_one(struct btree_trans *, struct btree_path *,
207 unsigned, unsigned long);
209 static inline int __must_check bch2_btree_path_traverse(struct btree_trans *trans,
210 struct btree_path *path, unsigned flags)
212 if (path->uptodate < BTREE_ITER_NEED_RELOCK)
215 return bch2_btree_path_traverse_one(trans, path, flags, _RET_IP_);
218 int __must_check bch2_btree_path_traverse(struct btree_trans *,
219 struct btree_path *, unsigned);
220 struct btree_path *bch2_path_get(struct btree_trans *, enum btree_id, struct bpos,
221 unsigned, unsigned, unsigned, unsigned long);
222 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *, struct bkey *);
225 * bch2_btree_path_peek_slot() for a cached iterator might return a key in a
226 * different snapshot:
228 static inline struct bkey_s_c bch2_btree_path_peek_slot_exact(struct btree_path *path, struct bkey *u)
230 struct bkey_s_c k = bch2_btree_path_peek_slot(path, u);
232 if (k.k && bpos_eq(path->pos, k.k->p))
237 return (struct bkey_s_c) { u, NULL };
240 struct bkey_i *bch2_btree_journal_peek_slot(struct btree_trans *,
241 struct btree_iter *, struct bpos);
243 void bch2_btree_path_level_init(struct btree_trans *, struct btree_path *, struct btree *);
245 int __bch2_trans_mutex_lock(struct btree_trans *, struct mutex *);
247 static inline int bch2_trans_mutex_lock(struct btree_trans *trans, struct mutex *lock)
249 return mutex_trylock(lock)
251 : __bch2_trans_mutex_lock(trans, lock);
254 #ifdef CONFIG_BCACHEFS_DEBUG
255 void bch2_trans_verify_paths(struct btree_trans *);
256 void bch2_assert_pos_locked(struct btree_trans *, enum btree_id,
259 static inline void bch2_trans_verify_paths(struct btree_trans *trans) {}
260 static inline void bch2_assert_pos_locked(struct btree_trans *trans, enum btree_id id,
261 struct bpos pos, bool key_cache) {}
264 void bch2_btree_path_fix_key_modified(struct btree_trans *trans,
265 struct btree *, struct bkey_packed *);
266 void bch2_btree_node_iter_fix(struct btree_trans *trans, struct btree_path *,
267 struct btree *, struct btree_node_iter *,
268 struct bkey_packed *, unsigned, unsigned);
270 int bch2_btree_path_relock_intent(struct btree_trans *, struct btree_path *);
272 void bch2_path_put(struct btree_trans *, struct btree_path *, bool);
274 int bch2_trans_relock(struct btree_trans *);
275 int bch2_trans_relock_notrace(struct btree_trans *);
276 void bch2_trans_unlock(struct btree_trans *);
277 void bch2_trans_unlock_long(struct btree_trans *);
278 bool bch2_trans_locked(struct btree_trans *);
280 static inline int trans_was_restarted(struct btree_trans *trans, u32 restart_count)
282 return restart_count != trans->restart_count
283 ? -BCH_ERR_transaction_restart_nested
287 void __noreturn bch2_trans_restart_error(struct btree_trans *, u32);
289 static inline void bch2_trans_verify_not_restarted(struct btree_trans *trans,
292 if (trans_was_restarted(trans, restart_count))
293 bch2_trans_restart_error(trans, restart_count);
296 void __noreturn bch2_trans_in_restart_error(struct btree_trans *);
298 static inline void bch2_trans_verify_not_in_restart(struct btree_trans *trans)
300 if (trans->restarted)
301 bch2_trans_in_restart_error(trans);
305 static int btree_trans_restart_nounlock(struct btree_trans *trans, int err)
308 BUG_ON(!bch2_err_matches(-err, BCH_ERR_transaction_restart));
310 trans->restarted = err;
311 trans->last_restarted_ip = _THIS_IP_;
316 static int btree_trans_restart(struct btree_trans *trans, int err)
318 btree_trans_restart_nounlock(trans, err);
322 bool bch2_btree_node_upgrade(struct btree_trans *,
323 struct btree_path *, unsigned);
325 void __bch2_btree_path_downgrade(struct btree_trans *, struct btree_path *, unsigned);
327 static inline void bch2_btree_path_downgrade(struct btree_trans *trans,
328 struct btree_path *path)
330 unsigned new_locks_want = path->level + !!path->intent_ref;
332 if (path->locks_want > new_locks_want)
333 __bch2_btree_path_downgrade(trans, path, new_locks_want);
336 void bch2_trans_downgrade(struct btree_trans *);
338 void bch2_trans_node_add(struct btree_trans *trans, struct btree *);
339 void bch2_trans_node_reinit_iter(struct btree_trans *, struct btree *);
341 int __must_check __bch2_btree_iter_traverse(struct btree_iter *iter);
342 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
344 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
345 struct btree *bch2_btree_iter_peek_node_and_restart(struct btree_iter *);
346 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
348 struct bkey_s_c bch2_btree_iter_peek_upto(struct btree_iter *, struct bpos);
349 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
351 static inline struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *iter)
353 return bch2_btree_iter_peek_upto(iter, SPOS_MAX);
356 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *);
357 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
359 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
360 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
361 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
363 bool bch2_btree_iter_advance(struct btree_iter *);
364 bool bch2_btree_iter_rewind(struct btree_iter *);
366 static inline void __bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
368 iter->k.type = KEY_TYPE_deleted;
369 iter->k.p.inode = iter->pos.inode = new_pos.inode;
370 iter->k.p.offset = iter->pos.offset = new_pos.offset;
371 iter->k.p.snapshot = iter->pos.snapshot = new_pos.snapshot;
375 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
377 if (unlikely(iter->update_path))
378 bch2_path_put(iter->trans, iter->update_path,
379 iter->flags & BTREE_ITER_INTENT);
380 iter->update_path = NULL;
382 if (!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS))
383 new_pos.snapshot = iter->snapshot;
385 __bch2_btree_iter_set_pos(iter, new_pos);
388 static inline void bch2_btree_iter_set_pos_to_extent_start(struct btree_iter *iter)
390 BUG_ON(!(iter->flags & BTREE_ITER_IS_EXTENTS));
391 iter->pos = bkey_start_pos(&iter->k);
394 static inline void bch2_btree_iter_set_snapshot(struct btree_iter *iter, u32 snapshot)
396 struct bpos pos = iter->pos;
398 iter->snapshot = snapshot;
399 pos.snapshot = snapshot;
400 bch2_btree_iter_set_pos(iter, pos);
403 void bch2_trans_iter_exit(struct btree_trans *, struct btree_iter *);
405 static inline unsigned __bch2_btree_iter_flags(struct btree_trans *trans,
409 if (!(flags & (BTREE_ITER_ALL_SNAPSHOTS|BTREE_ITER_NOT_EXTENTS)) &&
410 btree_id_is_extents(btree_id))
411 flags |= BTREE_ITER_IS_EXTENTS;
413 if (!(flags & __BTREE_ITER_ALL_SNAPSHOTS) &&
414 !btree_type_has_snapshot_field(btree_id))
415 flags &= ~BTREE_ITER_ALL_SNAPSHOTS;
417 if (!(flags & BTREE_ITER_ALL_SNAPSHOTS) &&
418 btree_type_has_snapshots(btree_id))
419 flags |= BTREE_ITER_FILTER_SNAPSHOTS;
421 if (trans->journal_replay_not_finished)
422 flags |= BTREE_ITER_WITH_JOURNAL;
427 static inline unsigned bch2_btree_iter_flags(struct btree_trans *trans,
431 if (!btree_id_cached(trans->c, btree_id)) {
432 flags &= ~BTREE_ITER_CACHED;
433 flags &= ~BTREE_ITER_WITH_KEY_CACHE;
434 } else if (!(flags & BTREE_ITER_CACHED))
435 flags |= BTREE_ITER_WITH_KEY_CACHE;
437 return __bch2_btree_iter_flags(trans, btree_id, flags);
440 static inline void bch2_trans_iter_init_common(struct btree_trans *trans,
441 struct btree_iter *iter,
442 unsigned btree_id, struct bpos pos,
449 iter->update_path = NULL;
450 iter->key_cache_path = NULL;
451 iter->btree_id = btree_id;
454 iter->snapshot = pos.snapshot;
456 iter->k = POS_KEY(pos);
457 iter->journal_idx = 0;
458 #ifdef CONFIG_BCACHEFS_DEBUG
459 iter->ip_allocated = ip;
461 iter->path = bch2_path_get(trans, btree_id, iter->pos,
462 locks_want, depth, flags, ip);
465 void bch2_trans_iter_init_outlined(struct btree_trans *, struct btree_iter *,
466 enum btree_id, struct bpos, unsigned);
468 static inline void bch2_trans_iter_init(struct btree_trans *trans,
469 struct btree_iter *iter,
470 unsigned btree_id, struct bpos pos,
473 if (__builtin_constant_p(btree_id) &&
474 __builtin_constant_p(flags))
475 bch2_trans_iter_init_common(trans, iter, btree_id, pos, 0, 0,
476 bch2_btree_iter_flags(trans, btree_id, flags),
479 bch2_trans_iter_init_outlined(trans, iter, btree_id, pos, flags);
482 void bch2_trans_node_iter_init(struct btree_trans *, struct btree_iter *,
483 enum btree_id, struct bpos,
484 unsigned, unsigned, unsigned);
485 void bch2_trans_copy_iter(struct btree_iter *, struct btree_iter *);
487 static inline void set_btree_iter_dontneed(struct btree_iter *iter)
489 if (!iter->trans->restarted)
490 iter->path->preserve = false;
493 void *__bch2_trans_kmalloc(struct btree_trans *, size_t);
495 static inline void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size)
497 size = roundup(size, 8);
499 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
500 void *p = trans->mem + trans->mem_top;
502 trans->mem_top += size;
506 return __bch2_trans_kmalloc(trans, size);
510 static inline void *bch2_trans_kmalloc_nomemzero(struct btree_trans *trans, size_t size)
512 size = roundup(size, 8);
514 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
515 void *p = trans->mem + trans->mem_top;
517 trans->mem_top += size;
520 return __bch2_trans_kmalloc(trans, size);
524 static inline struct bkey_s_c __bch2_bkey_get_iter(struct btree_trans *trans,
525 struct btree_iter *iter,
526 unsigned btree_id, struct bpos pos,
527 unsigned flags, unsigned type)
531 bch2_trans_iter_init(trans, iter, btree_id, pos, flags);
532 k = bch2_btree_iter_peek_slot(iter);
534 if (!bkey_err(k) && type && k.k->type != type)
535 k = bkey_s_c_err(-BCH_ERR_ENOENT_bkey_type_mismatch);
536 if (unlikely(bkey_err(k)))
537 bch2_trans_iter_exit(trans, iter);
541 static inline struct bkey_s_c bch2_bkey_get_iter(struct btree_trans *trans,
542 struct btree_iter *iter,
543 unsigned btree_id, struct bpos pos,
546 return __bch2_bkey_get_iter(trans, iter, btree_id, pos, flags, 0);
549 #define bch2_bkey_get_iter_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\
550 bkey_s_c_to_##_type(__bch2_bkey_get_iter(_trans, _iter, \
551 _btree_id, _pos, _flags, KEY_TYPE_##_type))
553 static inline int __bch2_bkey_get_val_typed(struct btree_trans *trans,
554 unsigned btree_id, struct bpos pos,
555 unsigned flags, unsigned type,
556 unsigned val_size, void *val)
558 struct btree_iter iter;
562 k = __bch2_bkey_get_iter(trans, &iter, btree_id, pos, flags, type);
565 unsigned b = min_t(unsigned, bkey_val_bytes(k.k), val_size);
568 if (unlikely(b < sizeof(*val)))
569 memset((void *) val + b, 0, sizeof(*val) - b);
570 bch2_trans_iter_exit(trans, &iter);
576 #define bch2_bkey_get_val_typed(_trans, _btree_id, _pos, _flags, _type, _val)\
577 __bch2_bkey_get_val_typed(_trans, _btree_id, _pos, _flags, \
578 KEY_TYPE_##_type, sizeof(*_val), _val)
580 void bch2_trans_srcu_unlock(struct btree_trans *);
581 void bch2_trans_srcu_lock(struct btree_trans *);
583 u32 bch2_trans_begin(struct btree_trans *);
587 * this does not handle transaction restarts from bch2_btree_iter_next_node()
590 #define __for_each_btree_node(_trans, _iter, _btree_id, _start, \
591 _locks_want, _depth, _flags, _b, _ret) \
592 for (bch2_trans_node_iter_init((_trans), &(_iter), (_btree_id), \
593 _start, _locks_want, _depth, _flags); \
594 (_b) = bch2_btree_iter_peek_node_and_restart(&(_iter)), \
595 !((_ret) = PTR_ERR_OR_ZERO(_b)) && (_b); \
596 (_b) = bch2_btree_iter_next_node(&(_iter)))
598 #define for_each_btree_node(_trans, _iter, _btree_id, _start, \
600 __for_each_btree_node(_trans, _iter, _btree_id, _start, \
601 0, 0, _flags, _b, _ret)
603 static inline struct bkey_s_c bch2_btree_iter_peek_prev_type(struct btree_iter *iter,
606 return flags & BTREE_ITER_SLOTS ? bch2_btree_iter_peek_slot(iter) :
607 bch2_btree_iter_peek_prev(iter);
610 static inline struct bkey_s_c bch2_btree_iter_peek_type(struct btree_iter *iter,
613 return flags & BTREE_ITER_SLOTS ? bch2_btree_iter_peek_slot(iter) :
614 bch2_btree_iter_peek(iter);
617 static inline struct bkey_s_c bch2_btree_iter_peek_upto_type(struct btree_iter *iter,
621 if (!(flags & BTREE_ITER_SLOTS))
622 return bch2_btree_iter_peek_upto(iter, end);
624 if (bkey_gt(iter->pos, end))
625 return bkey_s_c_null;
627 return bch2_btree_iter_peek_slot(iter);
630 static inline int btree_trans_too_many_iters(struct btree_trans *trans)
632 if (hweight64(trans->paths_allocated) > BTREE_ITER_MAX - 8) {
633 trace_and_count(trans->c, trans_restart_too_many_iters, trans, _THIS_IP_);
634 return btree_trans_restart(trans, BCH_ERR_transaction_restart_too_many_iters);
640 struct bkey_s_c bch2_btree_iter_peek_and_restart_outlined(struct btree_iter *);
642 static inline struct bkey_s_c
643 __bch2_btree_iter_peek_and_restart(struct btree_trans *trans,
644 struct btree_iter *iter, unsigned flags)
648 while (btree_trans_too_many_iters(trans) ||
649 (k = bch2_btree_iter_peek_type(iter, flags),
650 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
651 bch2_trans_begin(trans);
656 static inline struct bkey_s_c
657 __bch2_btree_iter_peek_upto_and_restart(struct btree_trans *trans,
658 struct btree_iter *iter,
664 while (btree_trans_too_many_iters(trans) ||
665 (k = bch2_btree_iter_peek_upto_type(iter, end, flags),
666 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
667 bch2_trans_begin(trans);
672 #define lockrestart_do(_trans, _do) \
674 u32 _restart_count; \
678 _restart_count = bch2_trans_begin(_trans); \
680 } while (bch2_err_matches(_ret2, BCH_ERR_transaction_restart)); \
683 bch2_trans_verify_not_restarted(_trans, _restart_count);\
689 * nested_lockrestart_do(), nested_commit_do():
691 * These are like lockrestart_do() and commit_do(), with two differences:
693 * - We don't call bch2_trans_begin() unless we had a transaction restart
694 * - We return -BCH_ERR_transaction_restart_nested if we succeeded after a
695 * transaction restart
697 #define nested_lockrestart_do(_trans, _do) \
699 u32 _restart_count, _orig_restart_count; \
702 _restart_count = _orig_restart_count = (_trans)->restart_count; \
704 while (bch2_err_matches(_ret2 = (_do), BCH_ERR_transaction_restart))\
705 _restart_count = bch2_trans_begin(_trans); \
708 bch2_trans_verify_not_restarted(_trans, _restart_count);\
710 _ret2 ?: trans_was_restarted(_trans, _restart_count); \
713 #define for_each_btree_key2(_trans, _iter, _btree_id, \
714 _start, _flags, _k, _do) \
718 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
719 (_start), (_flags)); \
722 u32 _restart_count = bch2_trans_begin(_trans); \
725 (_k) = bch2_btree_iter_peek_type(&(_iter), (_flags)); \
729 _ret3 = bkey_err(_k) ?: (_do); \
730 if (bch2_err_matches(_ret3, BCH_ERR_transaction_restart))\
734 bch2_trans_verify_not_restarted(_trans, _restart_count);\
735 if (!bch2_btree_iter_advance(&(_iter))) \
739 bch2_trans_iter_exit((_trans), &(_iter)); \
743 #define for_each_btree_key2_upto(_trans, _iter, _btree_id, \
744 _start, _end, _flags, _k, _do) \
748 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
749 (_start), (_flags)); \
752 u32 _restart_count = bch2_trans_begin(_trans); \
755 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, (_flags));\
759 _ret3 = bkey_err(_k) ?: (_do); \
760 if (bch2_err_matches(_ret3, BCH_ERR_transaction_restart))\
764 bch2_trans_verify_not_restarted(_trans, _restart_count);\
765 if (!bch2_btree_iter_advance(&(_iter))) \
769 bch2_trans_iter_exit((_trans), &(_iter)); \
773 #define for_each_btree_key_reverse(_trans, _iter, _btree_id, \
774 _start, _flags, _k, _do) \
778 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
779 (_start), (_flags)); \
782 u32 _restart_count = bch2_trans_begin(_trans); \
783 (_k) = bch2_btree_iter_peek_prev_type(&(_iter), (_flags));\
789 _ret3 = bkey_err(_k) ?: (_do); \
790 if (bch2_err_matches(_ret3, BCH_ERR_transaction_restart))\
794 bch2_trans_verify_not_restarted(_trans, _restart_count);\
795 if (!bch2_btree_iter_rewind(&(_iter))) \
799 bch2_trans_iter_exit((_trans), &(_iter)); \
803 #define for_each_btree_key_commit(_trans, _iter, _btree_id, \
804 _start, _iter_flags, _k, \
805 _disk_res, _journal_seq, _commit_flags,\
807 for_each_btree_key2(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
808 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
809 (_journal_seq), (_commit_flags)))
811 #define for_each_btree_key_reverse_commit(_trans, _iter, _btree_id, \
812 _start, _iter_flags, _k, \
813 _disk_res, _journal_seq, _commit_flags,\
815 for_each_btree_key_reverse(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
816 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
817 (_journal_seq), (_commit_flags)))
819 #define for_each_btree_key_upto_commit(_trans, _iter, _btree_id, \
820 _start, _end, _iter_flags, _k, \
821 _disk_res, _journal_seq, _commit_flags,\
823 for_each_btree_key2_upto(_trans, _iter, _btree_id, _start, _end, _iter_flags, _k,\
824 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
825 (_journal_seq), (_commit_flags)))
827 #define for_each_btree_key(_trans, _iter, _btree_id, \
828 _start, _flags, _k, _ret) \
829 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
830 (_start), (_flags)); \
831 (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
832 !((_ret) = bkey_err(_k)) && (_k).k; \
833 bch2_btree_iter_advance(&(_iter)))
835 #define for_each_btree_key_upto(_trans, _iter, _btree_id, \
836 _start, _end, _flags, _k, _ret) \
837 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
838 (_start), (_flags)); \
839 (_k) = __bch2_btree_iter_peek_upto_and_restart((_trans), \
840 &(_iter), _end, _flags),\
841 !((_ret) = bkey_err(_k)) && (_k).k; \
842 bch2_btree_iter_advance(&(_iter)))
844 #define for_each_btree_key_norestart(_trans, _iter, _btree_id, \
845 _start, _flags, _k, _ret) \
846 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
847 (_start), (_flags)); \
848 (_k) = bch2_btree_iter_peek_type(&(_iter), _flags), \
849 !((_ret) = bkey_err(_k)) && (_k).k; \
850 bch2_btree_iter_advance(&(_iter)))
852 #define for_each_btree_key_upto_norestart(_trans, _iter, _btree_id, \
853 _start, _end, _flags, _k, _ret) \
854 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
855 (_start), (_flags)); \
856 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),\
857 !((_ret) = bkey_err(_k)) && (_k).k; \
858 bch2_btree_iter_advance(&(_iter)))
860 #define for_each_btree_key_continue(_trans, _iter, _flags, _k, _ret) \
862 (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
863 !((_ret) = bkey_err(_k)) && (_k).k; \
864 bch2_btree_iter_advance(&(_iter)))
866 #define for_each_btree_key_continue_norestart(_iter, _flags, _k, _ret) \
868 (_k) = bch2_btree_iter_peek_type(&(_iter), _flags), \
869 !((_ret) = bkey_err(_k)) && (_k).k; \
870 bch2_btree_iter_advance(&(_iter)))
872 #define for_each_btree_key_upto_continue_norestart(_iter, _end, _flags, _k, _ret)\
874 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags), \
875 !((_ret) = bkey_err(_k)) && (_k).k; \
876 bch2_btree_iter_advance(&(_iter)))
878 #define drop_locks_do(_trans, _do) \
880 bch2_trans_unlock(_trans); \
881 _do ?: bch2_trans_relock(_trans); \
884 #define allocate_dropping_locks_errcode(_trans, _do) \
886 gfp_t _gfp = GFP_NOWAIT|__GFP_NOWARN; \
889 if (bch2_err_matches(_ret, ENOMEM)) { \
891 _ret = drop_locks_do(trans, _do); \
896 #define allocate_dropping_locks(_trans, _ret, _do) \
898 gfp_t _gfp = GFP_NOWAIT|__GFP_NOWARN; \
899 typeof(_do) _p = _do; \
902 if (unlikely(!_p)) { \
904 _ret = drop_locks_do(trans, ((_p = _do), 0)); \
909 /* new multiple iterator interface: */
911 void bch2_trans_updates_to_text(struct printbuf *, struct btree_trans *);
912 void bch2_btree_path_to_text(struct printbuf *, struct btree_path *);
913 void bch2_trans_paths_to_text(struct printbuf *, struct btree_trans *);
914 void bch2_dump_trans_updates(struct btree_trans *);
915 void bch2_dump_trans_paths_updates(struct btree_trans *);
917 struct btree_trans *__bch2_trans_get(struct bch_fs *, unsigned);
918 void bch2_trans_put(struct btree_trans *);
920 extern const char *bch2_btree_transaction_fns[BCH_TRANSACTIONS_NR];
921 unsigned bch2_trans_get_fn_idx(const char *);
923 #define bch2_trans_get(_c) \
925 static unsigned trans_fn_idx; \
927 if (unlikely(!trans_fn_idx)) \
928 trans_fn_idx = bch2_trans_get_fn_idx(__func__); \
929 __bch2_trans_get(_c, trans_fn_idx); \
932 void bch2_btree_trans_to_text(struct printbuf *, struct btree_trans *);
934 void bch2_fs_btree_iter_exit(struct bch_fs *);
935 int bch2_fs_btree_iter_init(struct bch_fs *);
937 #endif /* _BCACHEFS_BTREE_ITER_H */