Lines Matching refs:SJ
3341 // For each subscript SI 0 .. 3, we consider each remaining subscript, SJ.
3381 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {
3383 Intersection &= Pair[SJ].GroupLoops;
3386 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops;
3388 Pair[SJ].Group |= Pair[SI].Group;
3459 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) {
3460 DEBUG(dbgs() << SJ << " ");
3461 if (Pair[SJ].Classification == Subscript::SIV)
3462 Sivs.set(SJ);
3464 Mivs.set(SJ);
3469 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) {
3470 DEBUG(dbgs() << "testing subscript " << SJ << ", SIV\n");
3471 // SJ is an SIV subscript that's part of the current coupled group
3475 if (testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level,
3486 Sivs.reset(SJ);
3493 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3494 // SJ is an MIV subscript that's part of the current coupled group
3495 DEBUG(dbgs() << "\tSJ = " << SJ << "\n");
3496 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops,
3500 Pair[SJ].Classification =
3501 SJ].Src, LI->getLoopFor(Src->getParent()),
3502 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()),
3503 Pair[SJ].Loops);
3504 switch (Pair[SJ].Classification) {
3507 if (testZIV(Pair[SJ].Src, Pair[SJ].Dst, Result))
3509 Mivs.reset(SJ);
3512 Sivs.set(SJ);
3513 Mivs.reset(SJ);
3527 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3528 if (Pair[SJ].Classification == Subscript::RDIV) {
3530 if (testRDIV(Pair[SJ].Src, Pair[SJ].Dst, Result))
3533 Mivs.reset(SJ);
3540 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3541 if (Pair[SJ].Classification == Subscript::MIV) {
3543 if (testMIV(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, Result))
3552 for (int SJ = ConstrainedLevels.find_first();
3553 SJ >= 0; SJ = ConstrainedLevels.find_next(SJ)) {
3554 updateDirection(Result.DV[SJ - 1], Constraints[SJ]);
3555 if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE)
3734 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {
3736 Intersection &= Pair[SJ].GroupLoops;
3739 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops;
3741 Pair[SJ].Group |= Pair[SI].Group;
3790 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) {
3791 if (Pair[SJ].Classification == Subscript::SIV)
3792 Sivs.set(SJ);
3794 Mivs.set(SJ);
3798 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) {
3799 // SJ is an SIV subscript that's part of the current coupled group
3802 (void) testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level,
3809 Sivs.reset(SJ);
3813 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3814 // SJ is an MIV subscript that's part of the current coupled group
3815 if (propagate(Pair[SJ].Src, Pair[SJ].Dst,
3816 Pair[SJ].Loops, Constraints, Result.Consistent)) {
3817 Pair[SJ].Classification =
3818 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()),
3819 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()),
3820 Pair[SJ].Loops);
3821 switch (Pair[SJ].Classification) {
3823 Mivs.reset(SJ);
3826 Sivs.set(SJ);
3827 Mivs.reset(SJ);
