types.py 11 KB

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