| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/MCA/ |
| H A D | SourceMgr.h | 32 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-13.1/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.h | 241 void pruneEdges(unsigned Iterations);
244 unsigned Iterations);
270 void finalizeGraph(unsigned Iterations) { in finalizeGraph() argument
272 pruneEdges(Iterations); in finalizeGraph()
274 propagateThroughEdges(RootSet, Iterations); in finalizeGraph()
292 unsigned Iterations; variable
329 ArrayRef<MCInst> Sequence, unsigned Iterations);
|
| H A D | SummaryView.cpp | 70 TempStream << "Iterations: " << DV.Iterations; in printView()
88 DV.Iterations = (LastInstructionIdx / DV.Instructions) + 1; in collectData()
89 DV.TotalInstructions = DV.Instructions * DV.Iterations; in collectData()
92 DV.TotalUOps = NumMicroOps * DV.Iterations; in collectData()
102 json::Object JO({{"Iterations", DV.Iterations}, in toJSON()
|
| H A D | TimelineView.cpp | 21 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()
288 const unsigned Iterations = Timeline.size() / Source.size(); in printTimeline() local
289 for (unsigned Iteration = 0; Iteration < Iterations; ++Iteration) { in printTimeline()
|
| H A D | BottleneckAnalysis.cpp | 169 void DependencyGraph::pruneEdges(unsigned Iterations) { in pruneEdges() argument
176 if (Edge.Frequency == Iterations) in pruneEdges()
178 double Factor = (double)Edge.Frequency / Iterations; in pruneEdges()
202 unsigned Iterations) { in propagateThroughEdges() argument
381 FOS << " [ probability: " << ((DE->Frequency * 100) / Iterations) in printCriticalSequence()
446 DG(S.size() * 3), Iterations(NumIter), TotalCycles(0), in BottleneckAnalysis()
536 if (IID == ((Iterations * Source.size()) - 1)) in onEvent()
537 DG.finalizeGraph(Iterations); in onEvent()
|
| H A D | SummaryView.h | 51 unsigned Iterations; member
|
| H A D | TimelineView.h | 166 llvm::ArrayRef<llvm::MCInst> S, unsigned Iterations,
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 143 int Iterations = -1; member
151 Iterations = -1; in reset()
505 ReuseCandidate.Iterations = Iters; in findValueToReuse()
529 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
535 for (int i = 0; i < Iterations; ++i) { in reuseValue()
561 for (int i = Iterations-1; i >=0 ; --i) { in reuseValue()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 2538 Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations; in banerjeeMIVtest()
2737 if (Bound[K].Iterations) { in findBoundsALL()
2740 Bound[K].Iterations); in findBoundsALL()
2743 Bound[K].Iterations); in findBoundsALL()
2776 if (Bound[K].Iterations) { in findBoundsEQ()
2816 if (Bound[K].Iterations) { in findBoundsLT()
2818 Bound[K].Iterations, SE->getOne(Bound[K].Iterations->getType())); in findBoundsLT()
2860 if (Bound[K].Iterations) { in findBoundsGT()
2862 Bound[K].Iterations, SE->getOne(Bound[K].Iterations->getType())); in findBoundsGT()
2909 CI[K].Iterations = nullptr; in collectCoeffInfo()
[all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DependenceAnalysis.h | 358 const SCEV *Iterations; member
362 const SCEV *Iterations; member
|
| /freebsd-13.1/contrib/llvm-project/llvm/tools/llvm-mca/ |
| H A D | llvm-mca.cpp | 115 static cl::opt<unsigned> Iterations("iterations", variable
564 mca::SourceMgr S(LoweredSequence, PrintInstructionTables ? 1 : Iterations); in main()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | NewGVN.cpp | 3328 unsigned int Iterations = 0; in iterateTouchedInstructions() local
3336 ++Iterations; in iterateTouchedInstructions()
3384 NumGVNMaxIterations = std::max(NumGVNMaxIterations.getValue(), Iterations); in iterateTouchedInstructions()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 22822 int Iterations = TLI.getDivRefinementSteps(VT, MF); in BuildDivEstimate() local
22827 if (Iterations) { in BuildDivEstimate()
22832 for (int i = 0; i < Iterations; ++i) { in BuildDivEstimate()
22835 if (i == Iterations - 1) { in BuildDivEstimate()
22872 unsigned Iterations, in buildSqrtNROneConst() argument
22884 for (unsigned i = 0; i < Iterations; ++i) { in buildSqrtNROneConst()
22913 assert(Iterations > 0); in buildSqrtNRTwoConst()
22917 for (unsigned i = 0; i < Iterations; ++i) { in buildSqrtNRTwoConst()
22926 if (Reciprocal || (i + 1) < Iterations) { in buildSqrtNRTwoConst()
22961 int Iterations = TLI.getSqrtRefinementSteps(VT, MF); in buildSqrtEstimateImpl() local
[all …]
|