mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 10:42:39 +01:00
88bae72814
The current full unroll cost model does a symbolic evaluation of the loop up to a fixed limit. That symbolic evaluation currently simplifies to constants, but we can generalize to arbitrary Values using the InstructionSimplify infrastructure at very low cost. By itself, this enables some simplifications, but it's mainly useful when combined with the branch simplification over in D102928. Differential Revision: https://reviews.llvm.org/D102934 |
||
|---|---|---|
| .. | ||
| Inputs/ir2native_x86_64_model | ||
| AliasAnalysisTest.cpp | ||
| AliasSetTrackerTest.cpp | ||
| AssumeBundleQueriesTest.cpp | ||
| BasicAliasAnalysisTest.cpp | ||
| BlockFrequencyInfoTest.cpp | ||
| BranchProbabilityInfoTest.cpp | ||
| CallGraphTest.cpp | ||
| CaptureTrackingTest.cpp | ||
| CFGTest.cpp | ||
| CGSCCPassManagerTest.cpp | ||
| CMakeLists.txt | ||
| ConstraintSystemTest.cpp | ||
| DDGTest.cpp | ||
| DivergenceAnalysisTest.cpp | ||
| DomTreeUpdaterTest.cpp | ||
| FunctionPropertiesAnalysisTest.cpp | ||
| GlobalsModRefTest.cpp | ||
| IRSimilarityIdentifierTest.cpp | ||
| IVDescriptorsTest.cpp | ||
| LazyCallGraphTest.cpp | ||
| LoadsTest.cpp | ||
| LoopInfoTest.cpp | ||
| LoopNestTest.cpp | ||
| MemoryBuiltinsTest.cpp | ||
| MemorySSATest.cpp | ||
| PhiValuesTest.cpp | ||
| ProfileSummaryInfoTest.cpp | ||
| ScalarEvolutionTest.cpp | ||
| SparsePropagation.cpp | ||
| TargetLibraryInfoTest.cpp | ||
| TBAATest.cpp | ||
| TFUtilsTest.cpp | ||
| UnrollAnalyzerTest.cpp | ||
| ValueLatticeTest.cpp | ||
| ValueTrackingTest.cpp | ||
| VectorFunctionABITest.cpp | ||
| VectorUtilsTest.cpp | ||