qapi.py 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695
  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 qtype of an alternate branch, or None on error.
  211. def find_alternate_member_qtype(qapi_type):
  212. if builtin_types.has_key(qapi_type):
  213. return builtin_types[qapi_type]
  214. elif find_struct(qapi_type):
  215. return "QTYPE_QDICT"
  216. elif find_enum(qapi_type):
  217. return "QTYPE_QSTRING"
  218. elif find_union(qapi_type):
  219. return "QTYPE_QDICT"
  220. return None
  221. # Return the discriminator enum define if discriminator is specified as an
  222. # enum type, otherwise return None.
  223. def discriminator_find_enum_define(expr):
  224. base = expr.get('base')
  225. discriminator = expr.get('discriminator')
  226. if not (discriminator and base):
  227. return None
  228. base_fields = find_base_fields(base)
  229. if not base_fields:
  230. return None
  231. discriminator_type = base_fields.get(discriminator)
  232. if not discriminator_type:
  233. return None
  234. return find_enum(discriminator_type)
  235. def check_event(expr, expr_info):
  236. params = expr.get('data')
  237. if params:
  238. for argname, argentry, optional, structured in parse_args(params):
  239. if structured:
  240. raise QAPIExprError(expr_info,
  241. "Nested structure define in event is not "
  242. "supported, event '%s', argname '%s'"
  243. % (expr['event'], argname))
  244. def check_union(expr, expr_info):
  245. name = expr['union']
  246. base = expr.get('base')
  247. discriminator = expr.get('discriminator')
  248. members = expr['data']
  249. values = { 'MAX': '(automatic)' }
  250. # If the object has a member 'base', its value must name a complex type,
  251. # and there must be a discriminator.
  252. if base is not None:
  253. if discriminator is None:
  254. raise QAPIExprError(expr_info,
  255. "Union '%s' requires a discriminator to go "
  256. "along with base" %name)
  257. # Two types of unions, determined by discriminator.
  258. # With no discriminator it is a simple union.
  259. if discriminator is None:
  260. enum_define = None
  261. if base is not None:
  262. raise QAPIExprError(expr_info,
  263. "Simple union '%s' must not have a base"
  264. % name)
  265. # Else, it's a flat union.
  266. else:
  267. # The object must have a string member 'base'.
  268. if not isinstance(base, str):
  269. raise QAPIExprError(expr_info,
  270. "Flat union '%s' must have a string base field"
  271. % name)
  272. base_fields = find_base_fields(base)
  273. if not base_fields:
  274. raise QAPIExprError(expr_info,
  275. "Base '%s' is not a valid type"
  276. % base)
  277. # The value of member 'discriminator' must name a member of the
  278. # base type.
  279. if not isinstance(discriminator, str):
  280. raise QAPIExprError(expr_info,
  281. "Flat union '%s' discriminator must be a string"
  282. % name)
  283. discriminator_type = base_fields.get(discriminator)
  284. if not discriminator_type:
  285. raise QAPIExprError(expr_info,
  286. "Discriminator '%s' is not a member of base "
  287. "type '%s'"
  288. % (discriminator, base))
  289. enum_define = find_enum(discriminator_type)
  290. # Do not allow string discriminator
  291. if not enum_define:
  292. raise QAPIExprError(expr_info,
  293. "Discriminator '%s' must be of enumeration "
  294. "type" % discriminator)
  295. # Check every branch
  296. for (key, value) in members.items():
  297. # If the discriminator names an enum type, then all members
  298. # of 'data' must also be members of the enum type.
  299. if enum_define:
  300. if not key in enum_define['enum_values']:
  301. raise QAPIExprError(expr_info,
  302. "Discriminator value '%s' is not found in "
  303. "enum '%s'" %
  304. (key, enum_define["enum_name"]))
  305. # Otherwise, check for conflicts in the generated enum
  306. else:
  307. c_key = _generate_enum_string(key)
  308. if c_key in values:
  309. raise QAPIExprError(expr_info,
  310. "Union '%s' member '%s' clashes with '%s'"
  311. % (name, key, values[c_key]))
  312. values[c_key] = key
  313. def check_alternate(expr, expr_info):
  314. name = expr['alternate']
  315. members = expr['data']
  316. values = { 'MAX': '(automatic)' }
  317. types_seen = {}
  318. if expr.get('base') is not None:
  319. raise QAPIExprError(expr_info,
  320. "Alternate '%s' must not have a base"
  321. % name)
  322. # Check every branch
  323. for (key, value) in members.items():
  324. # Check for conflicts in the generated enum
  325. c_key = _generate_enum_string(key)
  326. if c_key in values:
  327. raise QAPIExprError(expr_info,
  328. "Alternate '%s' member '%s' clashes with '%s'"
  329. % (name, key, values[c_key]))
  330. values[c_key] = key
  331. # Ensure alternates have no type conflicts.
  332. if isinstance(value, list):
  333. raise QAPIExprError(expr_info,
  334. "Alternate '%s' member '%s' must "
  335. "not be array type" % (name, key))
  336. qtype = find_alternate_member_qtype(value)
  337. if not qtype:
  338. raise QAPIExprError(expr_info,
  339. "Alternate '%s' member '%s' has "
  340. "invalid type '%s'" % (name, key, value))
  341. if qtype in types_seen:
  342. raise QAPIExprError(expr_info,
  343. "Alternate '%s' member '%s' can't "
  344. "be distinguished from member '%s'"
  345. % (name, key, types_seen[qtype]))
  346. types_seen[qtype] = key
  347. def check_enum(expr, expr_info):
  348. name = expr['enum']
  349. members = expr.get('data')
  350. values = { 'MAX': '(automatic)' }
  351. if not isinstance(members, list):
  352. raise QAPIExprError(expr_info,
  353. "Enum '%s' requires an array for 'data'" % name)
  354. for member in members:
  355. if not isinstance(member, str):
  356. raise QAPIExprError(expr_info,
  357. "Enum '%s' member '%s' is not a string"
  358. % (name, member))
  359. key = _generate_enum_string(member)
  360. if key in values:
  361. raise QAPIExprError(expr_info,
  362. "Enum '%s' member '%s' clashes with '%s'"
  363. % (name, member, values[key]))
  364. values[key] = member
  365. def check_exprs(schema):
  366. for expr_elem in schema.exprs:
  367. expr = expr_elem['expr']
  368. info = expr_elem['info']
  369. if expr.has_key('enum'):
  370. check_enum(expr, info)
  371. elif expr.has_key('union'):
  372. check_union(expr, info)
  373. elif expr.has_key('alternate'):
  374. check_alternate(expr, info)
  375. elif expr.has_key('event'):
  376. check_event(expr, info)
  377. def parse_schema(input_file):
  378. # First pass: read entire file into memory
  379. try:
  380. schema = QAPISchema(open(input_file, "r"))
  381. except (QAPISchemaError, QAPIExprError), e:
  382. print >>sys.stderr, e
  383. exit(1)
  384. exprs = []
  385. try:
  386. # Next pass: learn the types.
  387. for expr_elem in schema.exprs:
  388. expr = expr_elem['expr']
  389. if expr.has_key('enum'):
  390. add_enum(expr['enum'], expr.get('data'))
  391. elif expr.has_key('union'):
  392. add_union(expr)
  393. elif expr.has_key('type'):
  394. add_struct(expr)
  395. exprs.append(expr)
  396. # Try again for hidden UnionKind enum
  397. for expr_elem in schema.exprs:
  398. expr = expr_elem['expr']
  399. if expr.has_key('union'):
  400. if not discriminator_find_enum_define(expr):
  401. add_enum('%sKind' % expr['union'])
  402. elif expr.has_key('alternate'):
  403. add_enum('%sKind' % expr['alternate'])
  404. # Final pass - validate that exprs make sense
  405. check_exprs(schema)
  406. except QAPIExprError, e:
  407. print >>sys.stderr, e
  408. exit(1)
  409. return exprs
  410. def parse_args(typeinfo):
  411. if isinstance(typeinfo, str):
  412. struct = find_struct(typeinfo)
  413. assert struct != None
  414. typeinfo = struct['data']
  415. for member in typeinfo:
  416. argname = member
  417. argentry = typeinfo[member]
  418. optional = False
  419. structured = False
  420. if member.startswith('*'):
  421. argname = member[1:]
  422. optional = True
  423. if isinstance(argentry, OrderedDict):
  424. structured = True
  425. yield (argname, argentry, optional, structured)
  426. def de_camel_case(name):
  427. new_name = ''
  428. for ch in name:
  429. if ch.isupper() and new_name:
  430. new_name += '_'
  431. if ch == '-':
  432. new_name += '_'
  433. else:
  434. new_name += ch.lower()
  435. return new_name
  436. def camel_case(name):
  437. new_name = ''
  438. first = True
  439. for ch in name:
  440. if ch in ['_', '-']:
  441. first = True
  442. elif first:
  443. new_name += ch.upper()
  444. first = False
  445. else:
  446. new_name += ch.lower()
  447. return new_name
  448. def c_var(name, protect=True):
  449. # ANSI X3J11/88-090, 3.1.1
  450. c89_words = set(['auto', 'break', 'case', 'char', 'const', 'continue',
  451. 'default', 'do', 'double', 'else', 'enum', 'extern', 'float',
  452. 'for', 'goto', 'if', 'int', 'long', 'register', 'return',
  453. 'short', 'signed', 'sizeof', 'static', 'struct', 'switch',
  454. 'typedef', 'union', 'unsigned', 'void', 'volatile', 'while'])
  455. # ISO/IEC 9899:1999, 6.4.1
  456. c99_words = set(['inline', 'restrict', '_Bool', '_Complex', '_Imaginary'])
  457. # ISO/IEC 9899:2011, 6.4.1
  458. c11_words = set(['_Alignas', '_Alignof', '_Atomic', '_Generic', '_Noreturn',
  459. '_Static_assert', '_Thread_local'])
  460. # GCC http://gcc.gnu.org/onlinedocs/gcc-4.7.1/gcc/C-Extensions.html
  461. # excluding _.*
  462. gcc_words = set(['asm', 'typeof'])
  463. # C++ ISO/IEC 14882:2003 2.11
  464. cpp_words = set(['bool', 'catch', 'class', 'const_cast', 'delete',
  465. 'dynamic_cast', 'explicit', 'false', 'friend', 'mutable',
  466. 'namespace', 'new', 'operator', 'private', 'protected',
  467. 'public', 'reinterpret_cast', 'static_cast', 'template',
  468. 'this', 'throw', 'true', 'try', 'typeid', 'typename',
  469. 'using', 'virtual', 'wchar_t',
  470. # alternative representations
  471. 'and', 'and_eq', 'bitand', 'bitor', 'compl', 'not',
  472. 'not_eq', 'or', 'or_eq', 'xor', 'xor_eq'])
  473. # namespace pollution:
  474. polluted_words = set(['unix', 'errno'])
  475. if protect and (name in c89_words | c99_words | c11_words | gcc_words | cpp_words | polluted_words):
  476. return "q_" + name
  477. return name.replace('-', '_').lstrip("*")
  478. def c_fun(name, protect=True):
  479. return c_var(name, protect).replace('.', '_')
  480. def c_list_type(name):
  481. return '%sList' % name
  482. def type_name(name):
  483. if type(name) == list:
  484. return c_list_type(name[0])
  485. return name
  486. enum_types = []
  487. struct_types = []
  488. union_types = []
  489. def add_struct(definition):
  490. global struct_types
  491. struct_types.append(definition)
  492. def find_struct(name):
  493. global struct_types
  494. for struct in struct_types:
  495. if struct['type'] == name:
  496. return struct
  497. return None
  498. def add_union(definition):
  499. global union_types
  500. union_types.append(definition)
  501. def find_union(name):
  502. global union_types
  503. for union in union_types:
  504. if union['union'] == name:
  505. return union
  506. return None
  507. def add_enum(name, enum_values = None):
  508. global enum_types
  509. enum_types.append({"enum_name": name, "enum_values": enum_values})
  510. def find_enum(name):
  511. global enum_types
  512. for enum in enum_types:
  513. if enum['enum_name'] == name:
  514. return enum
  515. return None
  516. def is_enum(name):
  517. return find_enum(name) != None
  518. eatspace = '\033EATSPACE.'
  519. # A special suffix is added in c_type() for pointer types, and it's
  520. # stripped in mcgen(). So please notice this when you check the return
  521. # value of c_type() outside mcgen().
  522. def c_type(name, is_param=False):
  523. if name == 'str':
  524. if is_param:
  525. return 'const char *' + eatspace
  526. return 'char *' + eatspace
  527. elif name == 'int':
  528. return 'int64_t'
  529. elif (name == 'int8' or name == 'int16' or name == 'int32' or
  530. name == 'int64' or name == 'uint8' or name == 'uint16' or
  531. name == 'uint32' or name == 'uint64'):
  532. return name + '_t'
  533. elif name == 'size':
  534. return 'uint64_t'
  535. elif name == 'bool':
  536. return 'bool'
  537. elif name == 'number':
  538. return 'double'
  539. elif type(name) == list:
  540. return '%s *%s' % (c_list_type(name[0]), eatspace)
  541. elif is_enum(name):
  542. return name
  543. elif name == None or len(name) == 0:
  544. return 'void'
  545. elif name == name.upper():
  546. return '%sEvent *%s' % (camel_case(name), eatspace)
  547. else:
  548. return '%s *%s' % (name, eatspace)
  549. def is_c_ptr(name):
  550. suffix = "*" + eatspace
  551. return c_type(name).endswith(suffix)
  552. def genindent(count):
  553. ret = ""
  554. for i in range(count):
  555. ret += " "
  556. return ret
  557. indent_level = 0
  558. def push_indent(indent_amount=4):
  559. global indent_level
  560. indent_level += indent_amount
  561. def pop_indent(indent_amount=4):
  562. global indent_level
  563. indent_level -= indent_amount
  564. def cgen(code, **kwds):
  565. indent = genindent(indent_level)
  566. lines = code.split('\n')
  567. lines = map(lambda x: indent + x, lines)
  568. return '\n'.join(lines) % kwds + '\n'
  569. def mcgen(code, **kwds):
  570. raw = cgen('\n'.join(code.split('\n')[1:-1]), **kwds)
  571. return re.sub(re.escape(eatspace) + ' *', '', raw)
  572. def basename(filename):
  573. return filename.split("/")[-1]
  574. def guardname(filename):
  575. guard = basename(filename).rsplit(".", 1)[0]
  576. for substr in [".", " ", "-"]:
  577. guard = guard.replace(substr, "_")
  578. return guard.upper() + '_H'
  579. def guardstart(name):
  580. return mcgen('''
  581. #ifndef %(name)s
  582. #define %(name)s
  583. ''',
  584. name=guardname(name))
  585. def guardend(name):
  586. return mcgen('''
  587. #endif /* %(name)s */
  588. ''',
  589. name=guardname(name))
  590. # ENUMName -> ENUM_NAME, EnumName1 -> ENUM_NAME1
  591. # ENUM_NAME -> ENUM_NAME, ENUM_NAME1 -> ENUM_NAME1, ENUM_Name2 -> ENUM_NAME2
  592. # ENUM24_Name -> ENUM24_NAME
  593. def _generate_enum_string(value):
  594. c_fun_str = c_fun(value, False)
  595. if value.isupper():
  596. return c_fun_str
  597. new_name = ''
  598. l = len(c_fun_str)
  599. for i in range(l):
  600. c = c_fun_str[i]
  601. # When c is upper and no "_" appears before, do more checks
  602. if c.isupper() and (i > 0) and c_fun_str[i - 1] != "_":
  603. # Case 1: next string is lower
  604. # Case 2: previous string is digit
  605. if (i < (l - 1) and c_fun_str[i + 1].islower()) or \
  606. c_fun_str[i - 1].isdigit():
  607. new_name += '_'
  608. new_name += c
  609. return new_name.lstrip('_').upper()
  610. def generate_enum_full_value(enum_name, enum_value):
  611. abbrev_string = _generate_enum_string(enum_name)
  612. value_string = _generate_enum_string(enum_value)
  613. return "%s_%s" % (abbrev_string, value_string)