Lines Matching defs:Iteration

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