Lines Matching refs:Iteration
262 int Iteration : 30; member
281 return PairInfo::getHashValue({S.I, S.Iteration}); in getHashValue()
286 return PairInfo::isEqual({LHS.I, LHS.Iteration}, {RHS.I, RHS.Iteration}); in isEqual()
365 auto AddCostRecursively = [&](Instruction &RootI, int Iteration) { in analyzeLoopUnrollCost() argument
366 assert(Iteration >= 0 && "Cannot have a negative iteration!"); in analyzeLoopUnrollCost()
370 for (;; --Iteration) { in analyzeLoopUnrollCost()
376 auto CostIter = InstCostMap.find({I, Iteration, 0, 0}); in analyzeLoopUnrollCost()
395 if (Iteration == 0) in analyzeLoopUnrollCost()
412 << Iteration << "): "); in analyzeLoopUnrollCost()
435 assert(Iteration > 0 && in analyzeLoopUnrollCost()
454 for (unsigned Iteration = 0; Iteration < TripCount; ++Iteration) { in analyzeLoopUnrollCost() local
455 LLVM_DEBUG(dbgs() << " Analyzing iteration " << Iteration << "\n"); in analyzeLoopUnrollCost()
471 Iteration == 0 ? L->getLoopPreheader() : L->getLoopLatch()); in analyzeLoopUnrollCost()
473 if (Iteration != 0 && !C) in analyzeLoopUnrollCost()
484 UnrolledInstAnalyzer Analyzer(Iteration, SimplifiedValues, SE, L); in analyzeLoopUnrollCost()
509 bool Inserted = InstCostMap.insert({&I, (int)Iteration, in analyzeLoopUnrollCost()
531 AddCostRecursively(I, Iteration); in analyzeLoopUnrollCost()
585 AddCostRecursively(*TI, Iteration); in analyzeLoopUnrollCost()