mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-22 12:33:33 +02:00
17b2066590
We can often end up with conditional stores that cannot be speculated. They can come from fairly simple, idiomatic code:
if (c & flag1)
*a = x;
if (c & flag2)
*a = y;
...
There is no dominating or post-dominating store to a, so it is not legal to move the store unconditionally to the end of the sequence and cache the intermediate result in a register, as we would like to.
It is, however, legal to merge the stores together and do the store once:
tmp = undef;
if (c & flag1)
tmp = x;
if (c & flag2)
tmp = y;
if (c & flag1 || c & flag2)
*a = tmp;
The real power in this optimization is that it allows arbitrary length ladders such as these to be completely and trivially if-converted. The typical code I'd expect this to trigger on often uses binary-AND with constants as the condition (as in the above example), which means the ending condition can simply be truncated into a single binary-AND too: 'if (c & (flag1|flag2))'. As in the general case there are bitwise operators here, the ladder can often be optimized further too.
This optimization involves potentially increasing register pressure. Even in the simplest case, the lifetime of the first predicate is extended. This can be elided in some cases such as using binary-AND on constants, but not in the general case. Threading 'tmp' through all branches can also increase register pressure.
The optimization as in this patch is enabled by default but kept in a very conservative mode. It will only optimize if it thinks the resultant code should be if-convertable, and additionally if it can thread 'tmp' through at least one existing PHI, so it will only ever in the worst case create one more PHI and extend the lifetime of a predicate.
This doesn't trigger much in LNT, unfortunately, but it does trigger in a big way in a third party test suite.
llvm-svn: 252051
|
||
|---|---|---|
| .. | ||
| AddDiscriminators.cpp | ||
| ASanStackFrameLayout.cpp | ||
| BasicBlockUtils.cpp | ||
| BreakCriticalEdges.cpp | ||
| BuildLibCalls.cpp | ||
| BypassSlowDivision.cpp | ||
| CloneFunction.cpp | ||
| CloneModule.cpp | ||
| CMakeLists.txt | ||
| CmpInstAnalysis.cpp | ||
| CodeExtractor.cpp | ||
| CtorUtils.cpp | ||
| DemoteRegToStack.cpp | ||
| FlattenCFG.cpp | ||
| GlobalStatus.cpp | ||
| InlineFunction.cpp | ||
| InstructionNamer.cpp | ||
| IntegerDivision.cpp | ||
| LCSSA.cpp | ||
| LLVMBuild.txt | ||
| Local.cpp | ||
| LoopSimplify.cpp | ||
| LoopUnroll.cpp | ||
| LoopUnrollRuntime.cpp | ||
| LoopUtils.cpp | ||
| LoopVersioning.cpp | ||
| LowerInvoke.cpp | ||
| LowerSwitch.cpp | ||
| Makefile | ||
| Mem2Reg.cpp | ||
| MetaRenamer.cpp | ||
| ModuleUtils.cpp | ||
| PromoteMemoryToRegister.cpp | ||
| SimplifyCFG.cpp | ||
| SimplifyIndVar.cpp | ||
| SimplifyInstructions.cpp | ||
| SimplifyLibCalls.cpp | ||
| SplitModule.cpp | ||
| SSAUpdater.cpp | ||
| SymbolRewriter.cpp | ||
| UnifyFunctionExitNodes.cpp | ||
| Utils.cpp | ||
| ValueMapper.cpp | ||