qapi-types.py 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455
  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, structured in parse_args(members):
  58. if optional:
  59. ret += mcgen('''
  60. bool has_%(c_name)s;
  61. ''',
  62. c_name=c_var(argname))
  63. if structured:
  64. push_indent()
  65. ret += generate_struct({ "field": argname, "data": argentry})
  66. pop_indent()
  67. else:
  68. ret += mcgen('''
  69. %(c_type)s %(c_name)s;
  70. ''',
  71. c_type=c_type(argentry), c_name=c_var(argname))
  72. return ret
  73. def generate_struct(expr):
  74. structname = expr.get('type', "")
  75. fieldname = expr.get('field', "")
  76. members = expr['data']
  77. base = expr.get('base')
  78. ret = mcgen('''
  79. struct %(name)s
  80. {
  81. ''',
  82. name=structname)
  83. if base:
  84. ret += generate_struct_fields({'base': base})
  85. ret += generate_struct_fields(members)
  86. if len(fieldname):
  87. fieldname = " " + fieldname
  88. ret += mcgen('''
  89. }%(field)s;
  90. ''',
  91. field=fieldname)
  92. return ret
  93. def generate_enum_lookup(name, values):
  94. ret = mcgen('''
  95. const char *%(name)s_lookup[] = {
  96. ''',
  97. name=name)
  98. i = 0
  99. for value in values:
  100. ret += mcgen('''
  101. "%(value)s",
  102. ''',
  103. value=value)
  104. ret += mcgen('''
  105. NULL,
  106. };
  107. ''')
  108. return ret
  109. def generate_enum(name, values):
  110. lookup_decl = mcgen('''
  111. extern const char *%(name)s_lookup[];
  112. ''',
  113. name=name)
  114. enum_decl = mcgen('''
  115. typedef enum %(name)s
  116. {
  117. ''',
  118. name=name)
  119. # append automatically generated _MAX value
  120. enum_values = values + [ 'MAX' ]
  121. i = 0
  122. for value in enum_values:
  123. enum_full_value = generate_enum_full_value(name, value)
  124. enum_decl += mcgen('''
  125. %(enum_full_value)s = %(i)d,
  126. ''',
  127. enum_full_value = enum_full_value,
  128. i=i)
  129. i += 1
  130. enum_decl += mcgen('''
  131. } %(name)s;
  132. ''',
  133. name=name)
  134. return lookup_decl + enum_decl
  135. def generate_anon_union_qtypes(expr):
  136. name = expr['union']
  137. members = expr['data']
  138. ret = mcgen('''
  139. const int %(name)s_qtypes[QTYPE_MAX] = {
  140. ''',
  141. name=name)
  142. for key in members:
  143. qapi_type = members[key]
  144. if builtin_type_qtypes.has_key(qapi_type):
  145. qtype = builtin_type_qtypes[qapi_type]
  146. elif find_struct(qapi_type):
  147. qtype = "QTYPE_QDICT"
  148. elif find_union(qapi_type):
  149. qtype = "QTYPE_QDICT"
  150. else:
  151. assert False, "Invalid anonymous union member"
  152. ret += mcgen('''
  153. [ %(qtype)s ] = %(abbrev)s_KIND_%(enum)s,
  154. ''',
  155. qtype = qtype,
  156. abbrev = de_camel_case(name).upper(),
  157. enum = c_fun(de_camel_case(key),False).upper())
  158. ret += mcgen('''
  159. };
  160. ''')
  161. return ret
  162. def generate_union(expr):
  163. name = expr['union']
  164. typeinfo = expr['data']
  165. base = expr.get('base')
  166. discriminator = expr.get('discriminator')
  167. enum_define = discriminator_find_enum_define(expr)
  168. if enum_define:
  169. discriminator_type_name = enum_define['enum_name']
  170. else:
  171. discriminator_type_name = '%sKind' % (name)
  172. ret = mcgen('''
  173. struct %(name)s
  174. {
  175. %(discriminator_type_name)s kind;
  176. union {
  177. void *data;
  178. ''',
  179. name=name,
  180. discriminator_type_name=discriminator_type_name)
  181. for key in typeinfo:
  182. ret += mcgen('''
  183. %(c_type)s %(c_name)s;
  184. ''',
  185. c_type=c_type(typeinfo[key]),
  186. c_name=c_fun(key))
  187. ret += mcgen('''
  188. };
  189. ''')
  190. if base:
  191. base_fields = find_struct(base)['data']
  192. if discriminator:
  193. base_fields = base_fields.copy()
  194. del base_fields[discriminator]
  195. ret += generate_struct_fields(base_fields)
  196. else:
  197. assert not discriminator
  198. ret += mcgen('''
  199. };
  200. ''')
  201. if discriminator == {}:
  202. ret += mcgen('''
  203. extern const int %(name)s_qtypes[];
  204. ''',
  205. name=name)
  206. return ret
  207. def generate_type_cleanup_decl(name):
  208. ret = mcgen('''
  209. void qapi_free_%(type)s(%(c_type)s obj);
  210. ''',
  211. c_type=c_type(name),type=name)
  212. return ret
  213. def generate_type_cleanup(name):
  214. ret = mcgen('''
  215. void qapi_free_%(type)s(%(c_type)s obj)
  216. {
  217. QapiDeallocVisitor *md;
  218. Visitor *v;
  219. if (!obj) {
  220. return;
  221. }
  222. md = qapi_dealloc_visitor_new();
  223. v = qapi_dealloc_get_visitor(md);
  224. visit_type_%(type)s(v, &obj, NULL, NULL);
  225. qapi_dealloc_visitor_cleanup(md);
  226. }
  227. ''',
  228. c_type=c_type(name),type=name)
  229. return ret
  230. try:
  231. opts, args = getopt.gnu_getopt(sys.argv[1:], "chbp:o:",
  232. ["source", "header", "builtins",
  233. "prefix=", "output-dir="])
  234. except getopt.GetoptError, err:
  235. print str(err)
  236. sys.exit(1)
  237. output_dir = ""
  238. prefix = ""
  239. c_file = 'qapi-types.c'
  240. h_file = 'qapi-types.h'
  241. do_c = False
  242. do_h = False
  243. do_builtins = False
  244. for o, a in opts:
  245. if o in ("-p", "--prefix"):
  246. prefix = 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(sys.stdin)
  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:
  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('type'):
  321. ret += generate_fwd_struct(expr['type'], 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. if expr.get('discriminator') == {}:
  334. fdef.write(generate_anon_union_qtypes(expr))
  335. else:
  336. continue
  337. fdecl.write(ret)
  338. # to avoid header dependency hell, we always generate declarations
  339. # for built-in types in our header files and simply guard them
  340. fdecl.write(guardstart("QAPI_TYPES_BUILTIN_CLEANUP_DECL"))
  341. for typename in builtin_types:
  342. fdecl.write(generate_type_cleanup_decl(typename + "List"))
  343. fdecl.write(guardend("QAPI_TYPES_BUILTIN_CLEANUP_DECL"))
  344. # ...this doesn't work for cases where we link in multiple objects that
  345. # have the functions defined, so we use -b option to provide control
  346. # over these cases
  347. if do_builtins:
  348. fdef.write(guardstart("QAPI_TYPES_BUILTIN_CLEANUP_DEF"))
  349. for typename in builtin_types:
  350. fdef.write(generate_type_cleanup(typename + "List"))
  351. fdef.write(guardend("QAPI_TYPES_BUILTIN_CLEANUP_DEF"))
  352. for expr in exprs:
  353. ret = "\n"
  354. if expr.has_key('type'):
  355. ret += generate_struct(expr) + "\n"
  356. ret += generate_type_cleanup_decl(expr['type'] + "List")
  357. fdef.write(generate_type_cleanup(expr['type'] + "List") + "\n")
  358. ret += generate_type_cleanup_decl(expr['type'])
  359. fdef.write(generate_type_cleanup(expr['type']) + "\n")
  360. elif expr.has_key('union'):
  361. ret += generate_union(expr)
  362. ret += generate_type_cleanup_decl(expr['union'] + "List")
  363. fdef.write(generate_type_cleanup(expr['union'] + "List") + "\n")
  364. ret += generate_type_cleanup_decl(expr['union'])
  365. fdef.write(generate_type_cleanup(expr['union']) + "\n")
  366. elif expr.has_key('enum'):
  367. ret += generate_type_cleanup_decl(expr['enum'] + "List")
  368. fdef.write(generate_type_cleanup(expr['enum'] + "List") + "\n")
  369. else:
  370. continue
  371. fdecl.write(ret)
  372. fdecl.write('''
  373. #endif
  374. ''')
  375. fdecl.flush()
  376. fdecl.close()
  377. fdef.flush()
  378. fdef.close()