search for: analyzepair

...o what? Could use some comments explaining whats going on here - cache should perhaps not be based on pairs of *instructions*, but on pairs of *subscripts, *since the anlysis for A[i] and A[i+1] is exactly the same as the analysis for B[i] and B[i + 1] LoopDependenceAnalysis.cpp - AnalyzePair - should check for mod-ref info with calls, so we can take advantage of any available interprocedural analysis. For example, if we have a load from A[i] and a call, you immediately give up and call it Unknown.. That's pessimistic; we should make sure that A is modified b...

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 orderi...

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

Hi Sanjoy, I wondered: >> 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...

Hi Hal, Preston! Sorry for the delay! Got busy with some offline work. I've worked on my previous code to calculate direction and distance vectors whenever possible (strong SIV, basically). I think the current code is much clearer and would like your opinions on it. I have attached the patch and also pushed to the github repo I mentioned [1]. Thanks! [1]