293   int Iteration : 30;  member
312     return PairInfo::getHashValue({S.I, S.Iteration});  in getHashValue()
317     return PairInfo::isEqual({LHS.I, LHS.Iteration}, {RHS.I, RHS.Iteration});  in isEqual()
406   auto AddCostRecursively = [&](Instruction &RootI, int Iteration) {  in analyzeLoopUnrollCost()  argument
407     assert(Iteration >= 0 && "Cannot have a negative iteration!");  in analyzeLoopUnrollCost()
415     for (;; --Iteration) {  in analyzeLoopUnrollCost()
421         auto CostIter = InstCostMap.find({I, Iteration, 0, 0});  in analyzeLoopUnrollCost()
440             if (Iteration == 0)  in analyzeLoopUnrollCost()
465                             << Iteration << "): ");  in analyzeLoopUnrollCost()
488       assert(Iteration > 0 &&  in analyzeLoopUnrollCost()
510   for (unsigned Iteration = 0; Iteration < TripCount; ++Iteration) {  in analyzeLoopUnrollCost()  local
511     LLVM_DEBUG(dbgs() << " Analyzing iteration " << Iteration << "\n");  in analyzeLoopUnrollCost()
527           Iteration == 0 ? L->getLoopPreheader() : L->getLoopLatch());  in analyzeLoopUnrollCost()
528       if (Iteration != 0 && SimplifiedValues.count(V))  in analyzeLoopUnrollCost()
538     UnrolledInstAnalyzer Analyzer(Iteration, SimplifiedValues, SE, L);  in analyzeLoopUnrollCost()
563         bool Inserted = InstCostMap.insert({&I, (int)Iteration,  in analyzeLoopUnrollCost()
585           AddCostRecursively(I, Iteration);  in analyzeLoopUnrollCost()
643       AddCostRecursively(*TI, Iteration);  in analyzeLoopUnrollCost()