Lines Matching defs:n_sectors
288 sector_t n_sectors;
589 sector_t sector, sector_t n_sectors, int mode)
594 if (unlikely(((sector | n_sectors) & ((1 << ic->sb->log2_sectors_per_block) - 1)) != 0)) {
597 n_sectors,
604 if (unlikely(!n_sectors))
608 end_bit = (sector + n_sectors - 1) >>
745 unsigned int section, unsigned int offset, unsigned int *n_sectors)
752 if (n_sectors)
753 *n_sectors = (PAGE_SIZE - pl_offset) >> SECTOR_SHIFT;
1051 unsigned int sector, unsigned int n_sectors,
1084 io_loc.count = n_sectors;
1101 unsigned int sector, n_sectors;
1104 n_sectors = n_sections * ic->journal_section_sectors;
1106 rw_journal_sectors(ic, opf, sector, n_sectors, comp);
1173 unsigned int n_sectors, sector_t target, io_notify_fn fn, void *data)
1180 BUG_ON((target | n_sectors | offset) & (unsigned int)(ic->sectors_per_block - 1));
1201 io_loc.count = n_sectors;
1212 return range1->logical_sector < range2->logical_sector + range2->n_sectors &&
1213 range1->logical_sector + range1->n_sectors > range2->logical_sector;
1221 BUG_ON((new_range->logical_sector | new_range->n_sectors) & (unsigned int)(ic->sectors_per_block - 1));
1238 if (new_range->logical_sector + new_range->n_sectors <= range->logical_sector)
1240 else if (new_range->logical_sector >= range->logical_sector + range->n_sectors)
1626 if (likely(!bio->bi_status) && unlikely(bio_sectors(bio) != dio->range.n_sectors)) {
1627 dio->range.logical_sector += dio->range.n_sectors;
1628 bio_advance(bio, dio->range.n_sectors << SECTOR_SHIFT);
1846 sectors_to_process = dio->range.n_sectors;
1896 unsigned int data_to_process = dio->range.n_sectors;
2031 unsigned int n_sectors;
2034 n_sectors = dio->range.n_sectors;
2039 if (unlikely(bv.bv_len >> SECTOR_SHIFT > n_sectors))
2040 bv.bv_len = n_sectors << SECTOR_SHIFT;
2041 n_sectors -= bv.bv_len >> SECTOR_SHIFT;
2155 } while (n_sectors);
2207 dio->range.n_sectors = bio_sectors(bio);
2214 dio->range.n_sectors = min(dio->range.n_sectors,
2216 if (unlikely(!dio->range.n_sectors)) {
2222 range_sectors = dio->range.n_sectors >> ic->sb->log2_sectors_per_block;
2254 } while ((i += ic->sectors_per_block) < dio->range.n_sectors);
2263 if (unlikely(dio->range.n_sectors > next_sector - dio->range.logical_sector))
2264 dio->range.n_sectors = next_sector - dio->range.logical_sector;
2269 for (i = ic->sectors_per_block; i < dio->range.n_sectors; i += ic->sectors_per_block, jp++) {
2273 dio->range.n_sectors = i;
2291 dio->range.n_sectors = ic->sectors_per_block;
2315 unlikely(next_sector < dio->range.logical_sector - dio->range.n_sectors)) {
2336 dio->range.n_sectors, BITMAP_OP_TEST_ALL_SET)) {
2361 bio->bi_iter.bi_size = dio->range.n_sectors << SECTOR_SHIFT;
2380 dio->range.logical_sector + dio->range.n_sectors > le64_to_cpu(ic->sb->recalc_sector))
2384 dio->range.n_sectors, BITMAP_OP_TEST_ALL_CLEAR))
2593 io->range.n_sectors = (k - j) << ic->sb->log2_sectors_per_block;
2731 sector_t logical_sector, n_sectors;
2778 range.n_sectors = min((sector_t)recalc_sectors, ic->provided_data_sectors - range.logical_sector);
2780 range.n_sectors = min(range.n_sectors, ((sector_t)1U << ic->sb->log2_interleave_sectors) - (unsigned int)offset);
2785 n_sectors = range.n_sectors;
2788 if (block_bitmap_op(ic, ic->recalc_bitmap, logical_sector, n_sectors, BITMAP_OP_TEST_ALL_CLEAR))
2794 n_sectors -= ic->sectors_per_block;
2797 while (block_bitmap_op(ic, ic->recalc_bitmap, logical_sector + n_sectors - ic->sectors_per_block,
2799 n_sectors -= ic->sectors_per_block;
2805 DEBUG_print("recalculating: %llx, %llx\n", logical_sector, n_sectors);
2825 io_loc.count = n_sectors;
2834 for (i = 0; i < n_sectors; i += ic->sectors_per_block) {
2853 end = ((range.logical_sector + range.n_sectors) >>
2864 ic->sb->recalc_sector = cpu_to_le64(range.logical_sector + range.n_sectors);
2902 dio->range.n_sectors, BITMAP_OP_TEST_ALL_SET)) {
2908 dio->range.n_sectors, BITMAP_OP_SET);
2924 dio->range.n_sectors, BITMAP_OP_SET);
2944 range.n_sectors = ic->provided_data_sectors;