mirror of https://github.com/xqemu/xqemu.git
qed: Add return value to qed_aio_read/write_data()
Don't recurse into qed_aio_next_io() and qed_aio_complete() here, but just return an error code and let the caller handle it. Signed-off-by: Kevin Wolf <kwolf@redhat.com> Reviewed-by: Stefan Hajnoczi <stefanha@redhat.com>
This commit is contained in:
parent
d6daddcdeb
commit
0596be7e6a
68
block/qed.c
68
block/qed.c
|
@ -1205,12 +1205,11 @@ static int qed_aio_write_inplace(QEDAIOCB *acb, uint64_t offset, size_t len)
|
||||||
* Write data cluster
|
* Write data cluster
|
||||||
*
|
*
|
||||||
* @opaque: Write request
|
* @opaque: Write request
|
||||||
* @ret: QED_CLUSTER_FOUND, QED_CLUSTER_L2, QED_CLUSTER_L1,
|
* @ret: QED_CLUSTER_FOUND, QED_CLUSTER_L2 or QED_CLUSTER_L1
|
||||||
* or -errno
|
|
||||||
* @offset: Cluster offset in bytes
|
* @offset: Cluster offset in bytes
|
||||||
* @len: Length in bytes
|
* @len: Length in bytes
|
||||||
*/
|
*/
|
||||||
static void qed_aio_write_data(void *opaque, int ret,
|
static int qed_aio_write_data(void *opaque, int ret,
|
||||||
uint64_t offset, size_t len)
|
uint64_t offset, size_t len)
|
||||||
{
|
{
|
||||||
QEDAIOCB *acb = opaque;
|
QEDAIOCB *acb = opaque;
|
||||||
|
@ -1221,40 +1220,27 @@ static void qed_aio_write_data(void *opaque, int ret,
|
||||||
|
|
||||||
switch (ret) {
|
switch (ret) {
|
||||||
case QED_CLUSTER_FOUND:
|
case QED_CLUSTER_FOUND:
|
||||||
ret = qed_aio_write_inplace(acb, offset, len);
|
return qed_aio_write_inplace(acb, offset, len);
|
||||||
break;
|
|
||||||
|
|
||||||
case QED_CLUSTER_L2:
|
case QED_CLUSTER_L2:
|
||||||
case QED_CLUSTER_L1:
|
case QED_CLUSTER_L1:
|
||||||
case QED_CLUSTER_ZERO:
|
case QED_CLUSTER_ZERO:
|
||||||
ret = qed_aio_write_alloc(acb, len);
|
return qed_aio_write_alloc(acb, len);
|
||||||
break;
|
|
||||||
|
|
||||||
default:
|
default:
|
||||||
assert(ret < 0);
|
g_assert_not_reached();
|
||||||
break;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if (ret < 0) {
|
|
||||||
if (ret != -EINPROGRESS) {
|
|
||||||
qed_aio_complete(acb, ret);
|
|
||||||
}
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
qed_aio_next_io(acb, 0);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Read data cluster
|
* Read data cluster
|
||||||
*
|
*
|
||||||
* @opaque: Read request
|
* @opaque: Read request
|
||||||
* @ret: QED_CLUSTER_FOUND, QED_CLUSTER_L2, QED_CLUSTER_L1,
|
* @ret: QED_CLUSTER_FOUND, QED_CLUSTER_L2 or QED_CLUSTER_L1
|
||||||
* or -errno
|
|
||||||
* @offset: Cluster offset in bytes
|
* @offset: Cluster offset in bytes
|
||||||
* @len: Length in bytes
|
* @len: Length in bytes
|
||||||
*/
|
*/
|
||||||
static void qed_aio_read_data(void *opaque, int ret,
|
static int qed_aio_read_data(void *opaque, int ret, uint64_t offset, size_t len)
|
||||||
uint64_t offset, size_t len)
|
|
||||||
{
|
{
|
||||||
QEDAIOCB *acb = opaque;
|
QEDAIOCB *acb = opaque;
|
||||||
BDRVQEDState *s = acb_to_s(acb);
|
BDRVQEDState *s = acb_to_s(acb);
|
||||||
|
@ -1265,34 +1251,23 @@ static void qed_aio_read_data(void *opaque, int ret,
|
||||||
|
|
||||||
trace_qed_aio_read_data(s, acb, ret, offset, len);
|
trace_qed_aio_read_data(s, acb, ret, offset, len);
|
||||||
|
|
||||||
if (ret < 0) {
|
|
||||||
goto err;
|
|
||||||
}
|
|
||||||
|
|
||||||
qemu_iovec_concat(&acb->cur_qiov, acb->qiov, acb->qiov_offset, len);
|
qemu_iovec_concat(&acb->cur_qiov, acb->qiov, acb->qiov_offset, len);
|
||||||
|
|
||||||
/* Handle zero cluster and backing file reads */
|
/* Handle zero cluster and backing file reads */
|
||||||
if (ret == QED_CLUSTER_ZERO) {
|
if (ret == QED_CLUSTER_ZERO) {
|
||||||
qemu_iovec_memset(&acb->cur_qiov, 0, 0, acb->cur_qiov.size);
|
qemu_iovec_memset(&acb->cur_qiov, 0, 0, acb->cur_qiov.size);
|
||||||
qed_aio_start_io(acb);
|
return 0;
|
||||||
return;
|
|
||||||
} else if (ret != QED_CLUSTER_FOUND) {
|
} else if (ret != QED_CLUSTER_FOUND) {
|
||||||
ret = qed_read_backing_file(s, acb->cur_pos, &acb->cur_qiov,
|
return qed_read_backing_file(s, acb->cur_pos, &acb->cur_qiov,
|
||||||
&acb->backing_qiov);
|
&acb->backing_qiov);
|
||||||
qed_aio_next_io(acb, ret);
|
|
||||||
return;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
BLKDBG_EVENT(bs->file, BLKDBG_READ_AIO);
|
BLKDBG_EVENT(bs->file, BLKDBG_READ_AIO);
|
||||||
ret = bdrv_preadv(bs->file, offset, &acb->cur_qiov);
|
ret = bdrv_preadv(bs->file, offset, &acb->cur_qiov);
|
||||||
if (ret < 0) {
|
if (ret < 0) {
|
||||||
goto err;
|
return ret;
|
||||||
}
|
}
|
||||||
qed_aio_next_io(acb, 0);
|
return 0;
|
||||||
return;
|
|
||||||
|
|
||||||
err:
|
|
||||||
qed_aio_complete(acb, ret);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -1301,8 +1276,6 @@ err:
|
||||||
static void qed_aio_next_io(QEDAIOCB *acb, int ret)
|
static void qed_aio_next_io(QEDAIOCB *acb, int ret)
|
||||||
{
|
{
|
||||||
BDRVQEDState *s = acb_to_s(acb);
|
BDRVQEDState *s = acb_to_s(acb);
|
||||||
QEDFindClusterFunc *io_fn = (acb->flags & QED_AIOCB_WRITE) ?
|
|
||||||
qed_aio_write_data : qed_aio_read_data;
|
|
||||||
uint64_t offset;
|
uint64_t offset;
|
||||||
size_t len;
|
size_t len;
|
||||||
|
|
||||||
|
@ -1333,7 +1306,24 @@ static void qed_aio_next_io(QEDAIOCB *acb, int ret)
|
||||||
/* Find next cluster and start I/O */
|
/* Find next cluster and start I/O */
|
||||||
len = acb->end_pos - acb->cur_pos;
|
len = acb->end_pos - acb->cur_pos;
|
||||||
ret = qed_find_cluster(s, &acb->request, acb->cur_pos, &len, &offset);
|
ret = qed_find_cluster(s, &acb->request, acb->cur_pos, &len, &offset);
|
||||||
io_fn(acb, ret, offset, len);
|
if (ret < 0) {
|
||||||
|
qed_aio_complete(acb, ret);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (acb->flags & QED_AIOCB_WRITE) {
|
||||||
|
ret = qed_aio_write_data(acb, ret, offset, len);
|
||||||
|
} else {
|
||||||
|
ret = qed_aio_read_data(acb, ret, offset, len);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (ret < 0) {
|
||||||
|
if (ret != -EINPROGRESS) {
|
||||||
|
qed_aio_complete(acb, ret);
|
||||||
|
}
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
qed_aio_next_io(acb, 0);
|
||||||
}
|
}
|
||||||
|
|
||||||
static BlockAIOCB *qed_aio_setup(BlockDriverState *bs,
|
static BlockAIOCB *qed_aio_setup(BlockDriverState *bs,
|
||||||
|
|
21
block/qed.h
21
block/qed.h
|
@ -177,27 +177,6 @@ enum {
|
||||||
QED_CLUSTER_L1, /* cluster missing in L1 */
|
QED_CLUSTER_L1, /* cluster missing in L1 */
|
||||||
};
|
};
|
||||||
|
|
||||||
/**
|
|
||||||
* qed_find_cluster() completion callback
|
|
||||||
*
|
|
||||||
* @opaque: User data for completion callback
|
|
||||||
* @ret: QED_CLUSTER_FOUND Success
|
|
||||||
* QED_CLUSTER_L2 Data cluster unallocated in L2
|
|
||||||
* QED_CLUSTER_L1 L2 unallocated in L1
|
|
||||||
* -errno POSIX error occurred
|
|
||||||
* @offset: Data cluster offset
|
|
||||||
* @len: Contiguous bytes starting from cluster offset
|
|
||||||
*
|
|
||||||
* This function is invoked when qed_find_cluster() completes.
|
|
||||||
*
|
|
||||||
* On success ret is QED_CLUSTER_FOUND and offset/len are a contiguous range
|
|
||||||
* in the image file.
|
|
||||||
*
|
|
||||||
* On failure ret is QED_CLUSTER_L2 or QED_CLUSTER_L1 for missing L2 or L1
|
|
||||||
* table offset, respectively. len is number of contiguous unallocated bytes.
|
|
||||||
*/
|
|
||||||
typedef void QEDFindClusterFunc(void *opaque, int ret, uint64_t offset, size_t len);
|
|
||||||
|
|
||||||
void qed_acquire(BDRVQEDState *s);
|
void qed_acquire(BDRVQEDState *s);
|
||||||
void qed_release(BDRVQEDState *s);
|
void qed_release(BDRVQEDState *s);
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue