Lines Matching refs:Iteration
287 int Iteration : 30; member
306 return PairInfo::getHashValue({S.I, S.Iteration}); in getHashValue()
311 return PairInfo::isEqual({LHS.I, LHS.Iteration}, {RHS.I, RHS.Iteration}); in isEqual()
400 auto AddCostRecursively = [&](Instruction &RootI, int Iteration) { in analyzeLoopUnrollCost() argument
401 assert(Iteration >= 0 && "Cannot have a negative iteration!"); in analyzeLoopUnrollCost()
409 for (;; --Iteration) { in analyzeLoopUnrollCost()
415 auto CostIter = InstCostMap.find({I, Iteration, 0, 0}); in analyzeLoopUnrollCost()
434 if (Iteration == 0) in analyzeLoopUnrollCost()
451 << Iteration << "): "); in analyzeLoopUnrollCost()
474 assert(Iteration > 0 && in analyzeLoopUnrollCost()
496 for (unsigned Iteration = 0; Iteration < TripCount; ++Iteration) { in analyzeLoopUnrollCost() local
497 LLVM_DEBUG(dbgs() << " Analyzing iteration " << Iteration << "\n"); in analyzeLoopUnrollCost()
513 Iteration == 0 ? L->getLoopPreheader() : L->getLoopLatch()); in analyzeLoopUnrollCost()
514 if (Iteration != 0 && SimplifiedValues.count(V)) in analyzeLoopUnrollCost()
524 UnrolledInstAnalyzer Analyzer(Iteration, SimplifiedValues, SE, L); in analyzeLoopUnrollCost()
549 bool Inserted = InstCostMap.insert({&I, (int)Iteration, in analyzeLoopUnrollCost()
571 AddCostRecursively(I, Iteration); in analyzeLoopUnrollCost()
629 AddCostRecursively(*TI, Iteration); in analyzeLoopUnrollCost()