qapi.py 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619
  1. #
  2. # QAPI helper library
  3. #
  4. # Copyright IBM, Corp. 2011
  5. # Copyright (c) 2013-2015 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. import re
  14. from ordereddict import OrderedDict
  15. import os
  16. import sys
  17. builtin_types = {
  18. 'str': 'QTYPE_QSTRING',
  19. 'int': 'QTYPE_QINT',
  20. 'number': 'QTYPE_QFLOAT',
  21. 'bool': 'QTYPE_QBOOL',
  22. 'int8': 'QTYPE_QINT',
  23. 'int16': 'QTYPE_QINT',
  24. 'int32': 'QTYPE_QINT',
  25. 'int64': 'QTYPE_QINT',
  26. 'uint8': 'QTYPE_QINT',
  27. 'uint16': 'QTYPE_QINT',
  28. 'uint32': 'QTYPE_QINT',
  29. 'uint64': 'QTYPE_QINT',
  30. 'size': 'QTYPE_QINT',
  31. }
  32. def error_path(parent):
  33. res = ""
  34. while parent:
  35. res = ("In file included from %s:%d:\n" % (parent['file'],
  36. parent['line'])) + res
  37. parent = parent['parent']
  38. return res
  39. class QAPISchemaError(Exception):
  40. def __init__(self, schema, msg):
  41. self.input_file = schema.input_file
  42. self.msg = msg
  43. self.col = 1
  44. self.line = schema.line
  45. for ch in schema.src[schema.line_pos:schema.pos]:
  46. if ch == '\t':
  47. self.col = (self.col + 7) % 8 + 1
  48. else:
  49. self.col += 1
  50. self.info = schema.parent_info
  51. def __str__(self):
  52. return error_path(self.info) + \
  53. "%s:%d:%d: %s" % (self.input_file, self.line, self.col, self.msg)
  54. class QAPIExprError(Exception):
  55. def __init__(self, expr_info, msg):
  56. self.info = expr_info
  57. self.msg = msg
  58. def __str__(self):
  59. return error_path(self.info['parent']) + \
  60. "%s:%d: %s" % (self.info['file'], self.info['line'], self.msg)
  61. class QAPISchema:
  62. def __init__(self, fp, input_relname=None, include_hist=[],
  63. previously_included=[], parent_info=None):
  64. """ include_hist is a stack used to detect inclusion cycles
  65. previously_included is a global state used to avoid multiple
  66. inclusions of the same file"""
  67. input_fname = os.path.abspath(fp.name)
  68. if input_relname is None:
  69. input_relname = fp.name
  70. self.input_dir = os.path.dirname(input_fname)
  71. self.input_file = input_relname
  72. self.include_hist = include_hist + [(input_relname, input_fname)]
  73. previously_included.append(input_fname)
  74. self.parent_info = parent_info
  75. self.src = fp.read()
  76. if self.src == '' or self.src[-1] != '\n':
  77. self.src += '\n'
  78. self.cursor = 0
  79. self.line = 1
  80. self.line_pos = 0
  81. self.exprs = []
  82. self.accept()
  83. while self.tok != None:
  84. expr_info = {'file': input_relname, 'line': self.line, 'parent': self.parent_info}
  85. expr = self.get_expr(False)
  86. if isinstance(expr, dict) and "include" in expr:
  87. if len(expr) != 1:
  88. raise QAPIExprError(expr_info, "Invalid 'include' directive")
  89. include = expr["include"]
  90. if not isinstance(include, str):
  91. raise QAPIExprError(expr_info,
  92. 'Expected a file name (string), got: %s'
  93. % include)
  94. include_path = os.path.join(self.input_dir, include)
  95. for elem in self.include_hist:
  96. if include_path == elem[1]:
  97. raise QAPIExprError(expr_info, "Inclusion loop for %s"
  98. % include)
  99. # skip multiple include of the same file
  100. if include_path in previously_included:
  101. continue
  102. try:
  103. fobj = open(include_path, 'r')
  104. except IOError, e:
  105. raise QAPIExprError(expr_info,
  106. '%s: %s' % (e.strerror, include))
  107. exprs_include = QAPISchema(fobj, include, self.include_hist,
  108. previously_included, expr_info)
  109. self.exprs.extend(exprs_include.exprs)
  110. else:
  111. expr_elem = {'expr': expr,
  112. 'info': expr_info}
  113. self.exprs.append(expr_elem)
  114. def accept(self):
  115. while True:
  116. self.tok = self.src[self.cursor]
  117. self.pos = self.cursor
  118. self.cursor += 1
  119. self.val = None
  120. if self.tok == '#':
  121. self.cursor = self.src.find('\n', self.cursor)
  122. elif self.tok in ['{', '}', ':', ',', '[', ']']:
  123. return
  124. elif self.tok == "'":
  125. string = ''
  126. esc = False
  127. while True:
  128. ch = self.src[self.cursor]
  129. self.cursor += 1
  130. if ch == '\n':
  131. raise QAPISchemaError(self,
  132. 'Missing terminating "\'"')
  133. if esc:
  134. string += ch
  135. esc = False
  136. elif ch == "\\":
  137. esc = True
  138. elif ch == "'":
  139. self.val = string
  140. return
  141. else:
  142. string += ch
  143. elif self.tok == '\n':
  144. if self.cursor == len(self.src):
  145. self.tok = None
  146. return
  147. self.line += 1
  148. self.line_pos = self.cursor
  149. elif not self.tok.isspace():
  150. raise QAPISchemaError(self, 'Stray "%s"' % self.tok)
  151. def get_members(self):
  152. expr = OrderedDict()
  153. if self.tok == '}':
  154. self.accept()
  155. return expr
  156. if self.tok != "'":
  157. raise QAPISchemaError(self, 'Expected string or "}"')
  158. while True:
  159. key = self.val
  160. self.accept()
  161. if self.tok != ':':
  162. raise QAPISchemaError(self, 'Expected ":"')
  163. self.accept()
  164. if key in expr:
  165. raise QAPISchemaError(self, 'Duplicate key "%s"' % key)
  166. expr[key] = self.get_expr(True)
  167. if self.tok == '}':
  168. self.accept()
  169. return expr
  170. if self.tok != ',':
  171. raise QAPISchemaError(self, 'Expected "," or "}"')
  172. self.accept()
  173. if self.tok != "'":
  174. raise QAPISchemaError(self, 'Expected string')
  175. def get_values(self):
  176. expr = []
  177. if self.tok == ']':
  178. self.accept()
  179. return expr
  180. if not self.tok in [ '{', '[', "'" ]:
  181. raise QAPISchemaError(self, 'Expected "{", "[", "]" or string')
  182. while True:
  183. expr.append(self.get_expr(True))
  184. if self.tok == ']':
  185. self.accept()
  186. return expr
  187. if self.tok != ',':
  188. raise QAPISchemaError(self, 'Expected "," or "]"')
  189. self.accept()
  190. def get_expr(self, nested):
  191. if self.tok != '{' and not nested:
  192. raise QAPISchemaError(self, 'Expected "{"')
  193. if self.tok == '{':
  194. self.accept()
  195. expr = self.get_members()
  196. elif self.tok == '[':
  197. self.accept()
  198. expr = self.get_values()
  199. elif self.tok == "'":
  200. expr = self.val
  201. self.accept()
  202. else:
  203. raise QAPISchemaError(self, 'Expected "{", "[" or string')
  204. return expr
  205. def find_base_fields(base):
  206. base_struct_define = find_struct(base)
  207. if not base_struct_define:
  208. return None
  209. return base_struct_define['data']
  210. # Return the discriminator enum define if discriminator is specified as an
  211. # enum type, otherwise return None.
  212. def discriminator_find_enum_define(expr):
  213. base = expr.get('base')
  214. discriminator = expr.get('discriminator')
  215. if not (discriminator and base):
  216. return None
  217. base_fields = find_base_fields(base)
  218. if not base_fields:
  219. return None
  220. discriminator_type = base_fields.get(discriminator)
  221. if not discriminator_type:
  222. return None
  223. return find_enum(discriminator_type)
  224. def check_event(expr, expr_info):
  225. params = expr.get('data')
  226. if params:
  227. for argname, argentry, optional, structured in parse_args(params):
  228. if structured:
  229. raise QAPIExprError(expr_info,
  230. "Nested structure define in event is not "
  231. "supported, event '%s', argname '%s'"
  232. % (expr['event'], argname))
  233. def check_union(expr, expr_info):
  234. name = expr['union']
  235. base = expr.get('base')
  236. discriminator = expr.get('discriminator')
  237. members = expr['data']
  238. # If the object has a member 'base', its value must name a complex type.
  239. if base:
  240. base_fields = find_base_fields(base)
  241. if not base_fields:
  242. raise QAPIExprError(expr_info,
  243. "Base '%s' is not a valid type"
  244. % base)
  245. # If the union object has no member 'discriminator', it's an
  246. # ordinary union.
  247. if not discriminator:
  248. enum_define = None
  249. # Else if the value of member 'discriminator' is {}, it's an
  250. # anonymous union.
  251. elif discriminator == {}:
  252. enum_define = None
  253. # Else, it's a flat union.
  254. else:
  255. # The object must have a member 'base'.
  256. if not base:
  257. raise QAPIExprError(expr_info,
  258. "Flat union '%s' must have a base field"
  259. % name)
  260. # The value of member 'discriminator' must name a member of the
  261. # base type.
  262. discriminator_type = base_fields.get(discriminator)
  263. if not discriminator_type:
  264. raise QAPIExprError(expr_info,
  265. "Discriminator '%s' is not a member of base "
  266. "type '%s'"
  267. % (discriminator, base))
  268. enum_define = find_enum(discriminator_type)
  269. # Do not allow string discriminator
  270. if not enum_define:
  271. raise QAPIExprError(expr_info,
  272. "Discriminator '%s' must be of enumeration "
  273. "type" % discriminator)
  274. # Check every branch
  275. for (key, value) in members.items():
  276. # If this named member's value names an enum type, then all members
  277. # of 'data' must also be members of the enum type.
  278. if enum_define and not key in enum_define['enum_values']:
  279. raise QAPIExprError(expr_info,
  280. "Discriminator value '%s' is not found in "
  281. "enum '%s'" %
  282. (key, enum_define["enum_name"]))
  283. # Todo: add checking for values. Key is checked as above, value can be
  284. # also checked here, but we need more functions to handle array case.
  285. def check_enum(expr, expr_info):
  286. name = expr['enum']
  287. members = expr.get('data')
  288. values = { 'MAX': '(automatic)' }
  289. if not isinstance(members, list):
  290. raise QAPIExprError(expr_info,
  291. "Enum '%s' requires an array for 'data'" % name)
  292. for member in members:
  293. if not isinstance(member, str):
  294. raise QAPIExprError(expr_info,
  295. "Enum '%s' member '%s' is not a string"
  296. % (name, member))
  297. key = _generate_enum_string(member)
  298. if key in values:
  299. raise QAPIExprError(expr_info,
  300. "Enum '%s' member '%s' clashes with '%s'"
  301. % (name, member, values[key]))
  302. values[key] = member
  303. def check_exprs(schema):
  304. for expr_elem in schema.exprs:
  305. expr = expr_elem['expr']
  306. info = expr_elem['info']
  307. if expr.has_key('enum'):
  308. check_enum(expr, info)
  309. elif expr.has_key('union'):
  310. check_union(expr, info)
  311. elif expr.has_key('event'):
  312. check_event(expr, info)
  313. def parse_schema(input_file):
  314. try:
  315. schema = QAPISchema(open(input_file, "r"))
  316. except (QAPISchemaError, QAPIExprError), e:
  317. print >>sys.stderr, e
  318. exit(1)
  319. exprs = []
  320. for expr_elem in schema.exprs:
  321. expr = expr_elem['expr']
  322. if expr.has_key('enum'):
  323. add_enum(expr['enum'], expr.get('data'))
  324. elif expr.has_key('union'):
  325. add_union(expr)
  326. elif expr.has_key('type'):
  327. add_struct(expr)
  328. exprs.append(expr)
  329. # Try again for hidden UnionKind enum
  330. for expr_elem in schema.exprs:
  331. expr = expr_elem['expr']
  332. if expr.has_key('union'):
  333. if not discriminator_find_enum_define(expr):
  334. add_enum('%sKind' % expr['union'])
  335. try:
  336. check_exprs(schema)
  337. except QAPIExprError, e:
  338. print >>sys.stderr, e
  339. exit(1)
  340. return exprs
  341. def parse_args(typeinfo):
  342. if isinstance(typeinfo, str):
  343. struct = find_struct(typeinfo)
  344. assert struct != None
  345. typeinfo = struct['data']
  346. for member in typeinfo:
  347. argname = member
  348. argentry = typeinfo[member]
  349. optional = False
  350. structured = False
  351. if member.startswith('*'):
  352. argname = member[1:]
  353. optional = True
  354. if isinstance(argentry, OrderedDict):
  355. structured = True
  356. yield (argname, argentry, optional, structured)
  357. def de_camel_case(name):
  358. new_name = ''
  359. for ch in name:
  360. if ch.isupper() and new_name:
  361. new_name += '_'
  362. if ch == '-':
  363. new_name += '_'
  364. else:
  365. new_name += ch.lower()
  366. return new_name
  367. def camel_case(name):
  368. new_name = ''
  369. first = True
  370. for ch in name:
  371. if ch in ['_', '-']:
  372. first = True
  373. elif first:
  374. new_name += ch.upper()
  375. first = False
  376. else:
  377. new_name += ch.lower()
  378. return new_name
  379. def c_var(name, protect=True):
  380. # ANSI X3J11/88-090, 3.1.1
  381. c89_words = set(['auto', 'break', 'case', 'char', 'const', 'continue',
  382. 'default', 'do', 'double', 'else', 'enum', 'extern', 'float',
  383. 'for', 'goto', 'if', 'int', 'long', 'register', 'return',
  384. 'short', 'signed', 'sizeof', 'static', 'struct', 'switch',
  385. 'typedef', 'union', 'unsigned', 'void', 'volatile', 'while'])
  386. # ISO/IEC 9899:1999, 6.4.1
  387. c99_words = set(['inline', 'restrict', '_Bool', '_Complex', '_Imaginary'])
  388. # ISO/IEC 9899:2011, 6.4.1
  389. c11_words = set(['_Alignas', '_Alignof', '_Atomic', '_Generic', '_Noreturn',
  390. '_Static_assert', '_Thread_local'])
  391. # GCC http://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/C-Extensions.html
  392. # excluding _.*
  393. gcc_words = set(['asm', 'typeof'])
  394. # C++ ISO/IEC 14882:2003 2.11
  395. cpp_words = set(['bool', 'catch', 'class', 'const_cast', 'delete',
  396. 'dynamic_cast', 'explicit', 'false', 'friend', 'mutable',
  397. 'namespace', 'new', 'operator', 'private', 'protected',
  398. 'public', 'reinterpret_cast', 'static_cast', 'template',
  399. 'this', 'throw', 'true', 'try', 'typeid', 'typename',
  400. 'using', 'virtual', 'wchar_t',
  401. # alternative representations
  402. 'and', 'and_eq', 'bitand', 'bitor', 'compl', 'not',
  403. 'not_eq', 'or', 'or_eq', 'xor', 'xor_eq'])
  404. # namespace pollution:
  405. polluted_words = set(['unix', 'errno'])
  406. if protect and (name in c89_words | c99_words | c11_words | gcc_words | cpp_words | polluted_words):
  407. return "q_" + name
  408. return name.replace('-', '_').lstrip("*")
  409. def c_fun(name, protect=True):
  410. return c_var(name, protect).replace('.', '_')
  411. def c_list_type(name):
  412. return '%sList' % name
  413. def type_name(name):
  414. if type(name) == list:
  415. return c_list_type(name[0])
  416. return name
  417. enum_types = []
  418. struct_types = []
  419. union_types = []
  420. def add_struct(definition):
  421. global struct_types
  422. struct_types.append(definition)
  423. def find_struct(name):
  424. global struct_types
  425. for struct in struct_types:
  426. if struct['type'] == name:
  427. return struct
  428. return None
  429. def add_union(definition):
  430. global union_types
  431. union_types.append(definition)
  432. def find_union(name):
  433. global union_types
  434. for union in union_types:
  435. if union['union'] == name:
  436. return union
  437. return None
  438. def add_enum(name, enum_values = None):
  439. global enum_types
  440. enum_types.append({"enum_name": name, "enum_values": enum_values})
  441. def find_enum(name):
  442. global enum_types
  443. for enum in enum_types:
  444. if enum['enum_name'] == name:
  445. return enum
  446. return None
  447. def is_enum(name):
  448. return find_enum(name) != None
  449. eatspace = '\033EATSPACE.'
  450. # A special suffix is added in c_type() for pointer types, and it's
  451. # stripped in mcgen(). So please notice this when you check the return
  452. # value of c_type() outside mcgen().
  453. def c_type(name, is_param=False):
  454. if name == 'str':
  455. if is_param:
  456. return 'const char *' + eatspace
  457. return 'char *' + eatspace
  458. elif name == 'int':
  459. return 'int64_t'
  460. elif (name == 'int8' or name == 'int16' or name == 'int32' or
  461. name == 'int64' or name == 'uint8' or name == 'uint16' or
  462. name == 'uint32' or name == 'uint64'):
  463. return name + '_t'
  464. elif name == 'size':
  465. return 'uint64_t'
  466. elif name == 'bool':
  467. return 'bool'
  468. elif name == 'number':
  469. return 'double'
  470. elif type(name) == list:
  471. return '%s *%s' % (c_list_type(name[0]), eatspace)
  472. elif is_enum(name):
  473. return name
  474. elif name == None or len(name) == 0:
  475. return 'void'
  476. elif name == name.upper():
  477. return '%sEvent *%s' % (camel_case(name), eatspace)
  478. else:
  479. return '%s *%s' % (name, eatspace)
  480. def is_c_ptr(name):
  481. suffix = "*" + eatspace
  482. return c_type(name).endswith(suffix)
  483. def genindent(count):
  484. ret = ""
  485. for i in range(count):
  486. ret += " "
  487. return ret
  488. indent_level = 0
  489. def push_indent(indent_amount=4):
  490. global indent_level
  491. indent_level += indent_amount
  492. def pop_indent(indent_amount=4):
  493. global indent_level
  494. indent_level -= indent_amount
  495. def cgen(code, **kwds):
  496. indent = genindent(indent_level)
  497. lines = code.split('\n')
  498. lines = map(lambda x: indent + x, lines)
  499. return '\n'.join(lines) % kwds + '\n'
  500. def mcgen(code, **kwds):
  501. raw = cgen('\n'.join(code.split('\n')[1:-1]), **kwds)
  502. return re.sub(re.escape(eatspace) + ' *', '', raw)
  503. def basename(filename):
  504. return filename.split("/")[-1]
  505. def guardname(filename):
  506. guard = basename(filename).rsplit(".", 1)[0]
  507. for substr in [".", " ", "-"]:
  508. guard = guard.replace(substr, "_")
  509. return guard.upper() + '_H'
  510. def guardstart(name):
  511. return mcgen('''
  512. #ifndef %(name)s
  513. #define %(name)s
  514. ''',
  515. name=guardname(name))
  516. def guardend(name):
  517. return mcgen('''
  518. #endif /* %(name)s */
  519. ''',
  520. name=guardname(name))
  521. # ENUMName -> ENUM_NAME, EnumName1 -> ENUM_NAME1
  522. # ENUM_NAME -> ENUM_NAME, ENUM_NAME1 -> ENUM_NAME1, ENUM_Name2 -> ENUM_NAME2
  523. # ENUM24_Name -> ENUM24_NAME
  524. def _generate_enum_string(value):
  525. c_fun_str = c_fun(value, False)
  526. if value.isupper():
  527. return c_fun_str
  528. new_name = ''
  529. l = len(c_fun_str)
  530. for i in range(l):
  531. c = c_fun_str[i]
  532. # When c is upper and no "_" appears before, do more checks
  533. if c.isupper() and (i > 0) and c_fun_str[i - 1] != "_":
  534. # Case 1: next string is lower
  535. # Case 2: previous string is digit
  536. if (i < (l - 1) and c_fun_str[i + 1].islower()) or \
  537. c_fun_str[i - 1].isdigit():
  538. new_name += '_'
  539. new_name += c
  540. return new_name.lstrip('_').upper()
  541. def generate_enum_full_value(enum_name, enum_value):
  542. abbrev_string = _generate_enum_string(enum_name)
  543. value_string = _generate_enum_string(enum_value)
  544. return "%s_%s" % (abbrev_string, value_string)