qapi.py 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469
  1. #
  2. # QAPI helper library
  3. #
  4. # Copyright IBM, Corp. 2011
  5. # Copyright (c) 2013 Red Hat Inc.
  6. #
  7. # Authors:
  8. # Anthony Liguori <aliguori@us.ibm.com>
  9. # Markus Armbruster <armbru@redhat.com>
  10. #
  11. # This work is licensed under the terms of the GNU GPL, version 2.
  12. # See the COPYING file in the top-level directory.
  13. from ordereddict import OrderedDict
  14. import sys
  15. builtin_types = [
  16. 'str', 'int', 'number', 'bool',
  17. 'int8', 'int16', 'int32', 'int64',
  18. 'uint8', 'uint16', 'uint32', 'uint64'
  19. ]
  20. builtin_type_qtypes = {
  21. 'str': 'QTYPE_QSTRING',
  22. 'int': 'QTYPE_QINT',
  23. 'number': 'QTYPE_QFLOAT',
  24. 'bool': 'QTYPE_QBOOL',
  25. 'int8': 'QTYPE_QINT',
  26. 'int16': 'QTYPE_QINT',
  27. 'int32': 'QTYPE_QINT',
  28. 'int64': 'QTYPE_QINT',
  29. 'uint8': 'QTYPE_QINT',
  30. 'uint16': 'QTYPE_QINT',
  31. 'uint32': 'QTYPE_QINT',
  32. 'uint64': 'QTYPE_QINT',
  33. }
  34. class QAPISchemaError(Exception):
  35. def __init__(self, schema, msg):
  36. self.fp = schema.fp
  37. self.msg = msg
  38. self.col = 1
  39. self.line = schema.line
  40. for ch in schema.src[schema.line_pos:schema.pos]:
  41. if ch == '\t':
  42. self.col = (self.col + 7) % 8 + 1
  43. else:
  44. self.col += 1
  45. def __str__(self):
  46. return "%s:%s:%s: %s" % (self.fp.name, self.line, self.col, self.msg)
  47. class QAPIExprError(Exception):
  48. def __init__(self, expr_info, msg):
  49. self.fp = expr_info['fp']
  50. self.line = expr_info['line']
  51. self.msg = msg
  52. def __str__(self):
  53. return "%s:%s: %s" % (self.fp.name, self.line, self.msg)
  54. class QAPISchema:
  55. def __init__(self, fp):
  56. self.fp = fp
  57. self.src = fp.read()
  58. if self.src == '' or self.src[-1] != '\n':
  59. self.src += '\n'
  60. self.cursor = 0
  61. self.line = 1
  62. self.line_pos = 0
  63. self.exprs = []
  64. self.accept()
  65. while self.tok != None:
  66. expr_info = {'fp': fp, 'line': self.line}
  67. expr_elem = {'expr': self.get_expr(False),
  68. 'info': expr_info}
  69. self.exprs.append(expr_elem)
  70. def accept(self):
  71. while True:
  72. self.tok = self.src[self.cursor]
  73. self.pos = self.cursor
  74. self.cursor += 1
  75. self.val = None
  76. if self.tok == '#':
  77. self.cursor = self.src.find('\n', self.cursor)
  78. elif self.tok in ['{', '}', ':', ',', '[', ']']:
  79. return
  80. elif self.tok == "'":
  81. string = ''
  82. esc = False
  83. while True:
  84. ch = self.src[self.cursor]
  85. self.cursor += 1
  86. if ch == '\n':
  87. raise QAPISchemaError(self,
  88. 'Missing terminating "\'"')
  89. if esc:
  90. string += ch
  91. esc = False
  92. elif ch == "\\":
  93. esc = True
  94. elif ch == "'":
  95. self.val = string
  96. return
  97. else:
  98. string += ch
  99. elif self.tok == '\n':
  100. if self.cursor == len(self.src):
  101. self.tok = None
  102. return
  103. self.line += 1
  104. self.line_pos = self.cursor
  105. elif not self.tok.isspace():
  106. raise QAPISchemaError(self, 'Stray "%s"' % self.tok)
  107. def get_members(self):
  108. expr = OrderedDict()
  109. if self.tok == '}':
  110. self.accept()
  111. return expr
  112. if self.tok != "'":
  113. raise QAPISchemaError(self, 'Expected string or "}"')
  114. while True:
  115. key = self.val
  116. self.accept()
  117. if self.tok != ':':
  118. raise QAPISchemaError(self, 'Expected ":"')
  119. self.accept()
  120. if key in expr:
  121. raise QAPISchemaError(self, 'Duplicate key "%s"' % key)
  122. expr[key] = self.get_expr(True)
  123. if self.tok == '}':
  124. self.accept()
  125. return expr
  126. if self.tok != ',':
  127. raise QAPISchemaError(self, 'Expected "," or "}"')
  128. self.accept()
  129. if self.tok != "'":
  130. raise QAPISchemaError(self, 'Expected string')
  131. def get_values(self):
  132. expr = []
  133. if self.tok == ']':
  134. self.accept()
  135. return expr
  136. if not self.tok in [ '{', '[', "'" ]:
  137. raise QAPISchemaError(self, 'Expected "{", "[", "]" or string')
  138. while True:
  139. expr.append(self.get_expr(True))
  140. if self.tok == ']':
  141. self.accept()
  142. return expr
  143. if self.tok != ',':
  144. raise QAPISchemaError(self, 'Expected "," or "]"')
  145. self.accept()
  146. def get_expr(self, nested):
  147. if self.tok != '{' and not nested:
  148. raise QAPISchemaError(self, 'Expected "{"')
  149. if self.tok == '{':
  150. self.accept()
  151. expr = self.get_members()
  152. elif self.tok == '[':
  153. self.accept()
  154. expr = self.get_values()
  155. elif self.tok == "'":
  156. expr = self.val
  157. self.accept()
  158. else:
  159. raise QAPISchemaError(self, 'Expected "{", "[" or string')
  160. return expr
  161. def find_base_fields(base):
  162. base_struct_define = find_struct(base)
  163. if not base_struct_define:
  164. return None
  165. return base_struct_define['data']
  166. def check_union(expr, expr_info):
  167. name = expr['union']
  168. base = expr.get('base')
  169. discriminator = expr.get('discriminator')
  170. members = expr['data']
  171. # If the object has a member 'base', its value must name a complex type.
  172. if base:
  173. base_fields = find_base_fields(base)
  174. if not base_fields:
  175. raise QAPIExprError(expr_info,
  176. "Base '%s' is not a valid type"
  177. % base)
  178. # If the union object has no member 'discriminator', it's an
  179. # ordinary union.
  180. if not discriminator:
  181. enum_define = None
  182. # Else if the value of member 'discriminator' is {}, it's an
  183. # anonymous union.
  184. elif discriminator == {}:
  185. enum_define = None
  186. # Else, it's a flat union.
  187. else:
  188. # The object must have a member 'base'.
  189. if not base:
  190. raise QAPIExprError(expr_info,
  191. "Flat union '%s' must have a base field"
  192. % name)
  193. # The value of member 'discriminator' must name a member of the
  194. # base type.
  195. discriminator_type = base_fields.get(discriminator)
  196. if not discriminator_type:
  197. raise QAPIExprError(expr_info,
  198. "Discriminator '%s' is not a member of base "
  199. "type '%s'"
  200. % (discriminator, base))
  201. enum_define = find_enum(discriminator_type)
  202. # Check every branch
  203. for (key, value) in members.items():
  204. # If this named member's value names an enum type, then all members
  205. # of 'data' must also be members of the enum type.
  206. if enum_define and not key in enum_define['enum_values']:
  207. raise QAPIExprError(expr_info,
  208. "Discriminator value '%s' is not found in "
  209. "enum '%s'" %
  210. (key, enum_define["enum_name"]))
  211. # Todo: add checking for values. Key is checked as above, value can be
  212. # also checked here, but we need more functions to handle array case.
  213. def check_exprs(schema):
  214. for expr_elem in schema.exprs:
  215. expr = expr_elem['expr']
  216. if expr.has_key('union'):
  217. check_union(expr, expr_elem['info'])
  218. def parse_schema(fp):
  219. try:
  220. schema = QAPISchema(fp)
  221. except QAPISchemaError, e:
  222. print >>sys.stderr, e
  223. exit(1)
  224. exprs = []
  225. for expr_elem in schema.exprs:
  226. expr = expr_elem['expr']
  227. if expr.has_key('enum'):
  228. add_enum(expr['enum'], expr['data'])
  229. elif expr.has_key('union'):
  230. add_union(expr)
  231. add_enum('%sKind' % expr['union'])
  232. elif expr.has_key('type'):
  233. add_struct(expr)
  234. exprs.append(expr)
  235. try:
  236. check_exprs(schema)
  237. except QAPIExprError, e:
  238. print >>sys.stderr, e
  239. exit(1)
  240. return exprs
  241. def parse_args(typeinfo):
  242. if isinstance(typeinfo, basestring):
  243. struct = find_struct(typeinfo)
  244. assert struct != None
  245. typeinfo = struct['data']
  246. for member in typeinfo:
  247. argname = member
  248. argentry = typeinfo[member]
  249. optional = False
  250. structured = False
  251. if member.startswith('*'):
  252. argname = member[1:]
  253. optional = True
  254. if isinstance(argentry, OrderedDict):
  255. structured = True
  256. yield (argname, argentry, optional, structured)
  257. def de_camel_case(name):
  258. new_name = ''
  259. for ch in name:
  260. if ch.isupper() and new_name:
  261. new_name += '_'
  262. if ch == '-':
  263. new_name += '_'
  264. else:
  265. new_name += ch.lower()
  266. return new_name
  267. def camel_case(name):
  268. new_name = ''
  269. first = True
  270. for ch in name:
  271. if ch in ['_', '-']:
  272. first = True
  273. elif first:
  274. new_name += ch.upper()
  275. first = False
  276. else:
  277. new_name += ch.lower()
  278. return new_name
  279. def c_var(name, protect=True):
  280. # ANSI X3J11/88-090, 3.1.1
  281. c89_words = set(['auto', 'break', 'case', 'char', 'const', 'continue',
  282. 'default', 'do', 'double', 'else', 'enum', 'extern', 'float',
  283. 'for', 'goto', 'if', 'int', 'long', 'register', 'return',
  284. 'short', 'signed', 'sizeof', 'static', 'struct', 'switch',
  285. 'typedef', 'union', 'unsigned', 'void', 'volatile', 'while'])
  286. # ISO/IEC 9899:1999, 6.4.1
  287. c99_words = set(['inline', 'restrict', '_Bool', '_Complex', '_Imaginary'])
  288. # ISO/IEC 9899:2011, 6.4.1
  289. c11_words = set(['_Alignas', '_Alignof', '_Atomic', '_Generic', '_Noreturn',
  290. '_Static_assert', '_Thread_local'])
  291. # GCC http://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/C-Extensions.html
  292. # excluding _.*
  293. gcc_words = set(['asm', 'typeof'])
  294. # C++ ISO/IEC 14882:2003 2.11
  295. cpp_words = set(['bool', 'catch', 'class', 'const_cast', 'delete',
  296. 'dynamic_cast', 'explicit', 'false', 'friend', 'mutable',
  297. 'namespace', 'new', 'operator', 'private', 'protected',
  298. 'public', 'reinterpret_cast', 'static_cast', 'template',
  299. 'this', 'throw', 'true', 'try', 'typeid', 'typename',
  300. 'using', 'virtual', 'wchar_t',
  301. # alternative representations
  302. 'and', 'and_eq', 'bitand', 'bitor', 'compl', 'not',
  303. 'not_eq', 'or', 'or_eq', 'xor', 'xor_eq'])
  304. # namespace pollution:
  305. polluted_words = set(['unix', 'errno'])
  306. if protect and (name in c89_words | c99_words | c11_words | gcc_words | cpp_words | polluted_words):
  307. return "q_" + name
  308. return name.replace('-', '_').lstrip("*")
  309. def c_fun(name, protect=True):
  310. return c_var(name, protect).replace('.', '_')
  311. def c_list_type(name):
  312. return '%sList' % name
  313. def type_name(name):
  314. if type(name) == list:
  315. return c_list_type(name[0])
  316. return name
  317. enum_types = []
  318. struct_types = []
  319. union_types = []
  320. def add_struct(definition):
  321. global struct_types
  322. struct_types.append(definition)
  323. def find_struct(name):
  324. global struct_types
  325. for struct in struct_types:
  326. if struct['type'] == name:
  327. return struct
  328. return None
  329. def add_union(definition):
  330. global union_types
  331. union_types.append(definition)
  332. def find_union(name):
  333. global union_types
  334. for union in union_types:
  335. if union['union'] == name:
  336. return union
  337. return None
  338. def add_enum(name, enum_values = None):
  339. global enum_types
  340. enum_types.append({"enum_name": name, "enum_values": enum_values})
  341. def find_enum(name):
  342. global enum_types
  343. for enum in enum_types:
  344. if enum['enum_name'] == name:
  345. return enum
  346. return None
  347. def is_enum(name):
  348. return find_enum(name) != None
  349. def c_type(name):
  350. if name == 'str':
  351. return 'char *'
  352. elif name == 'int':
  353. return 'int64_t'
  354. elif (name == 'int8' or name == 'int16' or name == 'int32' or
  355. name == 'int64' or name == 'uint8' or name == 'uint16' or
  356. name == 'uint32' or name == 'uint64'):
  357. return name + '_t'
  358. elif name == 'size':
  359. return 'uint64_t'
  360. elif name == 'bool':
  361. return 'bool'
  362. elif name == 'number':
  363. return 'double'
  364. elif type(name) == list:
  365. return '%s *' % c_list_type(name[0])
  366. elif is_enum(name):
  367. return name
  368. elif name == None or len(name) == 0:
  369. return 'void'
  370. elif name == name.upper():
  371. return '%sEvent *' % camel_case(name)
  372. else:
  373. return '%s *' % name
  374. def genindent(count):
  375. ret = ""
  376. for i in range(count):
  377. ret += " "
  378. return ret
  379. indent_level = 0
  380. def push_indent(indent_amount=4):
  381. global indent_level
  382. indent_level += indent_amount
  383. def pop_indent(indent_amount=4):
  384. global indent_level
  385. indent_level -= indent_amount
  386. def cgen(code, **kwds):
  387. indent = genindent(indent_level)
  388. lines = code.split('\n')
  389. lines = map(lambda x: indent + x, lines)
  390. return '\n'.join(lines) % kwds + '\n'
  391. def mcgen(code, **kwds):
  392. return cgen('\n'.join(code.split('\n')[1:-1]), **kwds)
  393. def basename(filename):
  394. return filename.split("/")[-1]
  395. def guardname(filename):
  396. guard = basename(filename).rsplit(".", 1)[0]
  397. for substr in [".", " ", "-"]:
  398. guard = guard.replace(substr, "_")
  399. return guard.upper() + '_H'
  400. def guardstart(name):
  401. return mcgen('''
  402. #ifndef %(name)s
  403. #define %(name)s
  404. ''',
  405. name=guardname(name))
  406. def guardend(name):
  407. return mcgen('''
  408. #endif /* %(name)s */
  409. ''',
  410. name=guardname(name))