Lines Matching refs:Iteration
185 int Iteration : 30; member
201 return PairInfo::getHashValue({S.I, S.Iteration}); in getHashValue()
205 return PairInfo::isEqual({LHS.I, LHS.Iteration}, {RHS.I, RHS.Iteration}); in isEqual()
284 auto AddCostRecursively = [&](Instruction &RootI, int Iteration) { in analyzeLoopUnrollCost() argument
285 assert(Iteration >= 0 && "Cannot have a negative iteration!"); in analyzeLoopUnrollCost()
289 for (;; --Iteration) { in analyzeLoopUnrollCost()
295 auto CostIter = InstCostMap.find({I, Iteration, 0, 0}); in analyzeLoopUnrollCost()
314 if (Iteration == 0) in analyzeLoopUnrollCost()
330 DEBUG(dbgs() << "Adding cost of instruction (iteration " << Iteration in analyzeLoopUnrollCost()
354 assert(Iteration > 0 && in analyzeLoopUnrollCost()
373 for (unsigned Iteration = 0; Iteration < TripCount; ++Iteration) { in analyzeLoopUnrollCost() local
374 DEBUG(dbgs() << " Analyzing iteration " << Iteration << "\n"); in analyzeLoopUnrollCost()
390 Iteration == 0 ? L->getLoopPreheader() : L->getLoopLatch()); in analyzeLoopUnrollCost()
392 if (Iteration != 0 && !C) in analyzeLoopUnrollCost()
403 UnrolledInstAnalyzer Analyzer(Iteration, SimplifiedValues, SE, L); in analyzeLoopUnrollCost()
423 bool Inserted = InstCostMap.insert({&I, (int)Iteration, in analyzeLoopUnrollCost()
435 AddCostRecursively(I, Iteration); in analyzeLoopUnrollCost()
494 AddCostRecursively(*TI, Iteration); in analyzeLoopUnrollCost()