OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:CurCycle
(Results
1 - 6
of
6
) sorted by null
/external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGVLIW.cpp
90
void scheduleNodeTopDown(SUnit *SU, unsigned
CurCycle
);
155
void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned
CurCycle
) {
156
DEBUG(dbgs() << "*** Scheduling [" <<
CurCycle
<< "]: ");
160
assert(
CurCycle
>= SU->getDepth() && "Node scheduled above its depth!");
161
SU->setDepthToAtLeast(
CurCycle
);
171
unsigned
CurCycle
= 0;
193
if (PendingQueue[i]->getDepth() ==
CurCycle
) {
201
assert(PendingQueue[i]->getDepth() >
CurCycle
&& "Negative latency?");
210
++
CurCycle
;
241
scheduleNodeTopDown(FoundSUnit,
CurCycle
);
[
all
...]
ScheduleDAGFast.cpp
100
void ReleasePredecessors(SUnit *SU, unsigned
CurCycle
);
161
void ScheduleDAGFast::ReleasePredecessors(SUnit *SU, unsigned
CurCycle
) {
174
LiveRegCycles[I->getReg()] =
CurCycle
;
183
void ScheduleDAGFast::ScheduleNodeBottomUp(SUnit *SU, unsigned
CurCycle
) {
184
DEBUG(dbgs() << "*** Scheduling [" <<
CurCycle
<< "]: ");
187
assert(
CurCycle
>= SU->getHeight() && "Node scheduled below its height!");
188
SU->setHeightToAtLeast(
CurCycle
);
191
ReleasePredecessors(SU,
CurCycle
);
528
unsigned
CurCycle
= 0;
531
ReleasePredecessors(&ExitSU,
CurCycle
);
[
all
...]
ScheduleDAGRRList.cpp
130
///
CurCycle
- The current scheduler state corresponds to this cycle.
131
unsigned
CurCycle
;
166
NeedLatency(needlatency), AvailableQueue(availqueue),
CurCycle
(0),
326
CurCycle
= 0;
602
if (NextCycle <=
CurCycle
)
609
CurCycle
= NextCycle;
612
for (;
CurCycle
!= NextCycle; ++
CurCycle
) {
636
// Bump
CurCycle
to account for latency. We assume the latency of other
660
AdvanceToCycle(
CurCycle
+ Stalls)
[
all
...]
/external/llvm/lib/CodeGen/
PostRASchedulerList.cpp
177
void ScheduleNodeTopDown(SUnit *SU, unsigned
CurCycle
);
181
void emitNoop(unsigned
CurCycle
);
466
void SchedulePostRATDList::ScheduleNodeTopDown(SUnit *SU, unsigned
CurCycle
) {
467
DEBUG(dbgs() << "*** Scheduling [" <<
CurCycle
<< "]: ");
471
assert(
CurCycle
>= SU->getDepth() &&
473
SU->setDepthToAtLeast(
CurCycle
);
481
void SchedulePostRATDList::emitNoop(unsigned
CurCycle
) {
482
DEBUG(dbgs() << "*** Emitting noop in cycle " <<
CurCycle
<< '\n');
491
unsigned
CurCycle
= 0;
524
if (PendingQueue[i]->getDepth() <=
CurCycle
) {
[
all
...]
ScoreboardHazardRecognizer.cpp
54
unsigned
CurCycle
= 0;
57
unsigned StageDepth =
CurCycle
+ IS->getCycles();
59
CurCycle
+= IS->getNextCycles();
/external/llvm/include/llvm/CodeGen/
ScheduleDAG.h
497
unsigned
CurCycle
;
501
CurCycle
(0), HasReadyFilter(rf) {}
544
CurCycle
= Cycle;
548
return
CurCycle
;
Completed in 78 milliseconds