| /freebsd/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
382 FOS << " [ probability: " << ((DE->Frequency * 100) / Iterations) in printCriticalSequence()
447 DG(S.size() * 3), Iterations(NumIter), TotalCycles(0), in BottleneckAnalysis()
537 if (IID == ((Iterations * Source.size()) - 1)) in onEvent()
538 DG.finalizeGraph(Iterations); in onEvent()
|
| H A D | SummaryView.h | 16 /// Iterations: 300
50 unsigned Iterations;
51 unsigned Iterations; global() member
|
| H A D | TimelineView.h | 166 llvm::ArrayRef<llvm::MCInst> S, unsigned Iterations,
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/MCA/ |
| H A D | SourceMgr.h | 62 const unsigned Iterations; variable
67 : Sequence(S), Current(0U), Iterations(Iter ? Iter : DefaultIterations) {} in CircularSourceMgr()
71 unsigned getNumIterations() const { return Iterations; } in getNumIterations()
73 return Current < (Iterations * Sequence.size()); in hasNext()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 143 int Iterations = -1; member
151 Iterations = -1; in reset()
502 ReuseCandidate.Iterations = Iters; in findValueToReuse()
526 int Iterations = ReuseCandidate.Iterations; in reuseValue() local
532 for (int i = 0; i < Iterations; ++i) { in reuseValue()
558 for (int i = Iterations-1; i >=0 ; --i) { in reuseValue()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopPeel.cpp | 228 PeelCounter Iterations = calculate(*Input); in calculate() local
229 assert(IterationsToInvariance[Input] == Iterations && in calculate()
231 return (IterationsToInvariance[Phi] = addOne(Iterations)); in calculate()
256 unsigned Iterations = 0; in calculateIterationsToPeel() local
261 Iterations = std::max(Iterations, *ToInvariance); in calculateIterationsToPeel()
262 if (Iterations == MaxIterations) in calculateIterationsToPeel()
266 assert((Iterations <= MaxIterations) && "bad result in phi analysis"); in calculateIterationsToPeel()
267 return Iterations ? std::optional<unsigned>(Iterations) : std::nullopt; in calculateIterationsToPeel()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 2623 Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations; in banerjeeMIVtest()
2835 if (Bound[K].Iterations) { in findBoundsALL()
2838 Bound[K].Iterations); in findBoundsALL()
2841 Bound[K].Iterations); in findBoundsALL()
2874 if (Bound[K].Iterations) { in findBoundsEQ()
2878 SE->getMulExpr(NegativePart, Bound[K].Iterations); in findBoundsEQ()
2881 SE->getMulExpr(PositivePart, Bound[K].Iterations); in findBoundsEQ()
2914 if (Bound[K].Iterations) { in findBoundsLT()
2916 Bound[K].Iterations, SE->getOne(Bound[K].Iterations->getType())); in findBoundsLT()
2958 if (Bound[K].Iterations) { in findBoundsGT()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
| H A D | WatchedLiteralsSolver.cpp | 412 auto [Res, Iterations] = WatchedLiteralsSolverImpl(Vals).solve(MaxIterations); in solve()
413 MaxIterations = Iterations; in solve()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DependenceAnalysis.h | 379 const SCEV *Iterations; member
383 const SCEV *Iterations; member
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-mca/ |
| H A D | llvm-mca.cpp | 113 static cl::opt<unsigned> Iterations("iterations", variable
665 PrintInstructionTables ? 1 : Iterations); in main()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SelectOptimize.cpp | 1171 const unsigned Iterations = 2; in computeLoopCosts() local
1172 for (unsigned Iter = 0; Iter < Iterations; ++Iter) { in computeLoopCosts()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | NewGVN.cpp | 3365 uint64_t Iterations = 0; in iterateTouchedInstructions() local
3373 ++Iterations; in iterateTouchedInstructions()
3423 NumGVNMaxIterations = std::max(NumGVNMaxIterations.getValue(), Iterations); in iterateTouchedInstructions()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 646 SDValue buildSqrtNROneConst(SDValue Arg, SDValue Est, unsigned Iterations,
648 SDValue buildSqrtNRTwoConst(SDValue Arg, SDValue Est, unsigned Iterations,
28072 int Iterations = TLI.getDivRefinementSteps(VT, MF); in BuildDivEstimate() local
28073 if (SDValue Est = TLI.getRecipEstimate(Op, DAG, Enabled, Iterations)) { in BuildDivEstimate()
28077 if (Iterations) { in BuildDivEstimate()
28082 for (int i = 0; i < Iterations; ++i) { in BuildDivEstimate()
28085 if (i == Iterations - 1) { in BuildDivEstimate()
28094 (i == Iterations - 1 ? N : FPOne), NewEst, Flags); in BuildDivEstimate()
28122 unsigned Iterations, in buildSqrtNROneConst() argument
28134 for (unsigned i = 0; i < Iterations; ++i) { in buildSqrtNROneConst()
[all …]
|