HomeSort by: relevance | last modified time | path
    Searched refs:Iteration (Results 1 - 13 of 13) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopUnrollAnalyzer.h 48 UnrolledInstAnalyzer(unsigned Iteration,
52 IterationNumber = SE.getConstant(APInt(64, Iteration));
68 /// iteration.
72 /// constant-fold on the given iteration.
75 /// of simplified values specific to this iteration. The idea is to propagate
  /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/
TimelineView.cpp 218 unsigned Iteration,
220 if (Iteration == 0 && SourceIndex == 0)
222 OS << '[' << Iteration << ',' << SourceIndex << ']';
288 for (unsigned Iteration = 0; Iteration < Iterations; ++Iteration) {
295 printTimelineViewEntry(FOS, Entry, Iteration, SourceIndex);
TimelineView.h 37 /// The first element of the pair is the iteration index, while the second
59 /// at iteration 0 was dispatched at cycle 0, and was retired at cycle 3.
148 const TimelineViewEntry &E, unsigned Iteration,
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopUnrollPass.cpp 106 "unroll-max-iteration-count-to-analyze", cl::init(10), cl::Hidden,
277 /// each iteration.
284 int Iteration : 30;
303 return PairInfo::getHashValue({S.I, S.Iteration});
308 return PairInfo::isEqual({LHS.I, LHS.Iteration}, {RHS.I, RHS.Iteration});
331 /// given iteration its condition would be resolved to true, we won't add up the
373 // We track the simplification of each instruction in each iteration. We use
387 auto AddCostRecursively = [&](Instruction &RootI, int Iteration) {
388 assert(Iteration >= 0 && "Cannot have a negative iteration!")
    [all...]
GVN.cpp 1546 // Blocks that dominate the latch execute on every single iteration, maybe
1549 // iteration are sometimes much colder than the header, and this is when
2193 // LHS then it will be turned into RHS by the next GVN iteration anyway, so
2471 unsigned Iteration = 0;
2473 LLVM_DEBUG(dbgs() << "GVN iteration: " << Iteration << "\n");
2476 ++Iteration;
2497 // iteration.
2843 /// iteration that may enable further optimization.
2863 /// Executes one iteration of GV
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CallGraphSCCPass.cpp 532 // Because of this, we allow iteration up to a specified iteration count.
535 // iteration count limit in case there is crazy code.
536 unsigned Iteration = 0;
539 LLVM_DEBUG(if (Iteration) dbgs()
540 << " SCCPASSMGR: Re-visiting SCC, iteration #" << Iteration
544 } while (Iteration++ < MaxDevirtIterations && DevirtualizedCall);
547 LLVM_DEBUG(dbgs() << " CGSCCPASSMGR: Stopped iteration after "
548 << Iteration
    [all...]
CGSCCPassManager.cpp 417 for (int Iteration = 0;; ++Iteration) {
429 // CGSCC layer handle any iteration to reflect the refined structure.
454 // the next iteration.
485 if (Iteration >= MaxIterations) {
512 // not after the last iteration.
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
FlattenCFG.cpp 282 bool Iteration = true;
307 Iteration = false;
312 } while (Iteration);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstructionCombining.cpp 1933 // the value of the previous iteration needs to be stored in the meantime,
1936 // loop iteration).
1984 // Sink down a layer of the type for the next iteration.
3982 unsigned Iteration = 0;
3985 ++Iteration;
3987 if (Iteration > InfiniteLoopDetectionThreshold) {
3993 if (Iteration > MaxIterations) {
3994 LLVM_DEBUG(dbgs() << "\n\n[IC] Iteration limit #" << MaxIterations
4000 LLVM_DEBUG(dbgs() << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/
CoroFrame.cpp 235 int Iteration = 0;
236 (void)Iteration;
240 LLVM_DEBUG(dbgs() << "iteration " << ++Iteration);
2094 /// This happens during the all-instructions iteration, so it must not
2188 // iteration pattern.
2641 // besides AI, and it doesn't invalidate the iteration because we delay
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ModuloSchedule.cpp 118 // the iteration, or stage, that the instruction is scheduled in. This is
776 /// that has uses past the definition in the next iteration. A copy with a new
910 /// during each iteration. Set Delta to the amount of the change.
1435 // The consumer optionally consumes LoopProducer in the same iteration
1763 // instructions of a previous loop iteration.
1768 // Keep track at which iteration each phi belongs to. We need it to know
1777 int Iteration = J;
1780 for (size_t K = Iteration; K > I; K--)
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
AttributorAttributes.cpp 276 int Iteration = 0;
290 if (Iteration++ >= MaxValues)
351 if (!VisitValueCB(*V, CtxI, State, Iteration > 1))
1213 // we have to be careful and iterate until this iteration is complete. The
  /src/external/apache2/llvm/dist/llvm/bindings/ocaml/llvm/
llvm.mli 383 (** {6 Iteration} *)
386 of [a]. [llpos] is used to specify positions in and for forward iteration
393 of [a]. [llrev_pos] is used for reverse iteration through the various value

Completed in 37 milliseconds