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

  /src/external/apache2/llvm/dist/llvm/include/llvm/MC/
MCInstrItineraries.h 101 uint16_t LastStage; ///< Index of last + 1 stage in itinerary
131 (Itineraries[ItinClassIndx].LastStage == UINT16_MAX));
142 unsigned StageIdx = Itineraries[ItinClassIndx].LastStage;
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
GCNSchedStrategy.h 80 LastStage = ClusteredLowOccupancyReschedule
GCNSchedStrategy.cpp 643 } while (Stage != LastStage);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ModuloSchedule.h 190 void generateProlog(unsigned LastStage, MachineBasicBlock *KernelBB,
192 void generateEpilog(unsigned LastStage, MachineBasicBlock *KernelBB,
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ModuloSchedule.cpp 190 void ModuloScheduleExpander::generateProlog(unsigned LastStage,
200 for (unsigned i = 0; i < LastStage; ++i) {
248 void ModuloScheduleExpander::generateEpilog(unsigned LastStage,
275 int EpilogStage = LastStage + 1;
276 for (unsigned i = LastStage; i >= 1; --i, ++EpilogStage) {
289 for (unsigned StageNum = i; StageNum <= LastStage; ++StageNum) {
305 InstrMap, LastStage, EpilogStage, i == 1);
307 LastStage, EpilogStage, i == 1);
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/MCTargetDesc/
HexagonMCInstrInfo.cpp 429 int Size = II[SchedClass].LastStage - II[SchedClass].FirstStage;
435 unsigned Stage = II[SchedClass].LastStage - 1;
465 Stage < II[SchedClass].LastStage; ++Stage) {
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
SubtargetEmitter.cpp 590 // { firstStage, lastStage, firstCycle, lastCycle } // index
594 Intinerary.LastStage << ", " <<

Completed in 25 milliseconds