HomeSort by relevance Sort by last modified time
    Searched defs:Cycles (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Target/X86/
X86PadShortFunction.cpp 40 // Cycles - Number of cycles until return if HasReturn is true, otherwise
41 // number of cycles until end of the BB
42 unsigned int Cycles;
44 VisitedBBInfo() : HasReturn(false), Cycles(0) {}
45 VisitedBBInfo(bool HasReturn, unsigned int Cycles)
46 : HasReturn(HasReturn), Cycles(Cycles) {}
62 unsigned int Cycles = 0);
65 unsigned int &Cycles);
    [all...]
  /external/llvm/include/llvm/CodeGen/
MachineTraceMetrics.h 36 // cycles required to execute the trace when execution is limited by data
38 // of cycles required to execute all instructions in the trace when ignoring
41 // Every instruction in the current block has a slack - the number of cycles
110 /// Get the scaled number of cycles used per processor resource in MBB.
206 /// Critical path length. This is the number of cycles in the longest data
228 /// Minimum number of cycles from this instruction is issued to the of the
252 /// This is the number of cycles required to execute all instructions from
258 /// Return the resource length of the trace. This is the number of cycles
278 return TE.Cycles.lookup(MI);
281 /// Return the slack of MI. This is the number of cycles MI can be delaye
    [all...]
  /external/llvm/include/llvm/MC/
MCSchedule.h 38 // their resource some fixed number of cycles after dispatch (e.g. for
49 /// scheduling class for the specified number of cycles.
52 unsigned Cycles;
55 return ProcResourceIdx == Other.ProcResourceIdx && Cycles == Other.Cycles;
59 /// Specify the latency in cpu cycles for a particular scheduling class and def
65 int Cycles;
69 return Cycles == Other.Cycles && WriteResourceID == Other.WriteResourceID;
73 /// Specify the number of cycles allowed after instruction issue before
    [all...]
  /external/llvm/utils/TableGen/
SubtargetEmitter.cpp 90 void ExpandProcResources(RecVec &PRVec, std::vector<int64_t> &Cycles,
306 // Form string as ,{ cycles, u1 | u2 | ... | un, timeinc, kind }
307 int Cycles = Stage->getValueAsInt("Cycles");
308 ItinString += " { " + itostr(Cycles) + ", ";
335 // number of operands that has cycles specified.
436 // operand cycles, and pipepine bypess tables. Then add the new Itinerary
487 // Emit as { cycles, u1 | u2 | ... | un, timeinc }, // indices
535 // Closing operand cycles
536 OperandCycleTable += " 0 // End operand cycles\n"
    [all...]

Completed in 40 milliseconds