diff options
| author | Alon Zakai <alonzakai@gmail.com> | 2018-01-24 15:49:16 -0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-01-24 15:49:16 -0800 |
| commit | 544cce0a37a124415b00a6b3a1dd2791d714a807 (patch) | |
| tree | 87c1ab60d10639928b1a9a9b3e461744387a3fea /src/passes/CoalesceLocals.cpp | |
| parent | 9baf87e8961079da478ec3d3f718d3331963cc77 (diff) | |
| download | binaryen-544cce0a37a124415b00a6b3a1dd2791d714a807.tar.gz binaryen-544cce0a37a124415b00a6b3a1dd2791d714a807.tar.bz2 binaryen-544cce0a37a124415b00a6b3a1dd2791d714a807.zip | |
Improve LocalGraph (#1382)
This simplifies the logic there into a more standard flow operation. This is not always faster, but it is much faster on the worst cases we saw before like sqlite, and it is simpler.
The rewrite also fixes a fuzz bug.
Diffstat (limited to 'src/passes/CoalesceLocals.cpp')
| -rw-r--r-- | src/passes/CoalesceLocals.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/passes/CoalesceLocals.cpp b/src/passes/CoalesceLocals.cpp index ae9d9246e..b6c96902b 100644 --- a/src/passes/CoalesceLocals.cpp +++ b/src/passes/CoalesceLocals.cpp @@ -103,7 +103,7 @@ void CoalesceLocals::increaseBackEdgePriorities() { auto* arrivingBlock = in[i]; if (arrivingBlock->out.size() > 1) continue; // we just want unconditional branches to the loop top, true phi fragments for (auto& action : arrivingBlock->contents.actions) { - if (action.what == Action::Set) { + if (action.isSet()) { auto* set = (*action.origin)->cast<SetLocal>(); if (auto* get = getCopy(set)) { // this is indeed a copy, add to the cost (default cost is 2, so this adds 50%, and can mostly break ties) |