2
0

qapi-types.py 11 KB

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