Merge remote-tracking branch 'remotes/stefanberger/tags/pull-tpm-2021-01-25-1' into...
[qemu.git] / tests / test-clone-visitor.c
1 /*
2 * QAPI Clone Visitor unit-tests.
3 *
4 * Copyright (C) 2016 Red Hat Inc.
5 *
6 * This work is licensed under the terms of the GNU GPL, version 2 or later.
7 * See the COPYING file in the top-level directory.
8 */
9
10 #include "qemu/osdep.h"
11
12 #include "qemu-common.h"
13 #include "qapi/clone-visitor.h"
14 #include "test-qapi-visit.h"
15
16 static void test_clone_struct(void)
17 {
18 UserDefOne *src, *dst;
19
20 src = g_new0(UserDefOne, 1);
21 src->integer = 42;
22 src->string = g_strdup("Hello");
23 src->has_enum1 = false;
24 src->enum1 = ENUM_ONE_VALUE2;
25
26 dst = QAPI_CLONE(UserDefOne, src);
27 g_assert(dst);
28 g_assert_cmpint(dst->integer, ==, 42);
29 g_assert(dst->string != src->string);
30 g_assert_cmpstr(dst->string, ==, "Hello");
31 g_assert_cmpint(dst->has_enum1, ==, false);
32 /* Our implementation does this, but it is not required:
33 g_assert_cmpint(dst->enum1, ==, ENUM_ONE_VALUE2);
34 */
35
36 qapi_free_UserDefOne(src);
37 qapi_free_UserDefOne(dst);
38 }
39
40 static void test_clone_alternate(void)
41 {
42 AltEnumBool *b_src, *s_src, *b_dst, *s_dst;
43
44 b_src = g_new0(AltEnumBool, 1);
45 b_src->type = QTYPE_QBOOL;
46 b_src->u.b = true;
47 s_src = g_new0(AltEnumBool, 1);
48 s_src->type = QTYPE_QSTRING;
49 s_src->u.e = ENUM_ONE_VALUE1;
50
51 b_dst = QAPI_CLONE(AltEnumBool, b_src);
52 g_assert(b_dst);
53 g_assert_cmpint(b_dst->type, ==, b_src->type);
54 g_assert_cmpint(b_dst->u.b, ==, b_src->u.b);
55 s_dst = QAPI_CLONE(AltEnumBool, s_src);
56 g_assert(s_dst);
57 g_assert_cmpint(s_dst->type, ==, s_src->type);
58 g_assert_cmpint(s_dst->u.e, ==, s_src->u.e);
59
60 qapi_free_AltEnumBool(b_src);
61 qapi_free_AltEnumBool(s_src);
62 qapi_free_AltEnumBool(b_dst);
63 qapi_free_AltEnumBool(s_dst);
64 }
65
66 static void test_clone_list_union(void)
67 {
68 uint8List *src = NULL, *dst;
69 uint8List *tmp = NULL;
70 int i;
71
72 /* Build list in reverse */
73 for (i = 10; i; i--) {
74 QAPI_LIST_PREPEND(src, i);
75 }
76
77 dst = QAPI_CLONE(uint8List, src);
78 for (tmp = dst, i = 1; i <= 10; i++) {
79 g_assert(tmp);
80 g_assert_cmpint(tmp->value, ==, i);
81 tmp = tmp->next;
82 }
83 g_assert(!tmp);
84
85 qapi_free_uint8List(src);
86 qapi_free_uint8List(dst);
87 }
88
89 static void test_clone_empty(void)
90 {
91 Empty2 *src, *dst;
92
93 src = g_new0(Empty2, 1);
94 dst = QAPI_CLONE(Empty2, src);
95 g_assert(dst);
96 qapi_free_Empty2(src);
97 qapi_free_Empty2(dst);
98 }
99
100 static void test_clone_complex1(void)
101 {
102 UserDefListUnion *src, *dst;
103
104 src = g_new0(UserDefListUnion, 1);
105 src->type = USER_DEF_LIST_UNION_KIND_STRING;
106
107 dst = QAPI_CLONE(UserDefListUnion, src);
108 g_assert(dst);
109 g_assert_cmpint(dst->type, ==, src->type);
110 g_assert(!dst->u.string.data);
111
112 qapi_free_UserDefListUnion(src);
113 qapi_free_UserDefListUnion(dst);
114 }
115
116 static void test_clone_complex2(void)
117 {
118 WrapAlternate *src, *dst;
119
120 src = g_new0(WrapAlternate, 1);
121 src->alt = g_new(UserDefAlternate, 1);
122 src->alt->type = QTYPE_QDICT;
123 src->alt->u.udfu.integer = 42;
124 /* Clone intentionally converts NULL into "" for strings */
125 src->alt->u.udfu.string = NULL;
126 src->alt->u.udfu.enum1 = ENUM_ONE_VALUE3;
127 src->alt->u.udfu.u.value3.intb = 99;
128 src->alt->u.udfu.u.value3.has_a_b = true;
129 src->alt->u.udfu.u.value3.a_b = true;
130
131 dst = QAPI_CLONE(WrapAlternate, src);
132 g_assert(dst);
133 g_assert(dst->alt);
134 g_assert_cmpint(dst->alt->type, ==, QTYPE_QDICT);
135 g_assert_cmpint(dst->alt->u.udfu.integer, ==, 42);
136 g_assert_cmpstr(dst->alt->u.udfu.string, ==, "");
137 g_assert_cmpint(dst->alt->u.udfu.enum1, ==, ENUM_ONE_VALUE3);
138 g_assert_cmpint(dst->alt->u.udfu.u.value3.intb, ==, 99);
139 g_assert_cmpint(dst->alt->u.udfu.u.value3.has_a_b, ==, true);
140 g_assert_cmpint(dst->alt->u.udfu.u.value3.a_b, ==, true);
141
142 qapi_free_WrapAlternate(src);
143 qapi_free_WrapAlternate(dst);
144 }
145
146 static void test_clone_complex3(void)
147 {
148 __org_qemu_x_Struct2 *src, *dst;
149 __org_qemu_x_Union1List *tmp;
150
151 src = g_new0(__org_qemu_x_Struct2, 1);
152 tmp = src->array = g_new0(__org_qemu_x_Union1List, 1);
153 tmp->value = g_new0(__org_qemu_x_Union1, 1);
154 tmp->value->type = ORG_QEMU_X_UNION1_KIND___ORG_QEMU_X_BRANCH;
155 tmp->value->u.__org_qemu_x_branch.data = g_strdup("one");
156 tmp = tmp->next = g_new0(__org_qemu_x_Union1List, 1);
157 tmp->value = g_new0(__org_qemu_x_Union1, 1);
158 tmp->value->type = ORG_QEMU_X_UNION1_KIND___ORG_QEMU_X_BRANCH;
159 tmp->value->u.__org_qemu_x_branch.data = g_strdup("two");
160 tmp = tmp->next = g_new0(__org_qemu_x_Union1List, 1);
161 tmp->value = g_new0(__org_qemu_x_Union1, 1);
162 tmp->value->type = ORG_QEMU_X_UNION1_KIND___ORG_QEMU_X_BRANCH;
163 tmp->value->u.__org_qemu_x_branch.data = g_strdup("three");
164
165 dst = QAPI_CLONE(__org_qemu_x_Struct2, src);
166 g_assert(dst);
167 tmp = dst->array;
168 g_assert(tmp);
169 g_assert(tmp->value);
170 g_assert_cmpstr(tmp->value->u.__org_qemu_x_branch.data, ==, "one");
171 tmp = tmp->next;
172 g_assert(tmp);
173 g_assert(tmp->value);
174 g_assert_cmpstr(tmp->value->u.__org_qemu_x_branch.data, ==, "two");
175 tmp = tmp->next;
176 g_assert(tmp);
177 g_assert(tmp->value);
178 g_assert_cmpstr(tmp->value->u.__org_qemu_x_branch.data, ==, "three");
179 tmp = tmp->next;
180 g_assert(!tmp);
181
182 qapi_free___org_qemu_x_Struct2(src);
183 qapi_free___org_qemu_x_Struct2(dst);
184 }
185
186 int main(int argc, char **argv)
187 {
188 g_test_init(&argc, &argv, NULL);
189
190 g_test_add_func("/visitor/clone/struct", test_clone_struct);
191 g_test_add_func("/visitor/clone/alternate", test_clone_alternate);
192 g_test_add_func("/visitor/clone/list_union", test_clone_list_union);
193 g_test_add_func("/visitor/clone/empty", test_clone_empty);
194 g_test_add_func("/visitor/clone/complex1", test_clone_complex1);
195 g_test_add_func("/visitor/clone/complex2", test_clone_complex2);
196 g_test_add_func("/visitor/clone/complex3", test_clone_complex3);
197
198 return g_test_run();
199 }