qapi-types.py 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330
  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):
  18. return mcgen('''
  19. typedef struct %(name)s %(name)s;
  20. typedef struct %(name)sList
  21. {
  22. %(name)s *value;
  23. struct %(name)sList *next;
  24. } %(name)sList;
  25. ''',
  26. name=name)
  27. def generate_fwd_enum_struct(name, members):
  28. return mcgen('''
  29. typedef struct %(name)sList
  30. {
  31. %(name)s value;
  32. struct %(name)sList *next;
  33. } %(name)sList;
  34. ''',
  35. name=name)
  36. def generate_struct(structname, fieldname, members):
  37. ret = mcgen('''
  38. struct %(name)s
  39. {
  40. ''',
  41. name=structname)
  42. for argname, argentry, optional, structured in parse_args(members):
  43. if optional:
  44. ret += mcgen('''
  45. bool has_%(c_name)s;
  46. ''',
  47. c_name=c_var(argname))
  48. if structured:
  49. push_indent()
  50. ret += generate_struct("", argname, argentry)
  51. pop_indent()
  52. else:
  53. ret += mcgen('''
  54. %(c_type)s %(c_name)s;
  55. ''',
  56. c_type=c_type(argentry), c_name=c_var(argname))
  57. if len(fieldname):
  58. fieldname = " " + fieldname
  59. ret += mcgen('''
  60. }%(field)s;
  61. ''',
  62. field=fieldname)
  63. return ret
  64. def generate_enum_lookup(name, values):
  65. ret = mcgen('''
  66. const char *%(name)s_lookup[] = {
  67. ''',
  68. name=name)
  69. i = 0
  70. for value in values:
  71. ret += mcgen('''
  72. "%(value)s",
  73. ''',
  74. value=value)
  75. ret += mcgen('''
  76. NULL,
  77. };
  78. ''')
  79. return ret
  80. def generate_enum_name(name):
  81. if name.isupper():
  82. return c_fun(name, False)
  83. new_name = ''
  84. for c in c_fun(name, False):
  85. if c.isupper():
  86. new_name += '_'
  87. new_name += c
  88. return new_name.lstrip('_').upper()
  89. def generate_enum(name, values):
  90. lookup_decl = mcgen('''
  91. extern const char *%(name)s_lookup[];
  92. ''',
  93. name=name)
  94. enum_decl = mcgen('''
  95. typedef enum %(name)s
  96. {
  97. ''',
  98. name=name)
  99. # append automatically generated _MAX value
  100. enum_values = values + [ 'MAX' ]
  101. i = 0
  102. for value in enum_values:
  103. enum_decl += mcgen('''
  104. %(abbrev)s_%(value)s = %(i)d,
  105. ''',
  106. abbrev=de_camel_case(name).upper(),
  107. value=generate_enum_name(value),
  108. i=i)
  109. i += 1
  110. enum_decl += mcgen('''
  111. } %(name)s;
  112. ''',
  113. name=name)
  114. return lookup_decl + enum_decl
  115. def generate_union(name, typeinfo):
  116. ret = mcgen('''
  117. struct %(name)s
  118. {
  119. %(name)sKind kind;
  120. union {
  121. void *data;
  122. ''',
  123. name=name)
  124. for key in typeinfo:
  125. ret += mcgen('''
  126. %(c_type)s %(c_name)s;
  127. ''',
  128. c_type=c_type(typeinfo[key]),
  129. c_name=c_fun(key))
  130. ret += mcgen('''
  131. };
  132. };
  133. ''')
  134. return ret
  135. def generate_type_cleanup_decl(name):
  136. ret = mcgen('''
  137. void qapi_free_%(type)s(%(c_type)s obj);
  138. ''',
  139. c_type=c_type(name),type=name)
  140. return ret
  141. def generate_type_cleanup(name):
  142. ret = mcgen('''
  143. void qapi_free_%(type)s(%(c_type)s obj)
  144. {
  145. QapiDeallocVisitor *md;
  146. Visitor *v;
  147. if (!obj) {
  148. return;
  149. }
  150. md = qapi_dealloc_visitor_new();
  151. v = qapi_dealloc_get_visitor(md);
  152. visit_type_%(type)s(v, &obj, NULL, NULL);
  153. qapi_dealloc_visitor_cleanup(md);
  154. }
  155. ''',
  156. c_type=c_type(name),type=name)
  157. return ret
  158. try:
  159. opts, args = getopt.gnu_getopt(sys.argv[1:], "chp:o:",
  160. ["source", "header", "prefix=", "output-dir="])
  161. except getopt.GetoptError, err:
  162. print str(err)
  163. sys.exit(1)
  164. output_dir = ""
  165. prefix = ""
  166. c_file = 'qapi-types.c'
  167. h_file = 'qapi-types.h'
  168. do_c = False
  169. do_h = False
  170. for o, a in opts:
  171. if o in ("-p", "--prefix"):
  172. prefix = a
  173. elif o in ("-o", "--output-dir"):
  174. output_dir = a + "/"
  175. elif o in ("-c", "--source"):
  176. do_c = True
  177. elif o in ("-h", "--header"):
  178. do_h = True
  179. if not do_c and not do_h:
  180. do_c = True
  181. do_h = True
  182. c_file = output_dir + prefix + c_file
  183. h_file = output_dir + prefix + h_file
  184. try:
  185. os.makedirs(output_dir)
  186. except os.error, e:
  187. if e.errno != errno.EEXIST:
  188. raise
  189. def maybe_open(really, name, opt):
  190. if really:
  191. return open(name, opt)
  192. else:
  193. import StringIO
  194. return StringIO.StringIO()
  195. fdef = maybe_open(do_c, c_file, 'w')
  196. fdecl = maybe_open(do_h, h_file, 'w')
  197. fdef.write(mcgen('''
  198. /* AUTOMATICALLY GENERATED, DO NOT MODIFY */
  199. /*
  200. * deallocation functions for schema-defined QAPI types
  201. *
  202. * Copyright IBM, Corp. 2011
  203. *
  204. * Authors:
  205. * Anthony Liguori <aliguori@us.ibm.com>
  206. * Michael Roth <mdroth@linux.vnet.ibm.com>
  207. *
  208. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  209. * See the COPYING.LIB file in the top-level directory.
  210. *
  211. */
  212. #include "qapi/dealloc-visitor.h"
  213. #include "%(prefix)sqapi-types.h"
  214. #include "%(prefix)sqapi-visit.h"
  215. ''', prefix=prefix))
  216. fdecl.write(mcgen('''
  217. /* AUTOMATICALLY GENERATED, DO NOT MODIFY */
  218. /*
  219. * schema-defined QAPI types
  220. *
  221. * Copyright IBM, Corp. 2011
  222. *
  223. * Authors:
  224. * Anthony Liguori <aliguori@us.ibm.com>
  225. *
  226. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  227. * See the COPYING.LIB file in the top-level directory.
  228. *
  229. */
  230. #ifndef %(guard)s
  231. #define %(guard)s
  232. #include <stdbool.h>
  233. #include <stdint.h>
  234. ''',
  235. guard=guardname(h_file)))
  236. exprs = parse_schema(sys.stdin)
  237. exprs = filter(lambda expr: not expr.has_key('gen'), exprs)
  238. for expr in exprs:
  239. ret = "\n"
  240. if expr.has_key('type'):
  241. ret += generate_fwd_struct(expr['type'], expr['data'])
  242. elif expr.has_key('enum'):
  243. ret += generate_enum(expr['enum'], expr['data']) + "\n"
  244. ret += generate_fwd_enum_struct(expr['enum'], expr['data'])
  245. fdef.write(generate_enum_lookup(expr['enum'], expr['data']))
  246. elif expr.has_key('union'):
  247. ret += generate_fwd_struct(expr['union'], expr['data']) + "\n"
  248. ret += generate_enum('%sKind' % expr['union'], expr['data'].keys())
  249. fdef.write(generate_enum_lookup('%sKind' % expr['union'], expr['data'].keys()))
  250. else:
  251. continue
  252. fdecl.write(ret)
  253. for expr in exprs:
  254. ret = "\n"
  255. if expr.has_key('type'):
  256. ret += generate_struct(expr['type'], "", expr['data']) + "\n"
  257. ret += generate_type_cleanup_decl(expr['type'] + "List")
  258. fdef.write(generate_type_cleanup(expr['type'] + "List") + "\n")
  259. ret += generate_type_cleanup_decl(expr['type'])
  260. fdef.write(generate_type_cleanup(expr['type']) + "\n")
  261. elif expr.has_key('union'):
  262. ret += generate_union(expr['union'], expr['data'])
  263. ret += generate_type_cleanup_decl(expr['union'] + "List")
  264. fdef.write(generate_type_cleanup(expr['union'] + "List") + "\n")
  265. ret += generate_type_cleanup_decl(expr['union'])
  266. fdef.write(generate_type_cleanup(expr['union']) + "\n")
  267. elif expr.has_key('enum'):
  268. ret += generate_type_cleanup_decl(expr['enum'] + "List")
  269. fdef.write(generate_type_cleanup(expr['enum'] + "List") + "\n")
  270. else:
  271. continue
  272. fdecl.write(ret)
  273. fdecl.write('''
  274. #endif
  275. ''')
  276. fdecl.flush()
  277. fdecl.close()
  278. fdef.flush()
  279. fdef.close()