[Migrated] We should override `thir_body` to inject loop merge points for structurization.
Dieses Issue hat noch niemand übernommen.
- Vorherrschende Sprache
- Rust
- Sterne
- 3.4k
- Forks
- 125
- PR-Merge-Kennzahlen
- Keine gemergten PRs in 30 T.
Beschreibung
Issue automatically imported from old repo: https://github.com/EmbarkStudios/rust-gpu/issues/944
Originally creatd by eddyb on 2022-11-24T08:17:49Z 👍: 1
I was writing up this SPIR-T issue when I realized we can do much better than I ever thought we can:
The "subgroup reconvergence"/"loop merges" problem statement
the fundamental ambiguity here (wrt reconvergence), that explicit merges solve, looks like this:
loop { // ... if cond { // the "then" edge *leaves the loop* A(); // !!! it might be important that this STAYS INSIDE the loop! break; // this is just a linear A -> B edge in the CFG (outside the loop's cycle) } } B(); // !!! it might be important that this STAYS OUTSIDE the loop!because the
A()->B()edge just looks like a redundant fusable edge (isomorphic to a singleA(); B();basic block), structurizers will very likely either produce:
loop { ... if cond { break; } } A(); B();(movingA()out of theloop)
A()no longer called for "early finishers" (losing a desired side-effect)loop { ... if cond { A(); B(); break; } }(movingB()into theloop)
B()now being called for "early finishers" (gaining an undesired side-effect)and they're both bad because a non-uniform
break(i.e. an "early finisher") will block on subgroup neighbors (semantically, at least, in hardware the now-inactive lanes will likely stick around while loop instructions continue being executed for remaining lanes, until they all eventuallybreak)
An actual reasonable solution for once (what prompted me to open this issue)
A better approach might be to "just" make up a SPIR-T instruction that acts as "loop merge barrier", i.e.:
loop { // ... if cond { A(); // !!! definitely INSIDE the loop break; // just an edge to the `LoopMerge`, in the CFG } } asm!("spirt.ControlInst.LoopMerge"); B(); // !!! definitely OUTSIDE the loopEach
LoopMergewould be consumed by one loop structurization - if you have nested loops, you'd need to be careful not to forget to add them to each loop.But wait, even if we make this ergonomic with macros... we'd still want to check that you don't use any instructions that "care" about e.g. subgroups, right? That could be e.g. a MIR check pass, right? Which we can inject... just like...
Yes, that's right,
rustc_codegen_spirvhas enough query overriding power that it could overridethir_body, which MIR construction uses as the source of truth, to introduce additional nodes around loops, allowing Rust to be on par with GLSL wrt structured control-flow guarantees.
Additionally, this could be used to replace #[spirv(unroll_loops)] (once that's removed, see https://github.com/EmbarkStudios/rust-gpu/pull/940#issuecomment-1320004784 for more context), as it would allow us to check for a (new) #[spirv(unroll)] attribute on the loop expression, and then store that in the injected merge point.
That would be much nicer than fn-level catch-alls, and generally a good fit for SPIR-V expressivity.
Beitragsleitfaden
Erste Schritte
- Lies das ganze Issue und danach den Beitragsleitfaden des Projekts.
- Schreib ins Issue, dass du es übernimmst — das erspart doppelte Arbeit.
- Forke das Repository und arbeite in einem Branch.
- Öffne einen Pull Request, der die Issue-Nummer nennt.
Rechercherichtung
Beginne mit der verknüpften Referenz zur MIR-Konstruktion von rustc und der Abfrageüberschreibung thir_body in rustc_codegen_spirv. Untersuche, wie Schleifenknoten LoopMerge und Schleifeninformationen zum Unrolling tragen könnten, einschließlich verschachtelter Schleifen und subgroup-sensitiver Anweisungen. Als abgeschlossen gilt, wenn Schleifenzusammenführungspunkte und das vorgeschlagene unroll-Attribut eingefügt und validiert werden, ohne die beabsichtigte Kontrollflusssemantik zu verlieren.
Vom Indexierungsmodell aus dem Issue-Text verfasst.
Bewertung
- Tech-Stack
- rust
- Bereich
- compilers
- Issue-Typ
- Feature
- Schwierigkeit
- 5/5
- Geschätzter Aufwand
- Über eine Woche
- Aktivitätsstatus
- Veraltet
- Klarheit
- Größtenteils klar
- Anfängerfreundlichkeit
- 25/100