1220       Instruction *RootInst = RootIt->first;  in validate()  local
1229       if (isRootInst(RootInst)) {  in validate()
1231         Visited.insert(RootInst);  in validate()
1237       if (!BaseInst->isSameOperationAs(RootInst)) {  in validate()
1260                 " vs. " << *RootInst << "\n");  in validate()
1265         RootInst = TryIt->first;  in validate()
1297                         " vs. " << *RootInst << " (prev. case overlap)\n");  in validate()
1304       if (RootInst->mayReadFromMemory())  in validate()
1306           if (K.aliasesUnknownInst(RootInst, *AA)) {  in validate()
1308                             " vs. " << *RootInst << " (depends on future store)\n");  in validate()
1319                                 (!isSimpleLoadStore(RootInst) &&  in validate()
1320                                  !isSafeToSpeculativelyExecute(RootInst)))) {  in validate()
1322                         " vs. " << *RootInst <<  in validate()
1337       bool InReduction = Reductions.isPairInSame(BaseInst, RootInst);  in validate()
1342           Value *Op2 = RootInst->getOperand(j);  in validate()
1349               if (Reductions.isPairInSame(RootInst, Op2I))  in validate()
1375                     << " vs. " << *RootInst << " (operand " << j << ")\n");  in validate()
1386           (!PossibleRedLastSet.count(RootInst) &&  in validate()
1387            hasUsesOutsideLoop(RootInst, L))) {  in validate()
1389                         " vs. " << *RootInst << " (uses outside loop)\n");  in validate()
1393       Reductions.recordPair(BaseInst, RootInst, Iter);  in validate()
1394       BaseMap.insert(std::make_pair(RootInst, BaseInst));  in validate()
1398       Visited.insert(RootInst);  in validate()