git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/btree_iter.h

   1 /* SPDX-License-Identifier: GPL-2.0 */
   2 #ifndef _BCACHEFS_BTREE_ITER_H
   3 #define _BCACHEFS_BTREE_ITER_H
   4
   5 #include "bset.h"
   6 #include "btree_types.h"
   7
   8 #include <trace/events/bcachefs.h>
   9
  10 static inline void __btree_path_get(struct btree_path *path, bool intent)
  11 {
  12         path->ref++;
  13         path->intent_ref += intent;
  14 }
  15
  16 static inline bool __btree_path_put(struct btree_path *path, bool intent)
  17 {
  18         EBUG_ON(!path->ref);
  19         EBUG_ON(!path->intent_ref && intent);
  20         path->intent_ref -= intent;
  21         return --path->ref == 0;
  22 }
  23
  24 static inline void btree_path_set_dirty(struct btree_path *path,
  25                                         enum btree_path_uptodate u)
  26 {
  27         path->uptodate = max_t(unsigned, path->uptodate, u);
  28 }
  29
  30 static inline struct btree *btree_path_node(struct btree_path *path,
  31                                             unsigned level)
  32 {
  33         return level < BTREE_MAX_DEPTH ? path->l[level].b : NULL;
  34 }
  35
  36 static inline bool btree_node_lock_seq_matches(const struct btree_path *path,
  37                                         const struct btree *b, unsigned level)
  38 {
  39         /*
  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:
  45          */
  46         return path->l[level].lock_seq >> 1 == b->c.lock.state.seq >> 1;
  47 }
  48
  49 static inline struct btree *btree_node_parent(struct btree_path *path,
  50                                               struct btree *b)
  51 {
  52         return btree_path_node(path, b->c.level + 1);
  53 }
  54
  55 /* Iterate over paths within a transaction: */
  56
  57 static inline struct btree_path *
  58 __trans_next_path(struct btree_trans *trans, unsigned idx)
  59 {
  60         u64 l;
  61
  62         if (idx == BTREE_ITER_MAX)
  63                 return NULL;
  64
  65         l = trans->paths_allocated >> idx;
  66         if (!l)
  67                 return NULL;
  68
  69         idx += __ffs64(l);
  70         EBUG_ON(idx >= BTREE_ITER_MAX);
  71         EBUG_ON(trans->paths[idx].idx != idx);
  72         return &trans->paths[idx];
  73 }
  74
  75 void bch2_btree_path_check_sort(struct btree_trans *, struct btree_path *, int);
  76
  77 #define trans_for_each_path_from(_trans, _path, _start)                 \
  78         for (_path = __trans_next_path((_trans), _start);               \
  79              (_path);                                                   \
  80              _path = __trans_next_path((_trans), (_path)->idx + 1))
  81
  82 #define trans_for_each_path(_trans, _path)                              \
  83         trans_for_each_path_from(_trans, _path, 0)
  84
  85 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path)
  86 {
  87         unsigned idx = path ? path->sorted_idx + 1 : 0;
  88
  89         EBUG_ON(idx > trans->nr_sorted);
  90
  91         return idx < trans->nr_sorted
  92                 ? trans->paths + trans->sorted[idx]
  93                 : NULL;
  94 }
  95
  96 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path)
  97 {
  98         EBUG_ON(path->sorted_idx >= trans->nr_sorted);
  99         return path->sorted_idx
 100                 ? trans->paths + trans->sorted[path->sorted_idx - 1]
 101                 : NULL;
 102 }
 103
 104 #define trans_for_each_path_inorder(_trans, _path, _i)                  \
 105         for (_i = 0;                                                    \
 106              ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) < (_trans)->nr_sorted;\
 107              _i++)
 108
 109 static inline bool __path_has_node(const struct btree_path *path,
 110                                    const struct btree *b)
 111 {
 112         return path->l[b->c.level].b == b &&
 113                 btree_node_lock_seq_matches(path, b, b->c.level);
 114 }
 115
 116 static inline struct btree_path *
 117 __trans_next_path_with_node(struct btree_trans *trans, struct btree *b,
 118                             unsigned idx)
 119 {
 120         struct btree_path *path = __trans_next_path(trans, idx);
 121
 122         while (path && !__path_has_node(path, b))
 123                 path = __trans_next_path(trans, path->idx + 1);
 124
 125         return path;
 126 }
 127
 128 #define trans_for_each_path_with_node(_trans, _b, _path)                \
 129         for (_path = __trans_next_path_with_node((_trans), (_b), 0);    \
 130              (_path);                                                   \
 131              _path = __trans_next_path_with_node((_trans), (_b),        \
 132                                                  (_path)->idx + 1))
 133
 134 struct btree_path *__bch2_btree_path_make_mut(struct btree_trans *, struct btree_path *,
 135                          bool, unsigned long);
 136
 137 static inline struct btree_path * __must_check
 138 bch2_btree_path_make_mut(struct btree_trans *trans,
 139                          struct btree_path *path, bool intent,
 140                          unsigned long ip)
 141 {
 142         if (path->ref > 1 || path->preserve)
 143                 path = __bch2_btree_path_make_mut(trans, path, intent, ip);
 144         path->should_be_locked = false;
 145         return path;
 146 }
 147
 148 struct btree_path * __must_check
 149 __bch2_btree_path_set_pos(struct btree_trans *, struct btree_path *,
 150                         struct bpos, bool, unsigned long, int);
 151
 152 static inline struct btree_path * __must_check
 153 bch2_btree_path_set_pos(struct btree_trans *trans,
 154                    struct btree_path *path, struct bpos new_pos,
 155                    bool intent, unsigned long ip)
 156 {
 157         int cmp = bpos_cmp(new_pos, path->pos);
 158
 159         return cmp
 160                 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip, cmp)
 161                 : path;
 162 }
 163
 164 int __must_check bch2_btree_path_traverse(struct btree_trans *,
 165                                           struct btree_path *, unsigned);
 166 struct btree_path *bch2_path_get(struct btree_trans *, enum btree_id, struct bpos,
 167                                  unsigned, unsigned, unsigned, unsigned long);
 168 inline struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *, struct bkey *);
 169
 170 struct bkey_i *bch2_btree_journal_peek_slot(struct btree_trans *,
 171                                         struct btree_iter *, struct bpos);
 172
 173 inline void bch2_btree_path_level_init(struct btree_trans *,
 174                                        struct btree_path *, struct btree *);
 175
 176 #ifdef CONFIG_BCACHEFS_DEBUG
 177 void bch2_trans_verify_paths(struct btree_trans *);
 178 void bch2_assert_pos_locked(struct btree_trans *, enum btree_id,
 179                             struct bpos, bool);
 180 #else
 181 static inline void bch2_trans_verify_paths(struct btree_trans *trans) {}
 182 static inline void bch2_assert_pos_locked(struct btree_trans *trans, enum btree_id id,
 183                                           struct bpos pos, bool key_cache) {}
 184 #endif
 185
 186 void bch2_btree_path_fix_key_modified(struct btree_trans *trans,
 187                                       struct btree *, struct bkey_packed *);
 188 void bch2_btree_node_iter_fix(struct btree_trans *trans, struct btree_path *,
 189                               struct btree *, struct btree_node_iter *,
 190                               struct bkey_packed *, unsigned, unsigned);
 191
 192 int bch2_btree_path_relock_intent(struct btree_trans *, struct btree_path *);
 193
 194 void bch2_path_put(struct btree_trans *, struct btree_path *, bool);
 195
 196 int bch2_trans_relock(struct btree_trans *);
 197 void bch2_trans_unlock(struct btree_trans *);
 198 bool bch2_trans_locked(struct btree_trans *);
 199
 200 static inline bool trans_was_restarted(struct btree_trans *trans, u32 restart_count)
 201 {
 202         return restart_count != trans->restart_count;
 203 }
 204
 205 void bch2_trans_verify_not_restarted(struct btree_trans *, u32);
 206
 207 __always_inline
 208 static inline int btree_trans_restart_nounlock(struct btree_trans *trans, int err)
 209 {
 210         BUG_ON(err <= 0);
 211         BUG_ON(!bch2_err_matches(err, BCH_ERR_transaction_restart));
 212
 213         trans->restarted = err;
 214         return -err;
 215 }
 216
 217 __always_inline
 218 static inline int btree_trans_restart(struct btree_trans *trans, int err)
 219 {
 220         btree_trans_restart_nounlock(trans, err);
 221         return -err;
 222 }
 223
 224 bool bch2_btree_node_upgrade(struct btree_trans *,
 225                              struct btree_path *, unsigned);
 226
 227 void __bch2_btree_path_downgrade(struct btree_trans *, struct btree_path *, unsigned);
 228
 229 static inline void bch2_btree_path_downgrade(struct btree_trans *trans,
 230                                              struct btree_path *path)
 231 {
 232         unsigned new_locks_want = path->level + !!path->intent_ref;
 233
 234         if (path->locks_want > new_locks_want)
 235                 __bch2_btree_path_downgrade(trans, path, new_locks_want);
 236 }
 237
 238 void bch2_trans_downgrade(struct btree_trans *);
 239
 240 void bch2_trans_node_add(struct btree_trans *trans, struct btree *);
 241 void bch2_trans_node_reinit_iter(struct btree_trans *, struct btree *);
 242
 243 int __must_check __bch2_btree_iter_traverse(struct btree_iter *iter);
 244 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
 245
 246 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
 247 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
 248
 249 struct bkey_s_c bch2_btree_iter_peek_upto(struct btree_iter *, struct bpos);
 250 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
 251
 252 struct bkey_s_c bch2_btree_iter_peek_all_levels(struct btree_iter *);
 253
 254 static inline struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *iter)
 255 {
 256         return bch2_btree_iter_peek_upto(iter, SPOS_MAX);
 257 }
 258
 259 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *);
 260 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
 261
 262 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
 263 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
 264 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
 265
 266 bool bch2_btree_iter_advance(struct btree_iter *);
 267 bool bch2_btree_iter_rewind(struct btree_iter *);
 268
 269 static inline void __bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
 270 {
 271         iter->k.type = KEY_TYPE_deleted;
 272         iter->k.p.inode         = iter->pos.inode       = new_pos.inode;
 273         iter->k.p.offset        = iter->pos.offset      = new_pos.offset;
 274         iter->k.p.snapshot      = iter->pos.snapshot    = new_pos.snapshot;
 275         iter->k.size = 0;
 276 }
 277
 278 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
 279 {
 280         if (unlikely(iter->update_path))
 281                 bch2_path_put(iter->trans, iter->update_path,
 282                               iter->flags & BTREE_ITER_INTENT);
 283         iter->update_path = NULL;
 284
 285         if (!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS))
 286                 new_pos.snapshot = iter->snapshot;
 287
 288         __bch2_btree_iter_set_pos(iter, new_pos);
 289 }
 290
 291 static inline void bch2_btree_iter_set_pos_to_extent_start(struct btree_iter *iter)
 292 {
 293         BUG_ON(!(iter->flags & BTREE_ITER_IS_EXTENTS));
 294         iter->pos = bkey_start_pos(&iter->k);
 295 }
 296
 297 static inline void bch2_btree_iter_set_snapshot(struct btree_iter *iter, u32 snapshot)
 298 {
 299         struct bpos pos = iter->pos;
 300
 301         iter->snapshot = snapshot;
 302         pos.snapshot = snapshot;
 303         bch2_btree_iter_set_pos(iter, pos);
 304 }
 305
 306 void bch2_trans_iter_exit(struct btree_trans *, struct btree_iter *);
 307 void bch2_trans_iter_init(struct btree_trans *, struct btree_iter *,
 308                           unsigned, struct bpos, unsigned);
 309 void bch2_trans_node_iter_init(struct btree_trans *, struct btree_iter *,
 310                                enum btree_id, struct bpos,
 311                                unsigned, unsigned, unsigned);
 312 void bch2_trans_copy_iter(struct btree_iter *, struct btree_iter *);
 313
 314 static inline void set_btree_iter_dontneed(struct btree_iter *iter)
 315 {
 316         if (!iter->trans->restarted)
 317                 iter->path->preserve = false;
 318 }
 319
 320 void *__bch2_trans_kmalloc(struct btree_trans *, size_t);
 321
 322 static inline void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size)
 323 {
 324         unsigned new_top = trans->mem_top + size;
 325         void *p = trans->mem + trans->mem_top;
 326
 327         if (likely(new_top <= trans->mem_bytes)) {
 328                 trans->mem_top += size;
 329                 memset(p, 0, size);
 330                 return p;
 331         } else {
 332                 return __bch2_trans_kmalloc(trans, size);
 333
 334         }
 335 }
 336
 337 u32 bch2_trans_begin(struct btree_trans *);
 338
 339 static inline struct btree *
 340 __btree_iter_peek_node_and_restart(struct btree_trans *trans, struct btree_iter *iter)
 341 {
 342         struct btree *b;
 343
 344         while (b = bch2_btree_iter_peek_node(iter),
 345                bch2_err_matches(PTR_ERR_OR_ZERO(b), BCH_ERR_transaction_restart))
 346                 bch2_trans_begin(trans);
 347
 348         return b;
 349 }
 350
 351 #define __for_each_btree_node(_trans, _iter, _btree_id, _start,         \
 352                               _locks_want, _depth, _flags, _b, _ret)    \
 353         for (bch2_trans_node_iter_init((_trans), &(_iter), (_btree_id), \
 354                                 _start, _locks_want, _depth, _flags);   \
 355              (_b) = __btree_iter_peek_node_and_restart((_trans), &(_iter)),\
 356              !((_ret) = PTR_ERR_OR_ZERO(_b)) && (_b);                   \
 357              (_b) = bch2_btree_iter_next_node(&(_iter)))
 358
 359 #define for_each_btree_node(_trans, _iter, _btree_id, _start,           \
 360                             _flags, _b, _ret)                           \
 361         __for_each_btree_node(_trans, _iter, _btree_id, _start,         \
 362                               0, 0, _flags, _b, _ret)
 363
 364 static inline int bkey_err(struct bkey_s_c k)
 365 {
 366         return PTR_ERR_OR_ZERO(k.k);
 367 }
 368
 369 static inline struct bkey_s_c bch2_btree_iter_peek_prev_type(struct btree_iter *iter,
 370                                                              unsigned flags)
 371 {
 372         BUG_ON(flags & BTREE_ITER_ALL_LEVELS);
 373
 374         return  flags & BTREE_ITER_SLOTS      ? bch2_btree_iter_peek_slot(iter) :
 375                                                 bch2_btree_iter_peek_prev(iter);
 376 }
 377
 378 static inline struct bkey_s_c bch2_btree_iter_peek_type(struct btree_iter *iter,
 379                                                         unsigned flags)
 380 {
 381         return  flags & BTREE_ITER_ALL_LEVELS ? bch2_btree_iter_peek_all_levels(iter) :
 382                 flags & BTREE_ITER_SLOTS      ? bch2_btree_iter_peek_slot(iter) :
 383                                                 bch2_btree_iter_peek(iter);
 384 }
 385
 386 static inline struct bkey_s_c bch2_btree_iter_peek_upto_type(struct btree_iter *iter,
 387                                                              struct bpos end,
 388                                                              unsigned flags)
 389 {
 390         if (!(flags & BTREE_ITER_SLOTS))
 391                 return bch2_btree_iter_peek_upto(iter, end);
 392
 393         if (bkey_cmp(iter->pos, end) > 0)
 394                 return bkey_s_c_null;
 395
 396         return bch2_btree_iter_peek_slot(iter);
 397 }
 398
 399 static inline int btree_trans_too_many_iters(struct btree_trans *trans)
 400 {
 401         if (hweight64(trans->paths_allocated) > BTREE_ITER_MAX - 8) {
 402                 trace_and_count(trans->c, trans_restart_too_many_iters, trans, _THIS_IP_);
 403                 return btree_trans_restart(trans, BCH_ERR_transaction_restart_too_many_iters);
 404         }
 405
 406         return 0;
 407 }
 408
 409 static inline struct bkey_s_c
 410 __bch2_btree_iter_peek_and_restart(struct btree_trans *trans,
 411                                    struct btree_iter *iter, unsigned flags)
 412 {
 413         struct bkey_s_c k;
 414
 415         while (btree_trans_too_many_iters(trans) ||
 416                (k = bch2_btree_iter_peek_type(iter, flags),
 417                 bch2_err_matches(bkey_err(k), BCH_ERR_transaction_restart)))
 418                 bch2_trans_begin(trans);
 419
 420         return k;
 421 }
 422
 423 #define lockrestart_do(_trans, _do)                                     \
 424 ({                                                                      \
 425         u32 _restart_count;                                             \
 426         int _ret;                                                       \
 427                                                                         \
 428         do {                                                            \
 429                 _restart_count = bch2_trans_begin(_trans);              \
 430                 _ret = (_do);                                           \
 431         } while (bch2_err_matches(_ret, BCH_ERR_transaction_restart));  \
 432                                                                         \
 433         if (!_ret)                                                      \
 434                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 435                                                                         \
 436         _ret;                                                           \
 437 })
 438
 439 /*
 440  * nested_lockrestart_do(), nested_commit_do():
 441  *
 442  * These are like lockrestart_do() and commit_do(), with two differences:
 443  *
 444  *  - We don't call bch2_trans_begin() unless we had a transaction restart
 445  *  - We return -BCH_ERR_transaction_restart_nested if we succeeded after a
 446  *  transaction restart
 447  */
 448 #define nested_lockrestart_do(_trans, _do)                              \
 449 ({                                                                      \
 450         u32 _restart_count, _orig_restart_count;                        \
 451         int _ret;                                                       \
 452                                                                         \
 453         _restart_count = _orig_restart_count = (_trans)->restart_count; \
 454                                                                         \
 455         while (bch2_err_matches(_ret = (_do), BCH_ERR_transaction_restart))\
 456                 _restart_count = bch2_trans_begin(_trans);              \
 457                                                                         \
 458         if (!_ret)                                                      \
 459                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 460                                                                         \
 461         if (!_ret && trans_was_restarted(_trans, _orig_restart_count))  \
 462                 _ret = -BCH_ERR_transaction_restart_nested;             \
 463                                                                         \
 464         _ret;                                                           \
 465 })
 466
 467 #define for_each_btree_key2(_trans, _iter, _btree_id,                   \
 468                             _start, _flags, _k, _do)                    \
 469 ({                                                                      \
 470         int _ret = 0;                                                   \
 471                                                                         \
 472         bch2_trans_iter_init((_trans), &(_iter), (_btree_id),           \
 473                              (_start), (_flags));                       \
 474                                                                         \
 475         while (1) {                                                     \
 476                 u32 _restart_count = bch2_trans_begin(_trans);          \
 477                 (_k) = bch2_btree_iter_peek_type(&(_iter), (_flags));   \
 478                 if (!(_k).k) {                                          \
 479                         _ret = 0;                                       \
 480                         break;                                          \
 481                 }                                                       \
 482                                                                         \
 483                 _ret = bkey_err(_k) ?: (_do);                           \
 484                 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
 485                         continue;                                       \
 486                 if (_ret)                                               \
 487                         break;                                          \
 488                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 489                 if (!bch2_btree_iter_advance(&(_iter)))                 \
 490                         break;                                          \
 491         }                                                               \
 492                                                                         \
 493         bch2_trans_iter_exit((_trans), &(_iter));                       \
 494         _ret;                                                           \
 495 })
 496
 497 #define for_each_btree_key_reverse(_trans, _iter, _btree_id,            \
 498                                    _start, _flags, _k, _do)             \
 499 ({                                                                      \
 500         int _ret = 0;                                                   \
 501                                                                         \
 502         bch2_trans_iter_init((_trans), &(_iter), (_btree_id),           \
 503                              (_start), (_flags));                       \
 504                                                                         \
 505         while (1) {                                                     \
 506                 u32 _restart_count = bch2_trans_begin(_trans);          \
 507                 (_k) = bch2_btree_iter_peek_prev_type(&(_iter), (_flags));\
 508                 if (!(_k).k) {                                          \
 509                         _ret = 0;                                       \
 510                         break;                                          \
 511                 }                                                       \
 512                                                                         \
 513                 _ret = bkey_err(_k) ?: (_do);                           \
 514                 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
 515                         continue;                                       \
 516                 if (_ret)                                               \
 517                         break;                                          \
 518                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 519                 if (!bch2_btree_iter_rewind(&(_iter)))                  \
 520                         break;                                          \
 521         }                                                               \
 522                                                                         \
 523         bch2_trans_iter_exit((_trans), &(_iter));                       \
 524         _ret;                                                           \
 525 })
 526
 527 #define for_each_btree_key_commit(_trans, _iter, _btree_id,             \
 528                                   _start, _iter_flags, _k,              \
 529                                   _disk_res, _journal_seq, _commit_flags,\
 530                                   _do)                                  \
 531         for_each_btree_key2(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
 532                             (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
 533                                         (_journal_seq), (_commit_flags)))
 534
 535 #define for_each_btree_key(_trans, _iter, _btree_id,                    \
 536                            _start, _flags, _k, _ret)                    \
 537         for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),      \
 538                                   (_start), (_flags));                  \
 539              (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
 540              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 541              bch2_btree_iter_advance(&(_iter)))
 542
 543 #define for_each_btree_key_norestart(_trans, _iter, _btree_id,          \
 544                            _start, _flags, _k, _ret)                    \
 545         for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),      \
 546                                   (_start), (_flags));                  \
 547              (_k) = bch2_btree_iter_peek_type(&(_iter), _flags),        \
 548              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 549              bch2_btree_iter_advance(&(_iter)))
 550
 551 #define for_each_btree_key_upto_norestart(_trans, _iter, _btree_id,     \
 552                            _start, _end, _flags, _k, _ret)              \
 553         for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),      \
 554                                   (_start), (_flags));                  \
 555              (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),\
 556              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 557              bch2_btree_iter_advance(&(_iter)))
 558
 559 #define for_each_btree_key_continue(_trans, _iter, _flags, _k, _ret)    \
 560         for (;                                                          \
 561              (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
 562              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 563              bch2_btree_iter_advance(&(_iter)))
 564
 565 #define for_each_btree_key_continue_norestart(_iter, _flags, _k, _ret)  \
 566         for (;                                                          \
 567              (_k) = bch2_btree_iter_peek_type(&(_iter), _flags),        \
 568              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 569              bch2_btree_iter_advance(&(_iter)))
 570
 571 /* new multiple iterator interface: */
 572
 573 void bch2_trans_updates_to_text(struct printbuf *, struct btree_trans *);
 574 void bch2_btree_path_to_text(struct printbuf *, struct btree_path *);
 575 void bch2_trans_paths_to_text(struct printbuf *, struct btree_trans *);
 576 void bch2_dump_trans_updates(struct btree_trans *);
 577 void bch2_dump_trans_paths_updates(struct btree_trans *);
 578 void __bch2_trans_init(struct btree_trans *, struct bch_fs *, unsigned);
 579 void bch2_trans_exit(struct btree_trans *);
 580
 581 extern const char *bch2_btree_transaction_fns[BCH_TRANSACTIONS_NR];
 582 unsigned bch2_trans_get_fn_idx(const char *);
 583
 584 #define bch2_trans_init(_trans, _c, _nr_iters, _mem)                    \
 585 do {                                                                    \
 586         static unsigned trans_fn_idx;                                   \
 587                                                                         \
 588         if (unlikely(!trans_fn_idx))                                    \
 589                 trans_fn_idx = bch2_trans_get_fn_idx(__func__);         \
 590                                                                         \
 591         __bch2_trans_init(_trans, _c, trans_fn_idx);                    \
 592 } while (0)
 593
 594 void bch2_btree_trans_to_text(struct printbuf *, struct btree_trans *);
 595
 596 void bch2_fs_btree_iter_exit(struct bch_fs *);
 597 int bch2_fs_btree_iter_init(struct bch_fs *);
 598
 599 #endif /* _BCACHEFS_BTREE_ITER_H */