qapi-visit.py 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535
  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, obj ? (void**) &(*obj)->%(c_name)s : NULL, sizeof(%(type)s), &err);
  44. if (!err) {
  45. visit_type_%(type)s_fields(m, obj ? &(*obj)->%(c_prefix)s%(c_name)s : NULL, &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 ? &(*obj)->%(c_prefix)shas_%(c_name)s : NULL, "%(name)s", &err);
  57. if (obj && (*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 ? &(*obj)->%(c_prefix)s%(c_name)s : NULL, "%(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 || *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 key in members:
  183. assert (members[key] in builtin_types
  184. or find_struct(members[key])
  185. or find_union(members[key])), "Invalid anonymous union member"
  186. ret += mcgen('''
  187. case %(abbrev)s_KIND_%(enum)s:
  188. visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, name, &err);
  189. break;
  190. ''',
  191. abbrev = de_camel_case(name).upper(),
  192. enum = c_fun(de_camel_case(key),False).upper(),
  193. c_type = type_name(members[key]),
  194. c_name = c_fun(key))
  195. ret += mcgen('''
  196. default:
  197. abort();
  198. }
  199. error_propagate(errp, err);
  200. err = NULL;
  201. visit_end_implicit_struct(m, &err);
  202. }
  203. }
  204. ''')
  205. return ret
  206. def generate_visit_union(expr):
  207. name = expr['union']
  208. members = expr['data']
  209. base = expr.get('base')
  210. discriminator = expr.get('discriminator')
  211. if discriminator == {}:
  212. assert not base
  213. return generate_visit_anon_union(name, members)
  214. ret = generate_visit_enum('%sKind' % name, members.keys())
  215. if base:
  216. base_fields = find_struct(base)['data']
  217. if discriminator:
  218. base_fields = base_fields.copy()
  219. del base_fields[discriminator]
  220. ret += generate_visit_struct_fields(name, "", "", base_fields)
  221. ret += mcgen('''
  222. void visit_type_%(name)s(Visitor *m, %(name)s ** obj, const char *name, Error **errp)
  223. {
  224. Error *err = NULL;
  225. if (!error_is_set(errp)) {
  226. visit_start_struct(m, (void **)obj, "%(name)s", name, sizeof(%(name)s), &err);
  227. if (!err) {
  228. if (obj && *obj) {
  229. ''',
  230. name=name)
  231. push_indent()
  232. push_indent()
  233. push_indent()
  234. if base:
  235. ret += mcgen('''
  236. visit_type_%(name)s_fields(m, obj, &err);
  237. ''',
  238. name=name)
  239. pop_indent()
  240. if not discriminator:
  241. desc_type = "type"
  242. else:
  243. desc_type = discriminator
  244. ret += mcgen('''
  245. visit_type_%(name)sKind(m, &(*obj)->kind, "%(type)s", &err);
  246. if (!err) {
  247. switch ((*obj)->kind) {
  248. ''',
  249. name=name, type=desc_type)
  250. for key in members:
  251. if not discriminator:
  252. fmt = 'visit_type_%(c_type)s(m, &(*obj)->%(c_name)s, "data", &err);'
  253. else:
  254. fmt = '''visit_start_implicit_struct(m, (void**) &(*obj)->%(c_name)s, sizeof(%(c_type)s), &err);
  255. if (!err) {
  256. visit_type_%(c_type)s_fields(m, &(*obj)->%(c_name)s, &err);
  257. error_propagate(errp, err);
  258. err = NULL;
  259. visit_end_implicit_struct(m, &err);
  260. }'''
  261. ret += mcgen('''
  262. case %(abbrev)s_KIND_%(enum)s:
  263. ''' + fmt + '''
  264. break;
  265. ''',
  266. abbrev = de_camel_case(name).upper(),
  267. enum = c_fun(de_camel_case(key),False).upper(),
  268. c_type=type_name(members[key]),
  269. c_name=c_fun(key))
  270. ret += mcgen('''
  271. default:
  272. abort();
  273. }
  274. }
  275. error_propagate(errp, err);
  276. err = NULL;
  277. }
  278. ''')
  279. pop_indent()
  280. ret += mcgen('''
  281. /* Always call end_struct if start_struct succeeded. */
  282. visit_end_struct(m, &err);
  283. }
  284. error_propagate(errp, err);
  285. }
  286. ''')
  287. pop_indent();
  288. ret += mcgen('''
  289. }
  290. ''')
  291. return ret
  292. def generate_declaration(name, members, genlist=True, builtin_type=False):
  293. ret = ""
  294. if not builtin_type:
  295. ret += mcgen('''
  296. void visit_type_%(name)s(Visitor *m, %(name)s ** obj, const char *name, Error **errp);
  297. ''',
  298. name=name)
  299. if genlist:
  300. ret += mcgen('''
  301. void visit_type_%(name)sList(Visitor *m, %(name)sList ** obj, const char *name, Error **errp);
  302. ''',
  303. name=name)
  304. return ret
  305. def generate_enum_declaration(name, members, genlist=True):
  306. ret = ""
  307. if genlist:
  308. ret += mcgen('''
  309. void visit_type_%(name)sList(Visitor *m, %(name)sList ** obj, const char *name, Error **errp);
  310. ''',
  311. name=name)
  312. return ret
  313. def generate_decl_enum(name, members, genlist=True):
  314. return mcgen('''
  315. void visit_type_%(name)s(Visitor *m, %(name)s * obj, const char *name, Error **errp);
  316. ''',
  317. name=name)
  318. try:
  319. opts, args = getopt.gnu_getopt(sys.argv[1:], "chbp:o:",
  320. ["source", "header", "builtins", "prefix=",
  321. "output-dir="])
  322. except getopt.GetoptError, err:
  323. print str(err)
  324. sys.exit(1)
  325. output_dir = ""
  326. prefix = ""
  327. c_file = 'qapi-visit.c'
  328. h_file = 'qapi-visit.h'
  329. do_c = False
  330. do_h = False
  331. do_builtins = False
  332. for o, a in opts:
  333. if o in ("-p", "--prefix"):
  334. prefix = a
  335. elif o in ("-o", "--output-dir"):
  336. output_dir = a + "/"
  337. elif o in ("-c", "--source"):
  338. do_c = True
  339. elif o in ("-h", "--header"):
  340. do_h = True
  341. elif o in ("-b", "--builtins"):
  342. do_builtins = True
  343. if not do_c and not do_h:
  344. do_c = True
  345. do_h = True
  346. c_file = output_dir + prefix + c_file
  347. h_file = output_dir + prefix + h_file
  348. try:
  349. os.makedirs(output_dir)
  350. except os.error, e:
  351. if e.errno != errno.EEXIST:
  352. raise
  353. def maybe_open(really, name, opt):
  354. if really:
  355. return open(name, opt)
  356. else:
  357. import StringIO
  358. return StringIO.StringIO()
  359. fdef = maybe_open(do_c, c_file, 'w')
  360. fdecl = maybe_open(do_h, h_file, 'w')
  361. fdef.write(mcgen('''
  362. /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
  363. /*
  364. * schema-defined QAPI visitor functions
  365. *
  366. * Copyright IBM, Corp. 2011
  367. *
  368. * Authors:
  369. * Anthony Liguori <aliguori@us.ibm.com>
  370. *
  371. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  372. * See the COPYING.LIB file in the top-level directory.
  373. *
  374. */
  375. #include "qemu-common.h"
  376. #include "%(header)s"
  377. ''',
  378. header=basename(h_file)))
  379. fdecl.write(mcgen('''
  380. /* THIS FILE IS AUTOMATICALLY GENERATED, DO NOT MODIFY */
  381. /*
  382. * schema-defined QAPI visitor function
  383. *
  384. * Copyright IBM, Corp. 2011
  385. *
  386. * Authors:
  387. * Anthony Liguori <aliguori@us.ibm.com>
  388. *
  389. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  390. * See the COPYING.LIB file in the top-level directory.
  391. *
  392. */
  393. #ifndef %(guard)s
  394. #define %(guard)s
  395. #include "qapi/visitor.h"
  396. #include "%(prefix)sqapi-types.h"
  397. ''',
  398. prefix=prefix, guard=guardname(h_file)))
  399. exprs = parse_schema(sys.stdin)
  400. # to avoid header dependency hell, we always generate declarations
  401. # for built-in types in our header files and simply guard them
  402. fdecl.write(guardstart("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
  403. for typename in builtin_types:
  404. fdecl.write(generate_declaration(typename, None, genlist=True,
  405. builtin_type=True))
  406. fdecl.write(guardend("QAPI_VISIT_BUILTIN_VISITOR_DECL"))
  407. # ...this doesn't work for cases where we link in multiple objects that
  408. # have the functions defined, so we use -b option to provide control
  409. # over these cases
  410. if do_builtins:
  411. fdef.write(guardstart("QAPI_VISIT_BUILTIN_VISITOR_DEF"))
  412. for typename in builtin_types:
  413. fdef.write(generate_visit_list(typename, None))
  414. fdef.write(guardend("QAPI_VISIT_BUILTIN_VISITOR_DEF"))
  415. for expr in exprs:
  416. if expr.has_key('type'):
  417. ret = generate_visit_struct(expr)
  418. ret += generate_visit_list(expr['type'], expr['data'])
  419. fdef.write(ret)
  420. ret = generate_declaration(expr['type'], expr['data'])
  421. fdecl.write(ret)
  422. elif expr.has_key('union'):
  423. ret = generate_visit_union(expr)
  424. ret += generate_visit_list(expr['union'], expr['data'])
  425. fdef.write(ret)
  426. ret = generate_decl_enum('%sKind' % expr['union'], expr['data'].keys())
  427. ret += generate_declaration(expr['union'], expr['data'])
  428. fdecl.write(ret)
  429. elif expr.has_key('enum'):
  430. ret = generate_visit_list(expr['enum'], expr['data'])
  431. ret += generate_visit_enum(expr['enum'], expr['data'])
  432. fdef.write(ret)
  433. ret = generate_decl_enum(expr['enum'], expr['data'])
  434. ret += generate_enum_declaration(expr['enum'], expr['data'])
  435. fdecl.write(ret)
  436. fdecl.write('''
  437. #endif
  438. ''')
  439. fdecl.flush()
  440. fdecl.close()
  441. fdef.flush()
  442. fdef.close()