qapi.py 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526
  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. # Return the discriminator enum define if discriminator is specified as an
  167. # enum type, otherwise return None.
  168. def discriminator_find_enum_define(expr):
  169. base = expr.get('base')
  170. discriminator = expr.get('discriminator')
  171. if not (discriminator and base):
  172. return None
  173. base_fields = find_base_fields(base)
  174. if not base_fields:
  175. return None
  176. discriminator_type = base_fields.get(discriminator)
  177. if not discriminator_type:
  178. return None
  179. return find_enum(discriminator_type)
  180. def check_union(expr, expr_info):
  181. name = expr['union']
  182. base = expr.get('base')
  183. discriminator = expr.get('discriminator')
  184. members = expr['data']
  185. # If the object has a member 'base', its value must name a complex type.
  186. if base:
  187. base_fields = find_base_fields(base)
  188. if not base_fields:
  189. raise QAPIExprError(expr_info,
  190. "Base '%s' is not a valid type"
  191. % base)
  192. # If the union object has no member 'discriminator', it's an
  193. # ordinary union.
  194. if not discriminator:
  195. enum_define = None
  196. # Else if the value of member 'discriminator' is {}, it's an
  197. # anonymous union.
  198. elif discriminator == {}:
  199. enum_define = None
  200. # Else, it's a flat union.
  201. else:
  202. # The object must have a member 'base'.
  203. if not base:
  204. raise QAPIExprError(expr_info,
  205. "Flat union '%s' must have a base field"
  206. % name)
  207. # The value of member 'discriminator' must name a member of the
  208. # base type.
  209. discriminator_type = base_fields.get(discriminator)
  210. if not discriminator_type:
  211. raise QAPIExprError(expr_info,
  212. "Discriminator '%s' is not a member of base "
  213. "type '%s'"
  214. % (discriminator, base))
  215. enum_define = find_enum(discriminator_type)
  216. # Do not allow string discriminator
  217. if not enum_define:
  218. raise QAPIExprError(expr_info,
  219. "Discriminator '%s' must be of enumeration "
  220. "type" % discriminator)
  221. # Check every branch
  222. for (key, value) in members.items():
  223. # If this named member's value names an enum type, then all members
  224. # of 'data' must also be members of the enum type.
  225. if enum_define and not key in enum_define['enum_values']:
  226. raise QAPIExprError(expr_info,
  227. "Discriminator value '%s' is not found in "
  228. "enum '%s'" %
  229. (key, enum_define["enum_name"]))
  230. # Todo: add checking for values. Key is checked as above, value can be
  231. # also checked here, but we need more functions to handle array case.
  232. def check_exprs(schema):
  233. for expr_elem in schema.exprs:
  234. expr = expr_elem['expr']
  235. if expr.has_key('union'):
  236. check_union(expr, expr_elem['info'])
  237. def parse_schema(fp):
  238. try:
  239. schema = QAPISchema(fp)
  240. except QAPISchemaError, e:
  241. print >>sys.stderr, e
  242. exit(1)
  243. exprs = []
  244. for expr_elem in schema.exprs:
  245. expr = expr_elem['expr']
  246. if expr.has_key('enum'):
  247. add_enum(expr['enum'], expr['data'])
  248. elif expr.has_key('union'):
  249. add_union(expr)
  250. elif expr.has_key('type'):
  251. add_struct(expr)
  252. exprs.append(expr)
  253. # Try again for hidden UnionKind enum
  254. for expr_elem in schema.exprs:
  255. expr = expr_elem['expr']
  256. if expr.has_key('union'):
  257. if not discriminator_find_enum_define(expr):
  258. add_enum('%sKind' % expr['union'])
  259. try:
  260. check_exprs(schema)
  261. except QAPIExprError, e:
  262. print >>sys.stderr, e
  263. exit(1)
  264. return exprs
  265. def parse_args(typeinfo):
  266. if isinstance(typeinfo, basestring):
  267. struct = find_struct(typeinfo)
  268. assert struct != None
  269. typeinfo = struct['data']
  270. for member in typeinfo:
  271. argname = member
  272. argentry = typeinfo[member]
  273. optional = False
  274. structured = False
  275. if member.startswith('*'):
  276. argname = member[1:]
  277. optional = True
  278. if isinstance(argentry, OrderedDict):
  279. structured = True
  280. yield (argname, argentry, optional, structured)
  281. def de_camel_case(name):
  282. new_name = ''
  283. for ch in name:
  284. if ch.isupper() and new_name:
  285. new_name += '_'
  286. if ch == '-':
  287. new_name += '_'
  288. else:
  289. new_name += ch.lower()
  290. return new_name
  291. def camel_case(name):
  292. new_name = ''
  293. first = True
  294. for ch in name:
  295. if ch in ['_', '-']:
  296. first = True
  297. elif first:
  298. new_name += ch.upper()
  299. first = False
  300. else:
  301. new_name += ch.lower()
  302. return new_name
  303. def c_var(name, protect=True):
  304. # ANSI X3J11/88-090, 3.1.1
  305. c89_words = set(['auto', 'break', 'case', 'char', 'const', 'continue',
  306. 'default', 'do', 'double', 'else', 'enum', 'extern', 'float',
  307. 'for', 'goto', 'if', 'int', 'long', 'register', 'return',
  308. 'short', 'signed', 'sizeof', 'static', 'struct', 'switch',
  309. 'typedef', 'union', 'unsigned', 'void', 'volatile', 'while'])
  310. # ISO/IEC 9899:1999, 6.4.1
  311. c99_words = set(['inline', 'restrict', '_Bool', '_Complex', '_Imaginary'])
  312. # ISO/IEC 9899:2011, 6.4.1
  313. c11_words = set(['_Alignas', '_Alignof', '_Atomic', '_Generic', '_Noreturn',
  314. '_Static_assert', '_Thread_local'])
  315. # GCC http://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/C-Extensions.html
  316. # excluding _.*
  317. gcc_words = set(['asm', 'typeof'])
  318. # C++ ISO/IEC 14882:2003 2.11
  319. cpp_words = set(['bool', 'catch', 'class', 'const_cast', 'delete',
  320. 'dynamic_cast', 'explicit', 'false', 'friend', 'mutable',
  321. 'namespace', 'new', 'operator', 'private', 'protected',
  322. 'public', 'reinterpret_cast', 'static_cast', 'template',
  323. 'this', 'throw', 'true', 'try', 'typeid', 'typename',
  324. 'using', 'virtual', 'wchar_t',
  325. # alternative representations
  326. 'and', 'and_eq', 'bitand', 'bitor', 'compl', 'not',
  327. 'not_eq', 'or', 'or_eq', 'xor', 'xor_eq'])
  328. # namespace pollution:
  329. polluted_words = set(['unix', 'errno'])
  330. if protect and (name in c89_words | c99_words | c11_words | gcc_words | cpp_words | polluted_words):
  331. return "q_" + name
  332. return name.replace('-', '_').lstrip("*")
  333. def c_fun(name, protect=True):
  334. return c_var(name, protect).replace('.', '_')
  335. def c_list_type(name):
  336. return '%sList' % name
  337. def type_name(name):
  338. if type(name) == list:
  339. return c_list_type(name[0])
  340. return name
  341. enum_types = []
  342. struct_types = []
  343. union_types = []
  344. def add_struct(definition):
  345. global struct_types
  346. struct_types.append(definition)
  347. def find_struct(name):
  348. global struct_types
  349. for struct in struct_types:
  350. if struct['type'] == name:
  351. return struct
  352. return None
  353. def add_union(definition):
  354. global union_types
  355. union_types.append(definition)
  356. def find_union(name):
  357. global union_types
  358. for union in union_types:
  359. if union['union'] == name:
  360. return union
  361. return None
  362. def add_enum(name, enum_values = None):
  363. global enum_types
  364. enum_types.append({"enum_name": name, "enum_values": enum_values})
  365. def find_enum(name):
  366. global enum_types
  367. for enum in enum_types:
  368. if enum['enum_name'] == name:
  369. return enum
  370. return None
  371. def is_enum(name):
  372. return find_enum(name) != None
  373. def c_type(name):
  374. if name == 'str':
  375. return 'char *'
  376. elif name == 'int':
  377. return 'int64_t'
  378. elif (name == 'int8' or name == 'int16' or name == 'int32' or
  379. name == 'int64' or name == 'uint8' or name == 'uint16' or
  380. name == 'uint32' or name == 'uint64'):
  381. return name + '_t'
  382. elif name == 'size':
  383. return 'uint64_t'
  384. elif name == 'bool':
  385. return 'bool'
  386. elif name == 'number':
  387. return 'double'
  388. elif type(name) == list:
  389. return '%s *' % c_list_type(name[0])
  390. elif is_enum(name):
  391. return name
  392. elif name == None or len(name) == 0:
  393. return 'void'
  394. elif name == name.upper():
  395. return '%sEvent *' % camel_case(name)
  396. else:
  397. return '%s *' % name
  398. def genindent(count):
  399. ret = ""
  400. for i in range(count):
  401. ret += " "
  402. return ret
  403. indent_level = 0
  404. def push_indent(indent_amount=4):
  405. global indent_level
  406. indent_level += indent_amount
  407. def pop_indent(indent_amount=4):
  408. global indent_level
  409. indent_level -= indent_amount
  410. def cgen(code, **kwds):
  411. indent = genindent(indent_level)
  412. lines = code.split('\n')
  413. lines = map(lambda x: indent + x, lines)
  414. return '\n'.join(lines) % kwds + '\n'
  415. def mcgen(code, **kwds):
  416. return cgen('\n'.join(code.split('\n')[1:-1]), **kwds)
  417. def basename(filename):
  418. return filename.split("/")[-1]
  419. def guardname(filename):
  420. guard = basename(filename).rsplit(".", 1)[0]
  421. for substr in [".", " ", "-"]:
  422. guard = guard.replace(substr, "_")
  423. return guard.upper() + '_H'
  424. def guardstart(name):
  425. return mcgen('''
  426. #ifndef %(name)s
  427. #define %(name)s
  428. ''',
  429. name=guardname(name))
  430. def guardend(name):
  431. return mcgen('''
  432. #endif /* %(name)s */
  433. ''',
  434. name=guardname(name))
  435. # ENUMName -> ENUM_NAME, EnumName1 -> ENUM_NAME1
  436. # ENUM_NAME -> ENUM_NAME, ENUM_NAME1 -> ENUM_NAME1, ENUM_Name2 -> ENUM_NAME2
  437. # ENUM24_Name -> ENUM24_NAME
  438. def _generate_enum_string(value):
  439. c_fun_str = c_fun(value, False)
  440. if value.isupper():
  441. return c_fun_str
  442. new_name = ''
  443. l = len(c_fun_str)
  444. for i in range(l):
  445. c = c_fun_str[i]
  446. # When c is upper and no "_" appears before, do more checks
  447. if c.isupper() and (i > 0) and c_fun_str[i - 1] != "_":
  448. # Case 1: next string is lower
  449. # Case 2: previous string is digit
  450. if (i < (l - 1) and c_fun_str[i + 1].islower()) or \
  451. c_fun_str[i - 1].isdigit():
  452. new_name += '_'
  453. new_name += c
  454. return new_name.lstrip('_').upper()
  455. def generate_enum_full_value(enum_name, enum_value):
  456. abbrev_string = _generate_enum_string(enum_name)
  457. value_string = _generate_enum_string(enum_value)
  458. return "%s_%s" % (abbrev_string, value_string)