1245       Instruction *RootInst = RootIt->first;  in validate()  local
1254       if (isRootInst(RootInst)) {  in validate()
1256         Visited.insert(RootInst);  in validate()
1262       if (!BaseInst->isSameOperationAs(RootInst)) {  in validate()
1285                             << *BaseInst << " vs. " << *RootInst << "\n");  in validate()
1290         RootInst = TryIt->first;  in validate()
1322                           << " vs. " << *RootInst << " (prev. case overlap)\n");  in validate()
1329       if (RootInst->mayReadFromMemory())  in validate()
1331           if (K.aliasesUnknownInst(RootInst, *AA)) {  in validate()
1333                               << *BaseInst << " vs. " << *RootInst  in validate()
1345                                 (!isUnorderedLoadStore(RootInst) &&  in validate()
1346                                  !isSafeToSpeculativelyExecute(RootInst)))) {  in validate()
1348                           << " vs. " << *RootInst  in validate()
1363       bool InReduction = Reductions.isPairInSame(BaseInst, RootInst);  in validate()
1368           Value *Op2 = RootInst->getOperand(j);  in validate()
1375               if (Reductions.isPairInSame(RootInst, Op2I))  in validate()
1402                          << " vs. " << *RootInst << " (operand " << j << ")\n");  in validate()
1413           (!PossibleRedLastSet.count(RootInst) &&  in validate()
1414            hasUsesOutsideLoop(RootInst, L))) {  in validate()
1416                           << " vs. " << *RootInst << " (uses outside loop)\n");  in validate()
1420       Reductions.recordPair(BaseInst, RootInst, Iter);  in validate()
1421       BaseMap.insert(std::make_pair(RootInst, BaseInst));  in validate()
1425       Visited.insert(RootInst);  in validate()