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
23 def generate_visit_implicit_struct(type):
24 global implicit_structs
25 if type in implicit_structs
:
27 implicit_structs
.append(type)
30 static void visit_type_implicit_%(c_type)s(Visitor *m, %(c_type)s **obj, Error **errp)
34 visit_start_implicit_struct(m, (void **)obj, sizeof(%(c_type)s), &err);
36 visit_type_%(c_type)s_fields(m, obj, errp);
37 visit_end_implicit_struct(m, &err);
39 error_propagate(errp, err);
42 c_type
=type_name(type))
44 def generate_visit_struct_fields(name
, members
, base
= None):
49 ret
+= generate_visit_implicit_struct(base
)
53 static void visit_type_%(name)s_fields(Visitor *m, %(name)s **obj, Error **errp)
62 visit_type_implicit_%(type)s(m, &(*obj)->%(c_name)s, &err);
67 type=type_name(base
), c_name
=c_name('base'))
69 for argname
, argentry
, optional
in parse_args(members
):
72 visit_optional(m, &(*obj)->has_%(c_name)s, "%(name)s", &err);
73 if (!err && (*obj)->has_%(c_name)s) {
75 c_name
=c_name(argname
), name
=argname
)
79 visit_type_%(type)s(m, &(*obj)->%(c_name)s, "%(name)s", &err);
81 type=type_name(argentry
), c_name
=c_name(argname
),
96 if re
.search('^ *goto out\\;', ret
, re
.MULTILINE
):
102 error_propagate(errp, err);
108 def generate_visit_struct_body(name
, members
):
112 visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(c_name)s), &err);
115 visit_type_%(c_name)s_fields(m, obj, errp);
117 visit_end_struct(m, &err);
119 error_propagate(errp, err);
121 name
=name
, c_name
=c_name(name
))
125 def generate_visit_struct(expr
):
127 name
= expr
['struct']
128 members
= expr
['data']
129 base
= expr
.get('base')
131 ret
= generate_visit_struct_fields(name
, members
, base
)
135 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp)
140 ret
+= generate_visit_struct_body(name
, members
)
147 def generate_visit_list(name
, members
):
150 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp)
153 GenericList *i, **prev;
155 visit_start_list(m, name, &err);
160 for (prev = (GenericList **)obj;
161 !err && (i = visit_next_list(m, prev, &err)) != NULL;
163 %(name)sList *native_i = (%(name)sList *)i;
164 visit_type_%(name)s(m, &native_i->value, NULL, &err);
167 error_propagate(errp, err);
169 visit_end_list(m, &err);
171 error_propagate(errp, err);
174 name
=type_name(name
))
176 def generate_visit_enum(name
, members
):
179 void visit_type_%(name)s(Visitor *m, %(name)s *obj, const char *name, Error **errp)
181 visit_type_enum(m, (int *)obj, %(name)s_lookup, "%(name)s", name, errp);
186 def generate_visit_alternate(name
, members
):
189 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp)
193 visit_start_implicit_struct(m, (void**) obj, sizeof(%(name)s), &err);
197 visit_get_next_type(m, (int*) &(*obj)->kind, %(name)s_qtypes, name, &err);
201 switch ((*obj)->kind) {
205 # For alternate, always use the default enum type automatically generated
207 disc_type
= c_name(name
) + 'Kind'
210 assert (members
[key
] in builtin_types
.keys()
211 or find_struct(members
[key
])
212 or find_union(members
[key
])
213 or find_enum(members
[key
])), "Invalid alternate member"
215 enum_full_value
= c_enum_const(disc_type
, key
)
217 case %(enum_full_value)s:
218 visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, name, &err);
221 enum_full_value
= enum_full_value
,
222 c_type
= type_name(members
[key
]),
223 c_name
= c_name(key
))
230 error_propagate(errp, err);
232 visit_end_implicit_struct(m, &err);
234 error_propagate(errp, err);
241 def generate_visit_union(expr
):
244 members
= expr
['data']
246 base
= expr
.get('base')
247 discriminator
= expr
.get('discriminator')
249 enum_define
= discriminator_find_enum_define(expr
)
251 # Use the enum type as discriminator
253 disc_type
= c_name(enum_define
['enum_name'])
255 # There will always be a discriminator in the C switch code, by default
256 # it is an enum type generated silently
257 ret
= generate_visit_enum(name
+ 'Kind', members
.keys())
258 disc_type
= c_name(name
) + 'Kind'
262 base_fields
= find_struct(base
)['data'].copy()
263 del base_fields
[discriminator
]
264 ret
+= generate_visit_struct_fields(name
, base_fields
)
268 ret
+= generate_visit_implicit_struct(members
[key
])
272 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp)
276 visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(name)s), &err);
286 visit_type_%(name)s_fields(m, obj, &err);
293 if not discriminator
:
296 disc_key
= discriminator
298 visit_type_%(disc_type)s(m, &(*obj)->kind, "%(disc_key)s", &err);
302 if (!visit_start_union(m, !!(*obj)->data, &err) || err) {
305 switch ((*obj)->kind) {
307 disc_type
= disc_type
,
311 if not discriminator
:
312 fmt
= 'visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, "data", &err);'
314 fmt
= 'visit_type_implicit_%(c_type)s(m, &(*obj)->%(c_name)s, &err);'
316 enum_full_value
= c_enum_const(disc_type
, key
)
318 case %(enum_full_value)s:
322 enum_full_value
= enum_full_value
,
323 c_type
=type_name(members
[key
]),
331 error_propagate(errp, err);
333 visit_end_union(m, !!(*obj)->data, &err);
334 error_propagate(errp, err);
337 visit_end_struct(m, &err);
339 error_propagate(errp, err);
345 def generate_declaration(name
, members
, builtin_type
=False):
351 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp);
356 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp);
362 def generate_enum_declaration(name
, members
):
364 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp);
370 def generate_decl_enum(name
, members
):
373 void visit_type_%(name)s(Visitor *m, %(name)s *obj, const char *name, Error **errp);
377 c_file
= 'qapi-visit.c'
378 h_file
= 'qapi-visit.h'
381 (input_file
, output_dir
, do_c
, do_h
, prefix
, opts
) = \
382 parse_command_line("b", ["builtins"])
385 if o
in ("-b", "--builtins"):
388 c_file
= output_dir
+ prefix
+ c_file
389 h_file
= output_dir
+ prefix
+ h_file
392 os
.makedirs(output_dir
)
394 if e
.errno
!= errno
.EEXIST
:
397 def maybe_open(really
, name
, opt
):
399 return open(name
, opt
)
402 return StringIO
.StringIO()
404 fdef
= maybe_open(do_c
, c_file
, 'w')
405 fdecl
= maybe_open(do_h
, h_file
, 'w')
408 /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
411 * schema-defined QAPI visitor functions
413 * Copyright IBM, Corp. 2011
416 * Anthony Liguori <aliguori@us.ibm.com>
418 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
419 * See the COPYING.LIB file in the top-level directory.
423 #include "qemu-common.h"
424 #include "%(header)s"
426 header
=basename(h_file
)))
428 fdecl
.write(mcgen('''
429 /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
432 * schema-defined QAPI visitor functions
434 * Copyright IBM, Corp. 2011
437 * Anthony Liguori <aliguori@us.ibm.com>
439 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
440 * See the COPYING.LIB file in the top-level directory.
447 #include "qapi/visitor.h"
448 #include "%(prefix)sqapi-types.h"
451 prefix
=prefix
, guard
=guardname(h_file
)))
453 exprs
= parse_schema(input_file
)
455 # to avoid header dependency hell, we always generate declarations
456 # for built-in types in our header files and simply guard them
457 fdecl
.write(guardstart("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
458 for typename
in builtin_types
.keys():
459 fdecl
.write(generate_declaration(typename
, None, builtin_type
=True))
460 fdecl
.write(guardend("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
462 # ...this doesn't work for cases where we link in multiple objects that
463 # have the functions defined, so we use -b option to provide control
466 for typename
in builtin_types
.keys():
467 fdef
.write(generate_visit_list(typename
, None))
470 if expr
.has_key('struct'):
471 ret
= generate_visit_struct(expr
)
472 ret
+= generate_visit_list(expr
['struct'], expr
['data'])
475 ret
= generate_declaration(expr
['struct'], expr
['data'])
477 elif expr
.has_key('union'):
478 ret
= generate_visit_union(expr
)
479 ret
+= generate_visit_list(expr
['union'], expr
['data'])
482 enum_define
= discriminator_find_enum_define(expr
)
485 ret
= generate_decl_enum('%sKind' % expr
['union'],
487 ret
+= generate_declaration(expr
['union'], expr
['data'])
489 elif expr
.has_key('alternate'):
490 ret
= generate_visit_alternate(expr
['alternate'], expr
['data'])
491 ret
+= generate_visit_list(expr
['alternate'], expr
['data'])
494 ret
= generate_decl_enum('%sKind' % expr
['alternate'],
496 ret
+= generate_declaration(expr
['alternate'], expr
['data'])
498 elif expr
.has_key('enum'):
499 ret
= generate_visit_list(expr
['enum'], expr
['data'])
500 ret
+= generate_visit_enum(expr
['enum'], expr
['data'])
503 ret
= generate_decl_enum(expr
['enum'], expr
['data'])
504 ret
+= generate_enum_declaration(expr
['enum'], expr
['data'])