Lines Matching refs:Pairs
37 // Some non-linear subscript pairs can be handled by the GCD test
77 STATISTIC(TotalArrayPairs, "Array pairs tested");
78 STATISTIC(SeparableSubscriptPairs, "Separable subscript pairs");
79 STATISTIC(CoupledSubscriptPairs, "Coupled subscript pairs");
80 STATISTIC(NonlinearSubscriptPairs, "Nonlinear subscript pairs");
782 void DependenceAnalysis::unifySubscriptType(ArrayRef<Subscript *> Pairs) {
789 for (unsigned i = 0; i < Pairs.size(); i++) {
790 const SCEV *Src = Pairs[i]->Src;
791 const SCEV *Dst = Pairs[i]->Dst;
814 for (unsigned i = 0; i < Pairs.size(); i++) {
815 const SCEV *Src = Pairs[i]->Src;
816 const SCEV *Dst = Pairs[i]->Dst;
827 Pairs[i]->Src = SE->getSignExtendExpr(Src, widestType);
830 Pairs[i]->Dst = SE->getSignExtendExpr(Dst, widestType);
3312 // resize Pair to contain as many pairs of subscripts as the delinearization
3313 // has found, and then initialize the pairs following the delinearization.
3415 unsigned Pairs = UsefulGEP ? SrcGEP->idx_end() - SrcGEP->idx_begin() : 1;
3416 SmallVector<Subscript, 4> Pair(Pairs);
3443 Pairs = Pair.size();
3447 for (unsigned P = 0; P < Pairs; ++P) {
3450 Pair[P].Group.resize(Pairs);
3466 SmallBitVector Separable(Pairs);
3467 SmallBitVector Coupled(Pairs);
3519 // Since Done remains true, we add 2 to the set of Separable pairs.
3526 for (unsigned SI = 0; SI < Pairs; ++SI) {
3544 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {
3619 SmallBitVector Sivs(Pairs);
3620 SmallBitVector Mivs(Pairs);
3731 for (unsigned SI = 0; SI < Pairs; ++SI)
3846 unsigned Pairs = UsefulGEP ? SrcGEP->idx_end() - SrcGEP->idx_begin() : 1;
3847 SmallVector<Subscript, 4> Pair(Pairs);
3869 Pairs = Pair.size();
3873 for (unsigned P = 0; P < Pairs; ++P) {
3876 Pair[P].Group.resize(Pairs);
3886 SmallBitVector Separable(Pairs);
3887 SmallBitVector Coupled(Pairs);
3890 for (unsigned SI = 0; SI < Pairs; ++SI) {
3906 for (unsigned SJ = SI + 1; SJ < Pairs; ++SJ) {
3959 SmallBitVector Sivs(Pairs);
3960 SmallBitVector Mivs(Pairs);
