Lines Matching refs:SJ
3425 // For each subscript SI 0 .. 3, we consider each remaining subscript, SJ.
3465 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {
3467 Intersection &= Pair[SJ].GroupLoops;
3470 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops;
3472 Pair[SJ].Group |= Pair[SI].Group;
3543 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) {
3544 DEBUG(dbgs() << SJ << " ");
3545 if (Pair[SJ].Classification == Subscript::SIV)
3546 Sivs.set(SJ);
3548 Mivs.set(SJ);
3553 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) {
3554 DEBUG(dbgs() << "testing subscript " << SJ << ", SIV\n");
3555 // SJ is an SIV subscript that's part of the current coupled group
3559 if (testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level,
3570 Sivs.reset(SJ);
3577 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3578 // SJ is an MIV subscript that's part of the current coupled group
3579 DEBUG(dbgs() << "\tSJ = " << SJ << "\n");
3580 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops,
3584 Pair[SJ].Classification =
3585 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()),
3586 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()),
3587 Pair[SJ].Loops);
3588 switch (Pair[SJ].Classification) {
3591 if (testZIV(Pair[SJ].Src, Pair[SJ].Dst, Result))
3593 Mivs.reset(SJ);
3596 Sivs.set(SJ);
3597 Mivs.reset(SJ);
3611 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3612 if (Pair[SJ].Classification == Subscript::RDIV) {
3614 if (testRDIV(Pair[SJ].Src, Pair[SJ].Dst, Result))
3617 Mivs.reset(SJ);
3624 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3625 if (Pair[SJ].Classification == Subscript::MIV) {
3627 if (testMIV(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, Result))
3636 for (int SJ = ConstrainedLevels.find_first();
3637 SJ >= 0; SJ = ConstrainedLevels.find_next(SJ)) {
3638 updateDirection(Result.DV[SJ - 1], Constraints[SJ]);
3639 if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE)
3824 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {
3826 Intersection &= Pair[SJ].GroupLoops;
3829 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops;
3831 Pair[SJ].Group |= Pair[SI].Group;
3880 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) {
3881 if (Pair[SJ].Classification == Subscript::SIV)
3882 Sivs.set(SJ);
3884 Mivs.set(SJ);
3888 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) {
3889 // SJ is an SIV subscript that's part of the current coupled group
3892 (void) testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level,
3899 Sivs.reset(SJ);
3903 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3904 // SJ is an MIV subscript that's part of the current coupled group
3905 if (propagate(Pair[SJ].Src, Pair[SJ].Dst,
3906 Pair[SJ].Loops, Constraints, Result.Consistent)) {
3907 Pair[SJ].Classification =
3908 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()),
3909 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()),
3910 Pair[SJ].Loops);
3911 switch (Pair[SJ].Classification) {
3913 Mivs.reset(SJ);
3916 Sivs.set(SJ);
3917 Mivs.reset(SJ);
