mirror of
https://github.com/yuzu-emu/unicorn.git
synced 2025-02-02 05:01:06 +00:00
qapi: Split visit_end_struct() into pieces
As mentioned in previous patches, we want to call visit_end_struct() functions unconditionally, so that visitors can release resources tied up since the matching visit_start_struct() without also having to worry about error priority if more than one error occurs. Even though error_propagate() can be safely used to ignore a second error during cleanup caused by a first error, it is simpler if the cleanup cannot set an error. So, split out the error checking portion (basically, input visitors checking for unvisited keys) into a new function visit_check_struct(), which can be safely skipped if any earlier errors are encountered, and leave the cleanup portion (which never fails, but must be called unconditionally if visit_start_struct() succeeded) in visit_end_struct(). Generated code in qapi-visit.c has diffs resembling: |@@ -59,10 +59,12 @@ void visit_type_ACPIOSTInfo(Visitor *v, | goto out_obj; | } | visit_type_ACPIOSTInfo_members(v, obj, &err); |- error_propagate(errp, err); |- err = NULL; |+ if (err) { |+ goto out_obj; |+ } |+ visit_check_struct(v, &err); | out_obj: |- visit_end_struct(v, &err); |+ visit_end_struct(v); | out: and in qapi-event.c: @@ -47,7 +47,10 @@ void qapi_event_send_acpi_device_ost(ACP | goto out; | } | visit_type_q_obj_ACPI_DEVICE_OST_arg_members(v, ¶m, &err); |- visit_end_struct(v, err ? NULL : &err); |+ if (!err) { |+ visit_check_struct(v, &err); |+ } |+ visit_end_struct(v); | if (err) { | goto out; Backports commit 15c2f669e3fb2bc97f7b42d1871f595c0ac24af8 from qemu
This commit is contained in:
parent
ae8d475ae0
commit
6084be1882
|
@ -44,8 +44,11 @@ struct Visitor
|
|||
void (*start_struct)(Visitor *v, const char *name, void **obj,
|
||||
size_t size, Error **errp);
|
||||
|
||||
/* Optional; intended for input visitors */
|
||||
void (*check_struct)(Visitor *v, Error **errp);
|
||||
|
||||
/* Must be set to visit structs */
|
||||
void (*end_struct)(Visitor *v, Error **errp);
|
||||
void (*end_struct)(Visitor *v);
|
||||
|
||||
/* Must be set */
|
||||
void (*start_list)(Visitor *v, const char *name, Error **errp);
|
||||
|
|
|
@ -194,10 +194,11 @@
|
|||
* }
|
||||
* outlist:
|
||||
* visit_end_list(v);
|
||||
* if (!err) {
|
||||
* visit_check_struct(v, &err);
|
||||
* }
|
||||
* outobj:
|
||||
* error_propagate(errp, err);
|
||||
* err = NULL;
|
||||
* visit_end_struct(v, &err);
|
||||
* visit_end_struct(v);
|
||||
* out:
|
||||
* error_propagate(errp, err);
|
||||
* ...clean up v...
|
||||
|
@ -253,17 +254,27 @@ void visit_start_struct(Visitor *v, const char *name, void **obj,
|
|||
size_t size, Error **errp);
|
||||
|
||||
/*
|
||||
* Complete an object visit started earlier.
|
||||
* Prepare for completing an object visit.
|
||||
*
|
||||
* @errp obeys typical error usage, and reports failures such as
|
||||
* unparsed keys remaining in the input stream.
|
||||
*
|
||||
* Should be called prior to visit_end_struct() if all other
|
||||
* intermediate visit steps were successful, to allow the visitor one
|
||||
* last chance to report errors. May be skipped on a cleanup path,
|
||||
* where there is no need to check for further errors.
|
||||
*/
|
||||
void visit_check_struct(Visitor *v, Error **errp);
|
||||
|
||||
/*
|
||||
* Complete an object visit started earlier.
|
||||
*
|
||||
* Must be called after any successful use of visit_start_struct(),
|
||||
* even if intermediate processing was skipped due to errors, to allow
|
||||
* the backend to release any resources. Destroying the visitor early
|
||||
* behaves as if this was implicitly called.
|
||||
*/
|
||||
void visit_end_struct(Visitor *v, Error **errp);
|
||||
void visit_end_struct(Visitor *v);
|
||||
|
||||
|
||||
/*** Visiting lists ***/
|
||||
|
|
|
@ -68,7 +68,7 @@ static void qapi_dealloc_start_struct(Visitor *v, const char *name, void **obj,
|
|||
qapi_dealloc_push(qov, obj);
|
||||
}
|
||||
|
||||
static void qapi_dealloc_end_struct(Visitor *v, Error **errp)
|
||||
static void qapi_dealloc_end_struct(Visitor *v)
|
||||
{
|
||||
QapiDeallocVisitor *qov = to_qov(v);
|
||||
void **obj = qapi_dealloc_pop(qov);
|
||||
|
|
|
@ -37,9 +37,16 @@ void visit_start_struct(Visitor *v, const char *name, void **obj,
|
|||
error_propagate(errp, err);
|
||||
}
|
||||
|
||||
void visit_end_struct(Visitor *v, Error **errp)
|
||||
void visit_check_struct(Visitor *v, Error **errp)
|
||||
{
|
||||
v->end_struct(v, errp);
|
||||
if (v->check_struct) {
|
||||
v->check_struct(v, errp);
|
||||
}
|
||||
}
|
||||
|
||||
void visit_end_struct(Visitor *v)
|
||||
{
|
||||
v->end_struct(v);
|
||||
}
|
||||
|
||||
void visit_start_list(Visitor *v, const char *name, Error **errp)
|
||||
|
|
|
@ -130,9 +130,11 @@ static gboolean always_true(gpointer key, gpointer val, gpointer user_pkey)
|
|||
return TRUE;
|
||||
}
|
||||
|
||||
static void qmp_input_pop(QmpInputVisitor *qiv, Error **errp)
|
||||
static void qmp_input_check_struct(Visitor *v, Error **errp)
|
||||
{
|
||||
QmpInputVisitor *qiv = to_qiv(v);
|
||||
StackObject *tos = &qiv->stack[qiv->nb_stack - 1];
|
||||
|
||||
assert(qiv->nb_stack > 0);
|
||||
|
||||
if (qiv->strict) {
|
||||
|
@ -143,6 +145,20 @@ static void qmp_input_pop(QmpInputVisitor *qiv, Error **errp)
|
|||
g_hash_table_find(top_ht, always_true, (gpointer)&key);
|
||||
error_setg(errp, QERR_QMP_EXTRA_MEMBER, key);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void qmp_input_pop(Visitor *v)
|
||||
{
|
||||
QmpInputVisitor *qiv = to_qiv(v);
|
||||
StackObject *tos = &qiv->stack[qiv->nb_stack - 1];
|
||||
|
||||
assert(qiv->nb_stack > 0);
|
||||
|
||||
if (qiv->strict) {
|
||||
GHashTable * const top_ht = qiv->stack[qiv->nb_stack - 1].h;
|
||||
if (top_ht) {
|
||||
g_hash_table_unref(top_ht);
|
||||
}
|
||||
tos->h = NULL;
|
||||
|
@ -178,13 +194,6 @@ static void qmp_input_start_struct(Visitor *v, const char *name, void **obj,
|
|||
}
|
||||
}
|
||||
|
||||
static void qmp_input_end_struct(Visitor *v, Error **errp)
|
||||
{
|
||||
QmpInputVisitor *qiv = to_qiv(v);
|
||||
|
||||
qmp_input_pop(qiv, &error_abort);
|
||||
}
|
||||
|
||||
static void qmp_input_start_list(Visitor *v, const char *name, Error **errp)
|
||||
{
|
||||
QmpInputVisitor *qiv = to_qiv(v);
|
||||
|
@ -221,13 +230,6 @@ static GenericList *qmp_input_next_list(Visitor *v, GenericList **list,
|
|||
return entry;
|
||||
}
|
||||
|
||||
static void qmp_input_end_list(Visitor *v)
|
||||
{
|
||||
QmpInputVisitor *qiv = to_qiv(v);
|
||||
|
||||
qmp_input_pop(qiv, &error_abort);
|
||||
}
|
||||
|
||||
static void qmp_input_start_alternate(Visitor *v, const char *name,
|
||||
GenericAlternate **obj, size_t size,
|
||||
bool promote_int, Error **errp)
|
||||
|
@ -386,11 +388,12 @@ QmpInputVisitor *qmp_input_visitor_new(QObject *obj, bool strict)
|
|||
|
||||
v->visitor.type = VISITOR_INPUT;
|
||||
v->visitor.start_struct = qmp_input_start_struct;
|
||||
v->visitor.end_struct = qmp_input_end_struct;
|
||||
v->visitor.check_struct = qmp_input_check_struct;
|
||||
v->visitor.end_struct = qmp_input_pop;
|
||||
v->visitor.start_alternate = qmp_input_start_alternate;
|
||||
v->visitor.start_list = qmp_input_start_list;
|
||||
v->visitor.next_list = qmp_input_next_list;
|
||||
v->visitor.end_list = qmp_input_end_list;
|
||||
v->visitor.end_list = qmp_input_pop;
|
||||
v->visitor.type_int64 = qmp_input_type_int64;
|
||||
v->visitor.type_uint64 = qmp_input_type_uint64;
|
||||
v->visitor.type_bool = qmp_input_type_bool;
|
||||
|
|
|
@ -112,7 +112,7 @@ static void qmp_output_start_struct(Visitor *v, const char *name, void **obj,
|
|||
qmp_output_push(qov, dict);
|
||||
}
|
||||
|
||||
static void qmp_output_end_struct(Visitor *v, Error **errp)
|
||||
static void qmp_output_end_struct(Visitor *v)
|
||||
{
|
||||
QmpOutputVisitor *qov = to_qov(v);
|
||||
QObject *value = qmp_output_pop(qov);
|
||||
|
|
|
@ -98,7 +98,10 @@ def gen_event_send(name, arg_type):
|
|||
goto out;
|
||||
}
|
||||
visit_type_%(c_name)s_members(v, ¶m, &err);
|
||||
visit_end_struct(v, err ? NULL : &err);
|
||||
if (!err) {
|
||||
visit_check_struct(v, &err);
|
||||
}
|
||||
visit_end_struct(v);
|
||||
if (err) {
|
||||
goto out;
|
||||
}
|
||||
|
|
|
@ -186,9 +186,10 @@ void visit_type_%(c_name)s(Visitor *v, const char *name, %(c_name)s **obj, Error
|
|||
break;
|
||||
}
|
||||
visit_type_%(c_type)s_members(v, &(*obj)->u.%(c_name)s, &err);
|
||||
error_propagate(errp, err);
|
||||
err = NULL;
|
||||
visit_end_struct(v, &err);
|
||||
if (!err) {
|
||||
visit_check_struct(v, &err);
|
||||
}
|
||||
visit_end_struct(v);
|
||||
''',
|
||||
c_type=var.type.c_name(),
|
||||
c_name=c_name(var.name))
|
||||
|
@ -236,10 +237,12 @@ void visit_type_%(c_name)s(Visitor *v, const char *name, %(c_name)s **obj, Error
|
|||
goto out_obj;
|
||||
}
|
||||
visit_type_%(c_name)s_members(v, *obj, &err);
|
||||
error_propagate(errp, err);
|
||||
err = NULL;
|
||||
if (err) {
|
||||
goto out_obj;
|
||||
}
|
||||
visit_check_struct(v, &err);
|
||||
out_obj:
|
||||
visit_end_struct(v, &err);
|
||||
visit_end_struct(v);
|
||||
out:
|
||||
error_propagate(errp, err);
|
||||
}
|
||||
|
|
Loading…
Reference in a new issue