check_runtime.py 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346
  1. #!/usr/bin/env python3
  2. """check_runtime.py -- structural check of the 8086 runtime blob.
  3. The runtime is hand-assembled byte by byte in Runtime.mod, so the only way
  4. to know it is right is to look at the bytes. This sweeps the code region
  5. with FCML (see disasm16.py) and asserts the properties that a wrong emitter
  6. cannot produce:
  7. 1. every instruction decodes, and the decoded lengths tile the code region
  8. exactly - a single byte-length mistake desynchronises the sweep, so a
  9. clean sweep means the lengths are all right;
  10. 2. every RT_Entry offset is an instruction boundary;
  11. 3. every relative branch and CALL target is an instruction boundary inside
  12. the code region;
  13. 4. the full disassembly matches tests/runtime.golden byte for byte;
  14. 5. each entry still begins with the instruction sequence it is supposed to
  15. begin with (semantic goldens, not positional ones, so they survive
  16. legitimate size changes but catch a wrong ModRM byte).
  17. Points 1-3 exist because they give readable diagnostics for the two most
  18. common classes of mistake (wrong instruction length, wrong fixup). They are
  19. NOT sufficient on their own - they all pass on code that decodes cleanly but
  20. means the wrong thing. Concretely: with MovAlDh emitting `8A C0`
  21. (`mov al,al`) instead of `8A C6` (`mov al,dh`), the sweep stayed in sync, every
  22. branch target stayed on a boundary, and no entry's first bytes changed, so all
  23. three checks passed on provably broken code. That is why check 4 exists: it
  24. catches any wrong-but-well-formed instruction, not just the ones that happen
  25. to break the structure.
  26. Re-baselining the golden
  27. ------------------------
  28. Check 4 fails on *every* legitimate edit to Runtime.mod, because inserting an
  29. instruction moves every later offset. That is intended: the golden forces a
  30. human to look at the whole new disassembly and say "yes, that is what I meant".
  31. python3 tests/check_runtime.py --bless # rewrite tests/runtime.golden
  32. git diff tests/runtime.golden # READ THE DIFF, then commit
  33. Do not use --bless to silence a red test. Re-baseline only after reading the
  34. diff and confirming the change is the one you intended; write the reason in the
  35. commit message. An fcml upgrade may also change instruction *wording* (not
  36. meaning) and require a re-baseline for the same reason.
  37. Usage: check_runtime.py [--bless] [-v] [RTPROBE-DUMP]
  38. (default: build RtProbe and dump it)
  39. """
  40. import os
  41. import re
  42. import subprocess
  43. import sys
  44. HERE = os.path.dirname(os.path.abspath(__file__))
  45. SHELL = os.path.dirname(HERE)
  46. GM2 = "/home/eric/bin/Modula2/Gm2/bin/gm2"
  47. # Scratch artifacts live in the repo's own tmp/ folder, beside the tree that
  48. # produced them, so a failing run's evidence cannot be lost in /tmp.
  49. TMP = os.path.normpath(os.path.join(SHELL, "..", "tmp"))
  50. RTPROBE = os.path.join(TMP, "tp_check_rtprobe")
  51. GOLDEN_FILE = os.path.join(HERE, "runtime.golden")
  52. RE_SIZE = re.compile(r"^(\d+) bytes$")
  53. RE_CODEEND = re.compile(r"^code ends at (\d+)$")
  54. RE_ENTRY = re.compile(r"^ entry (\d+) = (\d+)\s+\((\w+)\)$")
  55. RE_BRANCH = re.compile(r"^(?:j\w+|call|jmp)\s+([0-9a-f]+)h$")
  56. GOLDEN_TEXT_HEADER = """\
  57. # runtime.golden -- full FCML disassembly of the runtime's code region.
  58. #
  59. # GENERATED by tests/check_runtime.py --bless, then READ THE DIFF and commit.
  60. # Every line is "OFFSET BYTES MNEMONIC". This file is a deliberate
  61. # tripwire: any edit to Runtime.mod invalidates it, because inserting an
  62. # instruction renumbers everything after it, so you are forced to look at the
  63. # whole new listing and confirm you meant every change. See the "Re-baselining
  64. # the golden" section of check_runtime.py.
  65. #
  66. # Region: bytes 0..codeEnd of the runtime image (see the code/data split in
  67. # EmitData). Relative targets are absolute offsets within the runtime, which
  68. # the compiler adds to the runtime's load address when it emits a CALL.
  69. """
  70. # The "mod=11" column is reg-only, so reg is the second ModRM field: for
  71. # 88/8A (byte moves) ModRM = 11 010 rrr, for 89/8B (word moves) 11 001 rrr.
  72. def describe_golden_diff(have, want):
  73. """One-line summary of how the current disassembly differs from the
  74. golden, naming the first few differing instructions so the report points
  75. at the actual mistake instead of just saying 'mismatch'."""
  76. a = have.splitlines()
  77. b = want.splitlines()
  78. out = []
  79. for i in range(max(len(a), len(b))):
  80. x = a[i] if i < len(a) else "<end of golden>"
  81. y = b[i] if i < len(b) else "<end of disassembly>"
  82. if x != y:
  83. out.append("line %d: golden has %r, now %r" % (i + 1, x, y))
  84. if len(out) == 3:
  85. break
  86. out.append("%d differing line(s) total" % sum(
  87. 1 for i in range(max(len(a), len(b)))
  88. if (a[i] if i < len(a) else None) != (b[i] if i < len(b) else None)))
  89. return "; ".join(out)
  90. # Semantic goldens: the byte sequence each entry must START with. Stated in
  91. # terms of intent ("read the argument through BP") rather than offsets, so
  92. # they survive a legitimate size change but still catch a wrong ModRM byte.
  93. # This list is the *explanation* for the bytes; runtime.golden is the
  94. # backstop. Keep the two consistent -- they read the same measured ModRM
  95. # table that audit_helpers.py enforces on the source.
  96. #
  97. # The four read entries are here for the same reason the three earlier 8086
  98. # ModRM traps are: each of them is a hand-written sequence whose bytes are
  99. # well formed whether or not they mean anything, and each has in fact been
  100. # wrong while decoding cleanly. See the notes in Runtime.mod on each.
  101. GOLDEN = {
  102. "initmem": "8B F0 8B 54 04 8B 4C 06", # SI:=AX(header); DX:=[SI+4]; CX:=[SI+6]
  103. "stackchk": "C3", # the no-op: a bare RET, by design
  104. "progend": "31 C0 B4 4C CD 21 C3", # XOR AX,AX; AH:=$4C; INT 21h; RET
  105. "wrint": "55 8B EC 8B 46 04", # PUSH BP; MOV BP,SP; AX:=[BP+4]
  106. # wrchar: AL, not DL. DOS INT 21h AH=02h takes the character in AL, and
  107. # DL is the *other* 8086 convention (BIOS teletype). This read DL, so
  108. # every write of a character printed whatever the *last* character read
  109. # had been - usually nothing at all, since DL starts undefined. The
  110. # bytes are `8A 46 02` = MOV AL,[BP+2]; the old golden said `8A 56 02`
  111. # = MOV DL,[BP+2] and was RIGHT about what the code did and WRONG about
  112. # what it should do. That is the whole reason this check exists: a
  113. # positional golden blesses whatever is there.
  114. # wrchar and wrbool: PUSH BP; MOV BP,SP; ...; MOV SP,BP; POP BP.
  115. #
  116. # These two goldens were the *shape* of the fault found by execution and
  117. # not by any byte check. They read `8B EC 8A 46 02 89 EC` -- BP:=SP,
  118. # read, SP:=BP, no PUSH and no POP -- and they blessed it: the bytes were
  119. # well formed, the size did not change, the decode said exactly what it
  120. # said, and the entries still worked. What was wrong was that BP is the
  121. # one register an entry may keep, because the driver keeps its cursor into
  122. # the case record there, so an entry that borrows BP to reach its argument
  123. # and never gives it back sends the NEXT call to a garbage address. The
  124. # machine triple-faulted and restarted, which printed the record header
  125. # twice and hung.
  126. #
  127. # So the PUSH and the POP are now in the golden, which is the only place in
  128. # the byte-checking suite where "this entry must hand BP back" was ever
  129. # stated. Note the displacement moved 2 -> 4 with them: BP is pushed
  130. # first, so the argument is four bytes up. rt_exec.py checks the same rule
  131. # from the other side, and the two disagreeing is the point -- a golden
  132. # says what the bytes must be, and the contract says why.
  133. "wrchar": "55 8B EC 8A 46 04 89 EC 5D", # PUSH BP; BP:=SP; AL:=[BP+4]; SP:=BP; POP BP
  134. "wrbool": "55 8B EC 83 7E 04 00 89 EC", # PUSH BP; BP:=SP; CMP [BP+4],0; SP:=BP
  135. # ...and wrbool's POP BP is at 0086, after the INT 21h and not next to its
  136. # MOV SP,BP at 0076, so the six bytes above stop short of it on purpose. A
  137. # golden that had to span the whole frame would be asserting a code layout
  138. # rather than a prologue. rt_exec.py's POP_FRAME-free screen is what covers
  139. # that one, and it is a screen rather than a proof -- see the note there on
  140. # why 5D cannot be located exactly without a disassembler.
  141. "wrtinl": "5B 31 C9 8A 0F 43 B4 02", # POP BX; XOR CX,CX; CL:=[BX]; INC BX
  142. "rdln": "50", # PUSH AX, to keep the caller's
  143. # rdint: PUSH BP; MOV BP,SP; PUSH AX,BX,CX,DX,DI - five saved registers,
  144. # because the digit has to survive MUL (which owns DX) and be parked in
  145. # DI across it. A three-register version was not possible.
  146. "rdint": "55 8B EC 50 53 51 52 57",
  147. # rdchar: PUSH BP; MOV BP,SP; PUSH AX,BX,DI - three, no CX and no DX.
  148. # "DI" is how the caller's address gets in (there is no [BX] form), and
  149. # the store is `88 15` = MOV [DI],DL - a BYTE store, so readln of a CHAR
  150. # touches one byte and not the two rdint would have written over it.
  151. "rdchar": "55 8B EC 50 53 57",
  152. # rdbool: PUSH BP; MOV BP,SP; PUSH AX,BX,CX,DI - four. It needs no DX
  153. # (rdint's MUL is what forces DX to be saved) and saves nothing else; the
  154. # answer lives in CX, from "T/t/Y/y/1" test, and has to reach the
  155. # caller's address in DI.
  156. "rdbool": "55 8B EC 50 53 51 57",
  157. }
  158. def build_and_dump():
  159. os.makedirs(TMP, exist_ok=True)
  160. subprocess.run([GM2, "-fiso", "-Wall", "-c", "Runtime.mod"],
  161. cwd=SHELL, check=True)
  162. subprocess.run([GM2, "-fiso", "-o", RTPROBE,
  163. os.path.join("tests", "RtProbe.mod"),
  164. "Runtime.o", "Posix.o"],
  165. cwd=SHELL, check=True)
  166. out = subprocess.run([RTPROBE], capture_output=True, text=True, check=True)
  167. return out.stdout
  168. def parse(dump):
  169. size = codeend = None
  170. entries = {}
  171. code = bytearray()
  172. inhex = False
  173. for line in dump.splitlines():
  174. if RE_SIZE.match(line):
  175. size = int(RE_SIZE.match(line).group(1))
  176. continue
  177. m = RE_CODEEND.match(line)
  178. if m:
  179. codeend = int(m.group(1))
  180. continue
  181. m = RE_ENTRY.match(line)
  182. if m:
  183. entries[m.group(3)] = int(m.group(2))
  184. continue
  185. if line.strip() == "hex:":
  186. inhex = True
  187. continue
  188. if inhex:
  189. parts = line.split()
  190. if not parts or not re.fullmatch(r"[0-9A-F]{8}", parts[0]):
  191. continue
  192. for p in parts[1:]:
  193. code.append(int(p, 16))
  194. return size, codeend, entries, bytes(code)
  195. def main(argv):
  196. bless = "--bless" in argv
  197. verbose = "-v" in argv
  198. files = [a for a in argv[1:] if not a.startswith("-")]
  199. if len(files) > 1:
  200. print("usage: check_runtime.py [--bless] [-v] [RTPROBE-DUMP]")
  201. return 2
  202. if files:
  203. with open(files[0]) as f:
  204. dump = f.read()
  205. else:
  206. dump = build_and_dump()
  207. size, codeend, entries, code = parse(dump)
  208. problems = []
  209. if size is None or codeend is None:
  210. print("FAIL: could not parse the runtime dump (size/codeend missing)")
  211. return 1
  212. if len(code) != size:
  213. problems.append("hex dump has %d bytes, header says %d"
  214. % (len(code), size))
  215. if not entries:
  216. problems.append("no entry offsets parsed")
  217. sys.path.insert(0, HERE)
  218. import disasm16
  219. # --- 1. clean sweep of the code region ---------------------------
  220. body = code[:codeend]
  221. starts = set()
  222. listing = [] # (pc, bytes, text) - kept structured so neither the
  223. # branch scan nor the golden has to re-parse the
  224. # pretty-printed line
  225. pc = 0
  226. import io
  227. buf = io.StringIO()
  228. while pc < len(body):
  229. starts.add(pc)
  230. text, length = disasm16.decode(body[pc:], pc)
  231. if length == 0:
  232. buf.write("%04X: %s <DECODE ERROR>\n"
  233. % (pc, " ".join("%02X" % b for b in body[pc:pc + 8])))
  234. problems.append("decode error at %04X" % pc)
  235. break
  236. raw = body[pc:pc + length]
  237. text = text or "?"
  238. listing.append((pc, raw, text))
  239. buf.write("%04X: %-24s %s\n"
  240. % (pc, " ".join("%02X" % b for b in raw), text))
  241. pc += length
  242. if pc != len(body):
  243. problems.append("sweep ended at %04X, code region ends at %04X"
  244. % (pc, len(body)))
  245. if verbose:
  246. sys.stderr.write(buf.getvalue())
  247. # --- 2. entries are instruction boundaries -----------------------
  248. for name, off in sorted(entries.items()):
  249. if off not in starts:
  250. problems.append("entry %s at %d is not an instruction boundary"
  251. % (name, off))
  252. # --- 3. branch targets are instruction boundaries -----------------
  253. nbranch = 0
  254. for _at, _raw, text in listing:
  255. m = RE_BRANCH.match(text)
  256. if not m:
  257. continue
  258. nbranch += 1
  259. tgt = int(m.group(1), 16)
  260. if tgt not in starts:
  261. problems.append("%r targets %04X, not an instruction boundary"
  262. % (text, tgt))
  263. elif tgt >= codeend:
  264. problems.append("%r targets %04X, outside the code region"
  265. % (text, tgt))
  266. # --- 4. full-disassembly golden -----------------------------------
  267. # This is the only check that catches an instruction which decodes
  268. # cleanly but means the wrong thing; see the module docstring for the
  269. # MovAlDh example that motivated it.
  270. golden_text = "".join(
  271. "%04X %-11s %s\n" % (at, " ".join("%02X" % b for b in raw), text)
  272. for at, raw, text in listing)
  273. if bless:
  274. with open(GOLDEN_FILE, "w") as f:
  275. f.write(GOLDEN_TEXT_HEADER)
  276. f.write(golden_text)
  277. print("BLESSED: wrote %s (%d instructions). Read the diff before"
  278. " committing." % (GOLDEN_FILE, len(listing)))
  279. else:
  280. if not os.path.exists(GOLDEN_FILE):
  281. problems.append("no golden at %s - run with --bless once and"
  282. " commit the result" % GOLDEN_FILE)
  283. else:
  284. with open(GOLDEN_FILE) as f:
  285. have = f.read()
  286. want = GOLDEN_TEXT_HEADER + golden_text
  287. if have != want:
  288. problems.append("disassembly does not match %s (%s)"
  289. % (os.path.basename(GOLDEN_FILE),
  290. describe_golden_diff(have, want)))
  291. # --- 5. semantic goldens -----------------------------------------
  292. for name, want in sorted(GOLDEN.items()):
  293. if name not in entries:
  294. problems.append("no entry named %s" % name)
  295. continue
  296. off = entries[name]
  297. got = " ".join("%02X" % b for b in code[off:off + len(want.split())])
  298. if got.upper() != want.upper():
  299. problems.append("entry %s starts %s, expected %s"
  300. % (name, got.upper(), want.upper()))
  301. print("runtime: %d bytes, code 0..%d (%d), %d entries, %d branches checked"
  302. % (size, codeend - 1, codeend, len(entries), nbranch))
  303. for name in sorted(entries):
  304. print(" %-9s at %4d" % (name, entries[name]))
  305. if problems:
  306. print("FAIL: %d problem(s)" % len(problems))
  307. for p in problems:
  308. print(" - %s" % p)
  309. return 1
  310. print("PASS: runtime code region is self-consistent")
  311. return 0
  312. if __name__ == "__main__":
  313. sys.exit(main(sys.argv))