OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Latency
(Results
1 - 14
of
14
) 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
173
unsigned
Latency
= 0, StartCycle = 0;
176
Latency
= std::max(
Latency
, StartCycle + IS->getCycles());
180
return
Latency
;
221
/// getOperandLatency - Compute and return the use operand
latency
of a given
/external/llvm/include/llvm/CodeGen/
ScheduleDAG.h
84
///
Latency
- The time associated with this edge. Often this is just
85
/// the value of the
Latency
field of the predecessor, however advanced
87
unsigned
Latency
;
88
/// Record MinLatency seperately from "expected"
Latency
.
98
SDep(SUnit *S, Kind kind, unsigned
latency
= 1, unsigned Reg = 0,
101
: Dep(S, kind), Contents(),
Latency
(
latency
), MinLatency(
latency
) {
122
/// Return true if the specified SDep is equivalent except for
latency
.
141
&&
Latency
== Other.Latency && MinLatency == Other.MinLatency
[
all
...]
/external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp
194
/// especially important when the definition
latency
of the return value(s)
242
unsigned DataLatency = SU->
Latency
;
256
// Optionally add in a special extra
latency
for nodes that
272
// Adjust the dependence
latency
using operand def/use
277
unsigned
Latency
=
280
dep.setLatency(
Latency
);
302
// dependencies we use a
latency
of 0 because for a multi-issue
305
// TODO: Using a
latency
of 1 here for output dependencies assumes
365
unsigned
Latency
= SU->
Latency
;
[
all
...]
CriticalAntiDepBreaker.cpp
151
// In the case of a
latency
tie, prefer an anti-dependency edge over
432
if (!Max || SU->getDepth() + SU->
Latency
> Max->getDepth() + Max->
Latency
)
438
DEBUG(dbgs() << "Critical path has total
latency
"
439
<< (Max->getDepth() + Max->
Latency
) << "\n");
AggressiveAntiDepBreaker.cpp
302
// In the case of a
latency
tie, prefer an anti-dependency edge over
750
((SU->getDepth() + SU->
Latency
) >
751
(CriticalPathSU->getDepth() + CriticalPathSU->
Latency
))) {
[
all
...]
ScheduleDAG.cpp
70
// Extend the
latency
if needed. Equivalent to removePred(I) + addPred(D).
296
dbgs() << "
Latency
: " <<
Latency
<< "\n";
314
dbgs() << ":
Latency
=" << I->getLatency();
334
dbgs() << ":
Latency
=" << I->getLatency();
/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
197
assert(PendingQueue[i]->getDepth() > CurCycle && "Negative
latency
?");
242
if (FoundSUnit->
Latency
) // Don't increment CurCycle for pseudo-ops!
ScheduleDAGFast.cpp
334
AddPred(NewSU, SDep(LoadSU, SDep::Order, LoadSU->
Latency
));
411
AddPred(CopyFromSU, SDep(SU, SDep::Data, SU->
Latency
, Reg));
412
AddPred(CopyToSU, SDep(CopyFromSU, SDep::Data, CopyFromSU->
Latency
, 0));
589
AddPred(TrySU, SDep(Copies.front(), SDep::Order, /*
Latency
=*/1,
598
AddPred(NewDef, SDep(TrySU, SDep::Order, /*
Latency
=*/1,
ScheduleDAGRRList.cpp
56
"which tries to balance
latency
and register pressure",
112
/// NeedLatency - True if the scheduler will make use of
latency
information.
120
/// been issued, but their results are not ready yet (due to the
latency
of
254
/// need actual
latency
information but the hybrid scheduler does.
587
// Bypass lots of virtual calls in case of long
latency
.
609
// But given the crude nature of modeling
latency
though such nodes, we
615
// Bump CurCycle to account for
latency
. We assume the
latency
of other
756
// Check AvailableQueue after ReleasePredecessors in case of zero
latency
.
[
all
...]
/external/llvm/lib/Target/ARM/
ARMBaseInstrInfo.cpp
[
all
...]
/tools/motodev/src/plugins/emulator/
plugin.properties
119
StartUp_Options_NetDelay_Label=Network
Latency
120
StartUp_Options_NetDelay_Description=Set network
latency
emulation
125
StartUp_Options_NetFast_Label=Max Network Speed / Min Network
Latency
/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 1090 milliseconds