qapi-types.py 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466
  1. #
  2. # QAPI types generator
  3. #
  4. # Copyright IBM, Corp. 2011
  5. #
  6. # Authors:
  7. # Anthony Liguori <aliguori@us.ibm.com>
  8. #
  9. # This work is licensed under the terms of the GNU GPL, version 2.
  10. # See the COPYING file in the top-level directory.
  11. from ordereddict import OrderedDict
  12. from qapi import *
  13. import sys
  14. import os
  15. import getopt
  16. import errno
  17. def generate_fwd_struct(name, members, builtin_type=False):
  18. if builtin_type:
  19. return mcgen('''
  20. typedef struct %(name)sList
  21. {
  22. union {
  23. %(type)s value;
  24. uint64_t padding;
  25. };
  26. struct %(name)sList *next;
  27. } %(name)sList;
  28. ''',
  29. type=c_type(name),
  30. name=name)
  31. return mcgen('''
  32. typedef struct %(name)s %(name)s;
  33. typedef struct %(name)sList
  34. {
  35. union {
  36. %(name)s *value;
  37. uint64_t padding;
  38. };
  39. struct %(name)sList *next;
  40. } %(name)sList;
  41. ''',
  42. name=name)
  43. def generate_fwd_enum_struct(name, members):
  44. return mcgen('''
  45. typedef struct %(name)sList
  46. {
  47. union {
  48. %(name)s value;
  49. uint64_t padding;
  50. };
  51. struct %(name)sList *next;
  52. } %(name)sList;
  53. ''',
  54. name=name)
  55. def generate_struct_fields(members):
  56. ret = ''
  57. for argname, argentry, optional in parse_args(members):
  58. if optional:
  59. ret += mcgen('''
  60. bool has_%(c_name)s;
  61. ''',
  62. c_name=c_var(argname))
  63. ret += mcgen('''
  64. %(c_type)s %(c_name)s;
  65. ''',
  66. c_type=c_type(argentry), c_name=c_var(argname))
  67. return ret
  68. def generate_struct(expr):
  69. structname = expr.get('struct', "")
  70. fieldname = expr.get('field', "")
  71. members = expr['data']
  72. base = expr.get('base')
  73. ret = mcgen('''
  74. struct %(name)s
  75. {
  76. ''',
  77. name=structname)
  78. if base:
  79. ret += generate_struct_fields({'base': base})
  80. ret += generate_struct_fields(members)
  81. # Make sure that all structs have at least one field; this avoids
  82. # potential issues with attempting to malloc space for zero-length structs
  83. # in C, and also incompatibility with C++ (where an empty struct is size 1).
  84. if not base and not members:
  85. ret += mcgen('''
  86. char qapi_dummy_field_for_empty_struct;
  87. ''')
  88. if len(fieldname):
  89. fieldname = " " + fieldname
  90. ret += mcgen('''
  91. }%(field)s;
  92. ''',
  93. field=fieldname)
  94. return ret
  95. def generate_enum_lookup(name, values):
  96. ret = mcgen('''
  97. const char *%(name)s_lookup[] = {
  98. ''',
  99. name=name)
  100. i = 0
  101. for value in values:
  102. index = generate_enum_full_value(name, value)
  103. ret += mcgen('''
  104. [%(index)s] = "%(value)s",
  105. ''',
  106. index = index, value = value)
  107. max_index = generate_enum_full_value(name, 'MAX')
  108. ret += mcgen('''
  109. [%(max_index)s] = NULL,
  110. };
  111. ''',
  112. max_index=max_index)
  113. return ret
  114. def generate_enum(name, values):
  115. lookup_decl = mcgen('''
  116. extern const char *%(name)s_lookup[];
  117. ''',
  118. name=name)
  119. enum_decl = mcgen('''
  120. typedef enum %(name)s
  121. {
  122. ''',
  123. name=name)
  124. # append automatically generated _MAX value
  125. enum_values = values + [ 'MAX' ]
  126. i = 0
  127. for value in enum_values:
  128. enum_full_value = generate_enum_full_value(name, value)
  129. enum_decl += mcgen('''
  130. %(enum_full_value)s = %(i)d,
  131. ''',
  132. enum_full_value = enum_full_value,
  133. i=i)
  134. i += 1
  135. enum_decl += mcgen('''
  136. } %(name)s;
  137. ''',
  138. name=name)
  139. return lookup_decl + enum_decl
  140. def generate_alternate_qtypes(expr):
  141. name = expr['alternate']
  142. members = expr['data']
  143. ret = mcgen('''
  144. const int %(name)s_qtypes[QTYPE_MAX] = {
  145. ''',
  146. name=name)
  147. for key in members:
  148. qtype = find_alternate_member_qtype(members[key])
  149. assert qtype, "Invalid alternate member"
  150. ret += mcgen('''
  151. [ %(qtype)s ] = %(abbrev)s_KIND_%(enum)s,
  152. ''',
  153. qtype = qtype,
  154. abbrev = de_camel_case(name).upper(),
  155. enum = c_fun(de_camel_case(key),False).upper())
  156. ret += mcgen('''
  157. };
  158. ''')
  159. return ret
  160. def generate_union(expr, meta):
  161. name = expr[meta]
  162. typeinfo = expr['data']
  163. base = expr.get('base')
  164. discriminator = expr.get('discriminator')
  165. enum_define = discriminator_find_enum_define(expr)
  166. if enum_define:
  167. discriminator_type_name = enum_define['enum_name']
  168. else:
  169. discriminator_type_name = '%sKind' % (name)
  170. ret = mcgen('''
  171. struct %(name)s
  172. {
  173. %(discriminator_type_name)s kind;
  174. union {
  175. void *data;
  176. ''',
  177. name=name,
  178. discriminator_type_name=discriminator_type_name)
  179. for key in typeinfo:
  180. ret += mcgen('''
  181. %(c_type)s %(c_name)s;
  182. ''',
  183. c_type=c_type(typeinfo[key]),
  184. c_name=c_fun(key))
  185. ret += mcgen('''
  186. };
  187. ''')
  188. if base:
  189. assert discriminator
  190. base_fields = find_struct(base)['data'].copy()
  191. del base_fields[discriminator]
  192. ret += generate_struct_fields(base_fields)
  193. else:
  194. assert not discriminator
  195. ret += mcgen('''
  196. };
  197. ''')
  198. if meta == 'alternate':
  199. ret += mcgen('''
  200. extern const int %(name)s_qtypes[];
  201. ''',
  202. name=name)
  203. return ret
  204. def generate_type_cleanup_decl(name):
  205. ret = mcgen('''
  206. void qapi_free_%(type)s(%(c_type)s obj);
  207. ''',
  208. c_type=c_type(name),type=name)
  209. return ret
  210. def generate_type_cleanup(name):
  211. ret = mcgen('''
  212. void qapi_free_%(type)s(%(c_type)s obj)
  213. {
  214. QapiDeallocVisitor *md;
  215. Visitor *v;
  216. if (!obj) {
  217. return;
  218. }
  219. md = qapi_dealloc_visitor_new();
  220. v = qapi_dealloc_get_visitor(md);
  221. visit_type_%(type)s(v, &obj, NULL, NULL);
  222. qapi_dealloc_visitor_cleanup(md);
  223. }
  224. ''',
  225. c_type=c_type(name),type=name)
  226. return ret
  227. try:
  228. opts, args = getopt.gnu_getopt(sys.argv[1:], "chbp:i:o:",
  229. ["source", "header", "builtins",
  230. "prefix=", "input-file=", "output-dir="])
  231. except getopt.GetoptError, err:
  232. print str(err)
  233. sys.exit(1)
  234. output_dir = ""
  235. input_file = ""
  236. prefix = ""
  237. c_file = 'qapi-types.c'
  238. h_file = 'qapi-types.h'
  239. do_c = False
  240. do_h = False
  241. do_builtins = False
  242. for o, a in opts:
  243. if o in ("-p", "--prefix"):
  244. prefix = a
  245. elif o in ("-i", "--input-file"):
  246. input_file = a
  247. elif o in ("-o", "--output-dir"):
  248. output_dir = a + "/"
  249. elif o in ("-c", "--source"):
  250. do_c = True
  251. elif o in ("-h", "--header"):
  252. do_h = True
  253. elif o in ("-b", "--builtins"):
  254. do_builtins = True
  255. if not do_c and not do_h:
  256. do_c = True
  257. do_h = True
  258. c_file = output_dir + prefix + c_file
  259. h_file = output_dir + prefix + h_file
  260. try:
  261. os.makedirs(output_dir)
  262. except os.error, e:
  263. if e.errno != errno.EEXIST:
  264. raise
  265. def maybe_open(really, name, opt):
  266. if really:
  267. return open(name, opt)
  268. else:
  269. import StringIO
  270. return StringIO.StringIO()
  271. fdef = maybe_open(do_c, c_file, 'w')
  272. fdecl = maybe_open(do_h, h_file, 'w')
  273. fdef.write(mcgen('''
  274. /* AUTOMATICALLY GENERATED, DO NOT MODIFY */
  275. /*
  276. * deallocation functions for schema-defined QAPI types
  277. *
  278. * Copyright IBM, Corp. 2011
  279. *
  280. * Authors:
  281. * Anthony Liguori <aliguori@us.ibm.com>
  282. * Michael Roth <mdroth@linux.vnet.ibm.com>
  283. *
  284. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  285. * See the COPYING.LIB file in the top-level directory.
  286. *
  287. */
  288. #include "qapi/dealloc-visitor.h"
  289. #include "%(prefix)sqapi-types.h"
  290. #include "%(prefix)sqapi-visit.h"
  291. ''', prefix=prefix))
  292. fdecl.write(mcgen('''
  293. /* AUTOMATICALLY GENERATED, DO NOT MODIFY */
  294. /*
  295. * schema-defined QAPI types
  296. *
  297. * Copyright IBM, Corp. 2011
  298. *
  299. * Authors:
  300. * Anthony Liguori <aliguori@us.ibm.com>
  301. *
  302. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  303. * See the COPYING.LIB file in the top-level directory.
  304. *
  305. */
  306. #ifndef %(guard)s
  307. #define %(guard)s
  308. #include <stdbool.h>
  309. #include <stdint.h>
  310. ''',
  311. guard=guardname(h_file)))
  312. exprs = parse_schema(input_file)
  313. exprs = filter(lambda expr: not expr.has_key('gen'), exprs)
  314. fdecl.write(guardstart("QAPI_TYPES_BUILTIN_STRUCT_DECL"))
  315. for typename in builtin_types.keys():
  316. fdecl.write(generate_fwd_struct(typename, None, builtin_type=True))
  317. fdecl.write(guardend("QAPI_TYPES_BUILTIN_STRUCT_DECL"))
  318. for expr in exprs:
  319. ret = "\n"
  320. if expr.has_key('struct'):
  321. ret += generate_fwd_struct(expr['struct'], expr['data'])
  322. elif expr.has_key('enum'):
  323. ret += generate_enum(expr['enum'], expr['data']) + "\n"
  324. ret += generate_fwd_enum_struct(expr['enum'], expr['data'])
  325. fdef.write(generate_enum_lookup(expr['enum'], expr['data']))
  326. elif expr.has_key('union'):
  327. ret += generate_fwd_struct(expr['union'], expr['data']) + "\n"
  328. enum_define = discriminator_find_enum_define(expr)
  329. if not enum_define:
  330. ret += generate_enum('%sKind' % expr['union'], expr['data'].keys())
  331. fdef.write(generate_enum_lookup('%sKind' % expr['union'],
  332. expr['data'].keys()))
  333. elif expr.has_key('alternate'):
  334. ret += generate_fwd_struct(expr['alternate'], expr['data']) + "\n"
  335. ret += generate_enum('%sKind' % expr['alternate'], expr['data'].keys())
  336. fdef.write(generate_enum_lookup('%sKind' % expr['alternate'],
  337. expr['data'].keys()))
  338. fdef.write(generate_alternate_qtypes(expr))
  339. else:
  340. continue
  341. fdecl.write(ret)
  342. # to avoid header dependency hell, we always generate declarations
  343. # for built-in types in our header files and simply guard them
  344. fdecl.write(guardstart("QAPI_TYPES_BUILTIN_CLEANUP_DECL"))
  345. for typename in builtin_types.keys():
  346. fdecl.write(generate_type_cleanup_decl(typename + "List"))
  347. fdecl.write(guardend("QAPI_TYPES_BUILTIN_CLEANUP_DECL"))
  348. # ...this doesn't work for cases where we link in multiple objects that
  349. # have the functions defined, so we use -b option to provide control
  350. # over these cases
  351. if do_builtins:
  352. fdef.write(guardstart("QAPI_TYPES_BUILTIN_CLEANUP_DEF"))
  353. for typename in builtin_types.keys():
  354. fdef.write(generate_type_cleanup(typename + "List"))
  355. fdef.write(guardend("QAPI_TYPES_BUILTIN_CLEANUP_DEF"))
  356. for expr in exprs:
  357. ret = "\n"
  358. if expr.has_key('struct'):
  359. ret += generate_struct(expr) + "\n"
  360. ret += generate_type_cleanup_decl(expr['struct'] + "List")
  361. fdef.write(generate_type_cleanup(expr['struct'] + "List") + "\n")
  362. ret += generate_type_cleanup_decl(expr['struct'])
  363. fdef.write(generate_type_cleanup(expr['struct']) + "\n")
  364. elif expr.has_key('union'):
  365. ret += generate_union(expr, 'union')
  366. ret += generate_type_cleanup_decl(expr['union'] + "List")
  367. fdef.write(generate_type_cleanup(expr['union'] + "List") + "\n")
  368. ret += generate_type_cleanup_decl(expr['union'])
  369. fdef.write(generate_type_cleanup(expr['union']) + "\n")
  370. elif expr.has_key('alternate'):
  371. ret += generate_union(expr, 'alternate')
  372. ret += generate_type_cleanup_decl(expr['alternate'] + "List")
  373. fdef.write(generate_type_cleanup(expr['alternate'] + "List") + "\n")
  374. ret += generate_type_cleanup_decl(expr['alternate'])
  375. fdef.write(generate_type_cleanup(expr['alternate']) + "\n")
  376. elif expr.has_key('enum'):
  377. ret += generate_type_cleanup_decl(expr['enum'] + "List")
  378. fdef.write(generate_type_cleanup(expr['enum'] + "List") + "\n")
  379. else:
  380. continue
  381. fdecl.write(ret)
  382. fdecl.write('''
  383. #endif
  384. ''')
  385. fdecl.flush()
  386. fdecl.close()
  387. fdef.flush()
  388. fdef.close()