Lines Matching defs:Iteration

295   int Iteration : 30;
314     return PairInfo::getHashValue({S.I, S.Iteration});
319     return PairInfo::isEqual({LHS.I, LHS.Iteration}, {RHS.I, RHS.Iteration});
408   auto AddCostRecursively = [&](Instruction &RootI, int Iteration) {
409     assert(Iteration >= 0 && "Cannot have a negative iteration!");
417     for (;; --Iteration) {
421         // InstCostMap only uses I and Iteration as a key, the other two values
423         auto CostIter = InstCostMap.find({I, Iteration, 0, 0});
442             if (Iteration == 0)
467                             << Iteration << "): ");
490       assert(Iteration > 0 &&
512   for (unsigned Iteration = 0; Iteration < TripCount; ++Iteration) {
513     LLVM_DEBUG(dbgs() << " Analyzing iteration " << Iteration << "\n");
529           Iteration == 0 ? L->getLoopPreheader() : L->getLoopLatch());
530       if (Iteration != 0 && SimplifiedValues.count(V))
540     UnrolledInstAnalyzer Analyzer(Iteration, SimplifiedValues, SE, L);
565         bool Inserted = InstCostMap.insert({&I, (int)Iteration,
587           AddCostRecursively(I, Iteration);
645       AddCostRecursively(*TI, Iteration);