types.py 6.4 KB

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