prettyasserts.py 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450
  1. #!/usr/bin/env python3
  2. #
  3. # Preprocessor that makes asserts easier to debug.
  4. #
  5. # Example:
  6. # ./scripts/prettyasserts.py -p LFS_ASSERT lfs.c -o lfs.a.c
  7. #
  8. # Copyright (c) 2022, The littlefs authors.
  9. # Copyright (c) 2020, Arm Limited. All rights reserved.
  10. # SPDX-License-Identifier: BSD-3-Clause
  11. #
  12. import re
  13. import sys
  14. # NOTE the use of macros here helps keep a consistent stack depth which
  15. # tools may rely on.
  16. #
  17. # If compilation errors are noisy consider using -ftrack-macro-expansion=0.
  18. #
  19. LIMIT = 16
  20. CMP = {
  21. '==': 'eq',
  22. '!=': 'ne',
  23. '<=': 'le',
  24. '>=': 'ge',
  25. '<': 'lt',
  26. '>': 'gt',
  27. }
  28. LEXEMES = {
  29. 'ws': [r'(?:\s|\n|#.*?\n|//.*?\n|/\*.*?\*/)+'],
  30. 'assert': ['assert'],
  31. 'arrow': ['=>'],
  32. 'string': [r'"(?:\\.|[^"])*"', r"'(?:\\.|[^'])\'"],
  33. 'paren': ['\(', '\)'],
  34. 'cmp': CMP.keys(),
  35. 'logic': ['\&\&', '\|\|'],
  36. 'sep': [':', ';', '\{', '\}', ','],
  37. }
  38. def openio(path, mode='r', buffering=-1):
  39. # allow '-' for stdin/stdout
  40. if path == '-':
  41. if mode == 'r':
  42. return os.fdopen(os.dup(sys.stdin.fileno()), mode, buffering)
  43. else:
  44. return os.fdopen(os.dup(sys.stdout.fileno()), mode, buffering)
  45. else:
  46. return open(path, mode, buffering)
  47. def write_header(f, limit=LIMIT):
  48. f.writeln("// Generated by %s:" % sys.argv[0])
  49. f.writeln("//")
  50. f.writeln("// %s" % ' '.join(sys.argv))
  51. f.writeln("//")
  52. f.writeln()
  53. f.writeln("#include <stdbool.h>")
  54. f.writeln("#include <stdint.h>")
  55. f.writeln("#include <inttypes.h>")
  56. f.writeln("#include <stdio.h>")
  57. f.writeln("#include <string.h>")
  58. f.writeln("#include <signal.h>")
  59. # give source a chance to define feature macros
  60. f.writeln("#undef _FEATURES_H")
  61. f.writeln()
  62. # write print macros
  63. f.writeln("__attribute__((unused))")
  64. f.writeln("static void __pretty_assert_print_bool(")
  65. f.writeln(" const void *v, size_t size) {")
  66. f.writeln(" (void)size;")
  67. f.writeln(" printf(\"%s\", *(const bool*)v ? \"true\" : \"false\");")
  68. f.writeln("}")
  69. f.writeln()
  70. f.writeln("__attribute__((unused))")
  71. f.writeln("static void __pretty_assert_print_int(")
  72. f.writeln(" const void *v, size_t size) {")
  73. f.writeln(" (void)size;")
  74. f.writeln(" printf(\"%\"PRIiMAX, *(const intmax_t*)v);")
  75. f.writeln("}")
  76. f.writeln()
  77. f.writeln("__attribute__((unused))")
  78. f.writeln("static void __pretty_assert_print_mem(")
  79. f.writeln(" const void *v, size_t size) {")
  80. f.writeln(" const uint8_t *v_ = v;")
  81. f.writeln(" printf(\"\\\"\");")
  82. f.writeln(" for (size_t i = 0; i < size && i < %d; i++) {" % limit)
  83. f.writeln(" if (v_[i] >= ' ' && v_[i] <= '~') {")
  84. f.writeln(" printf(\"%c\", v_[i]);")
  85. f.writeln(" } else {")
  86. f.writeln(" printf(\"\\\\x%02x\", v_[i]);")
  87. f.writeln(" }")
  88. f.writeln(" }")
  89. f.writeln(" if (size > %d) {" % limit)
  90. f.writeln(" printf(\"...\");")
  91. f.writeln(" }")
  92. f.writeln(" printf(\"\\\"\");")
  93. f.writeln("}")
  94. f.writeln()
  95. f.writeln("__attribute__((unused))")
  96. f.writeln("static void __pretty_assert_print_str(")
  97. f.writeln(" const void *v, size_t size) {")
  98. f.writeln(" __pretty_assert_print_mem(v, size);")
  99. f.writeln("}")
  100. f.writeln()
  101. f.writeln("__attribute__((unused, noinline))")
  102. f.writeln("static void __pretty_assert_fail(")
  103. f.writeln(" const char *file, int line,")
  104. f.writeln(" void (*type_print_cb)(const void*, size_t),")
  105. f.writeln(" const char *cmp,")
  106. f.writeln(" const void *lh, size_t lsize,")
  107. f.writeln(" const void *rh, size_t rsize) {")
  108. f.writeln(" printf(\"%s:%d:assert: assert failed with \", file, line);")
  109. f.writeln(" type_print_cb(lh, lsize);")
  110. f.writeln(" printf(\", expected %s \", cmp);")
  111. f.writeln(" type_print_cb(rh, rsize);")
  112. f.writeln(" printf(\"\\n\");")
  113. f.writeln(" fflush(NULL);")
  114. f.writeln(" raise(SIGABRT);")
  115. f.writeln("}")
  116. f.writeln()
  117. # write assert macros
  118. for op, cmp in sorted(CMP.items()):
  119. f.writeln("#define __PRETTY_ASSERT_BOOL_%s(lh, rh) do { \\"
  120. % cmp.upper())
  121. f.writeln(" bool _lh = !!(lh); \\")
  122. f.writeln(" bool _rh = !!(rh); \\")
  123. f.writeln(" if (!(_lh %s _rh)) { \\" % op)
  124. f.writeln(" __pretty_assert_fail( \\")
  125. f.writeln(" __FILE__, __LINE__, \\")
  126. f.writeln(" __pretty_assert_print_bool, \"%s\", \\"
  127. % cmp)
  128. f.writeln(" &_lh, 0, \\")
  129. f.writeln(" &_rh, 0); \\")
  130. f.writeln(" } \\")
  131. f.writeln("} while (0)")
  132. for op, cmp in sorted(CMP.items()):
  133. f.writeln("#define __PRETTY_ASSERT_INT_%s(lh, rh) do { \\"
  134. % cmp.upper())
  135. f.writeln(" __typeof__(lh) _lh = lh; \\")
  136. f.writeln(" __typeof__(lh) _rh = rh; \\")
  137. f.writeln(" if (!(_lh %s _rh)) { \\" % op)
  138. f.writeln(" __pretty_assert_fail( \\")
  139. f.writeln(" __FILE__, __LINE__, \\")
  140. f.writeln(" __pretty_assert_print_int, \"%s\", \\"
  141. % cmp)
  142. f.writeln(" &(intmax_t){_lh}, 0, \\")
  143. f.writeln(" &(intmax_t){_rh}, 0); \\")
  144. f.writeln(" } \\")
  145. f.writeln("} while (0)")
  146. for op, cmp in sorted(CMP.items()):
  147. f.writeln("#define __PRETTY_ASSERT_MEM_%s(lh, rh, size) do { \\"
  148. % cmp.upper())
  149. f.writeln(" const void *_lh = lh; \\")
  150. f.writeln(" const void *_rh = rh; \\")
  151. f.writeln(" if (!(memcmp(_lh, _rh, size) %s 0)) { \\" % op)
  152. f.writeln(" __pretty_assert_fail( \\")
  153. f.writeln(" __FILE__, __LINE__, \\")
  154. f.writeln(" __pretty_assert_print_mem, \"%s\", \\"
  155. % cmp)
  156. f.writeln(" _lh, size, \\")
  157. f.writeln(" _rh, size); \\")
  158. f.writeln(" } \\")
  159. f.writeln("} while (0)")
  160. for op, cmp in sorted(CMP.items()):
  161. f.writeln("#define __PRETTY_ASSERT_STR_%s(lh, rh) do { \\"
  162. % cmp.upper())
  163. f.writeln(" const char *_lh = lh; \\")
  164. f.writeln(" const char *_rh = rh; \\")
  165. f.writeln(" if (!(strcmp(_lh, _rh) %s 0)) { \\" % op)
  166. f.writeln(" __pretty_assert_fail( \\")
  167. f.writeln(" __FILE__, __LINE__, \\")
  168. f.writeln(" __pretty_assert_print_str, \"%s\", \\"
  169. % cmp)
  170. f.writeln(" _lh, strlen(_lh), \\")
  171. f.writeln(" _rh, strlen(_rh)); \\")
  172. f.writeln(" } \\")
  173. f.writeln("} while (0)")
  174. f.writeln()
  175. f.writeln()
  176. def mkassert(type, cmp, lh, rh, size=None):
  177. if size is not None:
  178. return ("__PRETTY_ASSERT_%s_%s(%s, %s, %s)"
  179. % (type.upper(), cmp.upper(), lh, rh, size))
  180. else:
  181. return ("__PRETTY_ASSERT_%s_%s(%s, %s)"
  182. % (type.upper(), cmp.upper(), lh, rh))
  183. # simple recursive descent parser
  184. class ParseFailure(Exception):
  185. def __init__(self, expected, found):
  186. self.expected = expected
  187. self.found = found
  188. def __str__(self):
  189. return "expected %r, found %s..." % (
  190. self.expected, repr(self.found)[:70])
  191. class Parser:
  192. def __init__(self, in_f, lexemes=LEXEMES):
  193. p = '|'.join('(?P<%s>%s)' % (n, '|'.join(l))
  194. for n, l in lexemes.items())
  195. p = re.compile(p, re.DOTALL)
  196. data = in_f.read()
  197. tokens = []
  198. line = 1
  199. col = 0
  200. while True:
  201. m = p.search(data)
  202. if m:
  203. if m.start() > 0:
  204. tokens.append((None, data[:m.start()], line, col))
  205. tokens.append((m.lastgroup, m.group(), line, col))
  206. data = data[m.end():]
  207. else:
  208. tokens.append((None, data, line, col))
  209. break
  210. self.tokens = tokens
  211. self.off = 0
  212. def lookahead(self, *pattern):
  213. if self.off < len(self.tokens):
  214. token = self.tokens[self.off]
  215. if token[0] in pattern or token[1] in pattern:
  216. self.m = token[1]
  217. return self.m
  218. self.m = None
  219. return self.m
  220. def accept(self, *patterns):
  221. m = self.lookahead(*patterns)
  222. if m is not None:
  223. self.off += 1
  224. return m
  225. def expect(self, *patterns):
  226. m = self.accept(*patterns)
  227. if not m:
  228. raise ParseFailure(patterns, self.tokens[self.off:])
  229. return m
  230. def push(self):
  231. return self.off
  232. def pop(self, state):
  233. self.off = state
  234. def p_assert(p):
  235. state = p.push()
  236. # assert(memcmp(a,b,size) cmp 0)?
  237. try:
  238. p.expect('assert') ; p.accept('ws')
  239. p.expect('(') ; p.accept('ws')
  240. p.expect('memcmp') ; p.accept('ws')
  241. p.expect('(') ; p.accept('ws')
  242. lh = p_expr(p) ; p.accept('ws')
  243. p.expect(',') ; p.accept('ws')
  244. rh = p_expr(p) ; p.accept('ws')
  245. p.expect(',') ; p.accept('ws')
  246. size = p_expr(p) ; p.accept('ws')
  247. p.expect(')') ; p.accept('ws')
  248. cmp = p.expect('cmp') ; p.accept('ws')
  249. p.expect('0') ; p.accept('ws')
  250. p.expect(')')
  251. return mkassert('mem', CMP[cmp], lh, rh, size)
  252. except ParseFailure:
  253. p.pop(state)
  254. # assert(strcmp(a,b) cmp 0)?
  255. try:
  256. p.expect('assert') ; p.accept('ws')
  257. p.expect('(') ; p.accept('ws')
  258. p.expect('strcmp') ; p.accept('ws')
  259. p.expect('(') ; p.accept('ws')
  260. lh = p_expr(p) ; p.accept('ws')
  261. p.expect(',') ; p.accept('ws')
  262. rh = p_expr(p) ; p.accept('ws')
  263. p.expect(')') ; p.accept('ws')
  264. cmp = p.expect('cmp') ; p.accept('ws')
  265. p.expect('0') ; p.accept('ws')
  266. p.expect(')')
  267. return mkassert('str', CMP[cmp], lh, rh)
  268. except ParseFailure:
  269. p.pop(state)
  270. # assert(a cmp b)?
  271. try:
  272. p.expect('assert') ; p.accept('ws')
  273. p.expect('(') ; p.accept('ws')
  274. lh = p_expr(p) ; p.accept('ws')
  275. cmp = p.expect('cmp') ; p.accept('ws')
  276. rh = p_expr(p) ; p.accept('ws')
  277. p.expect(')')
  278. return mkassert('int', CMP[cmp], lh, rh)
  279. except ParseFailure:
  280. p.pop(state)
  281. # assert(a)?
  282. p.expect('assert') ; p.accept('ws')
  283. p.expect('(') ; p.accept('ws')
  284. lh = p_exprs(p) ; p.accept('ws')
  285. p.expect(')')
  286. return mkassert('bool', 'eq', lh, 'true')
  287. def p_expr(p):
  288. res = []
  289. while True:
  290. if p.accept('('):
  291. res.append(p.m)
  292. while True:
  293. res.append(p_exprs(p))
  294. if p.accept('sep'):
  295. res.append(p.m)
  296. else:
  297. break
  298. res.append(p.expect(')'))
  299. elif p.lookahead('assert'):
  300. state = p.push()
  301. try:
  302. res.append(p_assert(p))
  303. except ParseFailure:
  304. p.pop(state)
  305. res.append(p.expect('assert'))
  306. elif p.accept('string', None, 'ws'):
  307. res.append(p.m)
  308. else:
  309. return ''.join(res)
  310. def p_exprs(p):
  311. res = []
  312. while True:
  313. res.append(p_expr(p))
  314. if p.accept('cmp', 'logic', ','):
  315. res.append(p.m)
  316. else:
  317. return ''.join(res)
  318. def p_stmt(p):
  319. ws = p.accept('ws') or ''
  320. # memcmp(lh,rh,size) => 0?
  321. if p.lookahead('memcmp'):
  322. state = p.push()
  323. try:
  324. p.expect('memcmp') ; p.accept('ws')
  325. p.expect('(') ; p.accept('ws')
  326. lh = p_expr(p) ; p.accept('ws')
  327. p.expect(',') ; p.accept('ws')
  328. rh = p_expr(p) ; p.accept('ws')
  329. p.expect(',') ; p.accept('ws')
  330. size = p_expr(p) ; p.accept('ws')
  331. p.expect(')') ; p.accept('ws')
  332. p.expect('=>') ; p.accept('ws')
  333. p.expect('0') ; p.accept('ws')
  334. return ws + mkassert('mem', 'eq', lh, rh, size)
  335. except ParseFailure:
  336. p.pop(state)
  337. # strcmp(lh,rh) => 0?
  338. if p.lookahead('strcmp'):
  339. state = p.push()
  340. try:
  341. p.expect('strcmp') ; p.accept('ws') ; p.expect('(') ; p.accept('ws')
  342. lh = p_expr(p) ; p.accept('ws')
  343. p.expect(',') ; p.accept('ws')
  344. rh = p_expr(p) ; p.accept('ws')
  345. p.expect(')') ; p.accept('ws')
  346. p.expect('=>') ; p.accept('ws')
  347. p.expect('0') ; p.accept('ws')
  348. return ws + mkassert('str', 'eq', lh, rh)
  349. except ParseFailure:
  350. p.pop(state)
  351. # lh => rh?
  352. lh = p_exprs(p)
  353. if p.accept('=>'):
  354. rh = p_exprs(p)
  355. return ws + mkassert('int', 'eq', lh, rh)
  356. else:
  357. return ws + lh
  358. def main(input=None, output=None, pattern=[], limit=LIMIT):
  359. with openio(input or '-', 'r') as in_f:
  360. # create parser
  361. lexemes = LEXEMES.copy()
  362. lexemes['assert'] += pattern
  363. p = Parser(in_f, lexemes)
  364. with openio(output or '-', 'w') as f:
  365. def writeln(s=''):
  366. f.write(s)
  367. f.write('\n')
  368. f.writeln = writeln
  369. # write extra verbose asserts
  370. write_header(f, limit=limit)
  371. if input is not None:
  372. f.writeln("#line %d \"%s\"" % (1, input))
  373. # parse and write out stmt at a time
  374. try:
  375. while True:
  376. f.write(p_stmt(p))
  377. if p.accept('sep'):
  378. f.write(p.m)
  379. else:
  380. break
  381. except ParseFailure as f:
  382. pass
  383. for i in range(p.off, len(p.tokens)):
  384. f.write(p.tokens[i][1])
  385. if __name__ == "__main__":
  386. import argparse
  387. import sys
  388. parser = argparse.ArgumentParser(
  389. description="Preprocessor that makes asserts easier to debug.",
  390. allow_abbrev=False)
  391. parser.add_argument(
  392. 'input',
  393. help="Input C file.")
  394. parser.add_argument(
  395. '-o', '--output',
  396. required=True,
  397. help="Output C file.")
  398. parser.add_argument(
  399. '-p', '--pattern',
  400. action='append',
  401. help="Regex patterns to search for starting an assert statement. This"
  402. " implicitly includes \"assert\" and \"=>\".")
  403. parser.add_argument(
  404. '-l', '--limit',
  405. type=lambda x: int(x, 0),
  406. default=LIMIT,
  407. help="Maximum number of characters to display in strcmp and memcmp. "
  408. "Defaults to %r." % LIMIT)
  409. sys.exit(main(**{k: v
  410. for k, v in vars(parser.parse_intermixed_args()).items()
  411. if v is not None}))