2 # QAPI visitor generator
4 # Copyright IBM, Corp. 2011
5 # Copyright (C) 2014-2015 Red Hat, Inc.
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
25 def generate_visit_implicit_struct(type):
26 global implicit_structs
27 if type in implicit_structs:
29 implicit_structs.append(type)
32 static void visit_type_implicit_%(c_type)s(Visitor *m, %(c_type)s **obj, Error **errp)
36 visit_start_implicit_struct(m, (void **)obj, sizeof(%(c_type)s), &err);
38 visit_type_%(c_type)s_fields(m, obj, errp);
39 visit_end_implicit_struct(m, &err);
41 error_propagate(errp, err);
44 c_type=type_name(type))
46 def generate_visit_struct_fields(name, field_prefix, fn_prefix, members, base = None):
52 full_name = "%s_%s" % (name, fn_prefix)
54 for argname, argentry, optional, structured in parse_args(members):
57 nested_fn_prefix = argname
59 nested_fn_prefix = "%s_%s" % (fn_prefix, argname)
61 nested_field_prefix = "%s%s." % (field_prefix, argname)
62 ret += generate_visit_struct_fields(name, nested_field_prefix,
63 nested_fn_prefix, argentry)
66 static void visit_type_%(full_name)s_field_%(c_name)s(Visitor *m, %(name)s **obj, Error **errp)
69 name=name, full_name=full_name, c_name=c_var(argname))
70 ret += generate_visit_struct_body(full_name, argname, argentry)
76 ret += generate_visit_implicit_struct(base)
80 static void visit_type_%(full_name)s_fields(Visitor *m, %(name)s **obj, Error **errp)
84 name=name, full_name=full_name)
89 visit_type_implicit_%(type)s(m, &(*obj)->%(c_prefix)s%(c_name)s, &err);
94 c_prefix=c_var(field_prefix),
95 type=type_name(base), c_name=c_var('base'))
97 for argname, argentry, optional, structured in parse_args(members):
100 visit_optional(m, &(*obj)->%(c_prefix)shas_%(c_name)s, "%(name)s", &err);
101 if (!err && (*obj)->%(prefix)shas_%(c_name)s) {
103 c_prefix=c_var(field_prefix), prefix=field_prefix,
104 c_name=c_var(argname), name=argname)
109 visit_type_%(full_name)s_field_%(c_name)s(m, obj, &err);
111 full_name=full_name, c_name=c_var(argname))
114 visit_type_%(type)s(m, &(*obj)->%(c_prefix)s%(c_name)s, "%(name)s", &err);
116 c_prefix=c_var(field_prefix), prefix=field_prefix,
117 type=type_name(argentry), c_name=c_var(argname),
132 if re.search('^ *goto out\\;', ret, re.MULTILINE):
138 error_propagate(errp, err);
144 def generate_visit_struct_body(field_prefix, name, members):
153 full_name = "%s_%s" % (field_prefix, name)
155 if len(field_prefix):
157 visit_start_struct(m, NULL, "", "%(name)s", 0, &err);
162 visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(name)s), &err);
169 visit_type_%(name)s_fields(m, obj, errp);
171 visit_end_struct(m, &err);
173 error_propagate(errp, err);
179 def generate_visit_struct(expr):
182 members = expr['data']
183 base = expr.get('base')
185 ret = generate_visit_struct_fields(name, "", "", members, base)
189 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp)
194 ret += generate_visit_struct_body("", name, members)
201 def generate_visit_list(name, members):
204 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp)
207 GenericList *i, **prev;
209 visit_start_list(m, name, &err);
214 for (prev = (GenericList **)obj;
215 !err && (i = visit_next_list(m, prev, &err)) != NULL;
217 %(name)sList *native_i = (%(name)sList *)i;
218 visit_type_%(name)s(m, &native_i->value, NULL, &err);
221 error_propagate(errp, err);
223 visit_end_list(m, &err);
225 error_propagate(errp, err);
230 def generate_visit_enum(name, members):
233 void visit_type_%(name)s(Visitor *m, %(name)s *obj, const char *name, Error **errp)
235 visit_type_enum(m, (int *)obj, %(name)s_lookup, "%(name)s", name, errp);
240 def generate_visit_alternate(name, members):
243 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp)
247 visit_start_implicit_struct(m, (void**) obj, sizeof(%(name)s), &err);
251 visit_get_next_type(m, (int*) &(*obj)->kind, %(name)s_qtypes, name, &err);
255 switch ((*obj)->kind) {
259 # For alternate, always use the default enum type automatically generated
260 # as "'%sKind' % (name)"
261 disc_type = '%sKind' % (name)
264 assert (members[key] in builtin_types.keys()
265 or find_struct(members[key])
266 or find_union(members[key])
267 or find_enum(members[key])), "Invalid alternate member"
269 enum_full_value = generate_enum_full_value(disc_type, key)
271 case %(enum_full_value)s:
272 visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, name, &err);
275 enum_full_value = enum_full_value,
276 c_type = type_name(members[key]),
284 error_propagate(errp, err);
286 visit_end_implicit_struct(m, &err);
288 error_propagate(errp, err);
295 def generate_visit_union(expr):
298 members = expr['data']
300 base = expr.get('base')
301 discriminator = expr.get('discriminator')
303 enum_define = discriminator_find_enum_define(expr)
305 # Use the enum type as discriminator
307 disc_type = enum_define['enum_name']
309 # There will always be a discriminator in the C switch code, by default
310 # it is an enum type generated silently as "'%sKind' % (name)"
311 ret = generate_visit_enum('%sKind' % name, members.keys())
312 disc_type = '%sKind' % (name)
316 base_fields = find_struct(base)['data'].copy()
317 del base_fields[discriminator]
318 ret += generate_visit_struct_fields(name, "", "", base_fields)
322 ret += generate_visit_implicit_struct(members[key])
326 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp)
330 visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(name)s), &err);
340 visit_type_%(name)s_fields(m, obj, &err);
347 if not discriminator:
350 disc_key = discriminator
352 visit_type_%(disc_type)s(m, &(*obj)->kind, "%(disc_key)s", &err);
356 if (!visit_start_union(m, !!(*obj)->data, &err) || err) {
359 switch ((*obj)->kind) {
361 disc_type = disc_type,
365 if not discriminator:
366 fmt = 'visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, "data", &err);'
368 fmt = 'visit_type_implicit_%(c_type)s(m, &(*obj)->%(c_name)s, &err);'
370 enum_full_value = generate_enum_full_value(disc_type, key)
372 case %(enum_full_value)s:
376 enum_full_value = enum_full_value,
377 c_type=type_name(members[key]),
385 error_propagate(errp, err);
387 visit_end_union(m, !!(*obj)->data, &err);
388 error_propagate(errp, err);
391 visit_end_struct(m, &err);
393 error_propagate(errp, err);
399 def generate_declaration(name, members, builtin_type=False):
404 void visit_type_%(name)s(Visitor *m, %(name)s **obj, const char *name, Error **errp);
409 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp);
415 def generate_enum_declaration(name, members):
417 void visit_type_%(name)sList(Visitor *m, %(name)sList **obj, const char *name, Error **errp);
423 def generate_decl_enum(name, members):
426 void visit_type_%(name)s(Visitor *m, %(name)s *obj, const char *name, Error **errp);
431 opts, args = getopt.gnu_getopt(sys.argv[1:], "chbp:i:o:",
432 ["source", "header", "builtins", "prefix=",
433 "input-file=", "output-dir="])
434 except getopt.GetoptError, err:
441 c_file = 'qapi-visit.c'
442 h_file = 'qapi-visit.h'
449 if o in ("-p", "--prefix"):
451 elif o in ("-i", "--input-file"):
453 elif o in ("-o", "--output-dir"):
455 elif o in ("-c", "--source"):
457 elif o in ("-h", "--header"):
459 elif o in ("-b", "--builtins"):
462 if not do_c and not do_h:
466 c_file = output_dir + prefix + c_file
467 h_file = output_dir + prefix + h_file
470 os.makedirs(output_dir)
472 if e.errno != errno.EEXIST:
475 def maybe_open(really, name, opt):
477 return open(name, opt)
480 return StringIO.StringIO()
482 fdef = maybe_open(do_c, c_file, 'w')
483 fdecl = maybe_open(do_h, h_file, 'w')
486 /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
489 * schema-defined QAPI visitor functions
491 * Copyright IBM, Corp. 2011
496 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
497 * See the COPYING.LIB file in the top-level directory.
501 #include "qemu-common.h"
502 #include "%(header)s"
504 header=basename(h_file)))
506 fdecl.write(mcgen('''
507 /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
510 * schema-defined QAPI visitor functions
512 * Copyright IBM, Corp. 2011
517 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
518 * See the COPYING.LIB file in the top-level directory.
525 #include "qapi/visitor.h"
526 #include "%(prefix)sqapi-types.h"
529 prefix=prefix, guard=guardname(h_file)))
531 exprs = parse_schema(input_file)
533 # to avoid header dependency hell, we always generate declarations
534 # for built-in types in our header files and simply guard them
535 fdecl.write(guardstart("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
536 for typename in builtin_types.keys():
537 fdecl.write(generate_declaration(typename, None, builtin_type=True))
538 fdecl.write(guardend("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
540 # ...this doesn't work for cases where we link in multiple objects that
541 # have the functions defined, so we use -b option to provide control
544 for typename in builtin_types.keys():
545 fdef.write(generate_visit_list(typename, None))
548 if expr.has_key('type'):
549 ret = generate_visit_struct(expr)
550 ret += generate_visit_list(expr['type'], expr['data'])
553 ret = generate_declaration(expr['type'], expr['data'])
555 elif expr.has_key('union'):
556 ret = generate_visit_union(expr)
557 ret += generate_visit_list(expr['union'], expr['data'])
560 enum_define = discriminator_find_enum_define(expr)
563 ret = generate_decl_enum('%sKind' % expr['union'],
565 ret += generate_declaration(expr['union'], expr['data'])
567 elif expr.has_key('alternate'):
568 ret = generate_visit_alternate(expr['alternate'], expr['data'])
569 ret += generate_visit_list(expr['alternate'], expr['data'])
572 ret = generate_decl_enum('%sKind' % expr['alternate'],
574 ret += generate_declaration(expr['alternate'], expr['data'])
576 elif expr.has_key('enum'):
577 ret = generate_visit_list(expr['enum'], expr['data'])
578 ret += generate_visit_enum(expr['enum'], expr['data'])
581 ret = generate_decl_enum(expr['enum'], expr['data'])
582 ret += generate_enum_declaration(expr['enum'], expr['data'])