Lines Matching refs:SJ
3475 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) { in depends() local
3477 Intersection &= Pair[SJ].GroupLoops; in depends()
3480 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops; in depends()
3482 Pair[SJ].Group |= Pair[SI].Group; in depends()
3554 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) { in depends() local
3555 DEBUG(dbgs() << SJ << " "); in depends()
3556 if (Pair[SJ].Classification == Subscript::SIV) in depends()
3557 Sivs.set(SJ); in depends()
3559 Mivs.set(SJ); in depends()
3560 PairsInGroup.push_back(&Pair[SJ]); in depends()
3566 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) { in depends() local
3567 DEBUG(dbgs() << "testing subscript " << SJ << ", SIV\n"); in depends()
3572 if (testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, Result, NewConstraint, in depends()
3583 Sivs.reset(SJ); in depends()
3590 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends() local
3592 DEBUG(dbgs() << "\tSJ = " << SJ << "\n"); in depends()
3593 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, in depends()
3597 Pair[SJ].Classification = in depends()
3598 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()), in depends()
3599 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()), in depends()
3600 Pair[SJ].Loops); in depends()
3601 switch (Pair[SJ].Classification) { in depends()
3604 if (testZIV(Pair[SJ].Src, Pair[SJ].Dst, Result)) in depends()
3606 Mivs.reset(SJ); in depends()
3609 Sivs.set(SJ); in depends()
3610 Mivs.reset(SJ); in depends()
3624 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends() local
3625 if (Pair[SJ].Classification == Subscript::RDIV) { in depends()
3627 if (testRDIV(Pair[SJ].Src, Pair[SJ].Dst, Result)) in depends()
3630 Mivs.reset(SJ); in depends()
3637 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in depends() local
3638 if (Pair[SJ].Classification == Subscript::MIV) { in depends()
3640 if (testMIV(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, Result)) in depends()
3649 for (int SJ = ConstrainedLevels.find_first(); SJ >= 0; in depends() local
3650 SJ = ConstrainedLevels.find_next(SJ)) { in depends()
3651 if (SJ > (int)CommonLevels) in depends()
3653 updateDirection(Result.DV[SJ - 1], Constraints[SJ]); in depends()
3654 if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE) in depends()
3837 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) { in getSplitIteration() local
3839 Intersection &= Pair[SJ].GroupLoops; in getSplitIteration()
3842 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops; in getSplitIteration()
3844 Pair[SJ].Group |= Pair[SI].Group; in getSplitIteration()
3893 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) { in getSplitIteration() local
3894 if (Pair[SJ].Classification == Subscript::SIV) in getSplitIteration()
3895 Sivs.set(SJ); in getSplitIteration()
3897 Mivs.set(SJ); in getSplitIteration()
3901 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) { in getSplitIteration() local
3905 (void) testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, in getSplitIteration()
3912 Sivs.reset(SJ); in getSplitIteration()
3916 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) { in getSplitIteration() local
3918 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, in getSplitIteration()
3919 Pair[SJ].Loops, Constraints, Result.Consistent)) { in getSplitIteration()
3920 Pair[SJ].Classification = in getSplitIteration()
3921 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()), in getSplitIteration()
3922 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()), in getSplitIteration()
3923 Pair[SJ].Loops); in getSplitIteration()
3924 switch (Pair[SJ].Classification) { in getSplitIteration()
3926 Mivs.reset(SJ); in getSplitIteration()
3929 Sivs.set(SJ); in getSplitIteration()
3930 Mivs.reset(SJ); in getSplitIteration()