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