Lines Matching refs:it
108 #define __ceph_bio_iter_advance_step(it, n, STEP) do { \ argument
112 BUG_ON(!(it)->iter.bi_size); \
113 __cur_n = min((it)->iter.bi_size, __n); \
115 bio_advance_iter((it)->bio, &(it)->iter, __cur_n); \
116 if (!(it)->iter.bi_size && (it)->bio->bi_next) { \
118 (it)->bio = (it)->bio->bi_next; \
119 (it)->iter = (it)->bio->bi_iter; \
128 #define ceph_bio_iter_advance(it, n) \ argument
129 __ceph_bio_iter_advance_step(it, n, 0)
134 #define ceph_bio_iter_advance_step(it, n, BVEC_STEP) \ argument
135 __ceph_bio_iter_advance_step(it, n, ({ \
139 __cur_iter = (it)->iter; \
141 __bio_for_each_segment(bv, (it)->bio, __cur_iter, __cur_iter) \
152 #define __ceph_bvec_iter_advance_step(it, n, STEP) do { \ argument
153 BUG_ON((n) > (it)->iter.bi_size); \
155 bvec_iter_advance((it)->bvecs, &(it)->iter, (n)); \
161 #define ceph_bvec_iter_advance(it, n) \ argument
162 __ceph_bvec_iter_advance_step(it, n, 0)
167 #define ceph_bvec_iter_advance_step(it, n, BVEC_STEP) \ argument
168 __ceph_bvec_iter_advance_step(it, n, ({ \
172 __cur_iter = (it)->iter; \
174 for_each_bvec(bv, (it)->bvecs, __cur_iter, __cur_iter) \
178 #define ceph_bvec_iter_shorten(it, n) do { \ argument
179 BUG_ON((n) > (it)->iter.bi_size); \
180 (it)->iter.bi_size = (n); \