qapi-types.py 6.4 KB

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