Transforms/Scalar/LoopRerollPass.cpp

254       bool isPairInSame(Instruction *J1, Instruction *J2) {
257           DenseMap<Instruction *, int>::iterator J2I = PossibleRedIdx.find(J2);
268       void recordPair(Instruction *J1, Instruction *J2, unsigned i) {
270           assert(PossibleRedIdx.count(J2) &&
274           PossibleRedIter[J2] = i;
277           assert(Idx == PossibleRedIdx[J2] &&
863     for (BasicBlock::iterator J1 = Header->begin(), J2 = Header->begin(),
874       while (J2 != JE && (!RootUseSet.count(J2) ||
875              std::find(Roots[i].begin(), Roots[i].end(), J2) !=
881         if (!isa<PHINode>(J2) && !BaseUseSet.count(J2) &&
882             !AllRootUses.count(J2)) {
883           if (J2->mayWriteToMemory())
884             AST.add(J2);
890           if (!isSimpleLoadStore(J2) && !isSafeToSpeculativelyExecute(J2, DL))
894         ++J2;
897       if (!J1->isSameOperationAs(J2)) {
899                         " vs. " << *J2 << "\n");
907       if (BaseUseSet.count(J2) || AllRootUses.count(J2)) {
909                         " vs. " << *J2 << " (prev. case overlap)\n");
917       if (J2->mayReadFromMemory()) {
920           if (K->aliasesUnknownInst(J2, *AA)) {
922                             " vs. " << *J2 << " (depends on future store)\n");
935              (!isSimpleLoadStore(J2) && !isSafeToSpeculativelyExecute(J2)))) {
937                         " vs. " << *J2 <<
953       bool InReduction = Reductions.isPairInSame(J1, J2);
958           Value *Op2 = J2->getOperand(j);
965               if (Reductions.isPairInSame(J2, Op2I))
986                               " vs. " << *J2 << " (operand " << j << ")\n");
997           (!PossibleRedLastSet.count(J2) && hasUsesOutsideLoop(J2, L))) {
999                         " vs. " << *J2 << " (uses outside loop)\n");
1005         BaseMap.insert(std::pair<Value *, Value *>(J2, J1));
1007       AllRootUses.insert(J2);
1008       Reductions.recordPair(J1, J2, i+1);
1010       ++J2;