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 #include "trace.h"
   8
   9 static inline int __bkey_err(const struct bkey *k)
  10 {
  11         return PTR_ERR_OR_ZERO(k);
  12 }
  13
  14 #define bkey_err(_k)    __bkey_err((_k).k)
  15
  16 static inline void __btree_path_get(struct btree_path *path, bool intent)
  17 {
  18         path->ref++;
  19         path->intent_ref += intent;
  20 }
  21
  22 static inline bool __btree_path_put(struct btree_path *path, bool intent)
  23 {
  24         EBUG_ON(!path->ref);
  25         EBUG_ON(!path->intent_ref && intent);
  26         path->intent_ref -= intent;
  27         return --path->ref == 0;
  28 }
  29
  30 static inline void btree_path_set_dirty(struct btree_path *path,
  31                                         enum btree_path_uptodate u)
  32 {
  33         path->uptodate = max_t(unsigned, path->uptodate, u);
  34 }
  35
  36 static inline struct btree *btree_path_node(struct btree_path *path,
  37                                             unsigned level)
  38 {
  39         return level < BTREE_MAX_DEPTH ? path->l[level].b : NULL;
  40 }
  41
  42 static inline bool btree_node_lock_seq_matches(const struct btree_path *path,
  43                                         const struct btree *b, unsigned level)
  44 {
  45         return path->l[level].lock_seq == six_lock_seq(&b->c.lock);
  46 }
  47
  48 static inline struct btree *btree_node_parent(struct btree_path *path,
  49                                               struct btree *b)
  50 {
  51         return btree_path_node(path, b->c.level + 1);
  52 }
  53
  54 /* Iterate over paths within a transaction: */
  55
  56 void __bch2_btree_trans_sort_paths(struct btree_trans *);
  57
  58 static inline void btree_trans_sort_paths(struct btree_trans *trans)
  59 {
  60         if (!IS_ENABLED(CONFIG_BCACHEFS_DEBUG) &&
  61             trans->paths_sorted)
  62                 return;
  63         __bch2_btree_trans_sort_paths(trans);
  64 }
  65
  66 static inline struct btree_path *
  67 __trans_next_path(struct btree_trans *trans, unsigned idx)
  68 {
  69         u64 l;
  70
  71         if (idx == BTREE_ITER_MAX)
  72                 return NULL;
  73
  74         l = trans->paths_allocated >> idx;
  75         if (!l)
  76                 return NULL;
  77
  78         idx += __ffs64(l);
  79         EBUG_ON(idx >= BTREE_ITER_MAX);
  80         EBUG_ON(trans->paths[idx].idx != idx);
  81         return &trans->paths[idx];
  82 }
  83
  84 #define trans_for_each_path_from(_trans, _path, _start)                 \
  85         for (_path = __trans_next_path((_trans), _start);               \
  86              (_path);                                                   \
  87              _path = __trans_next_path((_trans), (_path)->idx + 1))
  88
  89 #define trans_for_each_path(_trans, _path)                              \
  90         trans_for_each_path_from(_trans, _path, 0)
  91
  92 static inline struct btree_path *
  93 __trans_next_path_safe(struct btree_trans *trans, unsigned *idx)
  94 {
  95         u64 l;
  96
  97         if (*idx == BTREE_ITER_MAX)
  98                 return NULL;
  99
 100         l = trans->paths_allocated >> *idx;
 101         if (!l)
 102                 return NULL;
 103
 104         *idx += __ffs64(l);
 105         EBUG_ON(*idx >= BTREE_ITER_MAX);
 106         return &trans->paths[*idx];
 107 }
 108
 109 /*
 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();
 112  */
 113 #define trans_for_each_path_safe_from(_trans, _path, _idx, _start)      \
 114         for (_idx = _start;                                             \
 115              (_path = __trans_next_path_safe((_trans), &_idx));         \
 116              _idx++)
 117
 118 #define trans_for_each_path_safe(_trans, _path, _idx)                   \
 119         trans_for_each_path_safe_from(_trans, _path, _idx, 0)
 120
 121 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path)
 122 {
 123         unsigned idx = path ? path->sorted_idx + 1 : 0;
 124
 125         EBUG_ON(idx > trans->nr_sorted);
 126
 127         return idx < trans->nr_sorted
 128                 ? trans->paths + trans->sorted[idx]
 129                 : NULL;
 130 }
 131
 132 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path)
 133 {
 134         unsigned idx = path ? path->sorted_idx : trans->nr_sorted;
 135
 136         return idx
 137                 ? trans->paths + trans->sorted[idx - 1]
 138                 : NULL;
 139 }
 140
 141 #define trans_for_each_path_inorder(_trans, _path, _i)                  \
 142         for (_i = 0;                                                    \
 143              ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) < (_trans)->nr_sorted;\
 144              _i++)
 145
 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;\
 149              --_i)
 150
 151 static inline bool __path_has_node(const struct btree_path *path,
 152                                    const struct btree *b)
 153 {
 154         return path->l[b->c.level].b == b &&
 155                 btree_node_lock_seq_matches(path, b, b->c.level);
 156 }
 157
 158 static inline struct btree_path *
 159 __trans_next_path_with_node(struct btree_trans *trans, struct btree *b,
 160                             unsigned idx)
 161 {
 162         struct btree_path *path = __trans_next_path(trans, idx);
 163
 164         while (path && !__path_has_node(path, b))
 165                 path = __trans_next_path(trans, path->idx + 1);
 166
 167         return path;
 168 }
 169
 170 #define trans_for_each_path_with_node(_trans, _b, _path)                \
 171         for (_path = __trans_next_path_with_node((_trans), (_b), 0);    \
 172              (_path);                                                   \
 173              _path = __trans_next_path_with_node((_trans), (_b),        \
 174                                                  (_path)->idx + 1))
 175
 176 struct btree_path *__bch2_btree_path_make_mut(struct btree_trans *, struct btree_path *,
 177                          bool, unsigned long);
 178
 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,
 182                          unsigned long ip)
 183 {
 184         if (path->ref > 1 || path->preserve)
 185                 path = __bch2_btree_path_make_mut(trans, path, intent, ip);
 186         path->should_be_locked = false;
 187         return path;
 188 }
 189
 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);
 193
 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)
 198 {
 199         int cmp = bpos_cmp(new_pos, path->pos);
 200
 201         return cmp
 202                 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip, cmp)
 203                 : path;
 204 }
 205
 206 int __must_check bch2_btree_path_traverse_one(struct btree_trans *, struct btree_path *,
 207                                               unsigned, unsigned long);
 208
 209 static inline int __must_check bch2_btree_path_traverse(struct btree_trans *trans,
 210                                           struct btree_path *path, unsigned flags)
 211 {
 212         if (path->uptodate < BTREE_ITER_NEED_RELOCK)
 213                 return 0;
 214
 215         return bch2_btree_path_traverse_one(trans, path, flags, _RET_IP_);
 216 }
 217
 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 *);
 223
 224 /*
 225  * bch2_btree_path_peek_slot() for a cached iterator might return a key in a
 226  * different snapshot:
 227  */
 228 static inline struct bkey_s_c bch2_btree_path_peek_slot_exact(struct btree_path *path, struct bkey *u)
 229 {
 230         struct bkey_s_c k = bch2_btree_path_peek_slot(path, u);
 231
 232         if (k.k && bpos_eq(path->pos, k.k->p))
 233                 return k;
 234
 235         bkey_init(u);
 236         u->p = path->pos;
 237         return (struct bkey_s_c) { u, NULL };
 238 }
 239
 240 struct bkey_i *bch2_btree_journal_peek_slot(struct btree_trans *,
 241                                         struct btree_iter *, struct bpos);
 242
 243 void bch2_btree_path_level_init(struct btree_trans *, struct btree_path *, struct btree *);
 244
 245 int __bch2_trans_mutex_lock(struct btree_trans *, struct mutex *);
 246
 247 static inline int bch2_trans_mutex_lock(struct btree_trans *trans, struct mutex *lock)
 248 {
 249         return mutex_trylock(lock)
 250                 ? 0
 251                 : __bch2_trans_mutex_lock(trans, lock);
 252 }
 253
 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,
 257                             struct bpos, bool);
 258 #else
 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) {}
 262 #endif
 263
 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);
 269
 270 int bch2_btree_path_relock_intent(struct btree_trans *, struct btree_path *);
 271
 272 void bch2_path_put(struct btree_trans *, struct btree_path *, bool);
 273
 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 bool bch2_trans_locked(struct btree_trans *);
 278
 279 static inline bool trans_was_restarted(struct btree_trans *trans, u32 restart_count)
 280 {
 281         return restart_count != trans->restart_count;
 282 }
 283
 284 void bch2_trans_restart_error(struct btree_trans *, u32);
 285
 286 static inline void bch2_trans_verify_not_restarted(struct btree_trans *trans,
 287                                                    u32 restart_count)
 288 {
 289         if (trans_was_restarted(trans, restart_count))
 290                 bch2_trans_restart_error(trans, restart_count);
 291 }
 292
 293 void bch2_trans_in_restart_error(struct btree_trans *);
 294
 295 static inline void bch2_trans_verify_not_in_restart(struct btree_trans *trans)
 296 {
 297         if (trans->restarted)
 298                 bch2_trans_in_restart_error(trans);
 299 }
 300
 301 __always_inline
 302 static int btree_trans_restart_nounlock(struct btree_trans *trans, int err)
 303 {
 304         BUG_ON(err <= 0);
 305         BUG_ON(!bch2_err_matches(-err, BCH_ERR_transaction_restart));
 306
 307         trans->restarted = err;
 308         trans->last_restarted_ip = _THIS_IP_;
 309         return -err;
 310 }
 311
 312 __always_inline
 313 static int btree_trans_restart(struct btree_trans *trans, int err)
 314 {
 315         btree_trans_restart_nounlock(trans, err);
 316         return -err;
 317 }
 318
 319 bool bch2_btree_node_upgrade(struct btree_trans *,
 320                              struct btree_path *, unsigned);
 321
 322 void __bch2_btree_path_downgrade(struct btree_trans *, struct btree_path *, unsigned);
 323
 324 static inline void bch2_btree_path_downgrade(struct btree_trans *trans,
 325                                              struct btree_path *path)
 326 {
 327         unsigned new_locks_want = path->level + !!path->intent_ref;
 328
 329         if (path->locks_want > new_locks_want)
 330                 __bch2_btree_path_downgrade(trans, path, new_locks_want);
 331 }
 332
 333 void bch2_trans_downgrade(struct btree_trans *);
 334
 335 void bch2_trans_node_add(struct btree_trans *trans, struct btree *);
 336 void bch2_trans_node_reinit_iter(struct btree_trans *, struct btree *);
 337
 338 int __must_check __bch2_btree_iter_traverse(struct btree_iter *iter);
 339 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
 340
 341 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
 342 struct btree *bch2_btree_iter_peek_node_and_restart(struct btree_iter *);
 343 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
 344
 345 struct bkey_s_c bch2_btree_iter_peek_upto(struct btree_iter *, struct bpos);
 346 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
 347
 348 struct bkey_s_c bch2_btree_iter_peek_all_levels(struct btree_iter *);
 349
 350 static inline struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *iter)
 351 {
 352         return bch2_btree_iter_peek_upto(iter, SPOS_MAX);
 353 }
 354
 355 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *);
 356 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
 357
 358 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
 359 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
 360 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
 361
 362 bool bch2_btree_iter_advance(struct btree_iter *);
 363 bool bch2_btree_iter_rewind(struct btree_iter *);
 364
 365 static inline void __bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
 366 {
 367         iter->k.type = KEY_TYPE_deleted;
 368         iter->k.p.inode         = iter->pos.inode       = new_pos.inode;
 369         iter->k.p.offset        = iter->pos.offset      = new_pos.offset;
 370         iter->k.p.snapshot      = iter->pos.snapshot    = new_pos.snapshot;
 371         iter->k.size = 0;
 372 }
 373
 374 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
 375 {
 376         if (unlikely(iter->update_path))
 377                 bch2_path_put(iter->trans, iter->update_path,
 378                               iter->flags & BTREE_ITER_INTENT);
 379         iter->update_path = NULL;
 380
 381         if (!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS))
 382                 new_pos.snapshot = iter->snapshot;
 383
 384         __bch2_btree_iter_set_pos(iter, new_pos);
 385 }
 386
 387 static inline void bch2_btree_iter_set_pos_to_extent_start(struct btree_iter *iter)
 388 {
 389         BUG_ON(!(iter->flags & BTREE_ITER_IS_EXTENTS));
 390         iter->pos = bkey_start_pos(&iter->k);
 391 }
 392
 393 static inline void bch2_btree_iter_set_snapshot(struct btree_iter *iter, u32 snapshot)
 394 {
 395         struct bpos pos = iter->pos;
 396
 397         iter->snapshot = snapshot;
 398         pos.snapshot = snapshot;
 399         bch2_btree_iter_set_pos(iter, pos);
 400 }
 401
 402 void bch2_trans_iter_exit(struct btree_trans *, struct btree_iter *);
 403
 404 static inline unsigned __bch2_btree_iter_flags(struct btree_trans *trans,
 405                                                unsigned btree_id,
 406                                                unsigned flags)
 407 {
 408         if (flags & BTREE_ITER_ALL_LEVELS)
 409                 flags |= BTREE_ITER_ALL_SNAPSHOTS|__BTREE_ITER_ALL_SNAPSHOTS;
 410
 411         if (!(flags & (BTREE_ITER_ALL_SNAPSHOTS|BTREE_ITER_NOT_EXTENTS)) &&
 412             btree_node_type_is_extents(btree_id))
 413                 flags |= BTREE_ITER_IS_EXTENTS;
 414
 415         if (!(flags & __BTREE_ITER_ALL_SNAPSHOTS) &&
 416             !btree_type_has_snapshots(btree_id))
 417                 flags &= ~BTREE_ITER_ALL_SNAPSHOTS;
 418
 419         if (!(flags & BTREE_ITER_ALL_SNAPSHOTS) &&
 420             btree_type_has_snapshots(btree_id))
 421                 flags |= BTREE_ITER_FILTER_SNAPSHOTS;
 422
 423         if (trans->journal_replay_not_finished)
 424                 flags |= BTREE_ITER_WITH_JOURNAL;
 425
 426         return flags;
 427 }
 428
 429 static inline unsigned bch2_btree_iter_flags(struct btree_trans *trans,
 430                                              unsigned btree_id,
 431                                              unsigned flags)
 432 {
 433         if (!btree_id_cached(trans->c, btree_id)) {
 434                 flags &= ~BTREE_ITER_CACHED;
 435                 flags &= ~BTREE_ITER_WITH_KEY_CACHE;
 436         } else if (!(flags & BTREE_ITER_CACHED))
 437                 flags |= BTREE_ITER_WITH_KEY_CACHE;
 438
 439         return __bch2_btree_iter_flags(trans, btree_id, flags);
 440 }
 441
 442 static inline void bch2_trans_iter_init_common(struct btree_trans *trans,
 443                                           struct btree_iter *iter,
 444                                           unsigned btree_id, struct bpos pos,
 445                                           unsigned locks_want,
 446                                           unsigned depth,
 447                                           unsigned flags,
 448                                           unsigned long ip)
 449 {
 450         memset(iter, 0, sizeof(*iter));
 451         iter->trans     = trans;
 452         iter->btree_id  = btree_id;
 453         iter->flags     = flags;
 454         iter->snapshot  = pos.snapshot;
 455         iter->pos       = pos;
 456         iter->k.p       = pos;
 457
 458 #ifdef CONFIG_BCACHEFS_DEBUG
 459         iter->ip_allocated = ip;
 460 #endif
 461         iter->path = bch2_path_get(trans, btree_id, iter->pos,
 462                                    locks_want, depth, flags, ip);
 463 }
 464
 465 void bch2_trans_iter_init_outlined(struct btree_trans *, struct btree_iter *,
 466                           unsigned, struct bpos, unsigned);
 467
 468 static inline void bch2_trans_iter_init(struct btree_trans *trans,
 469                           struct btree_iter *iter,
 470                           unsigned btree_id, struct bpos pos,
 471                           unsigned flags)
 472 {
 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),
 477                                 _THIS_IP_);
 478         else
 479                 bch2_trans_iter_init_outlined(trans, iter, btree_id, pos, flags);
 480 }
 481
 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 *);
 486
 487 static inline void set_btree_iter_dontneed(struct btree_iter *iter)
 488 {
 489         if (!iter->trans->restarted)
 490                 iter->path->preserve = false;
 491 }
 492
 493 void *__bch2_trans_kmalloc(struct btree_trans *, size_t);
 494
 495 static inline void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size)
 496 {
 497         size = roundup(size, 8);
 498
 499         if (likely(trans->mem_top + size <= trans->mem_bytes)) {
 500                 void *p = trans->mem + trans->mem_top;
 501
 502                 trans->mem_top += size;
 503                 memset(p, 0, size);
 504                 return p;
 505         } else {
 506                 return __bch2_trans_kmalloc(trans, size);
 507         }
 508 }
 509
 510 static inline void *bch2_trans_kmalloc_nomemzero(struct btree_trans *trans, size_t size)
 511 {
 512         size = roundup(size, 8);
 513
 514         if (likely(trans->mem_top + size <= trans->mem_bytes)) {
 515                 void *p = trans->mem + trans->mem_top;
 516
 517                 trans->mem_top += size;
 518                 return p;
 519         } else {
 520                 return __bch2_trans_kmalloc(trans, size);
 521         }
 522 }
 523
 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)
 528 {
 529         struct bkey_s_c k;
 530
 531         bch2_trans_iter_init(trans, iter, btree_id, pos, flags);
 532         k = bch2_btree_iter_peek_slot(iter);
 533
 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);
 538         return k;
 539 }
 540
 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,
 544                                 unsigned flags)
 545 {
 546         return __bch2_bkey_get_iter(trans, iter, btree_id, pos, flags, 0);
 547 }
 548
 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))
 552
 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)
 557 {
 558         struct btree_iter iter;
 559         struct bkey_s_c k;
 560         int ret;
 561
 562         k = __bch2_bkey_get_iter(trans, &iter, btree_id, pos, flags, type);
 563         ret = bkey_err(k);
 564         if (!ret) {
 565                 unsigned b = min_t(unsigned, bkey_val_bytes(k.k), val_size);
 566
 567                 memcpy(val, k.v, b);
 568                 if (unlikely(b < sizeof(*val)))
 569                         memset((void *) val + b, 0, sizeof(*val) - b);
 570                 bch2_trans_iter_exit(trans, &iter);
 571         }
 572
 573         return ret;
 574 }
 575
 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)
 579
 580 u32 bch2_trans_begin(struct btree_trans *);
 581
 582 /*
 583  * XXX
 584  * this does not handle transaction restarts from bch2_btree_iter_next_node()
 585  * correctly
 586  */
 587 #define __for_each_btree_node(_trans, _iter, _btree_id, _start,         \
 588                               _locks_want, _depth, _flags, _b, _ret)    \
 589         for (bch2_trans_node_iter_init((_trans), &(_iter), (_btree_id), \
 590                                 _start, _locks_want, _depth, _flags);   \
 591              (_b) = bch2_btree_iter_peek_node_and_restart(&(_iter)),    \
 592              !((_ret) = PTR_ERR_OR_ZERO(_b)) && (_b);                   \
 593              (_b) = bch2_btree_iter_next_node(&(_iter)))
 594
 595 #define for_each_btree_node(_trans, _iter, _btree_id, _start,           \
 596                             _flags, _b, _ret)                           \
 597         __for_each_btree_node(_trans, _iter, _btree_id, _start,         \
 598                               0, 0, _flags, _b, _ret)
 599
 600 static inline struct bkey_s_c bch2_btree_iter_peek_prev_type(struct btree_iter *iter,
 601                                                              unsigned flags)
 602 {
 603         BUG_ON(flags & BTREE_ITER_ALL_LEVELS);
 604
 605         return  flags & BTREE_ITER_SLOTS      ? bch2_btree_iter_peek_slot(iter) :
 606                                                 bch2_btree_iter_peek_prev(iter);
 607 }
 608
 609 static inline struct bkey_s_c bch2_btree_iter_peek_type(struct btree_iter *iter,
 610                                                         unsigned flags)
 611 {
 612         return  flags & BTREE_ITER_ALL_LEVELS ? bch2_btree_iter_peek_all_levels(iter) :
 613                 flags & BTREE_ITER_SLOTS      ? bch2_btree_iter_peek_slot(iter) :
 614                                                 bch2_btree_iter_peek(iter);
 615 }
 616
 617 static inline struct bkey_s_c bch2_btree_iter_peek_upto_type(struct btree_iter *iter,
 618                                                              struct bpos end,
 619                                                              unsigned flags)
 620 {
 621         if (!(flags & BTREE_ITER_SLOTS))
 622                 return bch2_btree_iter_peek_upto(iter, end);
 623
 624         if (bkey_gt(iter->pos, end))
 625                 return bkey_s_c_null;
 626
 627         return bch2_btree_iter_peek_slot(iter);
 628 }
 629
 630 static inline int btree_trans_too_many_iters(struct btree_trans *trans)
 631 {
 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);
 635         }
 636
 637         return 0;
 638 }
 639
 640 struct bkey_s_c bch2_btree_iter_peek_and_restart_outlined(struct btree_iter *);
 641
 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)
 645 {
 646         struct bkey_s_c k;
 647
 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);
 652
 653         return k;
 654 }
 655
 656 static inline struct bkey_s_c
 657 __bch2_btree_iter_peek_upto_and_restart(struct btree_trans *trans,
 658                                         struct btree_iter *iter,
 659                                         struct bpos end,
 660                                         unsigned flags)
 661 {
 662         struct bkey_s_c k;
 663
 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);
 668
 669         return k;
 670 }
 671
 672 #define lockrestart_do(_trans, _do)                                     \
 673 ({                                                                      \
 674         u32 _restart_count;                                             \
 675         int _ret;                                                       \
 676                                                                         \
 677         do {                                                            \
 678                 _restart_count = bch2_trans_begin(_trans);              \
 679                 _ret = (_do);                                           \
 680         } while (bch2_err_matches(_ret, BCH_ERR_transaction_restart));  \
 681                                                                         \
 682         if (!_ret)                                                      \
 683                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 684                                                                         \
 685         _ret;                                                           \
 686 })
 687
 688 /*
 689  * nested_lockrestart_do(), nested_commit_do():
 690  *
 691  * These are like lockrestart_do() and commit_do(), with two differences:
 692  *
 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
 696  */
 697 #define nested_lockrestart_do(_trans, _do)                              \
 698 ({                                                                      \
 699         u32 _restart_count, _orig_restart_count;                        \
 700         int _ret;                                                       \
 701                                                                         \
 702         _restart_count = _orig_restart_count = (_trans)->restart_count; \
 703                                                                         \
 704         while (bch2_err_matches(_ret = (_do), BCH_ERR_transaction_restart))\
 705                 _restart_count = bch2_trans_begin(_trans);              \
 706                                                                         \
 707         if (!_ret)                                                      \
 708                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 709                                                                         \
 710         if (!_ret && trans_was_restarted(_trans, _orig_restart_count))  \
 711                 _ret = -BCH_ERR_transaction_restart_nested;             \
 712                                                                         \
 713         _ret;                                                           \
 714 })
 715
 716 #define for_each_btree_key2(_trans, _iter, _btree_id,                   \
 717                             _start, _flags, _k, _do)                    \
 718 ({                                                                      \
 719         int _ret = 0;                                                   \
 720                                                                         \
 721         bch2_trans_iter_init((_trans), &(_iter), (_btree_id),           \
 722                              (_start), (_flags));                       \
 723                                                                         \
 724         while (1) {                                                     \
 725                 u32 _restart_count = bch2_trans_begin(_trans);          \
 726                                                                         \
 727                 _ret = 0;                                               \
 728                 (_k) = bch2_btree_iter_peek_type(&(_iter), (_flags));   \
 729                 if (!(_k).k)                                            \
 730                         break;                                          \
 731                                                                         \
 732                 _ret = bkey_err(_k) ?: (_do);                           \
 733                 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
 734                         continue;                                       \
 735                 if (_ret)                                               \
 736                         break;                                          \
 737                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 738                 if (!bch2_btree_iter_advance(&(_iter)))                 \
 739                         break;                                          \
 740         }                                                               \
 741                                                                         \
 742         bch2_trans_iter_exit((_trans), &(_iter));                       \
 743         _ret;                                                           \
 744 })
 745
 746 #define for_each_btree_key2_upto(_trans, _iter, _btree_id,              \
 747                             _start, _end, _flags, _k, _do)              \
 748 ({                                                                      \
 749         int _ret = 0;                                                   \
 750                                                                         \
 751         bch2_trans_iter_init((_trans), &(_iter), (_btree_id),           \
 752                              (_start), (_flags));                       \
 753                                                                         \
 754         while (1) {                                                     \
 755                 u32 _restart_count = bch2_trans_begin(_trans);          \
 756                                                                         \
 757                 _ret = 0;                                               \
 758                 (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, (_flags));\
 759                 if (!(_k).k)                                            \
 760                         break;                                          \
 761                                                                         \
 762                 _ret = bkey_err(_k) ?: (_do);                           \
 763                 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
 764                         continue;                                       \
 765                 if (_ret)                                               \
 766                         break;                                          \
 767                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 768                 if (!bch2_btree_iter_advance(&(_iter)))                 \
 769                         break;                                          \
 770         }                                                               \
 771                                                                         \
 772         bch2_trans_iter_exit((_trans), &(_iter));                       \
 773         _ret;                                                           \
 774 })
 775
 776 #define for_each_btree_key_reverse(_trans, _iter, _btree_id,            \
 777                                    _start, _flags, _k, _do)             \
 778 ({                                                                      \
 779         int _ret = 0;                                                   \
 780                                                                         \
 781         bch2_trans_iter_init((_trans), &(_iter), (_btree_id),           \
 782                              (_start), (_flags));                       \
 783                                                                         \
 784         while (1) {                                                     \
 785                 u32 _restart_count = bch2_trans_begin(_trans);          \
 786                 (_k) = bch2_btree_iter_peek_prev_type(&(_iter), (_flags));\
 787                 if (!(_k).k) {                                          \
 788                         _ret = 0;                                       \
 789                         break;                                          \
 790                 }                                                       \
 791                                                                         \
 792                 _ret = bkey_err(_k) ?: (_do);                           \
 793                 if (bch2_err_matches(_ret, BCH_ERR_transaction_restart))\
 794                         continue;                                       \
 795                 if (_ret)                                               \
 796                         break;                                          \
 797                 bch2_trans_verify_not_restarted(_trans, _restart_count);\
 798                 if (!bch2_btree_iter_rewind(&(_iter)))                  \
 799                         break;                                          \
 800         }                                                               \
 801                                                                         \
 802         bch2_trans_iter_exit((_trans), &(_iter));                       \
 803         _ret;                                                           \
 804 })
 805
 806 #define for_each_btree_key_commit(_trans, _iter, _btree_id,             \
 807                                   _start, _iter_flags, _k,              \
 808                                   _disk_res, _journal_seq, _commit_flags,\
 809                                   _do)                                  \
 810         for_each_btree_key2(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
 811                             (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
 812                                         (_journal_seq), (_commit_flags)))
 813
 814 #define for_each_btree_key_reverse_commit(_trans, _iter, _btree_id,     \
 815                                   _start, _iter_flags, _k,              \
 816                                   _disk_res, _journal_seq, _commit_flags,\
 817                                   _do)                                  \
 818         for_each_btree_key_reverse(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
 819                             (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
 820                                         (_journal_seq), (_commit_flags)))
 821
 822 #define for_each_btree_key_upto_commit(_trans, _iter, _btree_id,        \
 823                                   _start, _end, _iter_flags, _k,        \
 824                                   _disk_res, _journal_seq, _commit_flags,\
 825                                   _do)                                  \
 826         for_each_btree_key2_upto(_trans, _iter, _btree_id, _start, _end, _iter_flags, _k,\
 827                             (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
 828                                         (_journal_seq), (_commit_flags)))
 829
 830 #define for_each_btree_key(_trans, _iter, _btree_id,                    \
 831                            _start, _flags, _k, _ret)                    \
 832         for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),      \
 833                                   (_start), (_flags));                  \
 834              (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
 835              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 836              bch2_btree_iter_advance(&(_iter)))
 837
 838 #define for_each_btree_key_upto(_trans, _iter, _btree_id,               \
 839                                 _start, _end, _flags, _k, _ret)         \
 840         for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),      \
 841                                   (_start), (_flags));                  \
 842              (_k) = __bch2_btree_iter_peek_upto_and_restart((_trans),   \
 843                                                 &(_iter), _end, _flags),\
 844              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 845              bch2_btree_iter_advance(&(_iter)))
 846
 847 #define for_each_btree_key_norestart(_trans, _iter, _btree_id,          \
 848                            _start, _flags, _k, _ret)                    \
 849         for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),      \
 850                                   (_start), (_flags));                  \
 851              (_k) = bch2_btree_iter_peek_type(&(_iter), _flags),        \
 852              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 853              bch2_btree_iter_advance(&(_iter)))
 854
 855 #define for_each_btree_key_upto_norestart(_trans, _iter, _btree_id,     \
 856                            _start, _end, _flags, _k, _ret)              \
 857         for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id),      \
 858                                   (_start), (_flags));                  \
 859              (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),\
 860              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 861              bch2_btree_iter_advance(&(_iter)))
 862
 863 #define for_each_btree_key_continue(_trans, _iter, _flags, _k, _ret)    \
 864         for (;                                                          \
 865              (_k) = __bch2_btree_iter_peek_and_restart((_trans), &(_iter), _flags),\
 866              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 867              bch2_btree_iter_advance(&(_iter)))
 868
 869 #define for_each_btree_key_continue_norestart(_iter, _flags, _k, _ret)  \
 870         for (;                                                          \
 871              (_k) = bch2_btree_iter_peek_type(&(_iter), _flags),        \
 872              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 873              bch2_btree_iter_advance(&(_iter)))
 874
 875 #define for_each_btree_key_upto_continue_norestart(_iter, _end, _flags, _k, _ret)\
 876         for (;                                                                  \
 877              (_k) = bch2_btree_iter_peek_upto_type(&(_iter), _end, _flags),     \
 878              !((_ret) = bkey_err(_k)) && (_k).k;                                \
 879              bch2_btree_iter_advance(&(_iter)))
 880
 881 #define drop_locks_do(_trans, _do)                                      \
 882 ({                                                                      \
 883         bch2_trans_unlock(_trans);                                      \
 884         _do ?: bch2_trans_relock(_trans);                               \
 885 })
 886
 887 #define allocate_dropping_locks_errcode(_trans, _do)                    \
 888 ({                                                                      \
 889         gfp_t _gfp = GFP_NOWAIT|__GFP_NOWARN;                           \
 890         int _ret = _do;                                                 \
 891                                                                         \
 892         if (bch2_err_matches(_ret, ENOMEM)) {                           \
 893                 _gfp = GFP_KERNEL;                                      \
 894                 _ret = drop_locks_do(trans, _do);                       \
 895         }                                                               \
 896         _ret;                                                           \
 897 })
 898
 899 #define allocate_dropping_locks(_trans, _ret, _do)                      \
 900 ({                                                                      \
 901         gfp_t _gfp = GFP_NOWAIT|__GFP_NOWARN;                           \
 902         typeof(_do) _p = _do;                                           \
 903                                                                         \
 904         _ret = 0;                                                       \
 905         if (unlikely(!_p)) {                                            \
 906                 _gfp = GFP_KERNEL;                                      \
 907                 _ret = drop_locks_do(trans, ((_p = _do), 0));           \
 908         }                                                               \
 909         _p;                                                             \
 910 })
 911
 912 /* new multiple iterator interface: */
 913
 914 void bch2_trans_updates_to_text(struct printbuf *, struct btree_trans *);
 915 void bch2_btree_path_to_text(struct printbuf *, struct btree_path *);
 916 void bch2_trans_paths_to_text(struct printbuf *, struct btree_trans *);
 917 void bch2_dump_trans_updates(struct btree_trans *);
 918 void bch2_dump_trans_paths_updates(struct btree_trans *);
 919 void __bch2_trans_init(struct btree_trans *, struct bch_fs *, unsigned);
 920 void bch2_trans_exit(struct btree_trans *);
 921
 922 extern const char *bch2_btree_transaction_fns[BCH_TRANSACTIONS_NR];
 923 unsigned bch2_trans_get_fn_idx(const char *);
 924
 925 #define bch2_trans_init(_trans, _c, _nr_iters, _mem)                    \
 926 do {                                                                    \
 927         static unsigned trans_fn_idx;                                   \
 928                                                                         \
 929         if (unlikely(!trans_fn_idx))                                    \
 930                 trans_fn_idx = bch2_trans_get_fn_idx(__func__);         \
 931                                                                         \
 932         __bch2_trans_init(_trans, _c, trans_fn_idx);                    \
 933 } while (0)
 934
 935 void bch2_btree_trans_to_text(struct printbuf *, struct btree_trans *);
 936
 937 void bch2_fs_btree_iter_exit(struct bch_fs *);
 938 int bch2_fs_btree_iter_init(struct bch_fs *);
 939
 940 #endif /* _BCACHEFS_BTREE_ITER_H */