137 			const struct bio_vec *bvec = i->bvec;	\
141 						bvec, (K))	\
142 			i->nr_segs -= bvec - i->bvec;		\
143 			i->bvec = bvec;				\
857 	const struct bio_vec *bvec, *end;  in iov_iter_bvec_advance()  local
865 	for (bvec = i->bvec, end = bvec + i->nr_segs; bvec < end; bvec++) {  in iov_iter_bvec_advance()
866 		if (likely(size < bvec->bv_len))  in iov_iter_bvec_advance()
868 		size -= bvec->bv_len;  in iov_iter_bvec_advance()
871 	i->nr_segs -= bvec - i->bvec;  in iov_iter_bvec_advance()
872 	i->bvec = bvec;  in iov_iter_bvec_advance()
954 		const struct bio_vec *bvec = i->bvec;  in iov_iter_revert()  local
956 			size_t n = (--bvec)->bv_len;  in iov_iter_revert()
959 				i->bvec = bvec;  in iov_iter_revert()
990 			return min(i->count, i->bvec->bv_len - i->iov_offset);  in iov_iter_single_seg_count()
1013 			const struct bio_vec *bvec, unsigned long nr_segs,  in iov_iter_bvec()  argument
1020 		.bvec = bvec,  in iov_iter_bvec()
1127 		size_t len = i->bvec[k].bv_len - skip;  in iov_iter_aligned_bvec()
1133 		if ((unsigned long)(i->bvec[k].bv_offset + skip) & addr_mask)  in iov_iter_aligned_bvec()
1224 		size_t len = i->bvec[k].bv_len - skip;  in iov_iter_alignment_bvec()
1225 		res |= (unsigned long)i->bvec[k].bv_offset + skip;  in iov_iter_alignment_bvec()
1422 	len = i->bvec->bv_len - skip;  in first_bvec_segment()
1425 	skip += i->bvec->bv_offset;  in first_bvec_segment()
1426 	page = i->bvec->bv_page + skip / PAGE_SIZE;  in first_bvec_segment()
1481 		if (i->iov_offset == i->bvec->bv_len) {  in __iov_iter_get_pages_alloc()
1483 			i->bvec++;  in __iov_iter_get_pages_alloc()
1619 	for (p = i->bvec; size; skip = 0, p++) {  in bvec_npages()
1671 		return new->bvec = kmemdup(new->bvec,  in dup_iter()
1890 		i->bvec -= state->nr_segs - i->nr_segs;  in iov_iter_restore()