/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...] |
CriticalAntiDepBreaker.cpp | 143 // In the case of a latency tie, prefer an anti-dependency edge over 466 if (!Max || SU->getDepth() + SU->Latency > Max->getDepth() + Max->Latency) 472 DEBUG(dbgs() << "Critical path has total latency " 473 << (Max->getDepth() + Max->Latency) << "\n");
|
MachineScheduler.cpp | [all...] |
AggressiveAntiDepBreaker.cpp | 286 // In the case of a latency tie, prefer an anti-dependency edge over 744 ((SU->getDepth() + SU->Latency) > 745 (CriticalPathSU->getDepth() + CriticalPathSU->Latency))) { [all...] |
ScheduleDAGInstrs.cpp | 210 /// especially important when the definition latency of the return value(s) 268 // Adjust the dependence latency using operand def/use information, 300 // dependencies we use a latency of 0 because for a multi-issue 303 // TODO: Using a latency of 1 here for output dependencies assumes 392 // is also useful if output latency exceeds def-use latency. 443 // Adjust the dependence latency using operand def/use information, then 700 // Assign the Latency field of SU using target-provided information. 701 SU->Latency = SchedModel.computeInstrLatency(SU->getInstr()); 833 // dependence edge to ExitSU to model the live-out latency. This is require [all...] |
ScheduleDAG.cpp | 70 // Zero-latency weak edges may be added purely for heuristic ordering. Don't 75 // Extend the latency if needed. Equivalent to removePred(I) + addPred(D). 332 dbgs() << " Latency : " << Latency << "\n"; 350 dbgs() << ": Latency=" << I->getLatency(); 370 dbgs() << ": Latency=" << I->getLatency();
|
/external/llvm/lib/MC/MCDisassembler/ |
Disassembler.cpp | 173 /// \brief Gets latency information for \p Inst form the itinerary 175 /// \return The maximum expected latency over all the operands or -1 191 int Latency = 0; 194 Latency = std::max(Latency, IID.getOperandCycle(SCClass, OpIdx)); 196 return Latency; 199 /// \brief Gets latency information for \p Inst, based on \p DC information. 200 /// \return The maximum expected latency over all the definitions or -1 223 // Compute output latency. 224 int Latency = 0 [all...] |
/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 | 41 // This allows latency based scheduler to notice high latency instructions 43 // balancing scheduler heursitics than with the actual machine latency. 45 "sched-high-latency-cycles", cl::Hidden, cl::init(10), 46 cl::desc("Roughly estimate the number of cycles that 'long latency'" 93 SU->Latency = Old->Latency; 392 // Schedule zero-latency TokenFactor below any nodes that may increase the 408 // Assign the Latency field of NodeSUnit using target-provided information. 488 // If this is a ctrl dep, latency is 1 [all...] |
ScheduleDAGVLIW.cpp | 58 /// been issued, but their results are not ready yet (due to the latency of 201 assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?"); 246 if (FoundSUnit->Latency) // Don't increment CurCycle for pseudo-ops!
|
ScheduleDAGFast.cpp | 341 D.setLatency(LoadSU->Latency); 419 FromDep.setLatency(SU->Latency); 422 ToDep.setLatency(CopyFromSU->Latency);
|
ScheduleDAGRRList.cpp | 58 "which tries to balance latency and register pressure", 114 /// NeedLatency - True if the scheduler will make use of latency information. 122 /// been issued, but their results are not ready yet (due to the latency of 265 /// need actual latency information but the hybrid scheduler does. 608 // Bypass lots of virtual calls in case of long latency. 630 // But given the crude nature of modeling latency though such nodes, we 636 // Bump CurCycle to account for latency. We assume the latency of other 779 // Check AvailableQueue after ReleasePredecessors in case of zero latency. [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
qos.h | 36 ULONG Latency;
|
poclass.h | 245 ULONG Latency;
|
/external/chromium_org/third_party/webrtc/test/channel_transport/ |
udp_socket2_win.cc | 745 Qos.SendingFlowspec.Latency = QOS_NOT_SPECIFIED; 754 Qos.ReceivingFlowspec.Latency = QOS_NOT_SPECIFIED; [all...] |
/external/chromium_org/remoting/webapp/ |
connection_stats.js | 73 ', Latency: ' + formatStatNumber(stats.roundtripLatency, 'ms'));
|
/external/llvm/lib/Target/ARM/ |
ARMBaseInstrInfo.cpp | [all...] |
/external/llvm/lib/Target/PowerPC/ |
PPCInstrInfo.cpp | 112 int Latency = PPCGenInstrInfo::getOperandLatency(ItinData, DefMI, DefIdx, 131 if (Latency < 0) 132 Latency = getInstrLatency(ItinData, DefMI); 150 Latency += 2; 155 return Latency; 614 // an open question. On the A2, the isel instruction has a 2-cycle latency 747 // 1. xxlor : This has lower latency (on the P7), 2 cycles, but can only 749 // 2. xmovdp/xmovsp: This has higher latency (on the P7), 6 cycles, but 753 // lower-latency form is preferable. [all...] |
/external/chromium_org/v8/test/perf-test/Collections/ |
base.js | 6 // Performance.now is used in latency benchmarks, the fallback is Date.now. 42 // full benchmark suite has run to completion. If latency is set to 0 43 // then there is no latency score for this benchmark. 44 function BenchmarkResult(benchmark, time, latency) { 47 this.latency = latency; 191 if (measurements[i].latency != 0) { 192 log += Math.log(measurements[i].latency); 239 this.runner.NotifyResult(this.name + "Latency", formattedLatency);
|
/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...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
wmidata.h | [all...] |