Lines Matching defs:Loops

771                                             SmallBitVector &Loops) const {
775 Loops.set(Level);
801 // Collect any loops mentioned in the set of "Loops".
804 SmallBitVector &Loops) {
812 Loops.set(mapSrcLoop(AddRec->getLoop()));
813 return checkSrcSubscript(Start, LoopNest, Loops);
819 // Collect any loops mentioned in the set of "Loops".
822 SmallBitVector &Loops) {
830 Loops.set(mapDstLoop(AddRec->getLoop()));
831 return checkDstSubscript(Start, LoopNest, Loops);
841 SmallBitVector &Loops) {
848 Loops = SrcLoops;
849 Loops |= DstLoops;
850 unsigned N = Loops.count();
2174 const SmallBitVector &Loops,
2180 banerjeeMIVtest(Src, Dst, Loops, Result);
2430 const SmallBitVector &Loops,
2470 Loops, DepthExpanded, Delta);
2474 if (Loops[K]) {
2513 const SmallBitVector &Loops,
2520 if (Loops[K]) {
2545 if (Loops[Level]) {
2589 Loops, DepthExpanded, Delta);
2594 Loops, DepthExpanded, Delta);
2599 Loops, DepthExpanded, Delta);
2605 return exploreDirections(Level + 1, A, B, Bound, Loops, DepthExpanded, Delta);
2974 SmallBitVector &Loops,
2978 for (int LI = Loops.find_first(); LI >= 0; LI = Loops.find_next(LI)) {
3279 Pair[P].Loops.resize(MaxLevels + 1);
3286 Pair[P].Loops);
3287 Pair[P].GroupLoops = Pair[P].Loops;
3294 DEBUG(dumpSmallBitVector(Pair[P].Loops));
3326 // and collected all the loops mentioned by pair P in Pair[P].Loops.
3327 // In addition, we've initialized Pair[P].GroupLoops to Pair[P].Loops
3330 // Src Dst Classification Loops GroupLoops Group
3363 Pair[SI].Loops);
3366 Pair[SI].Loops);
3433 if (testMIV(Pair[SI].Src, Pair[SI].Dst, Pair[SI].Loops, Result))
3491 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops,
3498 Pair[SJ].Loops);
3538 if (testMIV(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, Result))
3559 CompleteLoops |= Pair[SI].Loops;
3697 Pair[P].Loops.resize(MaxLevels + 1);
3704 Pair[P].Loops);
3705 Pair[P].GroupLoops = Pair[P].Loops;
3718 Pair[SI].Loops);
3721 Pair[SI].Loops);
3811 Pair[SJ].Loops, Constraints, Result.Consistent)) {
3815 Pair[SJ].Loops);