2 # QAPI visitor generator
4 # Copyright IBM, Corp. 2011
5 # Copyright (C) 2014 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_anon_union(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 anon union, always use the default enum type automatically generated
260 # as "'%sKind' % (name)"
261 disc_type = '%sKind' % (name)
264 assert (members[key] in builtin_types
265 or find_struct(members[key])
266 or find_union(members[key])), "Invalid anonymous union member"
268 enum_full_value = generate_enum_full_value(disc_type, key)
270 case %(enum_full_value)s:
271 visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, name, &err);
274 enum_full_value = enum_full_value,
275 c_type = type_name(members[key]),
283 error_propagate(errp, err);
285 visit_end_implicit_struct(m, &err);
287 error_propagate(errp, err);
294 def generate_visit_union(expr):
297 members = expr['data']
299 base = expr.get('base')
300 discriminator = expr.get('discriminator')
302 if discriminator == {}:
304 return generate_visit_anon_union(name, members)
306 enum_define = discriminator_find_enum_define(expr)
308 # Use the enum type as discriminator
310 disc_type = enum_define['enum_name']
312 # There will always be a discriminator in the C switch code, by default it
313 # is an enum type generated silently as "'%sKind' % (name)"
314 ret = generate_visit_enum('%sKind' % name, members.keys())
315 disc_type = '%sKind' % (name)
318 base_fields = find_struct(base)['data']
320 base_fields = base_fields.copy()
321 del base_fields[discriminator]
322 ret += generate_visit_struct_fields(name, "", "", base_fields)
326 ret += generate_visit_implicit_struct(members[key])
330 void visit_type_%(name)s(Visitor *m, %(name)s ** obj, const char *name, Error **errp)
334 visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(name)s), &err);
344 visit_type_%(name)s_fields(m, obj, &err);
351 if not discriminator:
354 disc_key = discriminator
356 visit_type_%(disc_type)s(m, &(*obj)->kind, "%(disc_key)s", &err);
360 switch ((*obj)->kind) {
362 disc_type = disc_type,
366 if not discriminator:
367 fmt = 'visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, "data", &err);'
369 fmt = 'visit_type_implicit_%(c_type)s(m, &(*obj)->%(c_name)s, &err);'
371 enum_full_value = generate_enum_full_value(disc_type, key)
373 case %(enum_full_value)s:
377 enum_full_value = enum_full_value,
378 c_type=type_name(members[key]),
386 error_propagate(errp, err);
389 visit_end_struct(m, &err);
391 error_propagate(errp, err);
397 def generate_declaration(name, members, genlist=True, builtin_type=False):
402 void visit_type_%(name)s(Visitor *m, %(name)s ** obj, const char *name, Error **errp);
408 void visit_type_%(name)sList(Visitor *m, %(name)sList ** obj, const char *name, Error **errp);
414 def generate_enum_declaration(name, members, genlist=True):
418 void visit_type_%(name)sList(Visitor *m, %(name)sList ** obj, const char *name, Error **errp);
424 def generate_decl_enum(name, members, genlist=True):
427 void visit_type_%(name)s(Visitor *m, %(name)s * obj, const char *name, Error **errp);
432 opts, args = getopt.gnu_getopt(sys.argv[1:], "chbp:i:o:",
433 ["source", "header", "builtins", "prefix=",
434 "input-file=", "output-dir="])
435 except getopt.GetoptError, err:
442 c_file = 'qapi-visit.c'
443 h_file = 'qapi-visit.h'
450 if o in ("-p", "--prefix"):
452 elif o in ("-i", "--input-file"):
454 elif o in ("-o", "--output-dir"):
456 elif o in ("-c", "--source"):
458 elif o in ("-h", "--header"):
460 elif o in ("-b", "--builtins"):
463 if not do_c and not do_h:
467 c_file = output_dir + prefix + c_file
468 h_file = output_dir + prefix + h_file
471 os.makedirs(output_dir)
473 if e.errno != errno.EEXIST:
476 def maybe_open(really, name, opt):
478 return open(name, opt)
481 return StringIO.StringIO()
483 fdef = maybe_open(do_c, c_file, 'w')
484 fdecl = maybe_open(do_h, h_file, 'w')
487 /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
490 * schema-defined QAPI visitor functions
492 * Copyright IBM, Corp. 2011
497 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
498 * See the COPYING.LIB file in the top-level directory.
502 #include "qemu-common.h"
503 #include "%(header)s"
505 header=basename(h_file)))
507 fdecl.write(mcgen('''
508 /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
511 * schema-defined QAPI visitor functions
513 * Copyright IBM, Corp. 2011
518 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
519 * See the COPYING.LIB file in the top-level directory.
526 #include "qapi/visitor.h"
527 #include "%(prefix)sqapi-types.h"
530 prefix=prefix, guard=guardname(h_file)))
532 exprs = parse_schema(input_file)
534 # to avoid header dependency hell, we always generate declarations
535 # for built-in types in our header files and simply guard them
536 fdecl.write(guardstart("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
537 for typename in builtin_types:
538 fdecl.write(generate_declaration(typename, None, genlist=True,
540 fdecl.write(guardend("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
542 # ...this doesn't work for cases where we link in multiple objects that
543 # have the functions defined, so we use -b option to provide control
546 for typename in builtin_types:
547 fdef.write(generate_visit_list(typename, None))
550 if expr.has_key('type'):
551 ret = generate_visit_struct(expr)
552 ret += generate_visit_list(expr['type'], expr['data'])
555 ret = generate_declaration(expr['type'], expr['data'])
557 elif expr.has_key('union'):
558 ret = generate_visit_union(expr)
559 ret += generate_visit_list(expr['union'], expr['data'])
562 enum_define = discriminator_find_enum_define(expr)
565 ret = generate_decl_enum('%sKind' % expr['union'],
567 ret += generate_declaration(expr['union'], expr['data'])
569 elif expr.has_key('enum'):
570 ret = generate_visit_list(expr['enum'], expr['data'])
571 ret += generate_visit_enum(expr['enum'], expr['data'])
574 ret = generate_decl_enum(expr['enum'], expr['data'])
575 ret += generate_enum_declaration(expr['enum'], expr['data'])