Searched refs:bi_size (Results 1 – 7 of 7) sorted by relevance
83 unsigned int bi_size; /* residual I/O count */ member108 min((iter).bi_size, \148 if (WARN_ONCE(bytes > iter->bi_size, in bvec_iter_advance()150 iter->bi_size = 0; in bvec_iter_advance()154 iter->bi_size -= bytes; in bvec_iter_advance()181 iter->bi_size -= bytes; in bvec_iter_advance_single()186 (iter).bi_size && \192 (iter).bi_size && \200 .bi_size = UINT_MAX, \
37 #define bvec_iter_sectors(iter) ((iter).bi_size >> 9)55 bio->bi_iter.bi_size && in bio_has_data()102 iter->bi_size -= bytes; in bio_advance_iter()116 iter->bi_size -= bytes; in bio_advance_iter_single()136 if (nbytes == bio->bi_iter.bi_size) { in bio_advance()137 bio->bi_iter.bi_size = 0; in bio_advance()145 (iter).bi_size && \154 (iter).bi_size && \170 #define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len)
1093 return rq->bio->bi_iter.bi_size; in blk_rq_cur_bytes()
140 BUG_ON(!(it)->iter.bi_size); \141 __cur_n = min((it)->iter.bi_size, __n); \144 if (!(it)->iter.bi_size && (it)->bio->bi_next) { \168 __cur_iter.bi_size = __cur_n; \181 BUG_ON((n) > (it)->iter.bi_size); \201 __cur_iter.bi_size = (n); \207 BUG_ON((n) > (it)->iter.bi_size); \208 (it)->iter.bi_size = (n); \
30 __entry->nr_sector = bio->bi_iter.bi_size >> 9;104 __entry->nr_sector = bio->bi_iter.bi_size >> 9;139 __entry->nr_sector = bio->bi_iter.bi_size >> 9;170 __entry->nr_sector = bio->bi_iter.bi_size >> 9;239 __entry->nr_sector = bio->bi_iter.bi_size >> 9;
2410 __entry->len = bio->bi_iter.bi_size;
1204 __entry->size = bio->bi_iter.bi_size;
Completed in 21 milliseconds