HomeSort by relevance Sort by last modified time
    Searched refs:Latency (Results 1 - 16 of 16) sorted by null

  /external/llvm/include/llvm/MC/
MCInstrItineraries.h 156 /// getStageLatency - Return the total stage latency of the given
157 /// class. The latency is the maximum completion time for any stage
168 unsigned Latency = 0, StartCycle = 0;
171 Latency = std::max(Latency, StartCycle + IS->getCycles());
174 return Latency;
215 /// getOperandLatency - Compute and return the use operand latency of a given
  /external/llvm/lib/CodeGen/
TargetSchedule.cpp 26 cl::desc("Use TargetSchedModel for latency lookup"));
29 cl::desc("Use InstrItineraryData for latency lookup"));
92 // The machine model may explicitly specify an invalid latency, which
93 // effectively means infinite latency. Since users of the TargetSchedule API
94 // don't know how to handle this, we convert it to a very large latency that is
175 // No operand latency was found.
178 // Expected latency is the max of the stage latency and itinerary props.
179 // Rather than directly querying InstrItins stage latency, we call a TII
180 // hook to allow subtargets to specialize latency. This hook is onl
    [all...]
MachineScheduler.cpp     [all...]
CriticalAntiDepBreaker.cpp 135 // In the case of a latency tie, prefer an anti-dependency edge over
426 if (!Max || SU->getDepth() + SU->Latency > Max->getDepth() + Max->Latency)
432 DEBUG(dbgs() << "Critical path has total latency "
433 << (Max->getDepth() + Max->Latency) << "\n");
ScheduleDAGInstrs.cpp 202 /// especially important when the definition latency of the return value(s)
260 // Adjust the dependence latency using operand def/use information,
292 // dependencies we use a latency of 0 because for a multi-issue
295 // TODO: Using a latency of 1 here for output dependencies assumes
382 // is also useful if output latency exceeds def-use latency.
423 // Adjust the dependence latency using operand def/use information, then
680 // Assign the Latency field of SU using target-provided information.
681 SU->Latency = SchedModel.computeInstrLatency(SU->getInstr());
773 // dependence edge to ExitSU to model the live-out latency. This is require
    [all...]
AggressiveAntiDepBreaker.cpp 285 // In the case of a latency tie, prefer an anti-dependency edge over
733 ((SU->getDepth() + SU->Latency) >
734 (CriticalPathSU->getDepth() + CriticalPathSU->Latency))) {
    [all...]
ScheduleDAG.cpp 69 // Zero-latency weak edges may be added purely for heuristic ordering. Don't
74 // Extend the latency if needed. Equivalent to removePred(I) + addPred(D).
331 dbgs() << " Latency : " << Latency << "\n";
349 dbgs() << ": Latency=" << I->getLatency();
369 dbgs() << ": Latency=" << I->getLatency();
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 89 /// Latency - The time associated with this edge. Often this is just
90 /// the value of the Latency field of the predecessor, however advanced
92 unsigned Latency;
111 Latency = 0;
115 Latency = 1;
120 : Dep(S, Order), Contents(), Latency(0) {
124 /// Return true if the specified SDep is equivalent except for latency.
139 return overlaps(Other) && Latency == Other.Latency;
146 /// getLatency - Return the latency value for this edge, which roughl
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.cpp 40 // This allows latency based scheduler to notice high latency instructions
42 // balancing scheduler heursitics than with the actual machine latency.
44 "sched-high-latency-cycles", cl::Hidden, cl::init(10),
45 cl::desc("Roughly estimate the number of cycles that 'long latency'"
92 SU->Latency = Old->Latency;
386 // Schedule zero-latency TokenFactor below any nodes that may increase the
402 // Assign the Latency field of NodeSUnit using target-provided information.
482 // If this is a ctrl dep, latency is 1
    [all...]
ScheduleDAGVLIW.cpp 57 /// been issued, but their results are not ready yet (due to the latency of
199 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?");
244 if (FoundSUnit->Latency) // Don't increment CurCycle for pseudo-ops!
ScheduleDAGFast.cpp 340 D.setLatency(LoadSU->Latency);
418 FromDep.setLatency(SU->Latency);
421 ToDep.setLatency(CopyFromSU->Latency);
ScheduleDAGRRList.cpp 57 "which tries to balance latency and register pressure",
113 /// NeedLatency - True if the scheduler will make use of latency information.
121 /// been issued, but their results are not ready yet (due to the latency of
263 /// need actual latency information but the hybrid scheduler does.
606 // Bypass lots of virtual calls in case of long latency.
628 // But given the crude nature of modeling latency though such nodes, we
634 // Bump CurCycle to account for latency. We assume the latency of other
777 // Check AvailableQueue after ReleasePredecessors in case of zero latency.
    [all...]
  /external/llvm/lib/Target/ARM/
ARMBaseInstrInfo.cpp     [all...]
  /external/chromium_org/remoting/webapp/
connection_stats.js 73 ', Latency: ' + formatStatNumber(stats.roundtripLatency, 'ms'));
  /external/oprofile/events/mips/1004K/
events 95 event:0x3d counters:0 um:zero minimum:500 name:SELF_INTERVENTION_LATENCY : 61-0 Latency from miss detection to self intervention
96 event:0x3e counters:0 um:zero minimum:500 name:READ_RESPONSE_LATENCY : 62-0 Read latency from miss detection until critical dword of response is returned
  /external/blktrace/btt/doc/
btt.tex 463 \item[iostat] Latency information -- both Q2d, D2c and Q2C --
676 \newpage\section{\label{sec:lat}\label{sec:lat-q2d}\label{sec:lat-q2c}\label{sec:lat-d2c}Latency Data Files}
678 The latency data files which can be optionally produced by \texttt{btt}
679 provide per-IO latency information, one for queue time (Q2D), one
684 while the second column (Y values) shows the actual latency for a
    [all...]

Completed in 708 milliseconds