types.py 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259
  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 qapi.common import *
  13. # variants must be emitted before their container; track what has already
  14. # been output
  15. objects_seen = set()
  16. def gen_fwd_object_or_array(name):
  17. return mcgen('''
  18. typedef struct %(c_name)s %(c_name)s;
  19. ''',
  20. c_name=c_name(name))
  21. def gen_array(name, element_type):
  22. return mcgen('''
  23. struct %(c_name)s {
  24. %(c_name)s *next;
  25. %(c_type)s value;
  26. };
  27. ''',
  28. c_name=c_name(name), c_type=element_type.c_type())
  29. def gen_struct_members(members):
  30. ret = ''
  31. for memb in members:
  32. ret += gen_if(memb.ifcond)
  33. if memb.optional:
  34. ret += mcgen('''
  35. bool has_%(c_name)s;
  36. ''',
  37. c_name=c_name(memb.name))
  38. ret += mcgen('''
  39. %(c_type)s %(c_name)s;
  40. ''',
  41. c_type=memb.type.c_type(), c_name=c_name(memb.name))
  42. ret += gen_endif(memb.ifcond)
  43. return ret
  44. def gen_object(name, ifcond, base, members, variants):
  45. if name in objects_seen:
  46. return ''
  47. objects_seen.add(name)
  48. ret = ''
  49. if variants:
  50. for v in variants.variants:
  51. if isinstance(v.type, QAPISchemaObjectType):
  52. ret += gen_object(v.type.name, v.type.ifcond, v.type.base,
  53. v.type.local_members, v.type.variants)
  54. ret += mcgen('''
  55. ''')
  56. ret += gen_if(ifcond)
  57. ret += mcgen('''
  58. struct %(c_name)s {
  59. ''',
  60. c_name=c_name(name))
  61. if base:
  62. if not base.is_implicit():
  63. ret += mcgen('''
  64. /* Members inherited from %(c_name)s: */
  65. ''',
  66. c_name=base.c_name())
  67. ret += gen_struct_members(base.members)
  68. if not base.is_implicit():
  69. ret += mcgen('''
  70. /* Own members: */
  71. ''')
  72. ret += gen_struct_members(members)
  73. if variants:
  74. ret += gen_variants(variants)
  75. # Make sure that all structs have at least one member; this avoids
  76. # potential issues with attempting to malloc space for zero-length
  77. # structs in C, and also incompatibility with C++ (where an empty
  78. # struct is size 1).
  79. if (not base or base.is_empty()) and not members and not variants:
  80. ret += mcgen('''
  81. char qapi_dummy_for_empty_struct;
  82. ''')
  83. ret += mcgen('''
  84. };
  85. ''')
  86. ret += gen_endif(ifcond)
  87. return ret
  88. def gen_upcast(name, base):
  89. # C makes const-correctness ugly. We have to cast away const to let
  90. # this function work for both const and non-const obj.
  91. return mcgen('''
  92. static inline %(base)s *qapi_%(c_name)s_base(const %(c_name)s *obj)
  93. {
  94. return (%(base)s *)obj;
  95. }
  96. ''',
  97. c_name=c_name(name), base=base.c_name())
  98. def gen_variants(variants):
  99. ret = mcgen('''
  100. union { /* union tag is @%(c_name)s */
  101. ''',
  102. c_name=c_name(variants.tag_member.name))
  103. for var in variants.variants:
  104. if var.type.name == 'q_empty':
  105. continue
  106. ret += gen_if(var.ifcond)
  107. ret += mcgen('''
  108. %(c_type)s %(c_name)s;
  109. ''',
  110. c_type=var.type.c_unboxed_type(),
  111. c_name=c_name(var.name))
  112. ret += gen_endif(var.ifcond)
  113. ret += mcgen('''
  114. } u;
  115. ''')
  116. return ret
  117. def gen_type_cleanup_decl(name):
  118. ret = mcgen('''
  119. void qapi_free_%(c_name)s(%(c_name)s *obj);
  120. ''',
  121. c_name=c_name(name))
  122. return ret
  123. def gen_type_cleanup(name):
  124. ret = mcgen('''
  125. void qapi_free_%(c_name)s(%(c_name)s *obj)
  126. {
  127. Visitor *v;
  128. if (!obj) {
  129. return;
  130. }
  131. v = qapi_dealloc_visitor_new();
  132. visit_type_%(c_name)s(v, NULL, &obj, NULL);
  133. visit_free(v);
  134. }
  135. ''',
  136. c_name=c_name(name))
  137. return ret
  138. class QAPISchemaGenTypeVisitor(QAPISchemaModularCVisitor):
  139. def __init__(self, prefix):
  140. QAPISchemaModularCVisitor.__init__(
  141. self, prefix, 'qapi-types', ' * Schema-defined QAPI types',
  142. __doc__)
  143. self._add_system_module(None, ' * Built-in QAPI types')
  144. self._genc.preamble_add(mcgen('''
  145. #include "qemu/osdep.h"
  146. #include "qapi/dealloc-visitor.h"
  147. #include "qapi/qapi-builtin-types.h"
  148. #include "qapi/qapi-builtin-visit.h"
  149. '''))
  150. self._genh.preamble_add(mcgen('''
  151. #include "qapi/util.h"
  152. '''))
  153. def _begin_user_module(self, name):
  154. types = self._module_basename('qapi-types', name)
  155. visit = self._module_basename('qapi-visit', name)
  156. self._genc.preamble_add(mcgen('''
  157. #include "qemu/osdep.h"
  158. #include "qapi/dealloc-visitor.h"
  159. #include "%(types)s.h"
  160. #include "%(visit)s.h"
  161. ''',
  162. types=types, visit=visit))
  163. self._genh.preamble_add(mcgen('''
  164. #include "qapi/qapi-builtin-types.h"
  165. '''))
  166. def visit_begin(self, schema):
  167. # gen_object() is recursive, ensure it doesn't visit the empty type
  168. objects_seen.add(schema.the_empty_object_type.name)
  169. def _gen_type_cleanup(self, name):
  170. self._genh.add(gen_type_cleanup_decl(name))
  171. self._genc.add(gen_type_cleanup(name))
  172. def visit_enum_type(self, name, info, ifcond, members, prefix):
  173. with ifcontext(ifcond, self._genh, self._genc):
  174. self._genh.preamble_add(gen_enum(name, members, prefix))
  175. self._genc.add(gen_enum_lookup(name, members, prefix))
  176. def visit_array_type(self, name, info, ifcond, element_type):
  177. with ifcontext(ifcond, self._genh, self._genc):
  178. self._genh.preamble_add(gen_fwd_object_or_array(name))
  179. self._genh.add(gen_array(name, element_type))
  180. self._gen_type_cleanup(name)
  181. def visit_object_type(self, name, info, ifcond, base, members, variants,
  182. features):
  183. # Nothing to do for the special empty builtin
  184. if name == 'q_empty':
  185. return
  186. with ifcontext(ifcond, self._genh):
  187. self._genh.preamble_add(gen_fwd_object_or_array(name))
  188. self._genh.add(gen_object(name, ifcond, base, members, variants))
  189. with ifcontext(ifcond, self._genh, self._genc):
  190. if base and not base.is_implicit():
  191. self._genh.add(gen_upcast(name, base))
  192. # TODO Worth changing the visitor signature, so we could
  193. # directly use rather than repeat type.is_implicit()?
  194. if not name.startswith('q_'):
  195. # implicit types won't be directly allocated/freed
  196. self._gen_type_cleanup(name)
  197. def visit_alternate_type(self, name, info, ifcond, variants):
  198. with ifcontext(ifcond, self._genh):
  199. self._genh.preamble_add(gen_fwd_object_or_array(name))
  200. self._genh.add(gen_object(name, ifcond, None,
  201. [variants.tag_member], variants))
  202. with ifcontext(ifcond, self._genh, self._genc):
  203. self._gen_type_cleanup(name)
  204. def gen_types(schema, output_dir, prefix, opt_builtins):
  205. vis = QAPISchemaGenTypeVisitor(prefix)
  206. schema.visit(vis)
  207. vis.write(output_dir, opt_builtins)