Benjamin Kramer c1c74fb2b4 ScalarEvolution: Compute exit counts for loops with a power-of-2 step. ... If we have a loop of the form for (unsigned n = 0; n != (k & -32); n += 32) {} then we know that n is always divisible by 32 and the loop must terminate. Even if we have a condition where the loop counter will overflow it'll always hold this invariant. PR19183. Our loop vectorizer creates this pattern and it's also occasionally formed by loop counters derived from pointers. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@204728 91177308-0d34-0410-b5e6-96231b3b80d8		2014-03-25 16:25:12 +00:00
..
BasicAA	Reject alias to undefined symbols in the verifier.	2014-03-12 20:15:49 +00:00
BlockFrequencyInfo
BranchProbabilityInfo
CallGraph
CostModel	When analyzing vectors of element type that require legalization,	2014-03-10 22:59:13 +00:00
Delinearization
DependenceAnalysis	add -da-delinearize runs and checks to MIV testcases	2014-02-21 18:15:18 +00:00
Dominators
GlobalsModRef	BasicAA: Use reachabilty instead of dominance for checking value equality in phi	2014-01-03 05:47:03 +00:00
LazyCallGraph	[PM] Add a new "lazy" call graph analysis pass for the new pass manager.	2014-02-06 04:37:03 +00:00
Lint	Teach lint about address spaces	2014-03-06 17:33:55 +00:00
LoopInfo
MemoryDependenceAnalysis
PostDominators
RegionInfo
ScalarEvolution	ScalarEvolution: Compute exit counts for loops with a power-of-2 step.	2014-03-25 16:25:12 +00:00
TypeBasedAliasAnalysis	Fix known typos	2014-01-24 17:20:08 +00:00