Lines Matching refs:SJ
3638 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) { in depends() local
3640 Intersection &= Pair[SJ].GroupLoops; in depends()
3643 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops; in depends()
3645 Pair[SJ].Group |= Pair[SI].Group; in depends()
3717 for (unsigned SJ : Group.set_bits()) { in depends() local
3718 LLVM_DEBUG(dbgs() << SJ << " "); in depends()
3719 if (Pair[SJ].Classification == Subscript::SIV) in depends()
3720 Sivs.set(SJ); in depends()
3722 Mivs.set(SJ); in depends()
3723 PairsInGroup.push_back(&Pair[SJ]); in depends()
3729 for (unsigned SJ : Sivs.set_bits()) { in depends() local
3730 LLVM_DEBUG(dbgs() << "testing subscript " << SJ << ", SIV\n"); in depends()
3735 if (testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, Result, NewConstraint, in depends()
3746 Sivs.reset(SJ); in depends()
3753 for (unsigned SJ : Mivs.set_bits()) { in depends() local
3755 LLVM_DEBUG(dbgs() << "\tSJ = " << SJ << "\n"); in depends()
3756 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, in depends()
3760 Pair[SJ].Classification = in depends()
3761 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()), in depends()
3762 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()), in depends()
3763 Pair[SJ].Loops); in depends()
3764 switch (Pair[SJ].Classification) { in depends()
3767 if (testZIV(Pair[SJ].Src, Pair[SJ].Dst, Result)) in depends()
3769 Mivs.reset(SJ); in depends()
3772 Sivs.set(SJ); in depends()
3773 Mivs.reset(SJ); in depends()
3787 for (unsigned SJ : Mivs.set_bits()) { in depends() local
3788 if (Pair[SJ].Classification == Subscript::RDIV) { in depends()
3790 if (testRDIV(Pair[SJ].Src, Pair[SJ].Dst, Result)) in depends()
3793 Mivs.reset(SJ); in depends()
3800 for (unsigned SJ : Mivs.set_bits()) { in depends() local
3801 if (Pair[SJ].Classification == Subscript::MIV) { in depends()
3803 if (testMIV(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, Result)) in depends()
3812 for (unsigned SJ : ConstrainedLevels.set_bits()) { in depends() local
3813 if (SJ > CommonLevels) in depends()
3815 updateDirection(Result.DV[SJ - 1], Constraints[SJ]); in depends()
3816 if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE) in depends()
3973 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) { in getSplitIteration() local
3975 Intersection &= Pair[SJ].GroupLoops; in getSplitIteration()
3978 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops; in getSplitIteration()
3980 Pair[SJ].Group |= Pair[SI].Group; in getSplitIteration()
4029 for (unsigned SJ : Group.set_bits()) { in getSplitIteration() local
4030 if (Pair[SJ].Classification == Subscript::SIV) in getSplitIteration()
4031 Sivs.set(SJ); in getSplitIteration()
4033 Mivs.set(SJ); in getSplitIteration()
4037 for (unsigned SJ : Sivs.set_bits()) { in getSplitIteration() local
4041 (void) testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, in getSplitIteration()
4048 Sivs.reset(SJ); in getSplitIteration()
4052 for (unsigned SJ : Mivs.set_bits()) { in getSplitIteration() local
4054 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, in getSplitIteration()
4055 Pair[SJ].Loops, Constraints, Result.Consistent)) { in getSplitIteration()
4056 Pair[SJ].Classification = in getSplitIteration()
4057 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()), in getSplitIteration()
4058 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()), in getSplitIteration()
4059 Pair[SJ].Loops); in getSplitIteration()
4060 switch (Pair[SJ].Classification) { in getSplitIteration()
4062 Mivs.reset(SJ); in getSplitIteration()
4065 Sivs.set(SJ); in getSplitIteration()
4066 Mivs.reset(SJ); in getSplitIteration()