Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[compiler:chore] fix SSA pdf reference link #29162

Merged
merged 2 commits into from
May 20, 2024
+1 −1
Merged

[compiler:chore] fix SSA pdf reference link #29162

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
35e1293
[compiler:chore] fix SSA pdf reference link
HerringtonDarkholme May 18, 2024
37aab11
Use link from the university of the first author
kassens May 20, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion compiler/packages/babel-plugin-react-compiler/src/SSA/EliminateRedundantPhi.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ import {
* In both these cases, the phi is eliminated and all usages of the phi identifier
* are replaced with the other operand (ie in both cases above, all usages of `x2` are replaced with `x1` .
*
* The algorithm is inspired by that in https://pp.info.uni-karlsruhe.de/uploads/publikationen/braun13cc.pdf
* The algorithm is inspired by that in https://pp.ipd.kit.edu/uploads/publikationen/braun13cc.pdf
* but modified to reduce passes over the CFG. We visit the blocks in reverse postorder. Each time a redundant
* phi is encountered we add a mapping (eg x2 -> x1) to a rewrite table. Subsequent instructions, terminals,
* and phis rewrite all their identifiers based on this table. The algorithm loops over the CFG repeatedly
Expand Down