qapi.py 16 KB

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