search for: isconsist

...terator const_iterator; const_iterator begin() const { return levels.begin(); } const_iterator end() const { return levels.end(); } private: Value *source, *destination; Kind kind; SmallVector<const Level *, 4> levels; friend class LoopDependenceAnalysis; }; More methods, like `isConsistent` and `isConfused` can be added easily to this interface, since the raw data required to compute them is available. Given two Values, then, we can first break them up into their respective indices. We can then order them based on their loop nesting. To actually compute the dependence, we can t...

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

...private: >  Value *source, *destination; >  Kind kind; >  SmallVector<const Level *, 4> levels; I'd malloc an ordinary vector of the appropriate length, since we know the length at allocation time. >  friend class LoopDependenceAnalysis; > }; > > More methods, like `isConsistent` and `isConfused` can be added easily > to this interface, since the raw data required to compute them is > available. You'll also need flags for loop-independent, consistent, and confused. I thought earlier that the latter two could be computed, but I was wrong. Can't compute the...