mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2024-12-22 23:39:24 +00:00
fail delinearization when the size of subscripts differs
Because the delinearization is not a global analysis pass, it will compute the delinearization independently of knowledge about the way the delinearization happened for other data accesses to the same array: the dependence analysis will only trigger the delinearization on a tuple of access functions, and thus delinearization may compute different subscripts sizes for a same array. When that happens the safest is to discard the delinearized information. llvm-svn: 201866
This commit is contained in:
parent
f561a01a12
commit
5133d2e9d4
@ -3193,8 +3193,21 @@ DependenceAnalysis::tryDelinearize(const SCEV *SrcSCEV, const SCEV *DstSCEV,
|
||||
DstAR->delinearize(*SE, DstSubscripts, DstSizes);
|
||||
|
||||
int size = SrcSubscripts.size();
|
||||
// Fail when there is only a subscript: that's a linearized access function.
|
||||
if (size < 2)
|
||||
return false;
|
||||
|
||||
int dstSize = DstSubscripts.size();
|
||||
if (size != dstSize || size < 2)
|
||||
// Fail when the number of subscripts in Src and Dst differ.
|
||||
if (size != dstSize)
|
||||
return false;
|
||||
|
||||
// Fail when the size of any of the subscripts in Src and Dst differs: the
|
||||
// dependence analysis assumes that elements in the same array have same size.
|
||||
// SCEV delinearization does not have a context based on which it would decide
|
||||
// globally the size of subscripts that would best fit all the array accesses.
|
||||
for (int i = 0; i < size; ++i)
|
||||
if (SrcSizes[i] != DstSizes[i])
|
||||
return false;
|
||||
|
||||
#ifndef NDEBUG
|
||||
|
Loading…
Reference in New Issue
Block a user