2 # QAPI visitor generator
4 # Copyright IBM, Corp. 2011
5 # Copyright (C) 2014-2015 Red Hat, Inc.
8 # Anthony Liguori <aliguori@us.ibm.com>
9 # Michael Roth <mdroth@linux.vnet.ibm.com>
10 # Markus Armbruster <armbru@redhat.com>
12 # This work is licensed under the terms of the GNU GPL, version 2.
13 # See the COPYING file in the top-level directory.
15 from ordereddict
import OrderedDict
19 implicit_structs_seen
= set()
20 struct_fields_seen
= set()
22 def generate_visit_implicit_struct(type):
23 if type in implicit_structs_seen
:
25 implicit_structs_seen
.add(type)
27 if type not in struct_fields_seen
:
28 # Need a forward declaration
31 static void visit_type_%(c_type)s_fields(Visitor *m, %(c_type)s **obj, Error **errp);
33 c_type
=type_name(type))
37 static void visit_type_implicit_%(c_type)s(Visitor *m, %(c_type)s **obj, Error **errp)
41 visit_start_implicit_struct(m, (void **)obj, sizeof(%(c_type)s), &err);
43 visit_type_%(c_type)s_fields(m, obj, errp);
44 visit_end_implicit_struct(m, &err);
46 error_propagate(errp, err);
49 c_type
=type_name(type))
52 def generate_visit_struct_fields(name
, members
, base
= None):
53 struct_fields_seen
.add(name
)
58 ret
+= generate_visit_implicit_struct(base
)
62 static void visit_type_%(name)s_fields(Visitor *m, %(name)s **obj, Error **errp)
72 visit_type_implicit_%(type)s(m, &(*obj)->%(c_name)s, &err);
77 type=type_name(base
), c_name
=c_name('base'))
79 for argname
, argentry
, optional
in parse_args(members
):
82 visit_optional(m, &(*obj)->has_%(c_name)s, "%(name)s", &err);
83 if (!err && (*obj)->has_%(c_name)s) {
85 c_name
=c_name(argname
), name
=argname
)
89 visit_type_%(type)s(m, &(*obj)->%(c_name)s, "%(name)s", &err);
91 type=type_name(argentry
), c_name
=c_name(argname
),
106 if re
.search('^ *goto out\\;', ret
, re
.MULTILINE
):
112 error_propagate(errp, err);
118 def generate_visit_struct_body(name
):
119 # FIXME: if *obj is NULL on entry, and visit_start_struct() assigns to
120 # *obj, but then visit_type_FOO_fields() fails, we should clean up *obj
121 # rather than leaving it non-NULL. As currently written, the caller must
122 # call qapi_free_FOO() to avoid a memory leak of the partial FOO.
126 visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(c_name)s), &err);
129 visit_type_%(c_name)s_fields(m, obj, errp);
131 visit_end_struct(m, &err);
133 error_propagate(errp, err);
135 name
=name
, c_name
=c_name(name
))
139 def generate_visit_struct(expr
):
141 name
= expr
['struct']
142 members
= expr
['data']
143 base
= expr
.get('base')
145 ret
= generate_visit_struct_fields(name
, members
, base
)
149 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp)
154 ret
+= generate_visit_struct_body(name
)
161 def generate_visit_list(name
):
164 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp)
167 GenericList *i, **prev;
169 visit_start_list(m, name, &err);
174 for (prev = (GenericList **)obj;
175 !err && (i = visit_next_list(m, prev, &err)) != NULL;
177 %(name)sList *native_i = (%(name)sList *)i;
178 visit_type_%(name)s(m, &native_i->value, NULL, &err);
181 error_propagate(errp, err);
183 visit_end_list(m, &err);
185 error_propagate(errp, err);
188 name
=type_name(name
))
190 def generate_visit_enum(name
):
193 void visit_type_%(c_name)s(Visitor *m, %(c_name)s *obj, const char *name, Error **errp)
195 visit_type_enum(m, (int *)obj, %(c_name)s_lookup, "%(name)s", name, errp);
198 c_name
=c_name(name
), name
=name
)
200 def generate_visit_alternate(name
, members
):
203 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp)
207 visit_start_implicit_struct(m, (void**) obj, sizeof(%(name)s), &err);
211 visit_get_next_type(m, (int*) &(*obj)->kind, %(name)s_qtypes, name, &err);
215 switch ((*obj)->kind) {
219 # For alternate, always use the default enum type automatically generated
221 disc_type
= c_name(name
) + 'Kind'
224 assert (members
[key
] in builtin_types
.keys()
225 or find_struct(members
[key
])
226 or find_union(members
[key
])
227 or find_enum(members
[key
])), "Invalid alternate member"
229 enum_full_value
= c_enum_const(disc_type
, key
)
231 case %(enum_full_value)s:
232 visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, name, &err);
235 enum_full_value
= enum_full_value
,
236 c_type
= type_name(members
[key
]),
237 c_name
= c_name(key
))
244 error_propagate(errp, err);
246 visit_end_implicit_struct(m, &err);
248 error_propagate(errp, err);
255 def generate_visit_union(expr
):
258 members
= expr
['data']
260 base
= expr
.get('base')
261 discriminator
= expr
.get('discriminator')
263 enum_define
= discriminator_find_enum_define(expr
)
265 # Use the enum type as discriminator
267 disc_type
= c_name(enum_define
['enum_name'])
269 # There will always be a discriminator in the C switch code, by default
270 # it is an enum type generated silently
271 ret
= generate_visit_enum(name
+ 'Kind')
272 disc_type
= c_name(name
) + 'Kind'
276 base_fields
= find_struct(base
)['data'].copy()
277 del base_fields
[discriminator
]
278 ret
+= generate_visit_struct_fields(name
, base_fields
)
282 ret
+= generate_visit_implicit_struct(members
[key
])
286 void visit_type_%(c_name)s(Visitor *m, %(c_name)s **obj, const char *name, Error **errp)
290 visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(c_name)s), &err);
296 c_name
=c_name(name
), name
=name
)
300 visit_type_%(name)s_fields(m, obj, &err);
307 if not discriminator
:
312 disc_key
= discriminator
314 visit_type_%(disc_type)s(m, &(*obj)->%(c_tag)s, "%(disc_key)s", &err);
318 if (!visit_start_union(m, !!(*obj)->data, &err) || err) {
321 switch ((*obj)->%(c_tag)s) {
323 disc_type
= disc_type
,
328 if not discriminator
:
329 fmt
= 'visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, "data", &err);'
331 fmt
= 'visit_type_implicit_%(c_type)s(m, &(*obj)->%(c_name)s, &err);'
333 enum_full_value
= c_enum_const(disc_type
, key
)
335 case %(enum_full_value)s:
339 enum_full_value
= enum_full_value
,
340 c_type
=type_name(members
[key
]),
348 error_propagate(errp, err);
350 visit_end_union(m, !!(*obj)->data, &err);
351 error_propagate(errp, err);
354 visit_end_struct(m, &err);
356 error_propagate(errp, err);
362 def generate_declaration(name
, builtin_type
=False):
368 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp);
373 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp);
379 def generate_enum_declaration(name
):
381 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp);
387 def generate_decl_enum(name
):
390 void visit_type_%(name)s(Visitor *m, %(name)s *obj, const char *name, Error **errp);
396 (input_file
, output_dir
, do_c
, do_h
, prefix
, opts
) = \
397 parse_command_line("b", ["builtins"])
400 if o
in ("-b", "--builtins"):
405 * schema-defined QAPI visitor functions
407 * Copyright IBM, Corp. 2011
410 * Anthony Liguori <aliguori@us.ibm.com>
412 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
413 * See the COPYING.LIB file in the top-level directory.
419 * schema-defined QAPI visitor functions
421 * Copyright IBM, Corp. 2011
424 * Anthony Liguori <aliguori@us.ibm.com>
426 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
427 * See the COPYING.LIB file in the top-level directory.
432 (fdef
, fdecl
) = open_output(output_dir
, do_c
, do_h
, prefix
,
433 'qapi-visit.c', 'qapi-visit.h',
434 c_comment
, h_comment
)
437 #include "qemu-common.h"
438 #include "%(prefix)sqapi-visit.h"
442 fdecl
.write(mcgen('''
443 #include "qapi/visitor.h"
444 #include "%(prefix)sqapi-types.h"
449 exprs
= parse_schema(input_file
)
451 # to avoid header dependency hell, we always generate declarations
452 # for built-in types in our header files and simply guard them
453 fdecl
.write(guardstart("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
454 for typename
in builtin_types
.keys():
455 fdecl
.write(generate_declaration(typename
, builtin_type
=True))
456 fdecl
.write(guardend("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
458 # ...this doesn't work for cases where we link in multiple objects that
459 # have the functions defined, so we use -b option to provide control
462 for typename
in builtin_types
.keys():
463 fdef
.write(generate_visit_list(typename
))
466 if expr
.has_key('struct'):
467 ret
= generate_visit_struct(expr
)
468 ret
+= generate_visit_list(expr
['struct'])
471 ret
= generate_declaration(expr
['struct'])
473 elif expr
.has_key('union'):
474 ret
= generate_visit_union(expr
)
475 ret
+= generate_visit_list(expr
['union'])
478 enum_define
= discriminator_find_enum_define(expr
)
481 ret
= generate_decl_enum('%sKind' % expr
['union'])
482 ret
+= generate_declaration(expr
['union'])
484 elif expr
.has_key('alternate'):
485 ret
= generate_visit_alternate(expr
['alternate'], expr
['data'])
486 ret
+= generate_visit_list(expr
['alternate'])
489 ret
= generate_decl_enum('%sKind' % expr
['alternate'])
490 ret
+= generate_declaration(expr
['alternate'])
492 elif expr
.has_key('enum'):
493 ret
= generate_visit_list(expr
['enum'])
494 ret
+= generate_visit_enum(expr
['enum'])
497 ret
= generate_decl_enum(expr
['enum'])
498 ret
+= generate_enum_declaration(expr
['enum'])
501 close_output(fdef
, fdecl
)