qapi-types.py 10 KB

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