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
88
void scheduleNodeTopDown(SUnit *SU, unsigned
CurCycle
);
151
void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned
CurCycle
) {
152
DEBUG(dbgs() << "*** Scheduling [" <<
CurCycle
<< "]: ");
156
assert(
CurCycle
>= SU->getDepth() && "Node scheduled above its depth!");
157
SU->setDepthToAtLeast(
CurCycle
);
167
unsigned
CurCycle
= 0;
189
if (PendingQueue[i]->getDepth() ==
CurCycle
) {
197
assert(PendingQueue[i]->getDepth() >
CurCycle
&& "Negative latency?");
206
++
CurCycle
;
237
scheduleNodeTopDown(FoundSUnit,
CurCycle
);
[
all
...]
ScheduleDAGFast.cpp
94
void ReleasePredecessors(SUnit *SU, unsigned
CurCycle
);
155
void ScheduleDAGFast::ReleasePredecessors(SUnit *SU, unsigned
CurCycle
) {
168
LiveRegCycles[I->getReg()] =
CurCycle
;
177
void ScheduleDAGFast::ScheduleNodeBottomUp(SUnit *SU, unsigned
CurCycle
) {
178
DEBUG(dbgs() << "*** Scheduling [" <<
CurCycle
<< "]: ");
181
assert(
CurCycle
>= SU->getHeight() && "Node scheduled below its height!");
182
SU->setHeightToAtLeast(
CurCycle
);
185
ReleasePredecessors(SU,
CurCycle
);
522
unsigned
CurCycle
= 0;
525
ReleasePredecessors(&ExitSU,
CurCycle
);
[
all
...]
ScheduleDAGRRList.cpp
128
///
CurCycle
- The current scheduler state corresponds to this cycle.
129
unsigned
CurCycle
;
158
NeedLatency(needlatency), AvailableQueue(availqueue),
CurCycle
(0),
305
CurCycle
= 0;
580
if (NextCycle <=
CurCycle
)
587
CurCycle
= NextCycle;
590
for (;
CurCycle
!= NextCycle; ++
CurCycle
) {
614
// Bump
CurCycle
to account for latency. We assume the latency of other
638
AdvanceToCycle(
CurCycle
+ Stalls)
[
all
...]
/external/llvm/lib/CodeGen/
PostRASchedulerList.cpp
179
void ScheduleNodeTopDown(SUnit *SU, unsigned
CurCycle
);
627
void SchedulePostRATDList::ScheduleNodeTopDown(SUnit *SU, unsigned
CurCycle
) {
628
DEBUG(dbgs() << "*** Scheduling [" <<
CurCycle
<< "]: ");
632
assert(
CurCycle
>= SU->getDepth() &&
634
SU->setDepthToAtLeast(
CurCycle
);
644
unsigned
CurCycle
= 0;
678
if (PendingQueue[i]->getDepth() <=
CurCycle
) {
717
ScheduleNodeTopDown(FoundSUnit,
CurCycle
);
721
DEBUG(dbgs() << "*** Max instructions per cycle " <<
CurCycle
<< '\n');
723
++
CurCycle
;
[
all
...]
ScoreboardHazardRecognizer.cpp
55
unsigned
CurCycle
= 0;
58
unsigned StageDepth =
CurCycle
+ IS->getCycles();
60
CurCycle
+= IS->getNextCycles();
/external/llvm/include/llvm/CodeGen/
ScheduleDAG.h
439
unsigned
CurCycle
;
443
CurCycle
(0), HasReadyFilter(rf) {}
486
CurCycle
= Cycle;
490
return
CurCycle
;
Completed in 63 milliseconds