OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:NodeNum
(Results
1 - 15
of
15
) sorted by null
/external/llvm/include/llvm/CodeGen/
LatencyPriorityQueue.h
68
unsigned getLatency(unsigned
NodeNum
) const {
69
assert(
NodeNum
< (*SUnits).size());
70
return (*SUnits)[
NodeNum
].getHeight();
73
unsigned getNumSolelyBlockNodes(unsigned
NodeNum
) const {
74
assert(
NodeNum
< NumNodesSolelyBlocking.size());
75
return NumNodesSolelyBlocking[
NodeNum
];
ResourcePriorityQueue.h
98
unsigned getLatency(unsigned
NodeNum
) const {
99
assert(
NodeNum
< (*SUnits).size());
100
return (*SUnits)[
NodeNum
].getHeight();
103
unsigned getNumSolelyBlockNodes(unsigned
NodeNum
) const {
104
assert(
NodeNum
< NumNodesSolelyBlocking.size());
105
return NumNodesSolelyBlocking[
NodeNum
];
ScheduleDFS.h
149
return DFSNodeData[SU->
NodeNum
].InstrCount;
162
return ILPValue(DFSNodeData[SU->
NodeNum
].InstrCount, 1 + SU->getDepth());
175
assert(SU->
NodeNum
< DFSNodeData.size() && "New Node");
176
return DFSNodeData[SU->
NodeNum
].SubtreeID;
ScheduleDAG.h
290
unsigned
NodeNum
; // Entry # of node in the node vector.
329
SUnit(SDNode *node, unsigned
nodenum
)
330
: Node(node), Instr(0), OrigNode(0), SchedClass(0),
NodeNum
(
nodenum
),
343
SUnit(MachineInstr *instr, unsigned
nodenum
)
344
: Node(0), Instr(instr), OrigNode(0), SchedClass(0),
NodeNum
(
nodenum
),
357
: Node(0), Instr(0), OrigNode(0), SchedClass(0),
NodeNum
(BoundaryID),
375
bool isBoundaryNode() const { return
NodeNum
== BoundaryID; };
/external/llvm/lib/CodeGen/
ScheduleDAG.cpp
317
dbgs() << "SU(" <<
NodeNum
<< "): ";
346
dbgs() << "SU(" << I->getSUnit()->
NodeNum
<< ")";
366
dbgs() << "SU(" << I->getSUnit()->
NodeNum
<< ")";
473
int
NodeNum
= SU->
NodeNum
;
476
Node2Index[
NodeNum
] = Degree;
490
if (SU->
NodeNum
< DAGSize)
491
Allocate(SU->
NodeNum
, --Id);
495
if (SU->
NodeNum
< DAGSize && !--Node2Index[SU->
NodeNum
])
[
all
...]
LatencyPriorityQueue.cpp
31
unsigned LHSNum = LHS->
NodeNum
;
32
unsigned RHSNum = RHS->
NodeNum
;
81
NumNodesSolelyBlocking[SU->
NodeNum
] = NumNodesBlocking;
ScheduleDAGInstrs.cpp
651
<< SUa->
NodeNum
<< ") and SU("
652
<< SUb->
NodeNum
<< ")\n");
[
all
...]
MachineScheduler.cpp
310
dbgs() << Queue[i]->
NodeNum
<< " ";
811
DEBUG(dbgs() << "Cluster loads SU(" << SUa->
NodeNum
<< ") - SU("
812
<< SUb->
NodeNum
<< ")\n");
821
DEBUG(dbgs() << " Copy Succ SU(" << SI->getSUnit()->
NodeNum
<< ")\n");
833
// Map DAG
NodeNum
to store chain ID.
845
ChainPredID = PI->getSUnit()->
NodeNum
;
902
DEBUG(dbgs() << "Macro Fuse SU(" << SU->
NodeNum
<< ")\n");
[
all
...]
ScoreboardHazardRecognizer.cpp
165
DEBUG(dbgs() << "SU(" << SU->
NodeNum
<< "): ");
/external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp
246
if (NewNode->
NodeNum
>= NumSUnits)
257
if (NewNode->
NodeNum
>= NumSUnits)
[
all
...]
ScheduleDAGFast.cpp
241
DEBUG(dbgs() << "Unfolding SU # " << SU->
NodeNum
<< "\n");
255
N->setNodeId(NewSU->
NodeNum
);
277
LoadNode->setNodeId(LoadSU->
NodeNum
);
353
DEBUG(dbgs() << "Duplicating SU # " << SU->
NodeNum
<< "\n");
597
DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->
NodeNum
598
<< " to SU #" << Copies.front()->
NodeNum
<< "\n");
603
DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->
NodeNum
604
<< " to SU #" << TrySU->
NodeNum
<< "\n");
ResourcePriorityQueue.cpp
192
unsigned LHSNum = LHS->
NodeNum
;
193
unsigned RHSNum = RHS->
NodeNum
;
241
NumNodesSolelyBlocking[SU->
NodeNum
] = NumNodesBlocking;
436
ResCount += (NumNodesSolelyBlocking[SU->
NodeNum
] * ScaleTwo);
SelectionDAGPrinter.cpp
272
O << "SU(" << SU->
NodeNum
<< "): ";
ScheduleDAGSDNodes.cpp
357
N->setNodeId(NodeSUnit->
NodeNum
);
374
N->setNodeId(NodeSUnit->
NodeNum
);
397
N->setNodeId(NodeSUnit->
NodeNum
);
[
all
...]
/external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp
123
DEBUG(dbgs() << Packet[i]->
NodeNum
<< ")\t");
Completed in 963 milliseconds