ShuriZma
/
xqemu
mirror of https://github.com/xqemu/xqemu.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

quorum: Inline quorum_fifo_aio_cb() 

Inlining the function removes some boilerplace code and replaces
recursion by a simple loop, so the code becomes somewhat easier to
understand.

Signed-off-by: Kevin Wolf <kwolf@redhat.com>
Reviewed-by: Alberto Garcia <berto@igalia.com>
Reviewed-by: Eric Blake <eblake@redhat.com>
This commit is contained in:
Kevin Wolf 2016-11-10 17:40:34 +01:00
parent 6847da3808
commit a7e159025e
1 changed files with 13 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
block/quorum.c
View File

@ -250,30 +250,6 @@ static void quorum_report_bad_acb(QuorumChildRequest *sacb, int ret)
quorum_report_bad(type, acb->offset, acb->bytes, sacb->bs->node_name, ret); quorum_report_bad(type, acb->offset, acb->bytes, sacb->bs->node_name, ret);
} }
static int quorum_fifo_aio_cb(void *opaque, int ret)
{
QuorumChildRequest *sacb = opaque;
QuorumAIOCB *acb = sacb->parent;
BDRVQuorumState *s = acb->bs->opaque;
assert(acb->is_read && s->read_pattern == QUORUM_READ_PATTERN_FIFO);
if (ret < 0) {
quorum_report_bad_acb(sacb, ret);
/* We try to read next child in FIFO order if we fail to read */
if (acb->children_read < s->num_children) {
return read_fifo_child(acb);
}
}
acb->vote_ret = ret;
/* FIXME: rewrite failed children if acb->children_read > 1? */
return ret;
}
static void quorum_report_bad_versions(BDRVQuorumState *s, static void quorum_report_bad_versions(BDRVQuorumState *s,
QuorumAIOCB *acb, QuorumAIOCB *acb,
QuorumVoteValue *value) QuorumVoteValue *value)
@ -679,12 +655,20 @@ static int read_quorum_children(QuorumAIOCB *acb)
static int read_fifo_child(QuorumAIOCB *acb) static int read_fifo_child(QuorumAIOCB *acb)
{ {
BDRVQuorumState *s = acb->bs->opaque; BDRVQuorumState *s = acb->bs->opaque;
int n = acb->children_read++; int n, ret;
int ret;
acb->qcrs[n].bs = s->children[n]->bs; /* We try to read the next child in FIFO order if we failed to read */
ret = bdrv_co_preadv(s->children[n], acb->offset, acb->bytes, acb->qiov, 0); do {
ret = quorum_fifo_aio_cb(&acb->qcrs[n], ret); n = acb->children_read++;
acb->qcrs[n].bs = s->children[n]->bs;
ret = bdrv_co_preadv(s->children[n], acb->offset, acb->bytes,
acb->qiov, 0);
if (ret < 0) {
quorum_report_bad_acb(&acb->qcrs[n], ret);
}
} while (ret < 0 && acb->children_read < s->num_children);
/* FIXME: rewrite failed children if acb->children_read > 1? */
return ret; return ret;
} }