Lines Matching refs:SJ

3757       for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {  in depends()  local
3759 Intersection &= Pair[SJ].GroupLoops; in depends()
3762 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops; in depends()
3764 Pair[SJ].Group |= Pair[SI].Group; in depends()
3836 for (unsigned SJ : Group.set_bits()) { in depends() local
3837 LLVM_DEBUG(dbgs() << SJ << " "); in depends()
3838 if (Pair[SJ].Classification == Subscript::SIV) in depends()
3839 Sivs.set(SJ); in depends()
3841 Mivs.set(SJ); in depends()
3842 PairsInGroup.push_back(&Pair[SJ]); in depends()
3848 for (unsigned SJ : Sivs.set_bits()) { in depends() local
3849 LLVM_DEBUG(dbgs() << "testing subscript " << SJ << ", SIV\n"); in depends()
3854 if (testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, Result, NewConstraint, in depends()
3865 Sivs.reset(SJ); in depends()
3872 for (unsigned SJ : Mivs.set_bits()) { in depends() local
3874 LLVM_DEBUG(dbgs() << "\tSJ = " << SJ << "\n"); in depends()
3875 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, in depends()
3879 Pair[SJ].Classification = in depends()
3880 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()), in depends()
3881 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()), in depends()
3882 Pair[SJ].Loops); in depends()
3883 switch (Pair[SJ].Classification) { in depends()
3886 if (testZIV(Pair[SJ].Src, Pair[SJ].Dst, Result)) in depends()
3888 Mivs.reset(SJ); in depends()
3891 Sivs.set(SJ); in depends()
3892 Mivs.reset(SJ); in depends()
3906 for (unsigned SJ : Mivs.set_bits()) { in depends() local
3907 if (Pair[SJ].Classification == Subscript::RDIV) { in depends()
3909 if (testRDIV(Pair[SJ].Src, Pair[SJ].Dst, Result)) in depends()
3912 Mivs.reset(SJ); in depends()
3919 for (unsigned SJ : Mivs.set_bits()) { in depends() local
3920 if (Pair[SJ].Classification == Subscript::MIV) { in depends()
3922 if (testMIV(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops, Result)) in depends()
3931 for (unsigned SJ : ConstrainedLevels.set_bits()) { in depends() local
3932 if (SJ > CommonLevels) in depends()
3934 updateDirection(Result.DV[SJ - 1], Constraints[SJ]); in depends()
3935 if (Result.DV[SJ - 1].Direction == Dependence::DVEntry::NONE) in depends()
4092 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) { in getSplitIteration() local
4094 Intersection &= Pair[SJ].GroupLoops; in getSplitIteration()
4097 Pair[SJ].GroupLoops |= Pair[SI].GroupLoops; in getSplitIteration()
4099 Pair[SJ].Group |= Pair[SI].Group; in getSplitIteration()
4148 for (unsigned SJ : Group.set_bits()) { in getSplitIteration() local
4149 if (Pair[SJ].Classification == Subscript::SIV) in getSplitIteration()
4150 Sivs.set(SJ); in getSplitIteration()
4152 Mivs.set(SJ); in getSplitIteration()
4156 for (unsigned SJ : Sivs.set_bits()) { in getSplitIteration() local
4160 (void) testSIV(Pair[SJ].Src, Pair[SJ].Dst, Level, in getSplitIteration()
4167 Sivs.reset(SJ); in getSplitIteration()
4171 for (unsigned SJ : Mivs.set_bits()) { in getSplitIteration() local
4173 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, in getSplitIteration()
4174 Pair[SJ].Loops, Constraints, Result.Consistent)) { in getSplitIteration()
4175 Pair[SJ].Classification = in getSplitIteration()
4176 classifyPair(Pair[SJ].Src, LI->getLoopFor(Src->getParent()), in getSplitIteration()
4177 Pair[SJ].Dst, LI->getLoopFor(Dst->getParent()), in getSplitIteration()
4178 Pair[SJ].Loops); in getSplitIteration()
4179 switch (Pair[SJ].Classification) { in getSplitIteration()
4181 Mivs.reset(SJ); in getSplitIteration()
4184 Sivs.set(SJ); in getSplitIteration()
4185 Mivs.reset(SJ); in getSplitIteration()