Lines Matching refs:Iteration
283 int Iteration : 30;
302 return PairInfo::getHashValue({S.I, S.Iteration});
307 return PairInfo::isEqual({LHS.I, LHS.Iteration}, {RHS.I, RHS.Iteration});
386 auto AddCostRecursively = [&](Instruction &RootI, int Iteration) {
387 assert(Iteration >= 0 && "Cannot have a negative iteration!");
391 for (;; --Iteration) {
395 // InstCostMap only uses I and Iteration as a key, the other two values
397 auto CostIter = InstCostMap.find({I, Iteration, 0, 0});
416 if (Iteration == 0)
433 << Iteration << "): ");
456 assert(Iteration > 0 &&
475 for (unsigned Iteration = 0; Iteration < TripCount; ++Iteration) {
476 LLVM_DEBUG(dbgs() << " Analyzing iteration " << Iteration << "\n");
492 Iteration == 0 ? L->getLoopPreheader() : L->getLoopLatch());
494 if (Iteration != 0 && !C)
505 UnrolledInstAnalyzer Analyzer(Iteration, SimplifiedValues, SE, L);
530 bool Inserted = InstCostMap.insert({&I, (int)Iteration,
552 AddCostRecursively(I, Iteration);
606 AddCostRecursively(*TI, Iteration);