llvm-6502/test/Analysis
Sebastian Pop 421b2c571c remove constant terms
The delinearization is needed only to remove the non linearity induced by
expressions involving multiplications of parameters and induction variables.
There is no problem in dealing with constant times parameters, or constant times
an induction variable.

For this reason, the current patch discards all constant terms and multipliers
before running the delinearization algorithm on the terms. The only thing
remaining in the term expressions are parameters and multiply expressions of
parameters: these simplified term expressions are passed to the array shape
recognizer that will not recognize constant dimensions anymore: these will be
recognized as different strides in parametric subscripts.

The only important special case of a constant dimension is the size of elements.
Instead of relying on the delinearization to infer the size of an element,
compute the element size from the base address type. This is a much more precise
way of computing the element size than before, as we would have mixed together
the size of an element with the strides of the innermost dimension.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@209691 91177308-0d34-0410-b5e6-96231b3b80d8
2014-05-27 22:41:45 +00:00
..
BasicAA
BlockFrequencyInfo
BranchProbabilityInfo
CallGraph
CostModel AArch64/ARM64: move ARM64 into AArch64's place 2014-05-24 12:50:23 +00:00
Delinearization remove constant terms 2014-05-27 22:41:45 +00:00
DependenceAnalysis remove constant terms 2014-05-27 22:41:45 +00:00
Dominators
GlobalsModRef
LazyCallGraph
Lint
LoopInfo
MemoryDependenceAnalysis
PostDominators
RegionInfo
ScalarEvolution Adding testcase for PR18886. 2014-05-27 06:44:25 +00:00
TypeBasedAliasAnalysis