Lines Matching refs:it
136 #define __ceph_bio_iter_advance_step(it, n, STEP) do { \ argument
140 BUG_ON(!(it)->iter.bi_size); \
141 __cur_n = min((it)->iter.bi_size, __n); \
143 bio_advance_iter((it)->bio, &(it)->iter, __cur_n); \
144 if (!(it)->iter.bi_size && (it)->bio->bi_next) { \
146 (it)->bio = (it)->bio->bi_next; \
147 (it)->iter = (it)->bio->bi_iter; \
156 #define ceph_bio_iter_advance(it, n) \ argument
157 __ceph_bio_iter_advance_step(it, n, 0)
162 #define ceph_bio_iter_advance_step(it, n, BVEC_STEP) \ argument
163 __ceph_bio_iter_advance_step(it, n, ({ \
167 __cur_iter = (it)->iter; \
169 __bio_for_each_segment(bv, (it)->bio, __cur_iter, __cur_iter) \
180 #define __ceph_bvec_iter_advance_step(it, n, STEP) do { \ argument
181 BUG_ON((n) > (it)->iter.bi_size); \
183 bvec_iter_advance((it)->bvecs, &(it)->iter, (n)); \
189 #define ceph_bvec_iter_advance(it, n) \ argument
190 __ceph_bvec_iter_advance_step(it, n, 0)
195 #define ceph_bvec_iter_advance_step(it, n, BVEC_STEP) \ argument
196 __ceph_bvec_iter_advance_step(it, n, ({ \
200 __cur_iter = (it)->iter; \
202 for_each_bvec(bv, (it)->bvecs, __cur_iter, __cur_iter) \
206 #define ceph_bvec_iter_shorten(it, n) do { \ argument
207 BUG_ON((n) > (it)->iter.bi_size); \
208 (it)->iter.bi_size = (n); \