forked from OSchip/llvm-project
eb6be650ce
loop induction on LP64 targets. When the induction variable is used in addressing, IndVars now is usually able to inserst a 64-bit induction variable and eliminates the sign-extending cast. This is also useful for code using C "short" types for induction variables on targets with 32-bit addressing. Inserting a wider induction variable is easy; the tricky part is determining when trunc(sext(i)) expressions are no-ops. This requires range analysis of the loop trip count. A common case is when the original loop iteration starts at 0 and exits when the induction variable is signed-less-than a fixed value; this case is now handled. This replaces IndVarSimplify's OptimizeCanonicalIVType. It was doing the same optimization, but it was limited to loops with constant trip counts, because it was running after the loop rewrite, and the information about the original induction variable is lost by that point. Rename ScalarEvolution's executesAtLeastOnce to isLoopGuardedByCond, generalize it to be able to test for ICMP_NE conditions, and move it to be a public function so that IndVars can use it. llvm-svn: 64407 |
||
|---|---|---|
| .. | ||
| ADCE.cpp | ||
| BasicBlockPlacement.cpp | ||
| CMakeLists.txt | ||
| CodeGenPrepare.cpp | ||
| CondPropagate.cpp | ||
| ConstantProp.cpp | ||
| DCE.cpp | ||
| DeadStoreElimination.cpp | ||
| GVN.cpp | ||
| GVNPRE.cpp | ||
| IndVarSimplify.cpp | ||
| InstructionCombining.cpp | ||
| JumpThreading.cpp | ||
| LICM.cpp | ||
| LoopDeletion.cpp | ||
| LoopIndexSplit.cpp | ||
| LoopRotation.cpp | ||
| LoopStrengthReduce.cpp | ||
| LoopUnroll.cpp | ||
| LoopUnswitch.cpp | ||
| Makefile | ||
| MemCpyOptimizer.cpp | ||
| PredicateSimplifier.cpp | ||
| Reassociate.cpp | ||
| Reg2Mem.cpp | ||
| SCCP.cpp | ||
| Scalar.cpp | ||
| ScalarReplAggregates.cpp | ||
| SimplifyCFGPass.cpp | ||
| SimplifyHalfPowrLibCalls.cpp | ||
| SimplifyLibCalls.cpp | ||
| TailDuplication.cpp | ||
| TailRecursionElimination.cpp | ||