qapi-types.py 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443
  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 GPLv2.
  10. # See the COPYING.LIB 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. %(name)s value;
  48. struct %(name)sList *next;
  49. } %(name)sList;
  50. ''',
  51. name=name)
  52. def generate_struct_fields(members):
  53. ret = ''
  54. for argname, argentry, optional, structured in parse_args(members):
  55. if optional:
  56. ret += mcgen('''
  57. bool has_%(c_name)s;
  58. ''',
  59. c_name=c_var(argname))
  60. if structured:
  61. push_indent()
  62. ret += generate_struct("", argname, argentry)
  63. pop_indent()
  64. else:
  65. ret += mcgen('''
  66. %(c_type)s %(c_name)s;
  67. ''',
  68. c_type=c_type(argentry), c_name=c_var(argname))
  69. return ret
  70. def generate_struct(structname, fieldname, members):
  71. ret = mcgen('''
  72. struct %(name)s
  73. {
  74. ''',
  75. name=structname)
  76. ret += generate_struct_fields(members)
  77. if len(fieldname):
  78. fieldname = " " + fieldname
  79. ret += mcgen('''
  80. }%(field)s;
  81. ''',
  82. field=fieldname)
  83. return ret
  84. def generate_enum_lookup(name, values):
  85. ret = mcgen('''
  86. const char *%(name)s_lookup[] = {
  87. ''',
  88. name=name)
  89. i = 0
  90. for value in values:
  91. ret += mcgen('''
  92. "%(value)s",
  93. ''',
  94. value=value)
  95. ret += mcgen('''
  96. NULL,
  97. };
  98. ''')
  99. return ret
  100. def generate_enum_name(name):
  101. if name.isupper():
  102. return c_fun(name, False)
  103. new_name = ''
  104. for c in c_fun(name, False):
  105. if c.isupper():
  106. new_name += '_'
  107. new_name += c
  108. return new_name.lstrip('_').upper()
  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_decl += mcgen('''
  124. %(abbrev)s_%(value)s = %(i)d,
  125. ''',
  126. abbrev=de_camel_case(name).upper(),
  127. value=generate_enum_name(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. ret = mcgen('''
  168. struct %(name)s
  169. {
  170. %(name)sKind kind;
  171. union {
  172. void *data;
  173. ''',
  174. name=name)
  175. for key in typeinfo:
  176. ret += mcgen('''
  177. %(c_type)s %(c_name)s;
  178. ''',
  179. c_type=c_type(typeinfo[key]),
  180. c_name=c_fun(key))
  181. ret += mcgen('''
  182. };
  183. ''')
  184. if base:
  185. base_fields = find_struct(base)['data']
  186. if discriminator:
  187. base_fields = base_fields.copy()
  188. del base_fields[discriminator]
  189. ret += generate_struct_fields(base_fields)
  190. else:
  191. assert not discriminator
  192. ret += mcgen('''
  193. };
  194. ''')
  195. if discriminator == {}:
  196. ret += mcgen('''
  197. extern const int %(name)s_qtypes[];
  198. ''',
  199. name=name)
  200. return ret
  201. def generate_type_cleanup_decl(name):
  202. ret = mcgen('''
  203. void qapi_free_%(type)s(%(c_type)s obj);
  204. ''',
  205. c_type=c_type(name),type=name)
  206. return ret
  207. def generate_type_cleanup(name):
  208. ret = mcgen('''
  209. void qapi_free_%(type)s(%(c_type)s obj)
  210. {
  211. QapiDeallocVisitor *md;
  212. Visitor *v;
  213. if (!obj) {
  214. return;
  215. }
  216. md = qapi_dealloc_visitor_new();
  217. v = qapi_dealloc_get_visitor(md);
  218. visit_type_%(type)s(v, &obj, NULL, NULL);
  219. qapi_dealloc_visitor_cleanup(md);
  220. }
  221. ''',
  222. c_type=c_type(name),type=name)
  223. return ret
  224. try:
  225. opts, args = getopt.gnu_getopt(sys.argv[1:], "chbp:o:",
  226. ["source", "header", "builtins",
  227. "prefix=", "output-dir="])
  228. except getopt.GetoptError, err:
  229. print str(err)
  230. sys.exit(1)
  231. output_dir = ""
  232. prefix = ""
  233. c_file = 'qapi-types.c'
  234. h_file = 'qapi-types.h'
  235. do_c = False
  236. do_h = False
  237. do_builtins = False
  238. for o, a in opts:
  239. if o in ("-p", "--prefix"):
  240. prefix = a
  241. elif o in ("-o", "--output-dir"):
  242. output_dir = a + "/"
  243. elif o in ("-c", "--source"):
  244. do_c = True
  245. elif o in ("-h", "--header"):
  246. do_h = True
  247. elif o in ("-b", "--builtins"):
  248. do_builtins = True
  249. if not do_c and not do_h:
  250. do_c = True
  251. do_h = True
  252. c_file = output_dir + prefix + c_file
  253. h_file = output_dir + prefix + h_file
  254. try:
  255. os.makedirs(output_dir)
  256. except os.error, e:
  257. if e.errno != errno.EEXIST:
  258. raise
  259. def maybe_open(really, name, opt):
  260. if really:
  261. return open(name, opt)
  262. else:
  263. import StringIO
  264. return StringIO.StringIO()
  265. fdef = maybe_open(do_c, c_file, 'w')
  266. fdecl = maybe_open(do_h, h_file, 'w')
  267. fdef.write(mcgen('''
  268. /* AUTOMATICALLY GENERATED, DO NOT MODIFY */
  269. /*
  270. * deallocation functions for schema-defined QAPI types
  271. *
  272. * Copyright IBM, Corp. 2011
  273. *
  274. * Authors:
  275. * Anthony Liguori <aliguori@us.ibm.com>
  276. * Michael Roth <mdroth@linux.vnet.ibm.com>
  277. *
  278. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  279. * See the COPYING.LIB file in the top-level directory.
  280. *
  281. */
  282. #include "qapi/dealloc-visitor.h"
  283. #include "%(prefix)sqapi-types.h"
  284. #include "%(prefix)sqapi-visit.h"
  285. ''', prefix=prefix))
  286. fdecl.write(mcgen('''
  287. /* AUTOMATICALLY GENERATED, DO NOT MODIFY */
  288. /*
  289. * schema-defined QAPI types
  290. *
  291. * Copyright IBM, Corp. 2011
  292. *
  293. * Authors:
  294. * Anthony Liguori <aliguori@us.ibm.com>
  295. *
  296. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  297. * See the COPYING.LIB file in the top-level directory.
  298. *
  299. */
  300. #ifndef %(guard)s
  301. #define %(guard)s
  302. #include <stdbool.h>
  303. #include <stdint.h>
  304. ''',
  305. guard=guardname(h_file)))
  306. exprs = parse_schema(sys.stdin)
  307. exprs = filter(lambda expr: not expr.has_key('gen'), exprs)
  308. fdecl.write(guardstart("QAPI_TYPES_BUILTIN_STRUCT_DECL"))
  309. for typename in builtin_types:
  310. fdecl.write(generate_fwd_struct(typename, None, builtin_type=True))
  311. fdecl.write(guardend("QAPI_TYPES_BUILTIN_STRUCT_DECL"))
  312. for expr in exprs:
  313. ret = "\n"
  314. if expr.has_key('type'):
  315. ret += generate_fwd_struct(expr['type'], expr['data'])
  316. elif expr.has_key('enum'):
  317. ret += generate_enum(expr['enum'], expr['data']) + "\n"
  318. ret += generate_fwd_enum_struct(expr['enum'], expr['data'])
  319. fdef.write(generate_enum_lookup(expr['enum'], expr['data']))
  320. elif expr.has_key('union'):
  321. ret += generate_fwd_struct(expr['union'], expr['data']) + "\n"
  322. ret += generate_enum('%sKind' % expr['union'], expr['data'].keys())
  323. fdef.write(generate_enum_lookup('%sKind' % expr['union'], expr['data'].keys()))
  324. if expr.get('discriminator') == {}:
  325. fdef.write(generate_anon_union_qtypes(expr))
  326. else:
  327. continue
  328. fdecl.write(ret)
  329. # to avoid header dependency hell, we always generate declarations
  330. # for built-in types in our header files and simply guard them
  331. fdecl.write(guardstart("QAPI_TYPES_BUILTIN_CLEANUP_DECL"))
  332. for typename in builtin_types:
  333. fdecl.write(generate_type_cleanup_decl(typename + "List"))
  334. fdecl.write(guardend("QAPI_TYPES_BUILTIN_CLEANUP_DECL"))
  335. # ...this doesn't work for cases where we link in multiple objects that
  336. # have the functions defined, so we use -b option to provide control
  337. # over these cases
  338. if do_builtins:
  339. fdef.write(guardstart("QAPI_TYPES_BUILTIN_CLEANUP_DEF"))
  340. for typename in builtin_types:
  341. fdef.write(generate_type_cleanup(typename + "List"))
  342. fdef.write(guardend("QAPI_TYPES_BUILTIN_CLEANUP_DEF"))
  343. for expr in exprs:
  344. ret = "\n"
  345. if expr.has_key('type'):
  346. ret += generate_struct(expr['type'], "", expr['data']) + "\n"
  347. ret += generate_type_cleanup_decl(expr['type'] + "List")
  348. fdef.write(generate_type_cleanup(expr['type'] + "List") + "\n")
  349. ret += generate_type_cleanup_decl(expr['type'])
  350. fdef.write(generate_type_cleanup(expr['type']) + "\n")
  351. elif expr.has_key('union'):
  352. ret += generate_union(expr)
  353. ret += generate_type_cleanup_decl(expr['union'] + "List")
  354. fdef.write(generate_type_cleanup(expr['union'] + "List") + "\n")
  355. ret += generate_type_cleanup_decl(expr['union'])
  356. fdef.write(generate_type_cleanup(expr['union']) + "\n")
  357. elif expr.has_key('enum'):
  358. ret += generate_type_cleanup_decl(expr['enum'] + "List")
  359. fdef.write(generate_type_cleanup(expr['enum'] + "List") + "\n")
  360. else:
  361. continue
  362. fdecl.write(ret)
  363. fdecl.write('''
  364. #endif
  365. ''')
  366. fdecl.flush()
  367. fdecl.close()
  368. fdef.flush()
  369. fdef.close()