Lines Matching refs:SJ
3442 // For each subscript SI 0 .. 3, we consider each remaining subscript, SJ.
3481 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {
3483 Intersection &= Pair[SJ].GroupLoops;
3486 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops;
3488 Pair[SJ].Group |= Pair[SI].Group;
3559 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) {
3560 DEBUG(dbgs() << SJ << " ");
3561 if (Pair[SJ].Classification == Subscript::SIV)
3562 Sivs.set(SJ);
3564 Mivs.set(SJ);
3569 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) {
3570 DEBUG(dbgs() << "testing subscript " << SJ << ", SIV\n");
3571 // SJ is an SIV subscript that's part of the current coupled group
3575 if (testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, Result, NewConstraint,
3586 Sivs.reset(SJ);
3593 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3594 // SJ is an MIV subscript that's part of the current coupled group
3595 DEBUG(dbgs() << "\tSJ = " << SJ << "\n");
3596 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops,
3600 Pair[SJ].Classification =
3601 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()),
3602 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()),
3603 Pair[SJ].Loops);
3604 switch (Pair[SJ].Classification) {
3607 if (testZIV(Pair[SJ].Src, Pair[SJ].Dst, Result))
3609 Mivs.reset(SJ);
3612 Sivs.set(SJ);
3613 Mivs.reset(SJ);
3627 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3628 if (Pair[SJ].Classification == Subscript::RDIV) {
3630 if (testRDIV(Pair[SJ].Src, Pair[SJ].Dst, Result))
3633 Mivs.reset(SJ);
3640 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3641 if (Pair[SJ].Classification == Subscript::MIV) {
3643 if (testMIV(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, Result))
3652 for (int SJ = ConstrainedLevels.find_first(); SJ >= 0;
3653 SJ = ConstrainedLevels.find_next(SJ)) {
3654 if (SJ > (int)CommonLevels)
3656 updateDirection(Result.DV[SJ - 1], Constraints[SJ]);
3657 if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE)
3841 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {
3843 Intersection &= Pair[SJ].GroupLoops;
3846 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops;
3848 Pair[SJ].Group |= Pair[SI].Group;
3897 for (int SJ = Group.find_first(); SJ >= 0; SJ = Group.find_next(SJ)) {
3898 if (Pair[SJ].Classification == Subscript::SIV)
3899 Sivs.set(SJ);
3901 Mivs.set(SJ);
3905 for (int SJ = Sivs.find_first(); SJ >= 0; SJ = Sivs.find_next(SJ)) {
3906 // SJ is an SIV subscript that's part of the current coupled group
3909 (void) testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level,
3916 Sivs.reset(SJ);
3920 for (int SJ = Mivs.find_first(); SJ >= 0; SJ = Mivs.find_next(SJ)) {
3921 // SJ is an MIV subscript that's part of the current coupled group
3922 if (propagate(Pair[SJ].Src, Pair[SJ].Dst,
3923 Pair[SJ].Loops, Constraints, Result.Consistent)) {
3924 Pair[SJ].Classification =
3925 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()),
3926 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()),
3927 Pair[SJ].Loops);
3928 switch (Pair[SJ].Classification) {
3930 Mivs.reset(SJ);
3933 Sivs.set(SJ);
3934 Mivs.reset(SJ);
