Searched refs:Iteration (Results 1 - 13 of 13) sorted by relevance
| /freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LoopUnrollAnalyzer.h | 48 UnrolledInstAnalyzer(unsigned Iteration, argument
52 IterationNumber = SE.getConstant(APInt(64, Iteration));
|
| H A D | CGSCCPassManager.h | 610 for (int Iteration = 0;; ++Iteration) {
689 if (Iteration >= MaxIterations) {
|
| /freebsd-12-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
| H A D | TimelineView.cpp | 229 unsigned Iteration,
231 if (Iteration == 0 && SourceIndex == 0)
233 OS << '[' << Iteration << ',' << SourceIndex << ']';
301 for (unsigned Iteration = 0; Iteration < Iterations; ++Iteration) {
308 printTimelineViewEntry(FOS, Entry, Iteration, SourceIndex);
227 printTimelineViewEntry(formatted_raw_ostream &OS, const TimelineViewEntry &Entry, unsigned Iteration, unsigned SourceIndex) const argument
|
| H A D | TimelineView.h | 151 const TimelineViewEntry &E, unsigned Iteration,
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopUnrollPass.cpp | 283 int Iteration : 30; member in struct:__anon5686::UnrolledInstState
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
[all...] |
| H A D | GVN.cpp | 2143 unsigned Iteration = 0; local
2145 LLVM_DEBUG(dbgs() << "GVN iteration: " << Iteration << "\n");
2148 ++Iteration;
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CallGraphSCCPass.cpp | 490 unsigned Iteration = 0; local
493 LLVM_DEBUG(if (Iteration) dbgs()
494 << " SCCPASSMGR: Re-visiting SCC, iteration #" << Iteration
498 } while (Iteration++ < MaxIterations && DevirtualizedCall);
502 << Iteration
505 MaxSCCIterations.updateMax(Iteration);
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FlattenCFG.cpp | 282 bool Iteration = true; local
307 Iteration = false;
312 } while (Iteration);
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | CoroFrame.cpp | 214 int Iteration = 0; local
215 (void)Iteration;
219 LLVM_DEBUG(dbgs() << "iteration " << ++Iteration);
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstructionCombining.cpp | 3592 unsigned Iteration = 0; local
3594 ++Iteration;
3596 if (Iteration > InfiniteLoopDetectionThreshold) {
3602 if (Iteration > MaxIterations) {
3603 LLVM_DEBUG(dbgs() << "\n\n[IC] Iteration limit #" << MaxIterations
3609 LLVM_DEBUG(dbgs() << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ModuloSchedule.cpp | 1765 int Iteration = J; local
1768 for (size_t K = Iteration; K > I; K--)
|
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | Attributor.cpp | 283 int Iteration = 0; local
293 if (Iteration++ >= MaxValues)
339 if (!VisitValueCB(*V, State, Iteration > 1))
5866 LLVM_DEBUG(dbgs() << "\n\n[Attributor] #Iteration: " << IterationCounter
5913 LLVM_DEBUG(dbgs() << "[Attributor] #Iteration: " << IterationCounter
|
| /freebsd-12-stable/contrib/googletest/googlemock/test/ |
| H A D | gmock-matchers_test.cc | 5309 TEST(StreamlikeTest, Iteration) {
|
Completed in 188 milliseconds