Lines Matching defs:n_sectors
276 sector_t n_sectors;
518 sector_t sector, sector_t n_sectors, int mode)
523 if (unlikely(((sector | n_sectors) & ((1 << ic->sb->log2_sectors_per_block) - 1)) != 0)) {
526 n_sectors,
533 if (unlikely(!n_sectors))
537 end_bit = (sector + n_sectors - 1) >>
672 unsigned section, unsigned offset, unsigned *n_sectors)
679 if (n_sectors)
680 *n_sectors = (PAGE_SIZE - pl_offset) >> SECTOR_SHIFT;
953 unsigned sector, unsigned n_sectors, struct journal_completion *comp)
986 io_loc.count = n_sectors;
1001 unsigned sector, n_sectors;
1004 n_sectors = n_sections * ic->journal_section_sectors;
1006 rw_journal_sectors(ic, op, op_flags, sector, n_sectors, comp);
1071 unsigned n_sectors, sector_t target, io_notify_fn fn, void *data)
1078 BUG_ON((target | n_sectors | offset) & (unsigned)(ic->sectors_per_block - 1));
1100 io_loc.count = n_sectors;
1111 return range1->logical_sector < range2->logical_sector + range2->n_sectors &&
1112 range1->logical_sector + range1->n_sectors > range2->logical_sector;
1120 BUG_ON((new_range->logical_sector | new_range->n_sectors) & (unsigned)(ic->sectors_per_block - 1));
1136 if (new_range->logical_sector + new_range->n_sectors <= range->logical_sector) {
1138 } else if (new_range->logical_sector >= range->logical_sector + range->n_sectors) {
1519 if (likely(!bio->bi_status) && unlikely(bio_sectors(bio) != dio->range.n_sectors)) {
1520 dio->range.logical_sector += dio->range.n_sectors;
1521 bio_advance(bio, dio->range.n_sectors << SECTOR_SHIFT);
1657 sectors_to_process = dio->range.n_sectors;
1710 unsigned data_to_process = dio->range.n_sectors;
1840 unsigned n_sectors;
1843 n_sectors = dio->range.n_sectors;
1848 if (unlikely(bv.bv_len >> SECTOR_SHIFT > n_sectors))
1849 bv.bv_len = n_sectors << SECTOR_SHIFT;
1850 n_sectors -= bv.bv_len >> SECTOR_SHIFT;
1959 } while (n_sectors);
2012 dio->range.n_sectors = bio_sectors(bio);
2019 dio->range.n_sectors = min(dio->range.n_sectors,
2021 if (unlikely(!dio->range.n_sectors)) {
2027 range_sectors = dio->range.n_sectors >> ic->sb->log2_sectors_per_block;
2059 } while ((i += ic->sectors_per_block) < dio->range.n_sectors);
2067 if (unlikely(dio->range.n_sectors > next_sector - dio->range.logical_sector))
2068 dio->range.n_sectors = next_sector - dio->range.logical_sector;
2072 for (i = ic->sectors_per_block; i < dio->range.n_sectors; i += ic->sectors_per_block, jp++) {
2076 dio->range.n_sectors = i;
2094 dio->range.n_sectors = ic->sectors_per_block;
2114 unlikely(next_sector < dio->range.logical_sector - dio->range.n_sectors)) {
2135 dio->range.n_sectors, BITMAP_OP_TEST_ALL_SET)) {
2160 bio->bi_iter.bi_size = dio->range.n_sectors << SECTOR_SHIFT;
2179 dio->range.logical_sector + dio->range.n_sectors > le64_to_cpu(ic->sb->recalc_sector))
2183 dio->range.n_sectors, BITMAP_OP_TEST_ALL_CLEAR))
2387 io->range.n_sectors = (k - j) << ic->sb->log2_sectors_per_block;
2523 sector_t logical_sector, n_sectors;
2549 range.n_sectors = min((sector_t)RECALC_SECTORS, ic->provided_data_sectors - range.logical_sector);
2551 range.n_sectors = min(range.n_sectors, ((sector_t)1U << ic->sb->log2_interleave_sectors) - (unsigned)offset);
2556 n_sectors = range.n_sectors;
2559 if (block_bitmap_op(ic, ic->recalc_bitmap, logical_sector, n_sectors, BITMAP_OP_TEST_ALL_CLEAR)) {
2565 n_sectors -= ic->sectors_per_block;
2568 while (block_bitmap_op(ic, ic->recalc_bitmap, logical_sector + n_sectors - ic->sectors_per_block,
2570 n_sectors -= ic->sectors_per_block;
2576 DEBUG_print("recalculating: %llx, %llx\n", logical_sector, n_sectors);
2597 io_loc.count = n_sectors;
2606 for (i = 0; i < n_sectors; i += ic->sectors_per_block) {
2624 end = ((range.logical_sector + range.n_sectors) >>
2635 ic->sb->recalc_sector = cpu_to_le64(range.logical_sector + range.n_sectors);
2669 dio->range.n_sectors, BITMAP_OP_TEST_ALL_SET)) {
2675 dio->range.n_sectors, BITMAP_OP_SET);
2691 dio->range.n_sectors, BITMAP_OP_SET);
2711 range.n_sectors = ic->provided_data_sectors;