types.py 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328
  1. """
  2. QAPI types generator
  3. Copyright IBM, Corp. 2011
  4. Copyright (c) 2013-2018 Red Hat Inc.
  5. Authors:
  6. Anthony Liguori <aliguori@us.ibm.com>
  7. Michael Roth <mdroth@linux.vnet.ibm.com>
  8. Markus Armbruster <armbru@redhat.com>
  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. """
  12. from .common import (
  13. c_enum_const,
  14. c_name,
  15. gen_endif,
  16. gen_if,
  17. mcgen,
  18. )
  19. from .gen import QAPISchemaModularCVisitor, ifcontext
  20. from .schema import QAPISchemaEnumMember, QAPISchemaObjectType
  21. # variants must be emitted before their container; track what has already
  22. # been output
  23. objects_seen = set()
  24. def gen_enum_lookup(name, members, prefix=None):
  25. ret = mcgen('''
  26. const QEnumLookup %(c_name)s_lookup = {
  27. .array = (const char *const[]) {
  28. ''',
  29. c_name=c_name(name))
  30. for m in members:
  31. ret += gen_if(m.ifcond)
  32. index = c_enum_const(name, m.name, prefix)
  33. ret += mcgen('''
  34. [%(index)s] = "%(name)s",
  35. ''',
  36. index=index, name=m.name)
  37. ret += gen_endif(m.ifcond)
  38. ret += mcgen('''
  39. },
  40. .size = %(max_index)s
  41. };
  42. ''',
  43. max_index=c_enum_const(name, '_MAX', prefix))
  44. return ret
  45. def gen_enum(name, members, prefix=None):
  46. # append automatically generated _MAX value
  47. enum_members = members + [QAPISchemaEnumMember('_MAX', None)]
  48. ret = mcgen('''
  49. typedef enum %(c_name)s {
  50. ''',
  51. c_name=c_name(name))
  52. for m in enum_members:
  53. ret += gen_if(m.ifcond)
  54. ret += mcgen('''
  55. %(c_enum)s,
  56. ''',
  57. c_enum=c_enum_const(name, m.name, prefix))
  58. ret += gen_endif(m.ifcond)
  59. ret += mcgen('''
  60. } %(c_name)s;
  61. ''',
  62. c_name=c_name(name))
  63. ret += mcgen('''
  64. #define %(c_name)s_str(val) \\
  65. qapi_enum_lookup(&%(c_name)s_lookup, (val))
  66. extern const QEnumLookup %(c_name)s_lookup;
  67. ''',
  68. c_name=c_name(name))
  69. return ret
  70. def gen_fwd_object_or_array(name):
  71. return mcgen('''
  72. typedef struct %(c_name)s %(c_name)s;
  73. ''',
  74. c_name=c_name(name))
  75. def gen_array(name, element_type):
  76. return mcgen('''
  77. struct %(c_name)s {
  78. %(c_name)s *next;
  79. %(c_type)s value;
  80. };
  81. ''',
  82. c_name=c_name(name), c_type=element_type.c_type())
  83. def gen_struct_members(members):
  84. ret = ''
  85. for memb in members:
  86. ret += gen_if(memb.ifcond)
  87. if memb.optional:
  88. ret += mcgen('''
  89. bool has_%(c_name)s;
  90. ''',
  91. c_name=c_name(memb.name))
  92. ret += mcgen('''
  93. %(c_type)s %(c_name)s;
  94. ''',
  95. c_type=memb.type.c_type(), c_name=c_name(memb.name))
  96. ret += gen_endif(memb.ifcond)
  97. return ret
  98. def gen_object(name, ifcond, base, members, variants):
  99. if name in objects_seen:
  100. return ''
  101. objects_seen.add(name)
  102. ret = ''
  103. if variants:
  104. for v in variants.variants:
  105. if isinstance(v.type, QAPISchemaObjectType):
  106. ret += gen_object(v.type.name, v.type.ifcond, v.type.base,
  107. v.type.local_members, v.type.variants)
  108. ret += mcgen('''
  109. ''')
  110. ret += gen_if(ifcond)
  111. ret += mcgen('''
  112. struct %(c_name)s {
  113. ''',
  114. c_name=c_name(name))
  115. if base:
  116. if not base.is_implicit():
  117. ret += mcgen('''
  118. /* Members inherited from %(c_name)s: */
  119. ''',
  120. c_name=base.c_name())
  121. ret += gen_struct_members(base.members)
  122. if not base.is_implicit():
  123. ret += mcgen('''
  124. /* Own members: */
  125. ''')
  126. ret += gen_struct_members(members)
  127. if variants:
  128. ret += gen_variants(variants)
  129. # Make sure that all structs have at least one member; this avoids
  130. # potential issues with attempting to malloc space for zero-length
  131. # structs in C, and also incompatibility with C++ (where an empty
  132. # struct is size 1).
  133. if (not base or base.is_empty()) and not members and not variants:
  134. ret += mcgen('''
  135. char qapi_dummy_for_empty_struct;
  136. ''')
  137. ret += mcgen('''
  138. };
  139. ''')
  140. ret += gen_endif(ifcond)
  141. return ret
  142. def gen_upcast(name, base):
  143. # C makes const-correctness ugly. We have to cast away const to let
  144. # this function work for both const and non-const obj.
  145. return mcgen('''
  146. static inline %(base)s *qapi_%(c_name)s_base(const %(c_name)s *obj)
  147. {
  148. return (%(base)s *)obj;
  149. }
  150. ''',
  151. c_name=c_name(name), base=base.c_name())
  152. def gen_variants(variants):
  153. ret = mcgen('''
  154. union { /* union tag is @%(c_name)s */
  155. ''',
  156. c_name=c_name(variants.tag_member.name))
  157. for var in variants.variants:
  158. if var.type.name == 'q_empty':
  159. continue
  160. ret += gen_if(var.ifcond)
  161. ret += mcgen('''
  162. %(c_type)s %(c_name)s;
  163. ''',
  164. c_type=var.type.c_unboxed_type(),
  165. c_name=c_name(var.name))
  166. ret += gen_endif(var.ifcond)
  167. ret += mcgen('''
  168. } u;
  169. ''')
  170. return ret
  171. def gen_type_cleanup_decl(name):
  172. ret = mcgen('''
  173. void qapi_free_%(c_name)s(%(c_name)s *obj);
  174. G_DEFINE_AUTOPTR_CLEANUP_FUNC(%(c_name)s, qapi_free_%(c_name)s)
  175. ''',
  176. c_name=c_name(name))
  177. return ret
  178. def gen_type_cleanup(name):
  179. ret = mcgen('''
  180. void qapi_free_%(c_name)s(%(c_name)s *obj)
  181. {
  182. Visitor *v;
  183. if (!obj) {
  184. return;
  185. }
  186. v = qapi_dealloc_visitor_new();
  187. visit_type_%(c_name)s(v, NULL, &obj, NULL);
  188. visit_free(v);
  189. }
  190. ''',
  191. c_name=c_name(name))
  192. return ret
  193. class QAPISchemaGenTypeVisitor(QAPISchemaModularCVisitor):
  194. def __init__(self, prefix):
  195. super().__init__(
  196. prefix, 'qapi-types', ' * Schema-defined QAPI types',
  197. ' * Built-in QAPI types', __doc__)
  198. def _begin_system_module(self, name):
  199. self._genc.preamble_add(mcgen('''
  200. #include "qemu/osdep.h"
  201. #include "qapi/dealloc-visitor.h"
  202. #include "qapi/qapi-builtin-types.h"
  203. #include "qapi/qapi-builtin-visit.h"
  204. '''))
  205. self._genh.preamble_add(mcgen('''
  206. #include "qapi/util.h"
  207. '''))
  208. def _begin_user_module(self, name):
  209. types = self._module_basename('qapi-types', name)
  210. visit = self._module_basename('qapi-visit', name)
  211. self._genc.preamble_add(mcgen('''
  212. #include "qemu/osdep.h"
  213. #include "qapi/dealloc-visitor.h"
  214. #include "%(types)s.h"
  215. #include "%(visit)s.h"
  216. ''',
  217. types=types, visit=visit))
  218. self._genh.preamble_add(mcgen('''
  219. #include "qapi/qapi-builtin-types.h"
  220. '''))
  221. def visit_begin(self, schema):
  222. # gen_object() is recursive, ensure it doesn't visit the empty type
  223. objects_seen.add(schema.the_empty_object_type.name)
  224. def _gen_type_cleanup(self, name):
  225. self._genh.add(gen_type_cleanup_decl(name))
  226. self._genc.add(gen_type_cleanup(name))
  227. def visit_enum_type(self, name, info, ifcond, features, members, prefix):
  228. with ifcontext(ifcond, self._genh, self._genc):
  229. self._genh.preamble_add(gen_enum(name, members, prefix))
  230. self._genc.add(gen_enum_lookup(name, members, prefix))
  231. def visit_array_type(self, name, info, ifcond, element_type):
  232. with ifcontext(ifcond, self._genh, self._genc):
  233. self._genh.preamble_add(gen_fwd_object_or_array(name))
  234. self._genh.add(gen_array(name, element_type))
  235. self._gen_type_cleanup(name)
  236. def visit_object_type(self, name, info, ifcond, features,
  237. base, members, variants):
  238. # Nothing to do for the special empty builtin
  239. if name == 'q_empty':
  240. return
  241. with ifcontext(ifcond, self._genh):
  242. self._genh.preamble_add(gen_fwd_object_or_array(name))
  243. self._genh.add(gen_object(name, ifcond, base, members, variants))
  244. with ifcontext(ifcond, self._genh, self._genc):
  245. if base and not base.is_implicit():
  246. self._genh.add(gen_upcast(name, base))
  247. # TODO Worth changing the visitor signature, so we could
  248. # directly use rather than repeat type.is_implicit()?
  249. if not name.startswith('q_'):
  250. # implicit types won't be directly allocated/freed
  251. self._gen_type_cleanup(name)
  252. def visit_alternate_type(self, name, info, ifcond, features, variants):
  253. with ifcontext(ifcond, self._genh):
  254. self._genh.preamble_add(gen_fwd_object_or_array(name))
  255. self._genh.add(gen_object(name, ifcond, None,
  256. [variants.tag_member], variants))
  257. with ifcontext(ifcond, self._genh, self._genc):
  258. self._gen_type_cleanup(name)
  259. def gen_types(schema, output_dir, prefix, opt_builtins):
  260. vis = QAPISchemaGenTypeVisitor(prefix)
  261. schema.visit(vis)
  262. vis.write(output_dir, opt_builtins)