qapi-visit.py 11 KB

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