qapi-types.py 10 KB

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