Lines Matching refs:it
110 #define __ceph_bio_iter_advance_step(it, n, STEP) do { \ argument
114 BUG_ON(!(it)->iter.bi_size); \
115 __cur_n = min((it)->iter.bi_size, __n); \
117 bio_advance_iter((it)->bio, &(it)->iter, __cur_n); \
118 if (!(it)->iter.bi_size && (it)->bio->bi_next) { \
120 (it)->bio = (it)->bio->bi_next; \
121 (it)->iter = (it)->bio->bi_iter; \
130 #define ceph_bio_iter_advance(it, n) \ argument
131 __ceph_bio_iter_advance_step(it, n, 0)
136 #define ceph_bio_iter_advance_step(it, n, BVEC_STEP) \ argument
137 __ceph_bio_iter_advance_step(it, n, ({ \
141 __cur_iter = (it)->iter; \
143 __bio_for_each_segment(bv, (it)->bio, __cur_iter, __cur_iter) \
154 #define __ceph_bvec_iter_advance_step(it, n, STEP) do { \ argument
155 BUG_ON((n) > (it)->iter.bi_size); \
157 bvec_iter_advance((it)->bvecs, &(it)->iter, (n)); \
163 #define ceph_bvec_iter_advance(it, n) \ argument
164 __ceph_bvec_iter_advance_step(it, n, 0)
169 #define ceph_bvec_iter_advance_step(it, n, BVEC_STEP) \ argument
170 __ceph_bvec_iter_advance_step(it, n, ({ \
174 __cur_iter = (it)->iter; \
176 for_each_bvec(bv, (it)->bvecs, __cur_iter, __cur_iter) \
180 #define ceph_bvec_iter_shorten(it, n) do { \ argument
181 BUG_ON((n) > (it)->iter.bi_size); \
182 (it)->iter.bi_size = (n); \