4df387d0c1
The third structurize pass, which routes loop exits that leave the loop before they meet, runs only when the plain and the privatized pass throw, and its result was used without a check. Merged with #2471, it turns some of those budget failures into graphs that spirv-val rejects. In this one, selection 12 of the result lies in the selection at 7 and branches to 7's merge block 13: {{1}, {2, 3}, {4}, {5}, {6, 7}, {}, {8, 9}, {10, 11}, {1}, {12, 4}, {5}, {13}, {8, 14}, {15, 16}, {7}, {13}, {4}} block 12 exits the selection headed by block 12, but not via a structured exit hasStructuredConstructs checks the third pass's result against the structured control-flow rules of the SPIR-V specification (2.11), with dominance and post-dominance taken over branch, merge and continue edges. Back edges come only from a loop's continue block. A conditional without a merge breaks or continues its innermost loop. A header strictly dominates its merge, and a loop header its continue block. A construct contains the merge of every header inside it and is entered only through its header. It is left only to its own merge or to the innermost loop's merge or continue block, and a continue construct only to its loop's header or merge. When the result fails, the second pass's error is reported, as when the third pass throws. The first two passes are unchanged. Differential fuzz with the structured-program generator and random reducible graphs. Oracle: exact post-dominators, requireStructuredBranches, merges dominated by their headers, the original's executions, and spirv-val (SPIRV-Tools v2026.4). - Against 9fa7d06a: the same outcome and output on every graph. That covers 100,000 random graphs at 0 words and with one block at 1000, and 30,000 programs at 16 and at 1000 words per block, each also with one block at 1000. - Merged with #2471, the same 30,000 programs: the third pass had made 41, 42 and 45 of them invalid (16 words, 16 with one block at 1000, 1000 words). These end in #2471's own error again, and nothing else changes. The 1, 1 and 18 graphs that d59a9167 merged with #2471 already structures invalidly come from the first two passes and stay as they are. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> |
||
|---|---|---|
| .github | ||
| 3rdparty | ||
| cmake | ||
| core | ||
| docs | ||
| tools | ||
| .gitignore | ||
| .gitmodules | ||
| CMakeLists.txt | ||
| CONTRIBUTING.md | ||
| LICENSE | ||
| README.md | ||
README.md
About
Tool for automatic executables porting to Linux and Windows.
Includes a relinker that converts executable to the target system's native format and implementations of system prx libraries suitable for dynamic linking. No emulation or separate runtime process.
Usage, Build instructions, Architecture, Technical debt of the project, code style conventions, contributing
Status
* System libraries: percentage of the functions known to the project so far (declared in core/libs/prx), not of every PS5 system function. The total grows as more functions are declared.
Dreaming Sarah (2D platformer) runs at a stable 60 fps on a GTX 1050 Ti / i5-7500 3.4GHz.
Unsupported or unexpected states strictly throw std::runtime_error. what() is printed to stderr and the process terminates.
The shader recompiler successfully produces SPIR-V (validated via Spirv-Tools when built with ANYPS5_ENABLE_SPIRV_TOOLS).
Compatibility
See the game compatibility list for tested games and known issues.
Input mapping
SDL-mapped game controllers are supported, including analog sticks and triggers. Keyboard and mouse controls can be configured with an anyps5-input.ini file. See input mapping for the supported devices and configuration format.
Disclaimer
This project is intended for interoperability, research, preservation, and compatibility purposes. It does not include, distribute, or require copyrighted software, firmware, cryptographic keys, or proprietary libraries. Users are responsible for ensuring that any binaries used with this project are obtained and used in accordance with applicable laws and their respective license terms.
License
This project is licensed under the GNU General Public License version 2 only.