mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
161c7d06da
As discussed in PR41083: https://bugs.llvm.org/show_bug.cgi?id=41083 ...we can assert/crash in EarlyCSE using the current hashing scheme and instructions with flags. ValueTracking's matchSelectPattern() may rely on overflow (nsw, etc) or other flags when detecting patterns such as min/max/abs composed of compare+select. But the value numbering / hashing mechanism used by EarlyCSE intersects those flags to allow more CSE. Several alternatives to solve this are discussed in the bug report. This patch avoids the issue by doing simple matching of min/max/abs patterns that never requires instruction flags. We give up some CSE power because of that, but that is not expected to result in much actual performance difference because InstCombine will canonicalize these patterns when possible. It even has this comment for abs/nabs: /// Canonicalize all these variants to 1 pattern. /// This makes CSE more likely. (And this patch adds PhaseOrdering tests to verify that the expected transforms are still happening in the standard optimization pipelines. I left this code to use ValueTracking's "flavor" enum values, so we don't have to change the callers' code. If we decide to go back to using the ValueTracking call (by changing the hashing algorithm instead), it should be obvious how to replace this chunk. Differential Revision: https://reviews.llvm.org/D74285 |
||
|---|---|---|
| .. | ||
| AArch64 | ||
| AMDGPU | ||
| PowerPC | ||
| X86 | ||
| and_or.ll | ||
| atomics.ll | ||
| basic.ll | ||
| commute.ll | ||
| conditional.ll | ||
| const-speculation.ll | ||
| debug-info-undef.ll | ||
| debuginfo-dce.ll | ||
| edge.ll | ||
| fence.ll | ||
| flags.ll | ||
| floatingpoint.ll | ||
| globalsaa-memoryssa.ll | ||
| guards.ll | ||
| instsimplify-dom.ll | ||
| int_sideeffect.ll | ||
| invariant-loads.ll | ||
| invariant.start.ll | ||
| memoryssa.ll | ||
| pr33406.ll | ||
| readnone-mayunwind.ll | ||
| writeonly.ll | ||