: bch2_btree_iter_peek(iter);
}
+static inline int btree_trans_too_many_iters(struct btree_trans *trans)
+{
+ return hweight64(trans->paths_allocated) > BTREE_ITER_MAX / 2
+ ? -EINTR : 0;
+}
+
static inline struct bkey_s_c
__bch2_btree_iter_peek_and_restart(struct btree_trans *trans,
struct btree_iter *iter, unsigned flags)
{
struct bkey_s_c k;
- while ((hweight64(trans->paths_allocated) > BTREE_ITER_MAX / 2) ||
+ while (btree_trans_too_many_iters(trans) ||
(k = __bch2_btree_iter_peek(iter, flags),
bkey_err(k) == -EINTR))
bch2_trans_begin(trans);
* read_target looks up subvolumes, we can overflow paths if the
* directory has many subvolumes in it
*/
- if (hweight64(trans.paths_allocated) > BTREE_ITER_MAX / 2) {
- ret = -EINTR;
+ ret = btree_trans_too_many_iters(&trans);
+ if (ret)
break;
- }
}
bch2_trans_iter_exit(&trans, &iter);
err:
swap(rbio->bio.bi_iter.bi_size, bytes);
bio_advance(&rbio->bio, bytes);
+
+ ret = btree_trans_too_many_iters(trans);
+ if (ret)
+ break;
}
err:
bch2_trans_iter_exit(trans, &iter);
swap(bvec_iter.bi_size, bytes);
bio_advance_iter(&rbio->bio, &bvec_iter, bytes);
+
+ ret = btree_trans_too_many_iters(&trans);
+ if (ret)
+ break;
}
err:
bch2_trans_iter_exit(&trans, &iter);