OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
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
...]