HomeSort by: relevance | last modified time | path
    Searched refs:GroupLoops (Results 1 - 2 of 2) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DependenceAnalysis.cpp 3568 Pair[P].GroupLoops.resize(MaxLevels + 1);
3575 Pair[P].GroupLoops = Pair[P].Loops;
3615 // In addition, we've initialized Pair[P].GroupLoops to Pair[P].Loops
3618 // Src Dst Classification Loops GroupLoops Group
3627 // We begin by comparing 0 and 1. The intersection of the GroupLoops is empty.
3628 // Next, 0 and 2. Again, the intersection of their GroupLoops is empty.
3633 // Next, we consider 1 and 2. The intersection of the GroupLoops is empty.
3634 // Next, 1 and 3. The intersection of their GroupLoops = {2}, not empty,
3637 // Next, we compare 2 against 3. The intersection of the GroupLoops is empty.
3642 // Pair[3].Group = {0, 1, 3} and GroupLoops = {1, 2, 5}
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceAnalysis.h 350 SmallBitVector GroupLoops;

Completed in 29 milliseconds