mirrors/qemu
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

block: Make bdrv_is_allocated() byte-based

Browse Source 
We are gradually moving away from sector-based interfaces, towards
byte-based.  In the common case, allocation is unlikely to ever use
values that are not naturally sector-aligned, but it is possible
that byte-based values will let us be more precise about allocation
at the end of an unaligned file that can do byte-based access.

Changing the signature of the function to use int64_t *pnum ensures
that the compiler enforces that all callers are updated.  For now,
the io.c layer still assert()s that all callers are sector-aligned
on input and that *pnum is sector-aligned on return to the caller,
but that can be relaxed when a later patch implements byte-based
block status.  Therefore, this code adds usages like
DIV_ROUND_UP(,BDRV_SECTOR_SIZE) to callers that still want aligned
values, where the call might reasonbly give non-aligned results
in the future; on the other hand, no rounding is needed for callers
that should just continue to work with byte alignment.

For the most part this patch is just the addition of scaling at the
callers followed by inverse scaling at bdrv_is_allocated().  But
some code, particularly bdrv_commit(), gets a lot simpler because it
no longer has to mess with sectors; also, it is now possible to pass
NULL if the caller does not care how much of the image is allocated
beyond the initial offset.  Leave comments where we can further
simplify once a later patch eliminates the need for sector-aligned
requests through bdrv_is_allocated().

For ease of review, bdrv_is_allocated_above() will be tackled
separately.

Signed-off-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Kevin Wolf <kwolf@redhat.com>
This commit is contained in:
Eric Blake 2017-07-07 07:44:57 -05:00 committed by Kevin Wolf
parent 6f8e35e241
commit d6a644bbfe
9 changed files with 126 additions and 105 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
block/backup.c
View File

@ -47,12 +47,6 @@ typedef struct BackupBlockJob {
QLIST_HEAD(, CowRequest) inflight_reqs; QLIST_HEAD(, CowRequest) inflight_reqs;
} BackupBlockJob; } BackupBlockJob;
/* Size of a cluster in sectors, instead of bytes. */
static inline int64_t cluster_size_sectors(BackupBlockJob *job)
{
return job->cluster_size / BDRV_SECTOR_SIZE;
}
/* See if in-flight requests overlap and wait for them to complete */ /* See if in-flight requests overlap and wait for them to complete */
static void coroutine_fn wait_for_overlapping_requests(BackupBlockJob *job, static void coroutine_fn wait_for_overlapping_requests(BackupBlockJob *job,
int64_t start, int64_t start,
@ -433,7 +427,6 @@ static void coroutine_fn backup_run(void *opaque)
BackupCompleteData *data; BackupCompleteData *data;
BlockDriverState *bs = blk_bs(job->common.blk); BlockDriverState *bs = blk_bs(job->common.blk);
int64_t offset; int64_t offset;
int64_t sectors_per_cluster = cluster_size_sectors(job);
int ret = 0; int ret = 0;
QLIST_INIT(&job->inflight_reqs); QLIST_INIT(&job->inflight_reqs);
@ -465,12 +458,13 @@ static void coroutine_fn backup_run(void *opaque)
} }
if (job->sync_mode == MIRROR_SYNC_MODE_TOP) { if (job->sync_mode == MIRROR_SYNC_MODE_TOP) {
int i, n; int i;
int64_t n;
/* Check to see if these blocks are already in the /* Check to see if these blocks are already in the
* backing file. */ * backing file. */
for (i = 0; i < sectors_per_cluster;) { for (i = 0; i < job->cluster_size;) {
/* bdrv_is_allocated() only returns true/false based /* bdrv_is_allocated() only returns true/false based
* on the first set of sectors it comes across that * on the first set of sectors it comes across that
* are are all in the same state. * are are all in the same state.
@ -478,9 +472,8 @@ static void coroutine_fn backup_run(void *opaque)
* backup cluster length. We end up copying more than * backup cluster length. We end up copying more than
* needed but at some point that is always the case. */ * needed but at some point that is always the case. */
alloced = alloced =
bdrv_is_allocated(bs, bdrv_is_allocated(bs, offset + i,
(offset >> BDRV_SECTOR_BITS) + i, job->cluster_size - i, &n);
sectors_per_cluster - i, &n);
i += n; i += n;
if (alloced || n == 0) { if (alloced || n == 0) {

21
block/commit.c
View File

@ -443,7 +443,7 @@ fail:
} }
#define COMMIT_BUF_SECTORS 2048 #define COMMIT_BUF_SIZE (2048 * BDRV_SECTOR_SIZE)
/* commit COW file into the raw image */ /* commit COW file into the raw image */
int bdrv_commit(BlockDriverState *bs) int bdrv_commit(BlockDriverState *bs)
@ -452,8 +452,9 @@ int bdrv_commit(BlockDriverState *bs)
BlockDriverState *backing_file_bs = NULL; BlockDriverState *backing_file_bs = NULL;
BlockDriverState *commit_top_bs = NULL; BlockDriverState *commit_top_bs = NULL;
BlockDriver *drv = bs->drv; BlockDriver *drv = bs->drv;
int64_t sector, total_sectors, length, backing_length; int64_t offset, length, backing_length;
int n, ro, open_flags; int ro, open_flags;
int64_t n;
int ret = 0; int ret = 0;
uint8_t *buf = NULL; uint8_t *buf = NULL;
Error *local_err = NULL; Error *local_err = NULL;
@ -531,30 +532,26 @@ int bdrv_commit(BlockDriverState *bs)
} }
} }
total_sectors = length >> BDRV_SECTOR_BITS;
/* blk_try_blockalign() for src will choose an alignment that works for /* blk_try_blockalign() for src will choose an alignment that works for
* backing as well, so no need to compare the alignment manually. */ * backing as well, so no need to compare the alignment manually. */
buf = blk_try_blockalign(src, COMMIT_BUF_SECTORS * BDRV_SECTOR_SIZE); buf = blk_try_blockalign(src, COMMIT_BUF_SIZE);
if (buf == NULL) { if (buf == NULL) {
ret = -ENOMEM; ret = -ENOMEM;
goto ro_cleanup; goto ro_cleanup;
} }
for (sector = 0; sector < total_sectors; sector += n) { for (offset = 0; offset < length; offset += n) {
ret = bdrv_is_allocated(bs, sector, COMMIT_BUF_SECTORS, &n); ret = bdrv_is_allocated(bs, offset, COMMIT_BUF_SIZE, &n);
if (ret < 0) { if (ret < 0) {
goto ro_cleanup; goto ro_cleanup;
} }
if (ret) { if (ret) {
ret = blk_pread(src, sector * BDRV_SECTOR_SIZE, buf, ret = blk_pread(src, offset, buf, n);
n * BDRV_SECTOR_SIZE);
if (ret < 0) { if (ret < 0) {
goto ro_cleanup; goto ro_cleanup;
} }
ret = blk_pwrite(backing, sector * BDRV_SECTOR_SIZE, buf, ret = blk_pwrite(backing, offset, buf, n, 0);
n * BDRV_SECTOR_SIZE, 0);
if (ret < 0) { if (ret < 0) {
goto ro_cleanup; goto ro_cleanup;
} }

52
block/io.c
View File

@ -1033,17 +1033,18 @@ static int coroutine_fn bdrv_aligned_preadv(BdrvChild *child,
} }
if (flags & BDRV_REQ_COPY_ON_READ) { if (flags & BDRV_REQ_COPY_ON_READ) {
int64_t start_sector = offset >> BDRV_SECTOR_BITS; /* TODO: Simplify further once bdrv_is_allocated no longer
int64_t end_sector = DIV_ROUND_UP(offset + bytes, BDRV_SECTOR_SIZE); * requires sector alignment */
unsigned int nb_sectors = end_sector - start_sector; int64_t start = QEMU_ALIGN_DOWN(offset, BDRV_SECTOR_SIZE);
int pnum; int64_t end = QEMU_ALIGN_UP(offset + bytes, BDRV_SECTOR_SIZE);
int64_t pnum;
ret = bdrv_is_allocated(bs, start_sector, nb_sectors, &pnum); ret = bdrv_is_allocated(bs, start, end - start, &pnum);
if (ret < 0) { if (ret < 0) {
goto out; goto out;
} }
if (!ret || pnum != nb_sectors) { if (!ret || pnum != end - start) {
ret = bdrv_co_do_copy_on_readv(child, offset, bytes, qiov); ret = bdrv_co_do_copy_on_readv(child, offset, bytes, qiov);
goto out; goto out;
} }
@ -1900,15 +1901,25 @@ int64_t bdrv_get_block_status(BlockDriverState *bs,
sector_num, nb_sectors, pnum, file); sector_num, nb_sectors, pnum, file);
} }
int coroutine_fn bdrv_is_allocated(BlockDriverState *bs, int64_t sector_num, int coroutine_fn bdrv_is_allocated(BlockDriverState *bs, int64_t offset,
int nb_sectors, int *pnum) int64_t bytes, int64_t *pnum)
{ {
BlockDriverState *file; BlockDriverState *file;
int64_t ret = bdrv_get_block_status(bs, sector_num, nb_sectors, pnum, int64_t sector_num = offset >> BDRV_SECTOR_BITS;
int nb_sectors = bytes >> BDRV_SECTOR_BITS;
int64_t ret;
int psectors;
assert(QEMU_IS_ALIGNED(offset, BDRV_SECTOR_SIZE));
assert(QEMU_IS_ALIGNED(bytes, BDRV_SECTOR_SIZE) && bytes < INT_MAX);
ret = bdrv_get_block_status(bs, sector_num, nb_sectors, &psectors,
&file); &file);
if (ret < 0) { if (ret < 0) {
return ret; return ret;
} }
if (pnum) {
*pnum = psectors * BDRV_SECTOR_SIZE;
}
return !!(ret & BDRV_BLOCK_ALLOCATED); return !!(ret & BDRV_BLOCK_ALLOCATED);
} }
@ -1917,7 +1928,8 @@ int coroutine_fn bdrv_is_allocated(BlockDriverState *bs, int64_t sector_num,
* *
* Return true if the given sector is allocated in any image between * Return true if the given sector is allocated in any image between
* BASE and TOP (inclusive). BASE can be NULL to check if the given * BASE and TOP (inclusive). BASE can be NULL to check if the given
* sector is allocated in any image of the chain. Return false otherwise. * sector is allocated in any image of the chain. Return false otherwise,
* or negative errno on failure.
* *
* 'pnum' is set to the number of sectors (including and immediately following * 'pnum' is set to the number of sectors (including and immediately following
* the specified sector) that are known to be in the same * the specified sector) that are known to be in the same
@ -1934,13 +1946,19 @@ int bdrv_is_allocated_above(BlockDriverState *top,
intermediate = top; intermediate = top;
while (intermediate && intermediate != base) { while (intermediate && intermediate != base) {
int pnum_inter; int64_t pnum_inter;
ret = bdrv_is_allocated(intermediate, sector_num, nb_sectors, int psectors_inter;
ret = bdrv_is_allocated(intermediate, sector_num * BDRV_SECTOR_SIZE,
nb_sectors * BDRV_SECTOR_SIZE,
&pnum_inter); &pnum_inter);
if (ret < 0) { if (ret < 0) {
return ret; return ret;
} else if (ret) { }
*pnum = pnum_inter; assert(pnum_inter < INT_MAX * BDRV_SECTOR_SIZE);
psectors_inter = pnum_inter >> BDRV_SECTOR_BITS;
if (ret) {
*pnum = psectors_inter;
return 1; return 1;
} }
@ -1950,10 +1968,10 @@ int bdrv_is_allocated_above(BlockDriverState *top,
* *
* [sector_num+x, nr_sectors] allocated. * [sector_num+x, nr_sectors] allocated.
*/ */
if (n > pnum_inter && if (n > psectors_inter &&
(intermediate == top || (intermediate == top ||
sector_num + pnum_inter < intermediate->total_sectors)) { sector_num + psectors_inter < intermediate->total_sectors)) {
n = pnum_inter; n = psectors_inter;
} }
intermediate = backing_bs(intermediate); intermediate = backing_bs(intermediate);

7
block/stream.c
View File

@ -137,6 +137,7 @@ static void coroutine_fn stream_run(void *opaque)
for ( ; offset < s->common.len; offset += n * BDRV_SECTOR_SIZE) { for ( ; offset < s->common.len; offset += n * BDRV_SECTOR_SIZE) {
bool copy; bool copy;
int64_t count = 0;
/* Note that even when no rate limit is applied we need to yield /* Note that even when no rate limit is applied we need to yield
* with no pending I/O here so that bdrv_drain_all() returns. * with no pending I/O here so that bdrv_drain_all() returns.
@ -148,8 +149,10 @@ static void coroutine_fn stream_run(void *opaque)
copy = false; copy = false;
ret = bdrv_is_allocated(bs, offset / BDRV_SECTOR_SIZE, ret = bdrv_is_allocated(bs, offset, STREAM_BUFFER_SIZE, &count);
STREAM_BUFFER_SIZE / BDRV_SECTOR_SIZE, &n); /* TODO relax this once bdrv_is_allocated does not enforce sectors */
assert(QEMU_IS_ALIGNED(count, BDRV_SECTOR_SIZE));
n = count >> BDRV_SECTOR_BITS;
if (ret == 1) { if (ret == 1) {
/* Allocated in the top, no need to copy. */ /* Allocated in the top, no need to copy. */
} else if (ret >= 0) { } else if (ret >= 0) {

34
block/vvfat.c
View File

@ -1482,24 +1482,27 @@ static int vvfat_read(BlockDriverState *bs, int64_t sector_num,
if (sector_num >= bs->total_sectors) if (sector_num >= bs->total_sectors)
return -1; return -1;
if (s->qcow) { if (s->qcow) {
int n; int64_t n;
int ret; int ret;
ret = bdrv_is_allocated(s->qcow->bs, sector_num, ret = bdrv_is_allocated(s->qcow->bs, sector_num * BDRV_SECTOR_SIZE,
nb_sectors - i, &n); (nb_sectors - i) * BDRV_SECTOR_SIZE, &n);
if (ret < 0) { if (ret < 0) {
return ret; return ret;
} }
if (ret) { if (ret) {
DLOG(fprintf(stderr, "sectors %d+%d allocated\n", DLOG(fprintf(stderr, "sectors %" PRId64 "+%" PRId64
(int)sector_num, n)); " allocated\n", sector_num,
if (bdrv_read(s->qcow, sector_num, buf + i * 0x200, n)) { n >> BDRV_SECTOR_BITS));
if (bdrv_read(s->qcow, sector_num, buf + i * 0x200,
n >> BDRV_SECTOR_BITS)) {
return -1; return -1;
} }
i += n - 1; i += (n >> BDRV_SECTOR_BITS) - 1;
sector_num += n - 1; sector_num += (n >> BDRV_SECTOR_BITS) - 1;
continue; continue;
} }
DLOG(fprintf(stderr, "sector %d not allocated\n", (int)sector_num)); DLOG(fprintf(stderr, "sector %" PRId64 " not allocated\n",
sector_num));
} }
if (sector_num < s->offset_to_root_dir) { if (sector_num < s->offset_to_root_dir) {
if (sector_num < s->offset_to_fat) { if (sector_num < s->offset_to_fat) {
@ -1779,7 +1782,7 @@ static inline bool cluster_was_modified(BDRVVVFATState *s,
uint32_t cluster_num) uint32_t cluster_num)
{ {
int was_modified = 0; int was_modified = 0;
int i, dummy; int i;
if (s->qcow == NULL) { if (s->qcow == NULL) {
return 0; return 0;
@ -1787,8 +1790,9 @@ static inline bool cluster_was_modified(BDRVVVFATState *s,
for (i = 0; !was_modified && i < s->sectors_per_cluster; i++) { for (i = 0; !was_modified && i < s->sectors_per_cluster; i++) {
was_modified = bdrv_is_allocated(s->qcow->bs, was_modified = bdrv_is_allocated(s->qcow->bs,
cluster2sector(s, cluster_num) + i, (cluster2sector(s, cluster_num) +
1, &dummy); i) * BDRV_SECTOR_SIZE,
BDRV_SECTOR_SIZE, NULL);
} }
/* /*
@ -1935,7 +1939,7 @@ static uint32_t get_cluster_count_for_direntry(BDRVVVFATState* s,
} }
if (copy_it) { if (copy_it) {
int i, dummy; int i;
/* /*
* This is horribly inefficient, but that is okay, since * This is horribly inefficient, but that is okay, since
* it is rarely executed, if at all. * it is rarely executed, if at all.
@ -1946,7 +1950,9 @@ static uint32_t get_cluster_count_for_direntry(BDRVVVFATState* s,
for (i = 0; i < s->sectors_per_cluster; i++) { for (i = 0; i < s->sectors_per_cluster; i++) {
int res; int res;
res = bdrv_is_allocated(s->qcow->bs, offset + i, 1, &dummy); res = bdrv_is_allocated(s->qcow->bs,
(offset + i) * BDRV_SECTOR_SIZE,
BDRV_SECTOR_SIZE, NULL);
if (res < 0) { if (res < 0) {
return -1; return -1;
} }

4
include/block/block.h
View File

@ -427,8 +427,8 @@ int64_t bdrv_get_block_status_above(BlockDriverState *bs,
int64_t sector_num, int64_t sector_num,
int nb_sectors, int *pnum, int nb_sectors, int *pnum,
BlockDriverState **file); BlockDriverState **file);
int bdrv_is_allocated(BlockDriverState *bs, int64_t sector_num, int nb_sectors, int bdrv_is_allocated(BlockDriverState *bs, int64_t offset, int64_t bytes,
int *pnum); int64_t *pnum);
int bdrv_is_allocated_above(BlockDriverState *top, BlockDriverState *base, int bdrv_is_allocated_above(BlockDriverState *top, BlockDriverState *base,
int64_t sector_num, int nb_sectors, int *pnum); int64_t sector_num, int nb_sectors, int *pnum);

16
migration/block.c
View File

@ -34,7 +34,7 @@
#define BLK_MIG_FLAG_PROGRESS 0x04 #define BLK_MIG_FLAG_PROGRESS 0x04
#define BLK_MIG_FLAG_ZERO_BLOCK 0x08 #define BLK_MIG_FLAG_ZERO_BLOCK 0x08
#define MAX_IS_ALLOCATED_SEARCH 65536 #define MAX_IS_ALLOCATED_SEARCH (65536 * BDRV_SECTOR_SIZE)
#define MAX_INFLIGHT_IO 512 #define MAX_INFLIGHT_IO 512
@ -267,16 +267,20 @@ static int mig_save_device_bulk(QEMUFile *f, BlkMigDevState *bmds)
BlockBackend *bb = bmds->blk; BlockBackend *bb = bmds->blk;
BlkMigBlock *blk; BlkMigBlock *blk;
int nr_sectors; int nr_sectors;
int64_t count;
if (bmds->shared_base) { if (bmds->shared_base) {
qemu_mutex_lock_iothread(); qemu_mutex_lock_iothread();
aio_context_acquire(blk_get_aio_context(bb)); aio_context_acquire(blk_get_aio_context(bb));
/* Skip unallocated sectors; intentionally treats failure as /* Skip unallocated sectors; intentionally treats failure or
* an allocated sector */ * partial sector as an allocated sector */
while (cur_sector < total_sectors && while (cur_sector < total_sectors &&
!bdrv_is_allocated(blk_bs(bb), cur_sector, !bdrv_is_allocated(blk_bs(bb), cur_sector * BDRV_SECTOR_SIZE,
MAX_IS_ALLOCATED_SEARCH, &nr_sectors)) { MAX_IS_ALLOCATED_SEARCH, &count)) {
cur_sector += nr_sectors; if (count < BDRV_SECTOR_SIZE) {
break;
}
cur_sector += count >> BDRV_SECTOR_BITS;
} }
aio_context_release(blk_get_aio_context(bb)); aio_context_release(blk_get_aio_context(bb));
qemu_mutex_unlock_iothread(); qemu_mutex_unlock_iothread();

8
qemu-img.c
View File

@ -3258,6 +3258,7 @@ static int img_rebase(int argc, char **argv)
int64_t new_backing_num_sectors = 0; int64_t new_backing_num_sectors = 0;
uint64_t sector; uint64_t sector;
int n; int n;
int64_t count;
float local_progress = 0; float local_progress = 0;
buf_old = blk_blockalign(blk, IO_BUF_SIZE); buf_old = blk_blockalign(blk, IO_BUF_SIZE);
@ -3305,12 +3306,17 @@ static int img_rebase(int argc, char **argv)
} }
/* If the cluster is allocated, we don't need to take action */ /* If the cluster is allocated, we don't need to take action */
ret = bdrv_is_allocated(bs, sector, n, &n); ret = bdrv_is_allocated(bs, sector << BDRV_SECTOR_BITS,
n << BDRV_SECTOR_BITS, &count);
if (ret < 0) { if (ret < 0) {
error_report("error while reading image metadata: %s", error_report("error while reading image metadata: %s",
strerror(-ret)); strerror(-ret));
goto out; goto out;
} }
/* TODO relax this once bdrv_is_allocated does not enforce
* sector alignment */
assert(QEMU_IS_ALIGNED(count, BDRV_SECTOR_SIZE));
n = count >> BDRV_SECTOR_BITS;
if (ret) { if (ret) {
continue; continue;
} }

70
qemu-io-cmds.c
View File

@ -1760,12 +1760,12 @@ out:
static int alloc_f(BlockBackend *blk, int argc, char **argv) static int alloc_f(BlockBackend *blk, int argc, char **argv)
{ {
BlockDriverState *bs = blk_bs(blk); BlockDriverState *bs = blk_bs(blk);
int64_t offset, sector_num, nb_sectors, remaining, count; int64_t offset, start, remaining, count;
char s1[64]; char s1[64];
int num, ret; int ret;
int64_t sum_alloc; int64_t num, sum_alloc;
offset = cvtnum(argv[1]); start = offset = cvtnum(argv[1]);
if (offset < 0) { if (offset < 0) {
print_cvtnum_err(offset, argv[1]); print_cvtnum_err(offset, argv[1]);
return 0; return 0;
@ -1793,32 +1793,30 @@ static int alloc_f(BlockBackend *blk, int argc, char **argv)
count); count);
return 0; return 0;
} }
nb_sectors = count >> BDRV_SECTOR_BITS;
remaining = nb_sectors; remaining = count;
sum_alloc = 0; sum_alloc = 0;
sector_num = offset >> 9;
while (remaining) { while (remaining) {
ret = bdrv_is_allocated(bs, sector_num, remaining, &num); ret = bdrv_is_allocated(bs, offset, remaining, &num);
if (ret < 0) { if (ret < 0) {
printf("is_allocated failed: %s\n", strerror(-ret)); printf("is_allocated failed: %s\n", strerror(-ret));
return 0; return 0;
} }
sector_num += num; offset += num;
remaining -= num; remaining -= num;
if (ret) { if (ret) {
sum_alloc += num; sum_alloc += num;
} }
if (num == 0) { if (num == 0) {
nb_sectors -= remaining; count -= remaining;
remaining = 0; remaining = 0;
} }
} }
cvtstr(offset, s1, sizeof(s1)); cvtstr(start, s1, sizeof(s1));
printf("%"PRId64"/%"PRId64" bytes allocated at offset %s\n", printf("%"PRId64"/%"PRId64" bytes allocated at offset %s\n",
sum_alloc << BDRV_SECTOR_BITS, nb_sectors << BDRV_SECTOR_BITS, s1); sum_alloc, count, s1);
return 0; return 0;
} }
@ -1833,14 +1831,15 @@ static const cmdinfo_t alloc_cmd = {
}; };
static int map_is_allocated(BlockDriverState *bs, int64_t sector_num, static int map_is_allocated(BlockDriverState *bs, int64_t offset,
int64_t nb_sectors, int64_t *pnum) int64_t bytes, int64_t *pnum)
{ {
int num, num_checked; int64_t num;
int num_checked;
int ret, firstret; int ret, firstret;
num_checked = MIN(nb_sectors, INT_MAX); num_checked = MIN(bytes, BDRV_REQUEST_MAX_BYTES);
ret = bdrv_is_allocated(bs, sector_num, num_checked, &num); ret = bdrv_is_allocated(bs, offset, num_checked, &num);
if (ret < 0) { if (ret < 0) {
return ret; return ret;
} }
@ -1848,12 +1847,12 @@ static int map_is_allocated(BlockDriverState *bs, int64_t sector_num,
firstret = ret; firstret = ret;
*pnum = num; *pnum = num;
while (nb_sectors > 0 && ret == firstret) { while (bytes > 0 && ret == firstret) {
sector_num += num; offset += num;
nb_sectors -= num; bytes -= num;
num_checked = MIN(nb_sectors, INT_MAX); num_checked = MIN(bytes, BDRV_REQUEST_MAX_BYTES);
ret = bdrv_is_allocated(bs, sector_num, num_checked, &num); ret = bdrv_is_allocated(bs, offset, num_checked, &num);
if (ret == firstret && num) { if (ret == firstret && num) {
*pnum += num; *pnum += num;
} else { } else {
@ -1866,25 +1865,21 @@ static int map_is_allocated(BlockDriverState *bs, int64_t sector_num,
static int map_f(BlockBackend *blk, int argc, char **argv) static int map_f(BlockBackend *blk, int argc, char **argv)
{ {
int64_t offset; int64_t offset, bytes;
int64_t nb_sectors, total_sectors;
char s1[64], s2[64]; char s1[64], s2[64];
int64_t num; int64_t num;
int ret; int ret;
const char *retstr; const char *retstr;
offset = 0; offset = 0;
total_sectors = blk_nb_sectors(blk); bytes = blk_getlength(blk);
if (total_sectors < 0) { if (bytes < 0) {
error_report("Failed to query image length: %s", error_report("Failed to query image length: %s", strerror(-bytes));
strerror(-total_sectors));
return 0; return 0;
} }
nb_sectors = total_sectors; while (bytes) {
ret = map_is_allocated(blk_bs(blk), offset, bytes, &num);
do {
ret = map_is_allocated(blk_bs(blk), offset, nb_sectors, &num);
if (ret < 0) { if (ret < 0) {
error_report("Failed to get allocation status: %s", strerror(-ret)); error_report("Failed to get allocation status: %s", strerror(-ret));
return 0; return 0;
@ -1894,15 +1889,14 @@ static int map_f(BlockBackend *blk, int argc, char **argv)
} }
retstr = ret ? " allocated" : "not allocated"; retstr = ret ? " allocated" : "not allocated";
cvtstr(num << BDRV_SECTOR_BITS, s1, sizeof(s1)); cvtstr(num, s1, sizeof(s1));
cvtstr(offset << BDRV_SECTOR_BITS, s2, sizeof(s2)); cvtstr(offset, s2, sizeof(s2));
printf("%s (0x%" PRIx64 ") bytes %s at offset %s (0x%" PRIx64 ")\n", printf("%s (0x%" PRIx64 ") bytes %s at offset %s (0x%" PRIx64 ")\n",
s1, num << BDRV_SECTOR_BITS, retstr, s1, num, retstr, s2, offset);
s2, offset << BDRV_SECTOR_BITS);
offset += num; offset += num;
nb_sectors -= num; bytes -= num;
} while (offset < total_sectors); }
return 0; return 0;
} }