Drew T
e8c2b6baa0
- pinned since S79 as "the $a3<->$t0 swap of the two K&R raw-preserve parameter copies is fixed by ARGUMENT POSITION" — 3 attempts + permuter_ils 9->2 (S80); T4 re-probed DIFF 2 in a sandbox TU; the S83 hand pass hypothesised a local pseudo in $a3 (global.c find_reg pass-1 local_reg_n_refs) — REFUTED by the agent: that check is only in the best_reg<0 retry - the real mechanism (global.c:587-608 allocno_compare, pri = floor_log2(n_refs)*n_refs/live_length; find_reg hands the lowest free reg to whichever parm copy is allocated FIRST): every prior draft merged the 0x14/0x28 tails at C level (goto L_merge + a `kind` temp), deleting one `sb a2` use, so a2-raw had 3 refs/45 (pri 666) and lost $a3 to a1-raw (3 refs/26, pri 1153). Writing the 3-case `switch (a2)` with the tails DUPLICATED (the original's tails are merged by jump.c cross-jump AFTER allocation) gives a2-raw 4 refs/41 (floor_log2(4)=2 -> pri 1951) -> allocated first -> $a3; a block-scope `u8 *p` per case; no pins, no fences, no do-while (dumps .run/c294/dumps_t5x_9DEC_sw2: `73 in 8 75 in 7`) - the permuter's closeness-2 draft was R63-unsound (`tmp` uninitialised on the default path — its pseudo took $a3) - draft .run/P32/t5x/fable/func_80039DEC.c; report .run/P32/t5x/reports/func_80039DEC.md; coordinator rtu_match MATCH 74/74 in src/800_c.c (the no-proto TU decl from commit:3953 admits the K&R definition); gate_main slate_39DEC: BANKED, 143dbb89 BYTE-IDENTICAL - main open 5 -> 4 (3 pinned walls + func_80039308 NEAR)
BFM-decomp
A matching decompilation of Brave Fencer Musashi (PlayStation, SLUS-00726, USA 1998) — the first public decompilation effort for this game.
What "matching" means
The goal is C source code that, compiled with the original-era toolchain (PsyQ 4.x / GCC 2.7.2-family + ASPSX via maspsx), produces a byte-for-byte identical SLUS_007.26 and, eventually, byte-identical overlay binaries. SHA1 checksums are the ground truth; "functionally equivalent" does not count.
No ROM content
This repository contains no game assets, no disassembly output, and no ROM-derived data — only source code, build configuration, symbol names/addresses, hashes, and documentation. To build or contribute you must provide your own dump of the game disc (4-track BIN/CUE, redump layout). See .gitignore for the firewall.
Project status
Latest (Phase 19, 2026-06-20): the project builds 136 binaries byte-identical from a clean tree (the EXE + the resident engine + all 134 location overlays);
make check-all→ 136/136. Fleet byte-identical-from-source is 58.0% (function-instance-weighted; see the PhaseEnds for the byte-weighted ~30% figure and what it includes). Shared engine functions are matched once inov_SC01_077and propagated ×134 viatools/dedup_propagate.py. (The narrative below is Phase-11/12-era; a full refresh is part of the public-flip prep.)
Gen1 (foundation) complete — the matching pipeline is proven end-to-end. make extract && make build && make check rebuilds SLUS_007.26 byte-for-byte identical (SHA1 143dbb89…) from C + assembly, reproducibly across many sessions.
- Compiler pinned by evidence:
gcc-2.7.2-psx -O2 -G0 -mips1 -mcpu=3000+maspsx --aspsx-version=2.56 --expand-div. - 52 functions hand-matched to byte-identical machine code — including the LZSS streaming decompressor — with a decomp-permuter + matching-cookbook "flywheel" to accelerate the next.
- 959 PsyQ SDK functions linked byte-identical (libcd, libgs, libgte, libspu/libsnd, libgpu, libc2, libmcrd, libapi/libcard, libetc) straight from the real PsyQ 4.0 libraries instead of re-decompiling them — bringing byte-identical-from-source coverage of the EXE to ~50%.
- File-loader / overlay system reverse-engineered, with the resident engine blob + location overlays' load addresses proven byte-identical against a live PCSX-Redux RAM dump.
About half the EXE is still INCLUDE_ASM stubs (correct bytes, not yet C), and the bulk of the game lives in compressed overlays inside the .CD archives — Gen2 (overlays & engine at scale) is underway:
- The build toolchain is binary-agnostic (one parameterized pipeline builds any binary), and the always-resident engine blob rebuilds byte-for-byte from source (SHA1
8e17e02f…) — the second binary reconstructed exactly, after the EXE — and is now 86% hand-matched C (123 / 146 functions, up from 0): its scripting turned out to be compiled-MIPS state/mode dispatch, not a bytecode VM, and the save-file + sound (SQV) formats are documented. The harvest used a reusable swarm-of-agents + bit-for-bit byte-gate method (a wrong match can't be accepted) —tools/harvest_verify.py+tools/match_one.py, which carry straight into the overlay phase. - A cross-binary deduplication pipeline is live: a Ghidra-free signer fingerprints all 134 location overlays, and the report finds ~9,000 byte-identical function groups shared across binaries (~28 MB of collapsible code) — a single engine function is byte-identical in all 134 overlays. This is "one match unlocks many": each engine match will be auto-credited across the overlay fleet.
Current phase and detailed progress live in phase-ends/ (newest PhaseEnd_*.md = current state); methodology, rules, and the full roadmap are in PROJECT_CONTEXT.md; environment setup in docs/SETUP.md.
This project is developed primarily by Claude Code driving Ghidra through an MCP server; see CLAUDE.md.
License
Private repository for now. AGPL-3.0 is planned at public release, modeled on sotn-decomp. tools/brave-CUE/ is CUE's BRAVE extractor (GPL, source included) and retains its own license.