types.py 11 KB

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