qapi-visit.py 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436
  1. #
  2. # QAPI visitor generator
  3. #
  4. # Copyright IBM, Corp. 2011
  5. # Copyright (C) 2014-2015 Red Hat, Inc.
  6. #
  7. # Authors:
  8. # Anthony Liguori <aliguori@us.ibm.com>
  9. # Michael Roth <mdroth@linux.vnet.ibm.com>
  10. # Markus Armbruster <armbru@redhat.com>
  11. #
  12. # This work is licensed under the terms of the GNU GPL, version 2.
  13. # See the COPYING file in the top-level directory.
  14. from qapi import *
  15. import re
  16. implicit_structs_seen = set()
  17. struct_fields_seen = set()
  18. def gen_visit_decl(name, scalar=False):
  19. c_type = c_name(name) + ' *'
  20. if not scalar:
  21. c_type += '*'
  22. return mcgen('''
  23. void visit_type_%(c_name)s(Visitor *v, %(c_type)sobj, const char *name, Error **errp);
  24. ''',
  25. c_name=c_name(name), c_type=c_type)
  26. def gen_visit_implicit_struct(typ):
  27. if typ in implicit_structs_seen:
  28. return ''
  29. implicit_structs_seen.add(typ)
  30. ret = ''
  31. if typ.name not in struct_fields_seen:
  32. # Need a forward declaration
  33. ret += mcgen('''
  34. static void visit_type_%(c_type)s_fields(Visitor *v, %(c_type)s **obj, Error **errp);
  35. ''',
  36. c_type=typ.c_name())
  37. ret += mcgen('''
  38. static void visit_type_implicit_%(c_type)s(Visitor *v, %(c_type)s **obj, Error **errp)
  39. {
  40. Error *err = NULL;
  41. visit_start_implicit_struct(v, (void **)obj, sizeof(%(c_type)s), &err);
  42. if (!err) {
  43. visit_type_%(c_type)s_fields(v, obj, errp);
  44. visit_end_implicit_struct(v, &err);
  45. }
  46. error_propagate(errp, err);
  47. }
  48. ''',
  49. c_type=typ.c_name())
  50. return ret
  51. def gen_visit_struct_fields(name, base, members):
  52. struct_fields_seen.add(name)
  53. ret = ''
  54. if base:
  55. ret += gen_visit_implicit_struct(base)
  56. ret += mcgen('''
  57. static void visit_type_%(c_name)s_fields(Visitor *v, %(c_name)s **obj, Error **errp)
  58. {
  59. Error *err = NULL;
  60. ''',
  61. c_name=c_name(name))
  62. if base:
  63. ret += mcgen('''
  64. visit_type_implicit_%(c_type)s(v, &(*obj)->%(c_name)s, &err);
  65. ''',
  66. c_type=base.c_name(), c_name=c_name('base'))
  67. ret += gen_err_check()
  68. ret += gen_visit_fields(members, prefix='(*obj)->')
  69. # 'goto out' produced for base, and by gen_visit_fields() for each member
  70. if base or members:
  71. ret += mcgen('''
  72. out:
  73. ''')
  74. ret += mcgen('''
  75. error_propagate(errp, err);
  76. }
  77. ''')
  78. return ret
  79. def gen_visit_struct(name, base, members):
  80. ret = gen_visit_struct_fields(name, base, members)
  81. # FIXME: if *obj is NULL on entry, and visit_start_struct() assigns to
  82. # *obj, but then visit_type_FOO_fields() fails, we should clean up *obj
  83. # rather than leaving it non-NULL. As currently written, the caller must
  84. # call qapi_free_FOO() to avoid a memory leak of the partial FOO.
  85. ret += mcgen('''
  86. void visit_type_%(c_name)s(Visitor *v, %(c_name)s **obj, const char *name, Error **errp)
  87. {
  88. Error *err = NULL;
  89. visit_start_struct(v, (void **)obj, "%(name)s", name, sizeof(%(c_name)s), &err);
  90. if (!err) {
  91. if (*obj) {
  92. visit_type_%(c_name)s_fields(v, obj, errp);
  93. }
  94. visit_end_struct(v, &err);
  95. }
  96. error_propagate(errp, err);
  97. }
  98. ''',
  99. name=name, c_name=c_name(name))
  100. return ret
  101. def gen_visit_list(name, element_type):
  102. return mcgen('''
  103. void visit_type_%(c_name)s(Visitor *v, %(c_name)s **obj, const char *name, Error **errp)
  104. {
  105. Error *err = NULL;
  106. GenericList *i, **prev;
  107. visit_start_list(v, name, &err);
  108. if (err) {
  109. goto out;
  110. }
  111. for (prev = (GenericList **)obj;
  112. !err && (i = visit_next_list(v, prev, &err)) != NULL;
  113. prev = &i) {
  114. %(c_name)s *native_i = (%(c_name)s *)i;
  115. visit_type_%(c_elt_type)s(v, &native_i->value, NULL, &err);
  116. }
  117. error_propagate(errp, err);
  118. err = NULL;
  119. visit_end_list(v, &err);
  120. out:
  121. error_propagate(errp, err);
  122. }
  123. ''',
  124. c_name=c_name(name), c_elt_type=element_type.c_name())
  125. def gen_visit_enum(name):
  126. return mcgen('''
  127. void visit_type_%(c_name)s(Visitor *v, %(c_name)s *obj, const char *name, Error **errp)
  128. {
  129. visit_type_enum(v, (int *)obj, %(c_name)s_lookup, "%(name)s", name, errp);
  130. }
  131. ''',
  132. c_name=c_name(name), name=name)
  133. def gen_visit_alternate(name, variants):
  134. ret = mcgen('''
  135. void visit_type_%(c_name)s(Visitor *v, %(c_name)s **obj, const char *name, Error **errp)
  136. {
  137. Error *err = NULL;
  138. visit_start_implicit_struct(v, (void**) obj, sizeof(%(c_name)s), &err);
  139. if (err) {
  140. goto out;
  141. }
  142. visit_get_next_type(v, (int*) &(*obj)->kind, %(c_name)s_qtypes, name, &err);
  143. if (err) {
  144. goto out_obj;
  145. }
  146. switch ((*obj)->kind) {
  147. ''',
  148. c_name=c_name(name))
  149. for var in variants.variants:
  150. ret += mcgen('''
  151. case %(case)s:
  152. visit_type_%(c_type)s(v, &(*obj)->%(c_name)s, name, &err);
  153. break;
  154. ''',
  155. case=c_enum_const(variants.tag_member.type.name,
  156. var.name),
  157. c_type=var.type.c_name(),
  158. c_name=c_name(var.name))
  159. ret += mcgen('''
  160. default:
  161. abort();
  162. }
  163. out_obj:
  164. error_propagate(errp, err);
  165. err = NULL;
  166. visit_end_implicit_struct(v, &err);
  167. out:
  168. error_propagate(errp, err);
  169. }
  170. ''')
  171. return ret
  172. def gen_visit_union(name, base, variants):
  173. ret = ''
  174. if base:
  175. members = [m for m in base.members if m != variants.tag_member]
  176. ret += gen_visit_struct_fields(name, None, members)
  177. for var in variants.variants:
  178. # Ugly special case for simple union TODO get rid of it
  179. if not var.simple_union_type():
  180. ret += gen_visit_implicit_struct(var.type)
  181. ret += mcgen('''
  182. void visit_type_%(c_name)s(Visitor *v, %(c_name)s **obj, const char *name, Error **errp)
  183. {
  184. Error *err = NULL;
  185. visit_start_struct(v, (void **)obj, "%(name)s", name, sizeof(%(c_name)s), &err);
  186. if (err) {
  187. goto out;
  188. }
  189. if (!*obj) {
  190. goto out_obj;
  191. }
  192. ''',
  193. c_name=c_name(name), name=name)
  194. if base:
  195. ret += mcgen('''
  196. visit_type_%(c_name)s_fields(v, obj, &err);
  197. ''',
  198. c_name=c_name(name))
  199. ret += gen_err_check(label='out_obj')
  200. tag_key = variants.tag_member.name
  201. if not variants.tag_name:
  202. # we pointlessly use a different key for simple unions
  203. tag_key = 'type'
  204. ret += mcgen('''
  205. visit_type_%(c_type)s(v, &(*obj)->%(c_name)s, "%(name)s", &err);
  206. if (err) {
  207. goto out_obj;
  208. }
  209. if (!visit_start_union(v, !!(*obj)->data, &err) || err) {
  210. goto out_obj;
  211. }
  212. switch ((*obj)->%(c_name)s) {
  213. ''',
  214. c_type=variants.tag_member.type.c_name(),
  215. # TODO ugly special case for simple union
  216. # Use same tag name in C as on the wire to get rid of
  217. # it, then: c_name=c_name(variants.tag_member.name)
  218. c_name=c_name(variants.tag_name or 'kind'),
  219. name=tag_key)
  220. for var in variants.variants:
  221. # TODO ugly special case for simple union
  222. simple_union_type = var.simple_union_type()
  223. ret += mcgen('''
  224. case %(case)s:
  225. ''',
  226. case=c_enum_const(variants.tag_member.type.name,
  227. var.name))
  228. if simple_union_type:
  229. ret += mcgen('''
  230. visit_type_%(c_type)s(v, &(*obj)->%(c_name)s, "data", &err);
  231. ''',
  232. c_type=simple_union_type.c_name(),
  233. c_name=c_name(var.name))
  234. else:
  235. ret += mcgen('''
  236. visit_type_implicit_%(c_type)s(v, &(*obj)->%(c_name)s, &err);
  237. ''',
  238. c_type=var.type.c_name(),
  239. c_name=c_name(var.name))
  240. ret += mcgen('''
  241. break;
  242. ''')
  243. ret += mcgen('''
  244. default:
  245. abort();
  246. }
  247. out_obj:
  248. error_propagate(errp, err);
  249. err = NULL;
  250. if (*obj) {
  251. visit_end_union(v, !!(*obj)->data, &err);
  252. }
  253. error_propagate(errp, err);
  254. err = NULL;
  255. visit_end_struct(v, &err);
  256. out:
  257. error_propagate(errp, err);
  258. }
  259. ''')
  260. return ret
  261. class QAPISchemaGenVisitVisitor(QAPISchemaVisitor):
  262. def __init__(self):
  263. self.decl = None
  264. self.defn = None
  265. self._btin = None
  266. def visit_begin(self, schema):
  267. self.decl = ''
  268. self.defn = ''
  269. self._btin = guardstart('QAPI_VISIT_BUILTIN')
  270. def visit_end(self):
  271. # To avoid header dependency hell, we always generate
  272. # declarations for built-in types in our header files and
  273. # simply guard them. See also do_builtins (command line
  274. # option -b).
  275. self._btin += guardend('QAPI_VISIT_BUILTIN')
  276. self.decl = self._btin + self.decl
  277. self._btin = None
  278. def visit_needed(self, entity):
  279. # Visit everything except implicit objects
  280. return not (entity.is_implicit() and
  281. isinstance(entity, QAPISchemaObjectType))
  282. def visit_enum_type(self, name, info, values, prefix):
  283. self.decl += gen_visit_decl(name, scalar=True)
  284. self.defn += gen_visit_enum(name)
  285. def visit_array_type(self, name, info, element_type):
  286. decl = gen_visit_decl(name)
  287. defn = gen_visit_list(name, element_type)
  288. if isinstance(element_type, QAPISchemaBuiltinType):
  289. self._btin += decl
  290. if do_builtins:
  291. self.defn += defn
  292. else:
  293. self.decl += decl
  294. self.defn += defn
  295. def visit_object_type(self, name, info, base, members, variants):
  296. self.decl += gen_visit_decl(name)
  297. if variants:
  298. assert not members # not implemented
  299. self.defn += gen_visit_union(name, base, variants)
  300. else:
  301. self.defn += gen_visit_struct(name, base, members)
  302. def visit_alternate_type(self, name, info, variants):
  303. self.decl += gen_visit_decl(name)
  304. self.defn += gen_visit_alternate(name, variants)
  305. # If you link code generated from multiple schemata, you want only one
  306. # instance of the code for built-in types. Generate it only when
  307. # do_builtins, enabled by command line option -b. See also
  308. # QAPISchemaGenVisitVisitor.visit_end().
  309. do_builtins = False
  310. (input_file, output_dir, do_c, do_h, prefix, opts) = \
  311. parse_command_line("b", ["builtins"])
  312. for o, a in opts:
  313. if o in ("-b", "--builtins"):
  314. do_builtins = True
  315. c_comment = '''
  316. /*
  317. * schema-defined QAPI visitor functions
  318. *
  319. * Copyright IBM, Corp. 2011
  320. *
  321. * Authors:
  322. * Anthony Liguori <aliguori@us.ibm.com>
  323. *
  324. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  325. * See the COPYING.LIB file in the top-level directory.
  326. *
  327. */
  328. '''
  329. h_comment = '''
  330. /*
  331. * schema-defined QAPI visitor functions
  332. *
  333. * Copyright IBM, Corp. 2011
  334. *
  335. * Authors:
  336. * Anthony Liguori <aliguori@us.ibm.com>
  337. *
  338. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  339. * See the COPYING.LIB file in the top-level directory.
  340. *
  341. */
  342. '''
  343. (fdef, fdecl) = open_output(output_dir, do_c, do_h, prefix,
  344. 'qapi-visit.c', 'qapi-visit.h',
  345. c_comment, h_comment)
  346. fdef.write(mcgen('''
  347. #include "qemu-common.h"
  348. #include "%(prefix)sqapi-visit.h"
  349. ''',
  350. prefix=prefix))
  351. fdecl.write(mcgen('''
  352. #include "qapi/visitor.h"
  353. #include "%(prefix)sqapi-types.h"
  354. ''',
  355. prefix=prefix))
  356. schema = QAPISchema(input_file)
  357. gen = QAPISchemaGenVisitVisitor()
  358. schema.visit(gen)
  359. fdef.write(gen.defn)
  360. fdecl.write(gen.decl)
  361. close_output(fdef, fdecl)