qapi-visit.py 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551
  1. #
  2. # QAPI visitor generator
  3. #
  4. # Copyright IBM, Corp. 2011
  5. #
  6. # Authors:
  7. # Anthony Liguori <aliguori@us.ibm.com>
  8. # Michael Roth <mdroth@linux.vnet.ibm.com>
  9. #
  10. # This work is licensed under the terms of the GNU GPL, version 2.
  11. # See the COPYING file in the top-level directory.
  12. from ordereddict import OrderedDict
  13. from qapi import *
  14. import sys
  15. import os
  16. import getopt
  17. import errno
  18. def generate_visit_struct_fields(name, field_prefix, fn_prefix, members, base = None):
  19. substructs = []
  20. ret = ''
  21. if not fn_prefix:
  22. full_name = name
  23. else:
  24. full_name = "%s_%s" % (name, fn_prefix)
  25. for argname, argentry, optional, structured in parse_args(members):
  26. if structured:
  27. if not fn_prefix:
  28. nested_fn_prefix = argname
  29. else:
  30. nested_fn_prefix = "%s_%s" % (fn_prefix, argname)
  31. nested_field_prefix = "%s%s." % (field_prefix, argname)
  32. ret += generate_visit_struct_fields(name, nested_field_prefix,
  33. nested_fn_prefix, argentry)
  34. ret += mcgen('''
  35. static void visit_type_%(full_name)s_fields(Visitor *m, %(name)s ** obj, Error **errp)
  36. {
  37. Error *err = NULL;
  38. ''',
  39. name=name, full_name=full_name)
  40. push_indent()
  41. if base:
  42. ret += mcgen('''
  43. visit_start_implicit_struct(m, (void**) &(*obj)->%(c_name)s, sizeof(%(type)s), &err);
  44. if (!err) {
  45. visit_type_%(type)s_fields(m, &(*obj)->%(c_prefix)s%(c_name)s, &err);
  46. error_propagate(errp, err);
  47. err = NULL;
  48. visit_end_implicit_struct(m, &err);
  49. }
  50. ''',
  51. c_prefix=c_var(field_prefix),
  52. type=type_name(base), c_name=c_var('base'))
  53. for argname, argentry, optional, structured in parse_args(members):
  54. if optional:
  55. ret += mcgen('''
  56. visit_start_optional(m, &(*obj)->%(c_prefix)shas_%(c_name)s, "%(name)s", &err);
  57. if ((*obj)->%(prefix)shas_%(c_name)s) {
  58. ''',
  59. c_prefix=c_var(field_prefix), prefix=field_prefix,
  60. c_name=c_var(argname), name=argname)
  61. push_indent()
  62. if structured:
  63. ret += generate_visit_struct_body(full_name, argname, argentry)
  64. else:
  65. ret += mcgen('''
  66. visit_type_%(type)s(m, &(*obj)->%(c_prefix)s%(c_name)s, "%(name)s", &err);
  67. ''',
  68. c_prefix=c_var(field_prefix), prefix=field_prefix,
  69. type=type_name(argentry), c_name=c_var(argname),
  70. name=argname)
  71. if optional:
  72. pop_indent()
  73. ret += mcgen('''
  74. }
  75. visit_end_optional(m, &err);
  76. ''')
  77. pop_indent()
  78. ret += mcgen('''
  79. error_propagate(errp, err);
  80. }
  81. ''')
  82. return ret
  83. def generate_visit_struct_body(field_prefix, name, members):
  84. ret = mcgen('''
  85. if (!error_is_set(errp)) {
  86. ''')
  87. push_indent()
  88. if not field_prefix:
  89. full_name = name
  90. else:
  91. full_name = "%s_%s" % (field_prefix, name)
  92. if len(field_prefix):
  93. ret += mcgen('''
  94. Error **errp = &err; /* from outer scope */
  95. Error *err = NULL;
  96. visit_start_struct(m, NULL, "", "%(name)s", 0, &err);
  97. ''',
  98. name=name)
  99. else:
  100. ret += mcgen('''
  101. Error *err = NULL;
  102. visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(name)s), &err);
  103. ''',
  104. name=name)
  105. ret += mcgen('''
  106. if (!err) {
  107. if (*obj) {
  108. visit_type_%(name)s_fields(m, obj, &err);
  109. error_propagate(errp, err);
  110. err = NULL;
  111. }
  112. ''',
  113. name=full_name)
  114. pop_indent()
  115. ret += mcgen('''
  116. /* Always call end_struct if start_struct succeeded. */
  117. visit_end_struct(m, &err);
  118. }
  119. error_propagate(errp, err);
  120. }
  121. ''')
  122. return ret
  123. def generate_visit_struct(expr):
  124. name = expr['type']
  125. members = expr['data']
  126. base = expr.get('base')
  127. ret = generate_visit_struct_fields(name, "", "", members, base)
  128. ret += mcgen('''
  129. void visit_type_%(name)s(Visitor *m, %(name)s ** obj, const char *name, Error **errp)
  130. {
  131. ''',
  132. name=name)
  133. push_indent()
  134. ret += generate_visit_struct_body("", name, members)
  135. pop_indent()
  136. ret += mcgen('''
  137. }
  138. ''')
  139. return ret
  140. def generate_visit_list(name, members):
  141. return mcgen('''
  142. void visit_type_%(name)sList(Visitor *m, %(name)sList ** obj, const char *name, Error **errp)
  143. {
  144. GenericList *i, **prev = (GenericList **)obj;
  145. Error *err = NULL;
  146. if (!error_is_set(errp)) {
  147. visit_start_list(m, name, &err);
  148. if (!err) {
  149. for (; (i = visit_next_list(m, prev, &err)) != NULL; prev = &i) {
  150. %(name)sList *native_i = (%(name)sList *)i;
  151. visit_type_%(name)s(m, &native_i->value, NULL, &err);
  152. }
  153. error_propagate(errp, err);
  154. err = NULL;
  155. /* Always call end_list if start_list succeeded. */
  156. visit_end_list(m, &err);
  157. }
  158. error_propagate(errp, err);
  159. }
  160. }
  161. ''',
  162. name=name)
  163. def generate_visit_enum(name, members):
  164. return mcgen('''
  165. void visit_type_%(name)s(Visitor *m, %(name)s * obj, const char *name, Error **errp)
  166. {
  167. visit_type_enum(m, (int *)obj, %(name)s_lookup, "%(name)s", name, errp);
  168. }
  169. ''',
  170. name=name)
  171. def generate_visit_anon_union(name, members):
  172. ret = mcgen('''
  173. void visit_type_%(name)s(Visitor *m, %(name)s ** obj, const char *name, Error **errp)
  174. {
  175. Error *err = NULL;
  176. if (!error_is_set(errp)) {
  177. visit_start_implicit_struct(m, (void**) obj, sizeof(%(name)s), &err);
  178. visit_get_next_type(m, (int*) &(*obj)->kind, %(name)s_qtypes, name, &err);
  179. switch ((*obj)->kind) {
  180. ''',
  181. name=name)
  182. # For anon union, always use the default enum type automatically generated
  183. # as "'%sKind' % (name)"
  184. disc_type = '%sKind' % (name)
  185. for key in members:
  186. assert (members[key] in builtin_types
  187. or find_struct(members[key])
  188. or find_union(members[key])), "Invalid anonymous union member"
  189. enum_full_value = generate_enum_full_value(disc_type, key)
  190. ret += mcgen('''
  191. case %(enum_full_value)s:
  192. visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, name, &err);
  193. break;
  194. ''',
  195. enum_full_value = enum_full_value,
  196. c_type = type_name(members[key]),
  197. c_name = c_fun(key))
  198. ret += mcgen('''
  199. default:
  200. abort();
  201. }
  202. error_propagate(errp, err);
  203. err = NULL;
  204. visit_end_implicit_struct(m, &err);
  205. }
  206. }
  207. ''')
  208. return ret
  209. def generate_visit_union(expr):
  210. name = expr['union']
  211. members = expr['data']
  212. base = expr.get('base')
  213. discriminator = expr.get('discriminator')
  214. if discriminator == {}:
  215. assert not base
  216. return generate_visit_anon_union(name, members)
  217. enum_define = discriminator_find_enum_define(expr)
  218. if enum_define:
  219. # Use the enum type as discriminator
  220. ret = ""
  221. disc_type = enum_define['enum_name']
  222. else:
  223. # There will always be a discriminator in the C switch code, by default it
  224. # is an enum type generated silently as "'%sKind' % (name)"
  225. ret = generate_visit_enum('%sKind' % name, members.keys())
  226. disc_type = '%sKind' % (name)
  227. if base:
  228. base_fields = find_struct(base)['data']
  229. if discriminator:
  230. base_fields = base_fields.copy()
  231. del base_fields[discriminator]
  232. ret += generate_visit_struct_fields(name, "", "", base_fields)
  233. ret += mcgen('''
  234. void visit_type_%(name)s(Visitor *m, %(name)s ** obj, const char *name, Error **errp)
  235. {
  236. Error *err = NULL;
  237. if (!error_is_set(errp)) {
  238. visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(name)s), &err);
  239. if (!err) {
  240. if (*obj) {
  241. ''',
  242. name=name)
  243. push_indent()
  244. push_indent()
  245. push_indent()
  246. if base:
  247. ret += mcgen('''
  248. visit_type_%(name)s_fields(m, obj, &err);
  249. ''',
  250. name=name)
  251. pop_indent()
  252. if not discriminator:
  253. disc_key = "type"
  254. else:
  255. disc_key = discriminator
  256. ret += mcgen('''
  257. visit_type_%(disc_type)s(m, &(*obj)->kind, "%(disc_key)s", &err);
  258. if (!err) {
  259. switch ((*obj)->kind) {
  260. ''',
  261. disc_type = disc_type,
  262. disc_key = disc_key)
  263. for key in members:
  264. if not discriminator:
  265. fmt = 'visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, "data", &err);'
  266. else:
  267. fmt = '''visit_start_implicit_struct(m, (void**) &(*obj)->%(c_name)s, sizeof(%(c_type)s), &err);
  268. if (!err) {
  269. visit_type_%(c_type)s_fields(m, &(*obj)->%(c_name)s, &err);
  270. error_propagate(errp, err);
  271. err = NULL;
  272. visit_end_implicit_struct(m, &err);
  273. }'''
  274. enum_full_value = generate_enum_full_value(disc_type, key)
  275. ret += mcgen('''
  276. case %(enum_full_value)s:
  277. ''' + fmt + '''
  278. break;
  279. ''',
  280. enum_full_value = enum_full_value,
  281. c_type=type_name(members[key]),
  282. c_name=c_fun(key))
  283. ret += mcgen('''
  284. default:
  285. abort();
  286. }
  287. }
  288. error_propagate(errp, err);
  289. err = NULL;
  290. }
  291. ''')
  292. pop_indent()
  293. ret += mcgen('''
  294. /* Always call end_struct if start_struct succeeded. */
  295. visit_end_struct(m, &err);
  296. }
  297. error_propagate(errp, err);
  298. }
  299. ''')
  300. pop_indent();
  301. ret += mcgen('''
  302. }
  303. ''')
  304. return ret
  305. def generate_declaration(name, members, genlist=True, builtin_type=False):
  306. ret = ""
  307. if not builtin_type:
  308. ret += mcgen('''
  309. void visit_type_%(name)s(Visitor *m, %(name)s ** obj, const char *name, Error **errp);
  310. ''',
  311. name=name)
  312. if genlist:
  313. ret += mcgen('''
  314. void visit_type_%(name)sList(Visitor *m, %(name)sList ** obj, const char *name, Error **errp);
  315. ''',
  316. name=name)
  317. return ret
  318. def generate_enum_declaration(name, members, genlist=True):
  319. ret = ""
  320. if genlist:
  321. ret += mcgen('''
  322. void visit_type_%(name)sList(Visitor *m, %(name)sList ** obj, const char *name, Error **errp);
  323. ''',
  324. name=name)
  325. return ret
  326. def generate_decl_enum(name, members, genlist=True):
  327. return mcgen('''
  328. void visit_type_%(name)s(Visitor *m, %(name)s * obj, const char *name, Error **errp);
  329. ''',
  330. name=name)
  331. try:
  332. opts, args = getopt.gnu_getopt(sys.argv[1:], "chbp:o:",
  333. ["source", "header", "builtins", "prefix=",
  334. "output-dir="])
  335. except getopt.GetoptError, err:
  336. print str(err)
  337. sys.exit(1)
  338. output_dir = ""
  339. prefix = ""
  340. c_file = 'qapi-visit.c'
  341. h_file = 'qapi-visit.h'
  342. do_c = False
  343. do_h = False
  344. do_builtins = False
  345. for o, a in opts:
  346. if o in ("-p", "--prefix"):
  347. prefix = a
  348. elif o in ("-o", "--output-dir"):
  349. output_dir = a + "/"
  350. elif o in ("-c", "--source"):
  351. do_c = True
  352. elif o in ("-h", "--header"):
  353. do_h = True
  354. elif o in ("-b", "--builtins"):
  355. do_builtins = True
  356. if not do_c and not do_h:
  357. do_c = True
  358. do_h = True
  359. c_file = output_dir + prefix + c_file
  360. h_file = output_dir + prefix + h_file
  361. try:
  362. os.makedirs(output_dir)
  363. except os.error, e:
  364. if e.errno != errno.EEXIST:
  365. raise
  366. def maybe_open(really, name, opt):
  367. if really:
  368. return open(name, opt)
  369. else:
  370. import StringIO
  371. return StringIO.StringIO()
  372. fdef = maybe_open(do_c, c_file, 'w')
  373. fdecl = maybe_open(do_h, h_file, 'w')
  374. fdef.write(mcgen('''
  375. /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
  376. /*
  377. * schema-defined QAPI visitor functions
  378. *
  379. * Copyright IBM, Corp. 2011
  380. *
  381. * Authors:
  382. * Anthony Liguori <aliguori@us.ibm.com>
  383. *
  384. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  385. * See the COPYING.LIB file in the top-level directory.
  386. *
  387. */
  388. #include "qemu-common.h"
  389. #include "%(header)s"
  390. ''',
  391. header=basename(h_file)))
  392. fdecl.write(mcgen('''
  393. /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
  394. /*
  395. * schema-defined QAPI visitor function
  396. *
  397. * Copyright IBM, Corp. 2011
  398. *
  399. * Authors:
  400. * Anthony Liguori <aliguori@us.ibm.com>
  401. *
  402. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  403. * See the COPYING.LIB file in the top-level directory.
  404. *
  405. */
  406. #ifndef %(guard)s
  407. #define %(guard)s
  408. #include "qapi/visitor.h"
  409. #include "%(prefix)sqapi-types.h"
  410. ''',
  411. prefix=prefix, guard=guardname(h_file)))
  412. exprs = parse_schema(sys.stdin)
  413. # to avoid header dependency hell, we always generate declarations
  414. # for built-in types in our header files and simply guard them
  415. fdecl.write(guardstart("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
  416. for typename in builtin_types:
  417. fdecl.write(generate_declaration(typename, None, genlist=True,
  418. builtin_type=True))
  419. fdecl.write(guardend("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
  420. # ...this doesn't work for cases where we link in multiple objects that
  421. # have the functions defined, so we use -b option to provide control
  422. # over these cases
  423. if do_builtins:
  424. for typename in builtin_types:
  425. fdef.write(generate_visit_list(typename, None))
  426. for expr in exprs:
  427. if expr.has_key('type'):
  428. ret = generate_visit_struct(expr)
  429. ret += generate_visit_list(expr['type'], expr['data'])
  430. fdef.write(ret)
  431. ret = generate_declaration(expr['type'], expr['data'])
  432. fdecl.write(ret)
  433. elif expr.has_key('union'):
  434. ret = generate_visit_union(expr)
  435. ret += generate_visit_list(expr['union'], expr['data'])
  436. fdef.write(ret)
  437. enum_define = discriminator_find_enum_define(expr)
  438. ret = ""
  439. if not enum_define:
  440. ret = generate_decl_enum('%sKind' % expr['union'],
  441. expr['data'].keys())
  442. ret += generate_declaration(expr['union'], expr['data'])
  443. fdecl.write(ret)
  444. elif expr.has_key('enum'):
  445. ret = generate_visit_list(expr['enum'], expr['data'])
  446. ret += generate_visit_enum(expr['enum'], expr['data'])
  447. fdef.write(ret)
  448. ret = generate_decl_enum(expr['enum'], expr['data'])
  449. ret += generate_enum_declaration(expr['enum'], expr['data'])
  450. fdecl.write(ret)
  451. fdecl.write('''
  452. #endif
  453. ''')
  454. fdecl.flush()
  455. fdecl.close()
  456. fdef.flush()
  457. fdef.close()