forked from OSchip/llvm-project
a6e5860513
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. llvm-svn: 209691 |
||
|---|---|---|
| .. | ||
| Banerjee.ll | ||
| Coupled.ll | ||
| ExactRDIV.ll | ||
| ExactSIV.ll | ||
| GCD.ll | ||
| Invariant.ll | ||
| Preliminary.ll | ||
| Propagating.ll | ||
| Separability.ll | ||
| StrongSIV.ll | ||
| SymbolicRDIV.ll | ||
| SymbolicSIV.ll | ||
| WeakCrossingSIV.ll | ||
| WeakZeroDstSIV.ll | ||
| WeakZeroSrcSIV.ll | ||
| ZIV.ll | ||