2011-11-15 01:05:29 +04:00
|
|
|
/*
|
|
|
|
* QMP Output Visitor unit-tests.
|
|
|
|
*
|
2015-05-04 18:05:06 +03:00
|
|
|
* Copyright (C) 2011, 2015 Red Hat Inc.
|
2011-11-15 01:05:29 +04:00
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Luiz Capitulino <lcapitulino@redhat.com>
|
|
|
|
*
|
|
|
|
* This work is licensed under the terms of the GNU GPL, version 2 or later.
|
|
|
|
* See the COPYING file in the top-level directory.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <glib.h>
|
|
|
|
|
2012-12-06 14:22:34 +04:00
|
|
|
#include "qemu-common.h"
|
2011-11-15 01:05:29 +04:00
|
|
|
#include "qapi/qmp-output-visitor.h"
|
|
|
|
#include "test-qapi-types.h"
|
|
|
|
#include "test-qapi-visit.h"
|
2012-12-17 21:19:43 +04:00
|
|
|
#include "qapi/qmp/types.h"
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
typedef struct TestOutputVisitorData {
|
|
|
|
QmpOutputVisitor *qov;
|
|
|
|
Visitor *ov;
|
|
|
|
} TestOutputVisitorData;
|
|
|
|
|
|
|
|
static void visitor_output_setup(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
data->qov = qmp_output_visitor_new();
|
|
|
|
g_assert(data->qov != NULL);
|
|
|
|
|
|
|
|
data->ov = qmp_output_get_visitor(data->qov);
|
|
|
|
g_assert(data->ov != NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void visitor_output_teardown(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
qmp_output_visitor_cleanup(data->qov);
|
|
|
|
data->qov = NULL;
|
|
|
|
data->ov = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_int(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
int64_t value = -42;
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
QObject *obj;
|
|
|
|
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_int(data->ov, &value, NULL, &err);
|
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QINT);
|
|
|
|
g_assert_cmpint(qint_get_int(qobject_to_qint(obj)), ==, value);
|
|
|
|
|
|
|
|
qobject_decref(obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_bool(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
bool value = true;
|
|
|
|
QObject *obj;
|
|
|
|
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_bool(data->ov, &value, NULL, &err);
|
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QBOOL);
|
2015-05-16 01:24:59 +03:00
|
|
|
g_assert(qbool_get_bool(qobject_to_qbool(obj)) == value);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
qobject_decref(obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_number(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
double value = 3.14;
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
QObject *obj;
|
|
|
|
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_number(data->ov, &value, NULL, &err);
|
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QFLOAT);
|
|
|
|
g_assert(qfloat_get_double(qobject_to_qfloat(obj)) == value);
|
|
|
|
|
|
|
|
qobject_decref(obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_string(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
char *string = (char *) "Q E M U";
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
QObject *obj;
|
|
|
|
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_str(data->ov, &string, NULL, &err);
|
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QSTRING);
|
|
|
|
g_assert_cmpstr(qstring_get_str(qobject_to_qstring(obj)), ==, string);
|
|
|
|
|
|
|
|
qobject_decref(obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_no_string(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
char *string = NULL;
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
QObject *obj;
|
|
|
|
|
|
|
|
/* A null string should return "" */
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_str(data->ov, &string, NULL, &err);
|
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QSTRING);
|
|
|
|
g_assert_cmpstr(qstring_get_str(qobject_to_qstring(obj)), ==, "");
|
|
|
|
|
|
|
|
qobject_decref(obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_enum(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
QObject *obj;
|
|
|
|
EnumOne i;
|
|
|
|
|
|
|
|
for (i = 0; i < ENUM_ONE_MAX; i++) {
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_EnumOne(data->ov, &i, "unused", &err);
|
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QSTRING);
|
|
|
|
g_assert_cmpstr(qstring_get_str(qobject_to_qstring(obj)), ==,
|
|
|
|
EnumOne_lookup[i]);
|
|
|
|
qobject_decref(obj);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_enum_errors(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
EnumOne i, bad_values[] = { ENUM_ONE_MAX, -1 };
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err;
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(bad_values) ; i++) {
|
2014-05-02 15:26:29 +04:00
|
|
|
err = NULL;
|
|
|
|
visit_type_EnumOne(data->ov, &bad_values[i], "unused", &err);
|
|
|
|
g_assert(err);
|
|
|
|
error_free(err);
|
2011-11-15 01:05:29 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct TestStruct
|
|
|
|
{
|
|
|
|
int64_t integer;
|
|
|
|
bool boolean;
|
|
|
|
char *string;
|
|
|
|
} TestStruct;
|
|
|
|
|
|
|
|
static void visit_type_TestStruct(Visitor *v, TestStruct **obj,
|
|
|
|
const char *name, Error **errp)
|
|
|
|
{
|
2014-05-07 11:53:53 +04:00
|
|
|
Error *err = NULL;
|
|
|
|
|
2011-11-15 01:05:29 +04:00
|
|
|
visit_start_struct(v, (void **)obj, "TestStruct", name, sizeof(TestStruct),
|
2014-05-07 11:53:53 +04:00
|
|
|
&err);
|
|
|
|
if (err) {
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
visit_type_int(v, &(*obj)->integer, "integer", &err);
|
qapi: Replace uncommon use of the error API by the common one
We commonly use the error API like this:
err = NULL;
foo(..., &err);
if (err) {
goto out;
}
bar(..., &err);
Every error source is checked separately. The second function is only
called when the first one succeeds. Both functions are free to pass
their argument to error_set(). Because error_set() asserts no error
has been set, this effectively means they must not be called with an
error set.
The qapi-generated code uses the error API differently:
// *errp was initialized to NULL somewhere up the call chain
frob(..., errp);
gnat(..., errp);
Errors accumulate in *errp: first error wins, subsequent errors get
dropped. To make this work, the second function does nothing when
called with an error set. Requires non-null errp, or else the second
function can't see the first one fail.
This usage has also bled into visitor tests, and two device model
object property getters rtc_get_date() and balloon_stats_get_all().
With the "accumulate" technique, you need fewer error checks in
callers, and buy that with an error check in every callee. Can be
nice.
However, mixing the two techniques is confusing. You can't use the
"accumulate" technique with functions designed for the "check
separately" technique. You can use the "check separately" technique
with functions designed for the "accumulate" technique, but then
error_set() can't catch you setting an error more than once.
Standardize on the "check separately" technique for now, because it's
overwhelmingly prevalent.
Signed-off-by: Markus Armbruster <armbru@redhat.com>
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2014-05-07 11:53:54 +04:00
|
|
|
if (err) {
|
|
|
|
goto out_end;
|
|
|
|
}
|
2014-05-07 11:53:53 +04:00
|
|
|
visit_type_bool(v, &(*obj)->boolean, "boolean", &err);
|
qapi: Replace uncommon use of the error API by the common one
We commonly use the error API like this:
err = NULL;
foo(..., &err);
if (err) {
goto out;
}
bar(..., &err);
Every error source is checked separately. The second function is only
called when the first one succeeds. Both functions are free to pass
their argument to error_set(). Because error_set() asserts no error
has been set, this effectively means they must not be called with an
error set.
The qapi-generated code uses the error API differently:
// *errp was initialized to NULL somewhere up the call chain
frob(..., errp);
gnat(..., errp);
Errors accumulate in *errp: first error wins, subsequent errors get
dropped. To make this work, the second function does nothing when
called with an error set. Requires non-null errp, or else the second
function can't see the first one fail.
This usage has also bled into visitor tests, and two device model
object property getters rtc_get_date() and balloon_stats_get_all().
With the "accumulate" technique, you need fewer error checks in
callers, and buy that with an error check in every callee. Can be
nice.
However, mixing the two techniques is confusing. You can't use the
"accumulate" technique with functions designed for the "check
separately" technique. You can use the "check separately" technique
with functions designed for the "accumulate" technique, but then
error_set() can't catch you setting an error more than once.
Standardize on the "check separately" technique for now, because it's
overwhelmingly prevalent.
Signed-off-by: Markus Armbruster <armbru@redhat.com>
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2014-05-07 11:53:54 +04:00
|
|
|
if (err) {
|
|
|
|
goto out_end;
|
|
|
|
}
|
2014-05-07 11:53:53 +04:00
|
|
|
visit_type_str(v, &(*obj)->string, "string", &err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
qapi: Replace uncommon use of the error API by the common one
We commonly use the error API like this:
err = NULL;
foo(..., &err);
if (err) {
goto out;
}
bar(..., &err);
Every error source is checked separately. The second function is only
called when the first one succeeds. Both functions are free to pass
their argument to error_set(). Because error_set() asserts no error
has been set, this effectively means they must not be called with an
error set.
The qapi-generated code uses the error API differently:
// *errp was initialized to NULL somewhere up the call chain
frob(..., errp);
gnat(..., errp);
Errors accumulate in *errp: first error wins, subsequent errors get
dropped. To make this work, the second function does nothing when
called with an error set. Requires non-null errp, or else the second
function can't see the first one fail.
This usage has also bled into visitor tests, and two device model
object property getters rtc_get_date() and balloon_stats_get_all().
With the "accumulate" technique, you need fewer error checks in
callers, and buy that with an error check in every callee. Can be
nice.
However, mixing the two techniques is confusing. You can't use the
"accumulate" technique with functions designed for the "check
separately" technique. You can use the "check separately" technique
with functions designed for the "accumulate" technique, but then
error_set() can't catch you setting an error more than once.
Standardize on the "check separately" technique for now, because it's
overwhelmingly prevalent.
Signed-off-by: Markus Armbruster <armbru@redhat.com>
Reviewed-by: Eric Blake <eblake@redhat.com>
Signed-off-by: Luiz Capitulino <lcapitulino@redhat.com>
2014-05-07 11:53:54 +04:00
|
|
|
out_end:
|
|
|
|
error_propagate(errp, err);
|
|
|
|
err = NULL;
|
2014-05-07 11:53:53 +04:00
|
|
|
visit_end_struct(v, &err);
|
|
|
|
out:
|
|
|
|
error_propagate(errp, err);
|
2011-11-15 01:05:29 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_struct(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
TestStruct test_struct = { .integer = 42,
|
|
|
|
.boolean = false,
|
|
|
|
.string = (char *) "foo"};
|
|
|
|
TestStruct *p = &test_struct;
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
QObject *obj;
|
|
|
|
QDict *qdict;
|
|
|
|
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_TestStruct(data->ov, &p, NULL, &err);
|
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QDICT);
|
|
|
|
|
|
|
|
qdict = qobject_to_qdict(obj);
|
|
|
|
g_assert_cmpint(qdict_size(qdict), ==, 3);
|
|
|
|
g_assert_cmpint(qdict_get_int(qdict, "integer"), ==, 42);
|
2015-05-16 01:25:00 +03:00
|
|
|
g_assert_cmpint(qdict_get_bool(qdict, "boolean"), ==, false);
|
2011-11-15 01:05:29 +04:00
|
|
|
g_assert_cmpstr(qdict_get_str(qdict, "string"), ==, "foo");
|
|
|
|
|
|
|
|
QDECREF(qdict);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_struct_nested(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
int64_t value = 42;
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2015-05-04 18:05:29 +03:00
|
|
|
UserDefTwo *ud2;
|
2011-11-15 01:05:29 +04:00
|
|
|
QObject *obj;
|
|
|
|
QDict *qdict, *dict1, *dict2, *dict3, *userdef;
|
|
|
|
const char *string = "user def string";
|
2012-02-25 16:47:10 +04:00
|
|
|
const char *strings[] = { "forty two", "forty three", "forty four",
|
|
|
|
"forty five" };
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
ud2 = g_malloc0(sizeof(*ud2));
|
|
|
|
ud2->string0 = g_strdup(strings[0]);
|
|
|
|
|
qapi: Drop tests for inline nested structs
A future patch will be using a 'name':{dictionary} entry in the
QAPI schema to specify a default value for an optional argument;
but existing use of inline nested structs conflicts with that goal.
More precisely, a definition in the QAPI schema associates a name
with a set of properties:
Example 1: { 'struct': 'Foo', 'data': { MEMBERS... } }
associates the global name 'Foo' with properties (meta-type struct)
and MEMBERS...
Example 2: 'mumble': TYPE
within MEMBERS... above associates 'mumble' with properties (type
TYPE) and (optional false) within type Foo
The syntax of example 1 is extensible; if we need another property,
we add another name/value pair to the dictionary (such as
'base':TYPE). The syntax of example 2 is not extensible, because
the right hand side can only be a type.
We have used name encoding to add a property: "'*mumble': 'int'"
associates 'mumble' with (type int) and (optional true). Nice,
but doesn't scale. So the solution is to change our existing uses
to be syntactic sugar to an extensible form:
NAME: TYPE --> NAME: { 'type': TYPE, 'optional': false }
*ONAME: TYPE --> ONAME: { 'type': TYPE, 'optional': true }
This patch fixes the testsuite to avoid inline nested types, by
breaking the nesting into explicit types; it means that the type
is now boxed instead of unboxed in C code, but makes no difference
on the wire (and if desired, a later patch could change the
generator to not do so much boxing in C). When touching code to
add new allocations, also convert existing allocations to
consistently prefer typesafe g_new0 over g_malloc0 when a type
name is involved.
Signed-off-by: Eric Blake <eblake@redhat.com>
Reviewed-by: Markus Armbruster <armbru@redhat.com>
Signed-off-by: Markus Armbruster <armbru@redhat.com>
2015-05-04 18:05:30 +03:00
|
|
|
ud2->dict1 = g_malloc0(sizeof(*ud2->dict1));
|
|
|
|
ud2->dict1->string1 = g_strdup(strings[1]);
|
|
|
|
|
|
|
|
ud2->dict1->dict2 = g_malloc0(sizeof(*ud2->dict1->dict2));
|
|
|
|
ud2->dict1->dict2->userdef = g_new0(UserDefOne, 1);
|
|
|
|
ud2->dict1->dict2->userdef->string = g_strdup(string);
|
|
|
|
ud2->dict1->dict2->userdef->base = g_new0(UserDefZero, 1);
|
|
|
|
ud2->dict1->dict2->userdef->base->integer = value;
|
|
|
|
ud2->dict1->dict2->string = g_strdup(strings[2]);
|
|
|
|
|
|
|
|
ud2->dict1->dict3 = g_malloc0(sizeof(*ud2->dict1->dict3));
|
|
|
|
ud2->dict1->has_dict3 = true;
|
|
|
|
ud2->dict1->dict3->userdef = g_new0(UserDefOne, 1);
|
|
|
|
ud2->dict1->dict3->userdef->string = g_strdup(string);
|
|
|
|
ud2->dict1->dict3->userdef->base = g_new0(UserDefZero, 1);
|
|
|
|
ud2->dict1->dict3->userdef->base->integer = value;
|
|
|
|
ud2->dict1->dict3->string = g_strdup(strings[3]);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
2015-05-04 18:05:29 +03:00
|
|
|
visit_type_UserDefTwo(data->ov, &ud2, "unused", &err);
|
2014-05-02 15:26:29 +04:00
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QDICT);
|
|
|
|
|
|
|
|
qdict = qobject_to_qdict(obj);
|
|
|
|
g_assert_cmpint(qdict_size(qdict), ==, 2);
|
|
|
|
g_assert_cmpstr(qdict_get_str(qdict, "string0"), ==, strings[0]);
|
|
|
|
|
|
|
|
dict1 = qdict_get_qdict(qdict, "dict1");
|
|
|
|
g_assert_cmpint(qdict_size(dict1), ==, 3);
|
|
|
|
g_assert_cmpstr(qdict_get_str(dict1, "string1"), ==, strings[1]);
|
|
|
|
|
|
|
|
dict2 = qdict_get_qdict(dict1, "dict2");
|
|
|
|
g_assert_cmpint(qdict_size(dict2), ==, 2);
|
2015-05-04 18:05:29 +03:00
|
|
|
g_assert_cmpstr(qdict_get_str(dict2, "string"), ==, strings[2]);
|
|
|
|
userdef = qdict_get_qdict(dict2, "userdef");
|
2011-11-15 01:05:29 +04:00
|
|
|
g_assert_cmpint(qdict_size(userdef), ==, 2);
|
|
|
|
g_assert_cmpint(qdict_get_int(userdef, "integer"), ==, value);
|
|
|
|
g_assert_cmpstr(qdict_get_str(userdef, "string"), ==, string);
|
|
|
|
|
|
|
|
dict3 = qdict_get_qdict(dict1, "dict3");
|
|
|
|
g_assert_cmpint(qdict_size(dict3), ==, 2);
|
2015-05-04 18:05:29 +03:00
|
|
|
g_assert_cmpstr(qdict_get_str(dict3, "string"), ==, strings[3]);
|
|
|
|
userdef = qdict_get_qdict(dict3, "userdef");
|
2011-11-15 01:05:29 +04:00
|
|
|
g_assert_cmpint(qdict_size(userdef), ==, 2);
|
|
|
|
g_assert_cmpint(qdict_get_int(userdef, "integer"), ==, value);
|
|
|
|
g_assert_cmpstr(qdict_get_str(userdef, "string"), ==, string);
|
|
|
|
|
|
|
|
QDECREF(qdict);
|
2015-05-04 18:05:29 +03:00
|
|
|
qapi_free_UserDefTwo(ud2);
|
2011-11-15 01:05:29 +04:00
|
|
|
}
|
|
|
|
|
2012-03-20 14:22:49 +04:00
|
|
|
static void test_visitor_out_struct_errors(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
EnumOne bad_values[] = { ENUM_ONE_MAX, -1 };
|
2014-03-01 11:40:31 +04:00
|
|
|
UserDefZero b;
|
|
|
|
UserDefOne u = { .base = &b }, *pu = &u;
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err;
|
2012-03-20 14:22:49 +04:00
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(bad_values) ; i++) {
|
2014-05-02 15:26:29 +04:00
|
|
|
err = NULL;
|
2012-03-20 14:22:49 +04:00
|
|
|
u.has_enum1 = true;
|
|
|
|
u.enum1 = bad_values[i];
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_UserDefOne(data->ov, &pu, "unused", &err);
|
|
|
|
g_assert(err);
|
|
|
|
error_free(err);
|
2012-03-20 14:22:49 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-11-15 01:05:29 +04:00
|
|
|
typedef struct TestStructList
|
|
|
|
{
|
2013-05-27 07:20:58 +04:00
|
|
|
union {
|
|
|
|
TestStruct *value;
|
|
|
|
uint64_t padding;
|
|
|
|
};
|
2011-11-15 01:05:29 +04:00
|
|
|
struct TestStructList *next;
|
|
|
|
} TestStructList;
|
|
|
|
|
|
|
|
static void visit_type_TestStructList(Visitor *v, TestStructList **obj,
|
|
|
|
const char *name, Error **errp)
|
|
|
|
{
|
|
|
|
GenericList *i, **head = (GenericList **)obj;
|
|
|
|
|
|
|
|
visit_start_list(v, name, errp);
|
|
|
|
|
|
|
|
for (*head = i = visit_next_list(v, head, errp); i; i = visit_next_list(v, &i, errp)) {
|
|
|
|
TestStructList *native_i = (TestStructList *)i;
|
|
|
|
visit_type_TestStruct(v, &native_i->value, NULL, errp);
|
|
|
|
}
|
|
|
|
|
|
|
|
visit_end_list(v, errp);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_list(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
char *value_str = (char *) "list value";
|
|
|
|
TestStructList *p, *head = NULL;
|
|
|
|
const int max_items = 10;
|
|
|
|
bool value_bool = true;
|
|
|
|
int value_int = 10;
|
2014-05-02 15:26:29 +04:00
|
|
|
Error *err = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
QListEntry *entry;
|
|
|
|
QObject *obj;
|
|
|
|
QList *qlist;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < max_items; i++) {
|
|
|
|
p = g_malloc0(sizeof(*p));
|
|
|
|
p->value = g_malloc0(sizeof(*p->value));
|
|
|
|
p->value->integer = value_int;
|
|
|
|
p->value->boolean = value_bool;
|
|
|
|
p->value->string = value_str;
|
|
|
|
|
|
|
|
p->next = head;
|
|
|
|
head = p;
|
|
|
|
}
|
|
|
|
|
2014-05-02 15:26:29 +04:00
|
|
|
visit_type_TestStructList(data->ov, &head, NULL, &err);
|
|
|
|
g_assert(!err);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(obj != NULL);
|
|
|
|
g_assert(qobject_type(obj) == QTYPE_QLIST);
|
|
|
|
|
|
|
|
qlist = qobject_to_qlist(obj);
|
|
|
|
g_assert(!qlist_empty(qlist));
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
QLIST_FOREACH_ENTRY(qlist, entry) {
|
|
|
|
QDict *qdict;
|
|
|
|
|
|
|
|
g_assert(qobject_type(entry->value) == QTYPE_QDICT);
|
|
|
|
qdict = qobject_to_qdict(entry->value);
|
|
|
|
g_assert_cmpint(qdict_size(qdict), ==, 3);
|
|
|
|
g_assert_cmpint(qdict_get_int(qdict, "integer"), ==, value_int);
|
|
|
|
g_assert_cmpint(qdict_get_bool(qdict, "boolean"), ==, value_bool);
|
|
|
|
g_assert_cmpstr(qdict_get_str(qdict, "string"), ==, value_str);
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
g_assert_cmpint(i, ==, max_items);
|
|
|
|
|
|
|
|
QDECREF(qlist);
|
|
|
|
|
|
|
|
for (p = head; p;) {
|
|
|
|
TestStructList *tmp = p->next;
|
|
|
|
g_free(p->value);
|
|
|
|
g_free(p);
|
|
|
|
p = tmp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_list_qapi_free(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
2015-05-04 18:05:29 +03:00
|
|
|
UserDefTwoList *p, *head = NULL;
|
2011-11-15 01:05:29 +04:00
|
|
|
const char string[] = "foo bar";
|
|
|
|
int i, max_count = 1024;
|
|
|
|
|
|
|
|
for (i = 0; i < max_count; i++) {
|
|
|
|
p = g_malloc0(sizeof(*p));
|
|
|
|
p->value = g_malloc0(sizeof(*p->value));
|
|
|
|
|
|
|
|
p->value->string0 = g_strdup(string);
|
qapi: Drop tests for inline nested structs
A future patch will be using a 'name':{dictionary} entry in the
QAPI schema to specify a default value for an optional argument;
but existing use of inline nested structs conflicts with that goal.
More precisely, a definition in the QAPI schema associates a name
with a set of properties:
Example 1: { 'struct': 'Foo', 'data': { MEMBERS... } }
associates the global name 'Foo' with properties (meta-type struct)
and MEMBERS...
Example 2: 'mumble': TYPE
within MEMBERS... above associates 'mumble' with properties (type
TYPE) and (optional false) within type Foo
The syntax of example 1 is extensible; if we need another property,
we add another name/value pair to the dictionary (such as
'base':TYPE). The syntax of example 2 is not extensible, because
the right hand side can only be a type.
We have used name encoding to add a property: "'*mumble': 'int'"
associates 'mumble' with (type int) and (optional true). Nice,
but doesn't scale. So the solution is to change our existing uses
to be syntactic sugar to an extensible form:
NAME: TYPE --> NAME: { 'type': TYPE, 'optional': false }
*ONAME: TYPE --> ONAME: { 'type': TYPE, 'optional': true }
This patch fixes the testsuite to avoid inline nested types, by
breaking the nesting into explicit types; it means that the type
is now boxed instead of unboxed in C code, but makes no difference
on the wire (and if desired, a later patch could change the
generator to not do so much boxing in C). When touching code to
add new allocations, also convert existing allocations to
consistently prefer typesafe g_new0 over g_malloc0 when a type
name is involved.
Signed-off-by: Eric Blake <eblake@redhat.com>
Reviewed-by: Markus Armbruster <armbru@redhat.com>
Signed-off-by: Markus Armbruster <armbru@redhat.com>
2015-05-04 18:05:30 +03:00
|
|
|
p->value->dict1 = g_new0(UserDefTwoDict, 1);
|
|
|
|
p->value->dict1->string1 = g_strdup(string);
|
|
|
|
p->value->dict1->dict2 = g_new0(UserDefTwoDictDict, 1);
|
|
|
|
p->value->dict1->dict2->userdef = g_new0(UserDefOne, 1);
|
|
|
|
p->value->dict1->dict2->userdef->string = g_strdup(string);
|
|
|
|
p->value->dict1->dict2->userdef->base = g_new0(UserDefZero, 1);
|
|
|
|
p->value->dict1->dict2->userdef->base->integer = 42;
|
|
|
|
p->value->dict1->dict2->string = g_strdup(string);
|
|
|
|
p->value->dict1->has_dict3 = false;
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
p->next = head;
|
|
|
|
head = p;
|
|
|
|
}
|
|
|
|
|
2015-05-04 18:05:29 +03:00
|
|
|
qapi_free_UserDefTwoList(head);
|
2011-11-15 01:05:29 +04:00
|
|
|
}
|
|
|
|
|
2014-03-01 11:40:33 +04:00
|
|
|
static void test_visitor_out_union_flat(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
QObject *arg;
|
|
|
|
QDict *qdict;
|
|
|
|
|
|
|
|
Error *err = NULL;
|
|
|
|
|
|
|
|
UserDefFlatUnion *tmp = g_malloc0(sizeof(UserDefFlatUnion));
|
2014-03-05 06:44:39 +04:00
|
|
|
tmp->kind = ENUM_ONE_VALUE1;
|
|
|
|
tmp->string = g_strdup("str");
|
|
|
|
tmp->value1 = g_malloc0(sizeof(UserDefA));
|
2014-03-01 11:40:33 +04:00
|
|
|
/* TODO when generator bug is fixed: tmp->integer = 41; */
|
2014-03-05 06:44:39 +04:00
|
|
|
tmp->value1->boolean = true;
|
2014-03-01 11:40:33 +04:00
|
|
|
|
|
|
|
visit_type_UserDefFlatUnion(data->ov, &tmp, NULL, &err);
|
|
|
|
g_assert(err == NULL);
|
|
|
|
arg = qmp_output_get_qobject(data->qov);
|
|
|
|
|
|
|
|
g_assert(qobject_type(arg) == QTYPE_QDICT);
|
|
|
|
qdict = qobject_to_qdict(arg);
|
|
|
|
|
2014-03-05 06:44:39 +04:00
|
|
|
g_assert_cmpstr(qdict_get_str(qdict, "enum1"), ==, "value1");
|
|
|
|
g_assert_cmpstr(qdict_get_str(qdict, "string"), ==, "str");
|
2014-03-01 11:40:33 +04:00
|
|
|
/* TODO g_assert_cmpint(qdict_get_int(qdict, "integer"), ==, 41); */
|
|
|
|
g_assert_cmpint(qdict_get_bool(qdict, "boolean"), ==, true);
|
|
|
|
|
|
|
|
qapi_free_UserDefFlatUnion(tmp);
|
|
|
|
QDECREF(qdict);
|
|
|
|
}
|
|
|
|
|
2015-05-04 18:05:11 +03:00
|
|
|
static void test_visitor_out_alternate(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
2014-03-01 11:40:30 +04:00
|
|
|
{
|
|
|
|
QObject *arg;
|
|
|
|
Error *err = NULL;
|
|
|
|
|
2015-05-04 18:05:11 +03:00
|
|
|
UserDefAlternate *tmp = g_malloc0(sizeof(UserDefAlternate));
|
|
|
|
tmp->kind = USER_DEF_ALTERNATE_KIND_I;
|
2014-03-01 11:40:30 +04:00
|
|
|
tmp->i = 42;
|
|
|
|
|
2015-05-04 18:05:11 +03:00
|
|
|
visit_type_UserDefAlternate(data->ov, &tmp, NULL, &err);
|
2014-03-01 11:40:30 +04:00
|
|
|
g_assert(err == NULL);
|
|
|
|
arg = qmp_output_get_qobject(data->qov);
|
|
|
|
|
|
|
|
g_assert(qobject_type(arg) == QTYPE_QINT);
|
|
|
|
g_assert_cmpint(qint_get_int(qobject_to_qint(arg)), ==, 42);
|
|
|
|
|
2015-05-04 18:05:11 +03:00
|
|
|
qapi_free_UserDefAlternate(tmp);
|
2014-03-01 11:40:30 +04:00
|
|
|
}
|
|
|
|
|
2014-05-26 16:40:56 +04:00
|
|
|
static void test_visitor_out_empty(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
QObject *arg;
|
|
|
|
|
|
|
|
arg = qmp_output_get_qobject(data->qov);
|
|
|
|
g_assert(!arg);
|
|
|
|
}
|
|
|
|
|
2013-05-11 02:46:09 +04:00
|
|
|
static void init_native_list(UserDefNativeListUnion *cvalue)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
switch (cvalue->kind) {
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_INTEGER: {
|
|
|
|
intList **list = &cvalue->integer;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(intList, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_S8: {
|
|
|
|
int8List **list = &cvalue->s8;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(int8List, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_S16: {
|
|
|
|
int16List **list = &cvalue->s16;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(int16List, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_S32: {
|
|
|
|
int32List **list = &cvalue->s32;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(int32List, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_S64: {
|
|
|
|
int64List **list = &cvalue->s64;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(int64List, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_U8: {
|
|
|
|
uint8List **list = &cvalue->u8;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(uint8List, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_U16: {
|
|
|
|
uint16List **list = &cvalue->u16;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(uint16List, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_U32: {
|
|
|
|
uint32List **list = &cvalue->u32;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(uint32List, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_U64: {
|
|
|
|
uint64List **list = &cvalue->u64;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(uint64List, 1);
|
|
|
|
(*list)->value = i;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_BOOLEAN: {
|
|
|
|
boolList **list = &cvalue->boolean;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(boolList, 1);
|
|
|
|
(*list)->value = (i % 3 == 0);
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_STRING: {
|
|
|
|
strList **list = &cvalue->string;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(strList, 1);
|
|
|
|
(*list)->value = g_strdup_printf("%d", i);
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_NUMBER: {
|
|
|
|
numberList **list = &cvalue->number;
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
*list = g_new0(numberList, 1);
|
|
|
|
(*list)->value = (double)i / 3;
|
|
|
|
(*list)->next = NULL;
|
|
|
|
list = &(*list)->next;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
2013-07-25 20:21:28 +04:00
|
|
|
g_assert_not_reached();
|
2013-05-11 02:46:09 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void check_native_list(QObject *qobj,
|
|
|
|
UserDefNativeListUnionKind kind)
|
|
|
|
{
|
|
|
|
QDict *qdict;
|
|
|
|
QList *qlist;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
g_assert(qobj);
|
|
|
|
g_assert(qobject_type(qobj) == QTYPE_QDICT);
|
|
|
|
qdict = qobject_to_qdict(qobj);
|
|
|
|
g_assert(qdict);
|
|
|
|
g_assert(qdict_haskey(qdict, "data"));
|
|
|
|
qlist = qlist_copy(qobject_to_qlist(qdict_get(qdict, "data")));
|
|
|
|
|
|
|
|
switch (kind) {
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_S8:
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_S16:
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_S32:
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_S64:
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_U8:
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_U16:
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_U32:
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_U64:
|
|
|
|
/* all integer elements in JSON arrays get stored into QInts when
|
|
|
|
* we convert to QObjects, so we can check them all in the same
|
|
|
|
* fashion, so simply fall through here
|
|
|
|
*/
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_INTEGER:
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
QObject *tmp;
|
|
|
|
QInt *qvalue;
|
|
|
|
tmp = qlist_peek(qlist);
|
|
|
|
g_assert(tmp);
|
|
|
|
qvalue = qobject_to_qint(tmp);
|
|
|
|
g_assert_cmpint(qint_get_int(qvalue), ==, i);
|
|
|
|
qobject_decref(qlist_pop(qlist));
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_BOOLEAN:
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
QObject *tmp;
|
|
|
|
QBool *qvalue;
|
|
|
|
tmp = qlist_peek(qlist);
|
|
|
|
g_assert(tmp);
|
|
|
|
qvalue = qobject_to_qbool(tmp);
|
2015-05-16 01:24:59 +03:00
|
|
|
g_assert_cmpint(qbool_get_bool(qvalue), ==, i % 3 == 0);
|
2013-05-11 02:46:09 +04:00
|
|
|
qobject_decref(qlist_pop(qlist));
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_STRING:
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
QObject *tmp;
|
|
|
|
QString *qvalue;
|
|
|
|
gchar str[8];
|
|
|
|
tmp = qlist_peek(qlist);
|
|
|
|
g_assert(tmp);
|
|
|
|
qvalue = qobject_to_qstring(tmp);
|
|
|
|
sprintf(str, "%d", i);
|
|
|
|
g_assert_cmpstr(qstring_get_str(qvalue), ==, str);
|
|
|
|
qobject_decref(qlist_pop(qlist));
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case USER_DEF_NATIVE_LIST_UNION_KIND_NUMBER:
|
|
|
|
for (i = 0; i < 32; i++) {
|
|
|
|
QObject *tmp;
|
|
|
|
QFloat *qvalue;
|
|
|
|
GString *double_expected = g_string_new("");
|
|
|
|
GString *double_actual = g_string_new("");
|
|
|
|
|
|
|
|
tmp = qlist_peek(qlist);
|
|
|
|
g_assert(tmp);
|
|
|
|
qvalue = qobject_to_qfloat(tmp);
|
|
|
|
g_string_printf(double_expected, "%.6f", (double)i / 3);
|
|
|
|
g_string_printf(double_actual, "%.6f", qfloat_get_double(qvalue));
|
|
|
|
g_assert_cmpstr(double_actual->str, ==, double_expected->str);
|
|
|
|
|
|
|
|
qobject_decref(qlist_pop(qlist));
|
|
|
|
g_string_free(double_expected, true);
|
|
|
|
g_string_free(double_actual, true);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
2013-07-25 20:21:28 +04:00
|
|
|
g_assert_not_reached();
|
2013-05-11 02:46:09 +04:00
|
|
|
}
|
|
|
|
QDECREF(qlist);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_native_list(TestOutputVisitorData *data,
|
|
|
|
const void *unused,
|
|
|
|
UserDefNativeListUnionKind kind)
|
|
|
|
{
|
|
|
|
UserDefNativeListUnion *cvalue = g_new0(UserDefNativeListUnion, 1);
|
|
|
|
Error *err = NULL;
|
|
|
|
QObject *obj;
|
|
|
|
|
|
|
|
cvalue->kind = kind;
|
|
|
|
init_native_list(cvalue);
|
|
|
|
|
|
|
|
visit_type_UserDefNativeListUnion(data->ov, &cvalue, NULL, &err);
|
|
|
|
g_assert(err == NULL);
|
|
|
|
|
|
|
|
obj = qmp_output_get_qobject(data->qov);
|
|
|
|
check_native_list(obj, cvalue->kind);
|
|
|
|
qapi_free_UserDefNativeListUnion(cvalue);
|
|
|
|
qobject_decref(obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_int(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_INTEGER);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_int8(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_S8);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_int16(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_S16);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_int32(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_S32);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_int64(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_S64);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_uint8(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_U8);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_uint16(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_U16);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_uint32(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_U32);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_uint64(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_U64);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_bool(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_BOOLEAN);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_str(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_STRING);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_visitor_out_native_list_number(TestOutputVisitorData *data,
|
|
|
|
const void *unused)
|
|
|
|
{
|
|
|
|
test_native_list(data, unused, USER_DEF_NATIVE_LIST_UNION_KIND_NUMBER);
|
|
|
|
}
|
|
|
|
|
2011-11-15 01:05:29 +04:00
|
|
|
static void output_visitor_test_add(const char *testpath,
|
|
|
|
TestOutputVisitorData *data,
|
|
|
|
void (*test_func)(TestOutputVisitorData *data, const void *user_data))
|
|
|
|
{
|
|
|
|
g_test_add(testpath, TestOutputVisitorData, data, visitor_output_setup,
|
|
|
|
test_func, visitor_output_teardown);
|
|
|
|
}
|
|
|
|
|
|
|
|
int main(int argc, char **argv)
|
|
|
|
{
|
|
|
|
TestOutputVisitorData out_visitor_data;
|
|
|
|
|
|
|
|
g_test_init(&argc, &argv, NULL);
|
|
|
|
|
|
|
|
output_visitor_test_add("/visitor/output/int",
|
|
|
|
&out_visitor_data, test_visitor_out_int);
|
|
|
|
output_visitor_test_add("/visitor/output/bool",
|
|
|
|
&out_visitor_data, test_visitor_out_bool);
|
|
|
|
output_visitor_test_add("/visitor/output/number",
|
|
|
|
&out_visitor_data, test_visitor_out_number);
|
|
|
|
output_visitor_test_add("/visitor/output/string",
|
|
|
|
&out_visitor_data, test_visitor_out_string);
|
|
|
|
output_visitor_test_add("/visitor/output/no-string",
|
|
|
|
&out_visitor_data, test_visitor_out_no_string);
|
|
|
|
output_visitor_test_add("/visitor/output/enum",
|
|
|
|
&out_visitor_data, test_visitor_out_enum);
|
|
|
|
output_visitor_test_add("/visitor/output/enum-errors",
|
|
|
|
&out_visitor_data, test_visitor_out_enum_errors);
|
|
|
|
output_visitor_test_add("/visitor/output/struct",
|
|
|
|
&out_visitor_data, test_visitor_out_struct);
|
|
|
|
output_visitor_test_add("/visitor/output/struct-nested",
|
|
|
|
&out_visitor_data, test_visitor_out_struct_nested);
|
2012-03-20 14:22:49 +04:00
|
|
|
output_visitor_test_add("/visitor/output/struct-errors",
|
|
|
|
&out_visitor_data, test_visitor_out_struct_errors);
|
2011-11-15 01:05:29 +04:00
|
|
|
output_visitor_test_add("/visitor/output/list",
|
|
|
|
&out_visitor_data, test_visitor_out_list);
|
|
|
|
output_visitor_test_add("/visitor/output/list-qapi-free",
|
|
|
|
&out_visitor_data, test_visitor_out_list_qapi_free);
|
2014-03-01 11:40:33 +04:00
|
|
|
output_visitor_test_add("/visitor/output/union-flat",
|
|
|
|
&out_visitor_data, test_visitor_out_union_flat);
|
2015-05-04 18:05:11 +03:00
|
|
|
output_visitor_test_add("/visitor/output/alternate",
|
|
|
|
&out_visitor_data, test_visitor_out_alternate);
|
2014-05-26 16:40:56 +04:00
|
|
|
output_visitor_test_add("/visitor/output/empty",
|
|
|
|
&out_visitor_data, test_visitor_out_empty);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/int",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_int);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/int8",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_int8);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/int16",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_int16);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/int32",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_int32);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/int64",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_int64);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/uint8",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_uint8);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/uint16",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_uint16);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/uint32",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_uint32);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/uint64",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_uint64);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/bool",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_bool);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/string",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_str);
|
2013-05-11 02:46:09 +04:00
|
|
|
output_visitor_test_add("/visitor/output/native_list/number",
|
2015-05-04 18:05:06 +03:00
|
|
|
&out_visitor_data,
|
|
|
|
test_visitor_out_native_list_number);
|
2011-11-15 01:05:29 +04:00
|
|
|
|
|
|
|
g_test_run();
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|