OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:PredSU
(Results
1 - 9
of
9
) sorted by null
/external/llvm/lib/CodeGen/
ScheduleDAG.cpp
76
SUnit *
PredSU
= I->getSUnit();
80
for (SmallVectorImpl<SDep>::iterator II =
PredSU
->Succs.begin(),
81
EE =
PredSU
->Succs.end(); II != EE; ++II) {
203
SUnit *
PredSU
= I->getSUnit();
204
if (
PredSU
->isHeightCurrent)
205
WorkList.push_back(
PredSU
);
244
SUnit *
PredSU
= I->getSUnit();
245
if (
PredSU
->isDepthCurrent)
247
PredSU
->Depth + I->getLatency());
250
WorkList.push_back(
PredSU
);
[
all
...]
MachineScheduler.cpp
327
bool ScheduleDAGMI::canAddEdge(SUnit *SuccSU, SUnit *
PredSU
) {
328
return SuccSU == &ExitSU || !Topo.IsReachable(
PredSU
, SuccSU);
381
/// FIXME: Adjust
PredSU
height based on MinLatency.
383
SUnit *
PredSU
= PredEdge->getSUnit();
386
--
PredSU
->WeakSuccsLeft;
388
NextClusterPred =
PredSU
;
392
if (
PredSU
->NumSuccsLeft == 0) {
394
PredSU
->dump(this);
399
--
PredSU
->NumSuccsLeft;
400
if (
PredSU
->NumSuccsLeft == 0 && PredSU != &EntrySU
[
all
...]
CriticalAntiDepBreaker.cpp
132
const SUnit *
PredSU
= P->getSUnit();
134
unsigned PredTotalLatency =
PredSU
->getDepth() + PredLatency;
ScheduleDAGInstrs.cpp
[
all
...]
AggressiveAntiDepBreaker.cpp
282
const SUnit *
PredSU
= P->getSUnit();
284
unsigned PredTotalLatency =
PredSU
->getDepth() + PredLatency;
[
all
...]
/external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp
365
SUnit *
PredSU
= PredEdge->getSUnit();
368
if (
PredSU
->NumSuccsLeft == 0) {
370
PredSU
->dump(this);
375
--
PredSU
->NumSuccsLeft;
380
PredSU
->setHeightToAtLeast(SU->getHeight() + PredEdge->getLatency());
385
if (
PredSU
->NumSuccsLeft == 0 &&
PredSU
!= &EntrySU) {
386
PredSU
->isAvailable = true;
388
unsigned Height =
PredSU
->getHeight();
392
if (isReady(
PredSU
)) {
[
all
...]
ScheduleDAGFast.cpp
140
SUnit *
PredSU
= PredEdge->getSUnit();
143
if (
PredSU
->NumSuccsLeft == 0) {
145
PredSU
->dump(this);
150
--
PredSU
->NumSuccsLeft;
154
if (
PredSU
->NumSuccsLeft == 0 &&
PredSU
!= &EntrySU) {
155
PredSU
->isAvailable = true;
156
AvailableQueue.push(
PredSU
);
ResourcePriorityQueue.cpp
78
SUnit *
PredSU
= I->getSUnit();
79
const SDNode *ScegN =
PredSU
->getNode();
/external/llvm/include/llvm/CodeGen/
MachineScheduler.h
276
/// \brief True if an edge can be added from
PredSU
to SuccSU without creating
278
bool canAddEdge(SUnit *SuccSU, SUnit *
PredSU
);
Completed in 1384 milliseconds