search for: strongsiv

...scripts. Examine each pair of subscripts in sequence. If a pair is ZIV, we test hoping to prove independence. If we can't, we move on to the next subscript. If a pair is MIV, we ignore it and move on to the next subscript. If a pair is SIV, we check to see if it's something we can handle (strongSIV, weakzeroSIV, ...). If not, skip to next subscript. If we can handle it, compute direction (if StrongSIV, compute distance). Find the appropriate level based on the index variable, turn off the Scalar flag, and intersect the new direction with whatever is already stored there. If the result is NON...

Hi, Pondering the code for StrongSIV and trying to write my own, I find I have many questions. In this code, for example, * if (isa<SCEVConstant>(delta) && isa<SCEVConstant>(srcCoeff)) { const SCEVConstant *constDelta = cast<SCEVConstant>(delta); const SCEVConstant *constCoeff = cast<SCEVConstant&gt...

Hi Preston, Thanks for the feedback! > In LoopDependenceAnalysis::AnalyzePair, what's going to happen if we > have something like this > > for (i = 0; i < n; i++) > for (j = 0; j < n; j++) > A[i][j]++; > > versus > > for (i = 0; i < n; i++) > for (j = 0; j < n; j++) > A[j][i]++; I think this can be fixed by ordering the subscripts

Hi Sanjoy & Hal, Looking at LoopDependenceAnalysis::analyzeZIV ... I don't understand much about SCEV, but the code seems inadequate. Consider these three examples: int a = ...; // we can't be sure of the relationship between a and b int b = ...; // perhaps they are parameters, or the result of I/O for (int i = 0; i < n; i++) { v[a][i] = ...; v[a + 1][i] = ...; } for (int i