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

  /src/external/apache2/llvm/dist/llvm/lib/MCA/
Pipeline.cpp 10 /// This file implements an ordered container of stages that simulate the
27 for (auto &S : Stages)
32 return any_of(Stages, [](const std::unique_ptr<Stage> &S) {
38 assert(!Stages.empty() && "Unexpected empty pipeline found!");
53 // Update stages before we start processing new instructions.
54 for (auto I = Stages.rbegin(), E = Stages.rend(); I != E && !Err; ++I) {
61 Stage &FirstStage = *Stages[0];
65 // Update stages in preparation for a new cycle.
66 for (const std::unique_ptr<Stage> &S : Stages) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/MC/
MCInstrItineraries.h 10 // itineraries, stages, and operand reads/writes. This is used by
11 // schedulers to determine instruction stages and latencies.
47 /// indicate that the instruction requires multiple stages at the
95 /// This includes a set of stages occupied by the instruction and the pipeline
113 const InstrStage *Stages = nullptr; ///< Array of stages selected
122 : SchedModel(SM), Stages(S), OperandCycles(OS), Forwardings(F),
137 return Stages + StageIdx;
143 return Stages + StageIdx;
147 /// the maximum completion time for any stage in the itinerary. If no stages
    [all...]
MCSubtargetInfo.h 88 const InstrStage *Stages; // Instruction itinerary stages
  /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/
Pipeline.h 10 /// This file implements an ordered container of stages that simulate the
18 #include "llvm/MCA/Stages/Stage.h"
54 /// An ordered list of stages that define this instruction pipeline.
55 SmallVector<std::unique_ptr<Stage>, 8> Stages;
  /src/external/apache2/llvm/lib/libLLVMMCA/
Makefile 27 .PATH: ${LLVM_SRCDIR}/lib/MCA/Stages
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ModuloSchedule.h 94 /// The number of stages in this schedule (Max(Stage) + 1).
120 /// Return the number of stages contained in this schedule, which is the
181 /// The first element in the pair is the max difference in stages. The
232 /// Return the max. number of stages/iterations that can occur between a
235 std::pair<unsigned, bool> Stages = RegToStageDiff[Reg];
236 if ((int)CurStage > Schedule.getNumStages() - 1 && Stages.first == 0 &&
237 Stages.second)
239 return Stages.first;
242 /// The number of stages for a Phi is a little different than other
246 /// Phi in the same stage. This function returns the number of stages
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/MC/
MCSubtargetInfo.cpp 235 WriteLatencyTable(WL), ReadAdvanceTable(RA), Stages(IS),
330 return InstrItineraryData(SchedModel, Stages, OperandCycles, ForwardingPaths);
334 InstrItins = InstrItineraryData(getSchedModel(), Stages, OperandCycles,
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86PartialReduction.cpp 87 // instructions, otherwise we use punpck to emulate zero extend in stages. The
265 unsigned Stages = Log2_32(NumSplits);
266 for (unsigned s = Stages; s > 0; --s) {
319 unsigned Stages = Log2_32(NumElems);
320 for (unsigned i = 0; i != Stages; ++i) {
X86ISelLowering.cpp 9884 /// legalization + scalarization stages to need basic support.
11799 // TODO: Add support for matching multiple PACKSS/PACKUS stages.
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachinePipeliner.cpp 108 STATISTIC(NumFailLargeMaxStage, "Pipeliner abort due to too many stages");
125 /// A command line argument to limit the number of stages in the pipeline.
127 SwpMaxStages("pipeliner-max-stages",
128 cl::desc("Maximum stages allowed in the generated scheduled."),
592 << " : too many stages, abort\n");
597 << "Too many stages in schedule: "
600 << ". Refer to -pipeliner-max-stages.";
612 DenseMap<MachineInstr *, int> Cycles, Stages;
619 Stages[SU->getInstr()] = Schedule.stageScheduled(SU);
625 Stages[KV.first] = Stages[KV.second]
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAG.cpp 9832 // Matching failed - attempt to see if we did enough stages that a partial
9860 unsigned Stages = Log2_32(Op.getValueType().getVectorNumElements());
9862 for (unsigned i = 0; i < Stages; ++i) {
9893 // reduction stages.

Completed in 49 milliseconds