2
0

qapi.py 18 KB

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