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(_trans, _path, _idx) \
115 (_path = __trans_next_path_safe((_trans), &_idx)); \
118 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path)
120 unsigned idx = path ? path->sorted_idx + 1 : 0;
122 EBUG_ON(idx > trans->nr_sorted);
124 return idx < trans->nr_sorted
125 ? trans->paths + trans->sorted[idx]
129 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path)
131 unsigned idx = path ? path->sorted_idx : trans->nr_sorted;
134 ? trans->paths + trans->sorted[idx - 1]
138 #define trans_for_each_path_inorder(_trans, _path, _i) \
140 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) < (_trans)->nr_sorted;\
143 #define trans_for_each_path_inorder_reverse(_trans, _path, _i) \
144 for (_i = trans->nr_sorted - 1; \
145 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) >= 0;\
148 static inline bool __path_has_node(const struct btree_path *path,
149 const struct btree *b)
151 return path->l[b->c.level].b == b &&
152 btree_node_lock_seq_matches(path, b, b->c.level);
155 static inline struct btree_path *
156 __trans_next_path_with_node(struct btree_trans *trans, struct btree *b,
159 struct btree_path *path = __trans_next_path(trans, idx);
161 while (path && !__path_has_node(path, b))
162 path = __trans_next_path(trans, path->idx + 1);
167 #define trans_for_each_path_with_node(_trans, _b, _path) \
168 for (_path = __trans_next_path_with_node((_trans), (_b), 0); \
170 _path = __trans_next_path_with_node((_trans), (_b), \
173 struct btree_path *__bch2_btree_path_make_mut(struct btree_trans *, struct btree_path *,
174 bool, unsigned long);
176 static inline struct btree_path * __must_check
177 bch2_btree_path_make_mut(struct btree_trans *trans,
178 struct btree_path *path, bool intent,
181 if (path->ref > 1 || path->preserve)
182 path = __bch2_btree_path_make_mut(trans, path, intent, ip);
183 path->should_be_locked = false;
187 struct btree_path * __must_check
188 __bch2_btree_path_set_pos(struct btree_trans *, struct btree_path *,
189 struct bpos, bool, unsigned long, int);
191 static inline struct btree_path * __must_check
192 bch2_btree_path_set_pos(struct btree_trans *trans,
193 struct btree_path *path, struct bpos new_pos,
194 bool intent, unsigned long ip)
196 int cmp = bpos_cmp(new_pos, path->pos);
199 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip, cmp)
203 int __must_check bch2_btree_path_traverse_one(struct btree_trans *, struct btree_path *,
204 unsigned, unsigned long);
206 static inline int __must_check bch2_btree_path_traverse(struct btree_trans *trans,
207 struct btree_path *path, unsigned flags)
209 if (path->uptodate < BTREE_ITER_NEED_RELOCK)
212 return bch2_btree_path_traverse_one(trans, path, flags, _RET_IP_);
215 int __must_check bch2_btree_path_traverse(struct btree_trans *,
216 struct btree_path *, unsigned);
217 struct btree_path *bch2_path_get(struct btree_trans *, enum btree_id, struct bpos,
218 unsigned, unsigned, unsigned, unsigned long);
219 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *, struct bkey *);
221 struct bkey_i *bch2_btree_journal_peek_slot(struct btree_trans *,
222 struct btree_iter *, struct bpos);
224 void bch2_btree_path_level_init(struct btree_trans *, struct btree_path *, struct btree *);
226 int __bch2_trans_mutex_lock(struct btree_trans *, struct mutex *);
228 static inline int bch2_trans_mutex_lock(struct btree_trans *trans, struct mutex *lock)
230 return mutex_trylock(lock)
232 : __bch2_trans_mutex_lock(trans, lock);
235 #ifdef CONFIG_BCACHEFS_DEBUG
236 void bch2_trans_verify_paths(struct btree_trans *);
237 void bch2_assert_pos_locked(struct btree_trans *, enum btree_id,
240 static inline void bch2_trans_verify_paths(struct btree_trans *trans) {}
241 static inline void bch2_assert_pos_locked(struct btree_trans *trans, enum btree_id id,
242 struct bpos pos, bool key_cache) {}
245 void bch2_btree_path_fix_key_modified(struct btree_trans *trans,
246 struct btree *, struct bkey_packed *);
247 void bch2_btree_node_iter_fix(struct btree_trans *trans, struct btree_path *,
248 struct btree *, struct btree_node_iter *,
249 struct bkey_packed *, unsigned, unsigned);
251 int bch2_btree_path_relock_intent(struct btree_trans *, struct btree_path *);
253 void bch2_path_put(struct btree_trans *, struct btree_path *, bool);
255 int bch2_trans_relock(struct btree_trans *);
256 int bch2_trans_relock_notrace(struct btree_trans *);
257 void bch2_trans_unlock(struct btree_trans *);
258 bool bch2_trans_locked(struct btree_trans *);
260 static inline bool trans_was_restarted(struct btree_trans *trans, u32 restart_count)
262 return restart_count != trans->restart_count;
265 void bch2_trans_restart_error(struct btree_trans *, u32);
267 static inline void bch2_trans_verify_not_restarted(struct btree_trans *trans,
270 if (trans_was_restarted(trans, restart_count))
271 bch2_trans_restart_error(trans, restart_count);
274 void bch2_trans_in_restart_error(struct btree_trans *);
276 static inline void bch2_trans_verify_not_in_restart(struct btree_trans *trans)
278 if (trans->restarted)
279 bch2_trans_in_restart_error(trans);
283 static inline int btree_trans_restart_nounlock(struct btree_trans *trans, int err)
286 BUG_ON(!bch2_err_matches(err, BCH_ERR_transaction_restart));
288 trans->restarted = err;
289 trans->last_restarted_ip = _THIS_IP_;
294 static inline int btree_trans_restart(struct btree_trans *trans, int err)
296 btree_trans_restart_nounlock(trans, err);
300 bool bch2_btree_node_upgrade(struct btree_trans *,
301 struct btree_path *, unsigned);
303 void __bch2_btree_path_downgrade(struct btree_trans *, struct btree_path *, unsigned);
305 static inline void bch2_btree_path_downgrade(struct btree_trans *trans,
306 struct btree_path *path)
308 unsigned new_locks_want = path->level + !!path->intent_ref;
310 if (path->locks_want > new_locks_want)
311 __bch2_btree_path_downgrade(trans, path, new_locks_want);
314 void bch2_trans_downgrade(struct btree_trans *);
316 void bch2_trans_node_add(struct btree_trans *trans, struct btree *);
317 void bch2_trans_node_reinit_iter(struct btree_trans *, struct btree *);
319 int __must_check __bch2_btree_iter_traverse(struct btree_iter *iter);
320 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
322 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
323 struct btree *bch2_btree_iter_peek_node_and_restart(struct btree_iter *);
324 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
326 struct bkey_s_c bch2_btree_iter_peek_upto(struct btree_iter *, struct bpos);
327 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
329 struct bkey_s_c bch2_btree_iter_peek_all_levels(struct btree_iter *);
331 static inline struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *iter)
333 return bch2_btree_iter_peek_upto(iter, SPOS_MAX);
336 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *);
337 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
339 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
340 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
341 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
343 bool bch2_btree_iter_advance(struct btree_iter *);
344 bool bch2_btree_iter_rewind(struct btree_iter *);
346 static inline void __bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
348 iter->k.type = KEY_TYPE_deleted;
349 iter->k.p.inode = iter->pos.inode = new_pos.inode;
350 iter->k.p.offset = iter->pos.offset = new_pos.offset;
351 iter->k.p.snapshot = iter->pos.snapshot = new_pos.snapshot;
355 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
357 if (unlikely(iter->update_path))
358 bch2_path_put(iter->trans, iter->update_path,
359 iter->flags & BTREE_ITER_INTENT);
360 iter->update_path = NULL;
362 if (!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS))
363 new_pos.snapshot = iter->snapshot;
365 __bch2_btree_iter_set_pos(iter, new_pos);
368 static inline void bch2_btree_iter_set_pos_to_extent_start(struct btree_iter *iter)
370 BUG_ON(!(iter->flags & BTREE_ITER_IS_EXTENTS));
371 iter->pos = bkey_start_pos(&iter->k);
374 static inline void bch2_btree_iter_set_snapshot(struct btree_iter *iter, u32 snapshot)
376 struct bpos pos = iter->pos;
378 iter->snapshot = snapshot;
379 pos.snapshot = snapshot;
380 bch2_btree_iter_set_pos(iter, pos);
383 void bch2_trans_iter_exit(struct btree_trans *, struct btree_iter *);
385 static inline unsigned __bch2_btree_iter_flags(struct btree_trans *trans,
389 if (flags & BTREE_ITER_ALL_LEVELS)
390 flags |= BTREE_ITER_ALL_SNAPSHOTS|__BTREE_ITER_ALL_SNAPSHOTS;
392 if (!(flags & (BTREE_ITER_ALL_SNAPSHOTS|BTREE_ITER_NOT_EXTENTS)) &&
393 btree_node_type_is_extents(btree_id))
394 flags |= BTREE_ITER_IS_EXTENTS;
396 if (!(flags & __BTREE_ITER_ALL_SNAPSHOTS) &&
397 !btree_type_has_snapshots(btree_id))
398 flags &= ~BTREE_ITER_ALL_SNAPSHOTS;
400 if (!(flags & BTREE_ITER_ALL_SNAPSHOTS) &&
401 btree_type_has_snapshots(btree_id))
402 flags |= BTREE_ITER_FILTER_SNAPSHOTS;
404 if (trans->journal_replay_not_finished)
405 flags |= BTREE_ITER_WITH_JOURNAL;
410 static inline unsigned bch2_btree_iter_flags(struct btree_trans *trans,
414 if (!btree_id_cached(trans->c, btree_id)) {
415 flags &= ~BTREE_ITER_CACHED;
416 flags &= ~BTREE_ITER_WITH_KEY_CACHE;
417 } else if (!(flags & BTREE_ITER_CACHED))
418 flags |= BTREE_ITER_WITH_KEY_CACHE;
420 return __bch2_btree_iter_flags(trans, btree_id, flags);
423 static inline void bch2_trans_iter_init_common(struct btree_trans *trans,
424 struct btree_iter *iter,
425 unsigned btree_id, struct bpos pos,
431 memset(iter, 0, sizeof(*iter));
433 iter->btree_id = btree_id;
435 iter->snapshot = pos.snapshot;
439 #ifdef CONFIG_BCACHEFS_DEBUG
440 iter->ip_allocated = ip;
442 iter->path = bch2_path_get(trans, btree_id, iter->pos,
443 locks_want, depth, flags, ip);
446 void bch2_trans_iter_init_outlined(struct btree_trans *, struct btree_iter *,
447 unsigned, struct bpos, unsigned);
449 static inline void bch2_trans_iter_init(struct btree_trans *trans,
450 struct btree_iter *iter,
451 unsigned btree_id, struct bpos pos,
454 if (__builtin_constant_p(btree_id) &&
455 __builtin_constant_p(flags))
456 bch2_trans_iter_init_common(trans, iter, btree_id, pos, 0, 0,
457 bch2_btree_iter_flags(trans, btree_id, flags),
460 bch2_trans_iter_init_outlined(trans, iter, btree_id, pos, flags);
463 void bch2_trans_node_iter_init(struct btree_trans *, struct btree_iter *,
464 enum btree_id, struct bpos,
465 unsigned, unsigned, unsigned);
466 void bch2_trans_copy_iter(struct btree_iter *, struct btree_iter *);
468 static inline void set_btree_iter_dontneed(struct btree_iter *iter)
470 if (!iter->trans->restarted)
471 iter->path->preserve = false;
474 void *__bch2_trans_kmalloc(struct btree_trans *, size_t);
476 static inline void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size)
478 size = roundup(size, 8);
480 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
481 void *p = trans->mem + trans->mem_top;
483 trans->mem_top += size;
487 return __bch2_trans_kmalloc(trans, size);
491 static inline void *bch2_trans_kmalloc_nomemzero(struct btree_trans *trans, size_t size)
493 size = roundup(size, 8);
495 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
496 void *p = trans->mem + trans->mem_top;
498 trans->mem_top += size;
501 return __bch2_trans_kmalloc(trans, size);
505 static inline struct bkey_s_c __bch2_bkey_get_iter(struct btree_trans *trans,
506 struct btree_iter *iter,
507 unsigned btree_id, struct bpos pos,
508 unsigned flags, unsigned type)
512 bch2_trans_iter_init(trans, iter, btree_id, pos, flags);
513 k = bch2_btree_iter_peek_slot(iter);
515 if (!bkey_err(k) && type && k.k->type != type)
516 k = bkey_s_c_err(-BCH_ERR_ENOENT_bkey_type_mismatch);
517 if (unlikely(bkey_err(k)))
518 bch2_trans_iter_exit(trans, iter);
522 static inline struct bkey_s_c bch2_bkey_get_iter(struct btree_trans *trans,
523 struct btree_iter *iter,
524 unsigned btree_id, struct bpos pos,
527 return __bch2_bkey_get_iter(trans, iter, btree_id, pos, flags, 0);
530 #define bch2_bkey_get_iter_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\
531 bkey_s_c_to_##_type(__bch2_bkey_get_iter(_trans, _iter, \
532 _btree_id, _pos, _flags, KEY_TYPE_##_type))
534 static inline int __bch2_bkey_get_val_typed(struct btree_trans *trans,
535 unsigned btree_id, struct bpos pos,
536 unsigned flags, unsigned type,
537 unsigned val_size, void *val)
539 struct btree_iter iter;
543 k = __bch2_bkey_get_iter(trans, &iter, btree_id, pos, flags, type);
546 unsigned b = min_t(unsigned, bkey_val_bytes(k.k), val_size);
549 if (unlikely(b < sizeof(*val)))
550 memset((void *) val + b, 0, sizeof(*val) - b);
551 bch2_trans_iter_exit(trans, &iter);
557 #define bch2_bkey_get_val_typed(_trans, _btree_id, _pos, _flags, _type, _val)\
558 __bch2_bkey_get_val_typed(_trans, _btree_id, _pos, _flags, \
559 KEY_TYPE_##_type, sizeof(*_val), _val)
561 u32 bch2_trans_begin(struct btree_trans *);
565 * this does not handle transaction restarts from bch2_btree_iter_next_node()
568 #define __for_each_btree_node(_trans, _iter, _btree_id, _start, \
569 _locks_want, _depth, _flags, _b, _ret) \
570 for (bch2_trans_node_iter_init((_trans), &(_iter), (_btree_id), \
571 _start, _locks_want, _depth, _flags); \
572 (_b) = bch2_btree_iter_peek_node_and_restart(&(_iter)), \
573 !((_ret) = PTR_ERR_OR_ZERO(_b)) && (_b); \
574 (_b) = bch2_btree_iter_next_node(&(_iter)))
576 #define for_each_btree_node(_trans, _iter, _btree_id, _start, \
578 __for_each_btree_node(_trans, _iter, _btree_id, _start, \
579 0, 0, _flags, _b, _ret)
581 static inline struct bkey_s_c bch2_btree_iter_peek_prev_type(struct btree_iter *iter,
584 BUG_ON(flags & BTREE_ITER_ALL_LEVELS);
586 return flags & BTREE_ITER_SLOTS ? bch2_btree_iter_peek_slot(iter) :
587 bch2_btree_iter_peek_prev(iter);
590 static inline struct bkey_s_c bch2_btree_iter_peek_type(struct btree_iter *iter,
593 return flags & BTREE_ITER_ALL_LEVELS ? bch2_btree_iter_peek_all_levels(iter) :
594 flags & BTREE_ITER_SLOTS ? bch2_btree_iter_peek_slot(iter) :
595 bch2_btree_iter_peek(iter);
598 static inline struct bkey_s_c bch2_btree_iter_peek_upto_type(struct btree_iter *iter,
602 if (!(flags & BTREE_ITER_SLOTS))
603 return bch2_btree_iter_peek_upto(iter, end);
605 if (bkey_gt(iter->pos, end))
606 return bkey_s_c_null;
608 return bch2_btree_iter_peek_slot(iter);
611 static inline int btree_trans_too_many_iters(struct btree_trans *trans)
613 if (hweight64(trans->paths_allocated) > BTREE_ITER_MAX - 8) {
614 trace_and_count(trans->c, trans_restart_too_many_iters, trans, _THIS_IP_);
615 return btree_trans_restart(trans, BCH_ERR_transaction_restart_too_many_iters);
621 struct bkey_s_c bch2_btree_iter_peek_and_restart_outlined(struct btree_iter *);
623 static inline struct bkey_s_c
624 __bch2_btree_iter_peek_and_restart(struct btree_trans *trans,
625 struct btree_iter *iter, unsigned flags)
629 while (btree_trans_too_many_iters(trans) ||
630 (k = bch2_btree_iter_peek_type(iter, flags),
631 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
632 bch2_trans_begin(trans);
637 static inline struct bkey_s_c
638 __bch2_btree_iter_peek_upto_and_restart(struct btree_trans *trans,
639 struct btree_iter *iter,
645 while (btree_trans_too_many_iters(trans) ||
646 (k = bch2_btree_iter_peek_upto_type(iter, end, flags),
647 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
648 bch2_trans_begin(trans);
653 #define lockrestart_do(_trans, _do) \
655 u32 _restart_count; \
659 _restart_count = bch2_trans_begin(_trans); \
661 } while (bch2_err_matches(_ret, BCH_ERR_transaction_restart)); \
664 bch2_trans_verify_not_restarted(_trans, _restart_count);\
670 * nested_lockrestart_do(), nested_commit_do():
672 * These are like lockrestart_do() and commit_do(), with two differences:
674 * - We don't call bch2_trans_begin() unless we had a transaction restart
675 * - We return -BCH_ERR_transaction_restart_nested if we succeeded after a
676 * transaction restart
678 #define nested_lockrestart_do(_trans, _do) \
680 u32 _restart_count, _orig_restart_count; \
683 _restart_count = _orig_restart_count = (_trans)->restart_count; \
685 while (bch2_err_matches(_ret = (_do), BCH_ERR_transaction_restart))\
686 _restart_count = bch2_trans_begin(_trans); \
689 bch2_trans_verify_not_restarted(_trans, _restart_count);\
691 if (!_ret && trans_was_restarted(_trans, _orig_restart_count)) \
692 _ret = -BCH_ERR_transaction_restart_nested; \
697 #define for_each_btree_key2(_trans, _iter, _btree_id, \
698 _start, _flags, _k, _do) \
702 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
703 (_start), (_flags)); \
706 u32 _restart_count = bch2_trans_begin(_trans); \
709 (_k) = bch2_btree_iter_peek_type(&(_iter), (_flags)); \
713 _ret = bkey_err(_k) ?: (_do); \
714 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
718 bch2_trans_verify_not_restarted(_trans, _restart_count);\
719 if (!bch2_btree_iter_advance(&(_iter))) \
723 bch2_trans_iter_exit((_trans), &(_iter)); \
727 #define for_each_btree_key2_upto(_trans, _iter, _btree_id, \
728 _start, _end, _flags, _k, _do) \
732 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
733 (_start), (_flags)); \
736 u32 _restart_count = bch2_trans_begin(_trans); \
739 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, (_flags));\
743 _ret = bkey_err(_k) ?: (_do); \
744 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
748 bch2_trans_verify_not_restarted(_trans, _restart_count);\
749 if (!bch2_btree_iter_advance(&(_iter))) \
753 bch2_trans_iter_exit((_trans), &(_iter)); \
757 #define for_each_btree_key_reverse(_trans, _iter, _btree_id, \
758 _start, _flags, _k, _do) \
762 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
763 (_start), (_flags)); \
766 u32 _restart_count = bch2_trans_begin(_trans); \
767 (_k) = bch2_btree_iter_peek_prev_type(&(_iter), (_flags));\
773 _ret = bkey_err(_k) ?: (_do); \
774 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
778 bch2_trans_verify_not_restarted(_trans, _restart_count);\
779 if (!bch2_btree_iter_rewind(&(_iter))) \
783 bch2_trans_iter_exit((_trans), &(_iter)); \
787 #define for_each_btree_key_commit(_trans, _iter, _btree_id, \
788 _start, _iter_flags, _k, \
789 _disk_res, _journal_seq, _commit_flags,\
791 for_each_btree_key2(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
792 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
793 (_journal_seq), (_commit_flags)))
795 #define for_each_btree_key_upto_commit(_trans, _iter, _btree_id, \
796 _start, _end, _iter_flags, _k, \
797 _disk_res, _journal_seq, _commit_flags,\
799 for_each_btree_key2_upto(_trans, _iter, _btree_id, _start, _end, _iter_flags, _k,\
800 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
801 (_journal_seq), (_commit_flags)))
803 #define for_each_btree_key(_trans, _iter, _btree_id, \
804 _start, _flags, _k, _ret) \
805 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
806 (_start), (_flags)); \
807 (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
808 !((_ret) = bkey_err(_k)) && (_k).k; \
809 bch2_btree_iter_advance(&(_iter)))
811 #define for_each_btree_key_upto(_trans, _iter, _btree_id, \
812 _start, _end, _flags, _k, _ret) \
813 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
814 (_start), (_flags)); \
815 (_k) = __bch2_btree_iter_peek_upto_and_restart((_trans), \
816 &(_iter), _end, _flags),\
817 !((_ret) = bkey_err(_k)) && (_k).k; \
818 bch2_btree_iter_advance(&(_iter)))
820 #define for_each_btree_key_norestart(_trans, _iter, _btree_id, \
821 _start, _flags, _k, _ret) \
822 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
823 (_start), (_flags)); \
824 (_k) = bch2_btree_iter_peek_type(&(_iter), _flags), \
825 !((_ret) = bkey_err(_k)) && (_k).k; \
826 bch2_btree_iter_advance(&(_iter)))
828 #define for_each_btree_key_upto_norestart(_trans, _iter, _btree_id, \
829 _start, _end, _flags, _k, _ret) \
830 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
831 (_start), (_flags)); \
832 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),\
833 !((_ret) = bkey_err(_k)) && (_k).k; \
834 bch2_btree_iter_advance(&(_iter)))
836 #define for_each_btree_key_continue(_trans, _iter, _flags, _k, _ret) \
838 (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
839 !((_ret) = bkey_err(_k)) && (_k).k; \
840 bch2_btree_iter_advance(&(_iter)))
842 #define for_each_btree_key_continue_norestart(_iter, _flags, _k, _ret) \
844 (_k) = bch2_btree_iter_peek_type(&(_iter), _flags), \
845 !((_ret) = bkey_err(_k)) && (_k).k; \
846 bch2_btree_iter_advance(&(_iter)))
848 #define for_each_btree_key_upto_continue_norestart(_iter, _end, _flags, _k, _ret)\
850 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags), \
851 !((_ret) = bkey_err(_k)) && (_k).k; \
852 bch2_btree_iter_advance(&(_iter)))
854 #define drop_locks_do(_trans, _do) \
856 bch2_trans_unlock(_trans); \
857 _do ?: bch2_trans_relock(_trans); \
860 #define allocate_dropping_locks_errcode(_trans, _do) \
862 gfp_t _gfp = GFP_NOWAIT|__GFP_NOWARN; \
865 if (bch2_err_matches(_ret, ENOMEM)) { \
867 _ret = drop_locks_do(trans, _do); \
872 #define allocate_dropping_locks(_trans, _ret, _do) \
874 gfp_t _gfp = GFP_NOWAIT|__GFP_NOWARN; \
875 typeof(_do) _p = _do; \
878 if (unlikely(!_p)) { \
880 _ret = drop_locks_do(trans, ((_p = _do), 0)); \
885 /* new multiple iterator interface: */
887 void bch2_trans_updates_to_text(struct printbuf *, struct btree_trans *);
888 void bch2_btree_path_to_text(struct printbuf *, struct btree_path *);
889 void bch2_trans_paths_to_text(struct printbuf *, struct btree_trans *);
890 void bch2_dump_trans_updates(struct btree_trans *);
891 void bch2_dump_trans_paths_updates(struct btree_trans *);
892 void __bch2_trans_init(struct btree_trans *, struct bch_fs *, unsigned);
893 void bch2_trans_exit(struct btree_trans *);
895 extern const char *bch2_btree_transaction_fns[BCH_TRANSACTIONS_NR];
896 unsigned bch2_trans_get_fn_idx(const char *);
898 #define bch2_trans_init(_trans, _c, _nr_iters, _mem) \
900 static unsigned trans_fn_idx; \
902 if (unlikely(!trans_fn_idx)) \
903 trans_fn_idx = bch2_trans_get_fn_idx(__func__); \
905 __bch2_trans_init(_trans, _c, trans_fn_idx); \
908 void bch2_btree_trans_to_text(struct printbuf *, struct btree_trans *);
910 void bch2_fs_btree_iter_exit(struct bch_fs *);
911 int bch2_fs_btree_iter_init(struct bch_fs *);
913 #endif /* _BCACHEFS_BTREE_ITER_H */