Home
last modified time | relevance | path

Searched refs:Iterations (Results 1 – 10 of 10) sorted by relevance

/freebsd-12.1/contrib/llvm/include/llvm/MCA/
H A DSourceMgr.h32 const unsigned Iterations; variable
37 : Sequence(S), Current(0), Iterations(Iter ? Iter : DefaultIterations) {} in SourceMgr()
39 unsigned getNumIterations() const { return Iterations; } in getNumIterations()
41 bool hasNext() const { return Current < (Iterations * Sequence.size()); } in hasNext()
/freebsd-12.1/contrib/llvm/tools/llvm-mca/Views/
H A DSummaryView.cpp65 unsigned Iterations = (LastInstructionIdx / Instructions) + 1; in printView() local
66 unsigned TotalInstructions = Instructions * Iterations; in printView()
67 unsigned TotalUOps = NumMicroOps * Iterations; in printView()
75 TempStream << "Iterations: " << Iterations; in printView()
H A DTimelineView.cpp21 llvm::ArrayRef<llvm::MCInst> S, unsigned Iterations, in TimelineView() argument
27 assert(Iterations && "Invalid number of iterations specified!"); in TimelineView()
28 NumInstructions *= Iterations; in TimelineView()
269 const unsigned Iterations = Timeline.size() / Source.size(); in printTimeline() local
270 for (unsigned Iteration = 0; Iteration < Iterations; ++Iteration) { in printTimeline()
H A DTimelineView.h169 llvm::ArrayRef<llvm::MCInst> S, unsigned Iterations,
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp472 int Iterations = -1; in reuseValue() local
485 if (Iterations == -1) in reuseValue()
486 Iterations = D->iterations(); in reuseValue()
487 assert(Iterations == D->iterations() && "Iterations mismatch"); in reuseValue()
495 for (int i = 0; i < Iterations; ++i) { in reuseValue()
521 for (int i = Iterations-1; i >=0 ; --i) { in reuseValue()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp2543 Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations; in banerjeeMIVtest()
2742 if (Bound[K].Iterations) { in findBoundsALL()
2745 Bound[K].Iterations); in findBoundsALL()
2748 Bound[K].Iterations); in findBoundsALL()
2781 if (Bound[K].Iterations) { in findBoundsEQ()
2821 if (Bound[K].Iterations) { in findBoundsLT()
2823 Bound[K].Iterations, SE->getOne(Bound[K].Iterations->getType())); in findBoundsLT()
2865 if (Bound[K].Iterations) { in findBoundsGT()
2867 Bound[K].Iterations, SE->getOne(Bound[K].Iterations->getType())); in findBoundsGT()
2914 CI[K].Iterations = nullptr; in collectCoeffInfo()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h354 const SCEV *Iterations; member
358 const SCEV *Iterations; member
/freebsd-12.1/contrib/llvm/tools/llvm-mca/
H A Dllvm-mca.cpp90 static cl::opt<unsigned> Iterations("iterations", variable
438 mca::SourceMgr S(LoweredSequence, PrintInstructionTables ? 1 : Iterations); in main()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp3370 unsigned int Iterations = 0; in iterateTouchedInstructions() local
3378 ++Iterations; in iterateTouchedInstructions()
3426 NumGVNMaxIterations = std::max(NumGVNMaxIterations.getValue(), Iterations); in iterateTouchedInstructions()
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp18825 int Iterations = TLI.getDivRefinementSteps(VT, MF); in BuildReciprocalEstimate() local
18829 if (Iterations) { in BuildReciprocalEstimate()
18835 for (int i = 0; i < Iterations; ++i) { in BuildReciprocalEstimate()
18862 unsigned Iterations, in buildSqrtNROneConst() argument
18877 for (unsigned i = 0; i < Iterations; ++i) { in buildSqrtNROneConst()
18906 unsigned Iterations, in buildSqrtNRTwoConst() argument
18915 assert(Iterations > 0); in buildSqrtNRTwoConst()
18919 for (unsigned i = 0; i < Iterations; ++i) { in buildSqrtNRTwoConst()
18933 if (Reciprocal || (i + 1) < Iterations) { in buildSqrtNRTwoConst()
18970 int Iterations = TLI.getSqrtRefinementSteps(VT, MF); in buildSqrtEstimateImpl() local
[all …]