92 #define __ceph_bio_iter_advance_step(it, n, STEP) do {			      \  argument
96 		BUG_ON(!(it)->iter.bi_size);				      \
97 		__cur_n = min((it)->iter.bi_size, __n);			      \
99 		bio_advance_iter((it)->bio, &(it)->iter, __cur_n);	      \
100 		if (!(it)->iter.bi_size && (it)->bio->bi_next) {	      \
102 			(it)->bio = (it)->bio->bi_next;			      \
103 			(it)->iter = (it)->bio->bi_iter;		      \
112 #define ceph_bio_iter_advance(it, n)					      \  argument
113 	__ceph_bio_iter_advance_step(it, n, 0)
118 #define ceph_bio_iter_advance_step(it, n, BVEC_STEP)			      \  argument
119 	__ceph_bio_iter_advance_step(it, n, ({				      \
123 		__cur_iter = (it)->iter;				      \
125 		__bio_for_each_segment(bv, (it)->bio, __cur_iter, __cur_iter) \
136 #define __ceph_bvec_iter_advance_step(it, n, STEP) do {			      \  argument
137 	BUG_ON((n) > (it)->iter.bi_size);				      \
139 	bvec_iter_advance((it)->bvecs, &(it)->iter, (n));		      \
145 #define ceph_bvec_iter_advance(it, n)					      \  argument
146 	__ceph_bvec_iter_advance_step(it, n, 0)
151 #define ceph_bvec_iter_advance_step(it, n, BVEC_STEP)			      \  argument
152 	__ceph_bvec_iter_advance_step(it, n, ({				      \
156 		__cur_iter = (it)->iter;				      \
158 		for_each_bvec(bv, (it)->bvecs, __cur_iter, __cur_iter)	      \
162 #define ceph_bvec_iter_shorten(it, n) do {				      \  argument
163 	BUG_ON((n) > (it)->iter.bi_size);				      \
164 	(it)->iter.bi_size = (n);					      \