| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 33 // SUnits - The SUnits for the current graph.
34 std::vector<SUnit> *SUnits;
52 void initNodes(std::vector<SUnit> &sunits) override {
53 SUnits = &sunits;
54 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
58 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
65 SUnits = nullptr;
69 assert(NodeNum < (*SUnits).size())
[all...] |
| ResourcePriorityQueue.h | 39 /// SUnits - The SUnits for the current graph.
40 std::vector<SUnit> *SUnits;
82 void initNodes(std::vector<SUnit> &sunits) override;
85 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
91 SUnits = nullptr;
95 assert(NodeNum < (*SUnits).size());
96 return (*SUnits)[NodeNum].getHeight();
|
| ScheduleDAGInstrs.h | 142 /// is mapped to a set of SUnits. These include all local vreg uses, not
172 /// A list of SUnits, used in Value2SUsMap, during DAG construction.
279 /// buildSchedGraph - Build SUnits from the MachineBasicBlock that we are
343 const SUnit *Addr = SUnits.empty() ? nullptr : &SUnits[0];
345 SUnits.emplace_back(MI, (unsigned)SUnits.size());
346 assert((Addr == nullptr || Addr == &SUnits[0]) &&
347 "SUnits std::vector reallocated on the fly!");
348 SUnits.back().OrigNode = &SUnits.back()
[all...] |
| ScheduleDAG.h | 96 /// classes which require default constructors. SUnits may not
183 /// as "must alias", meaning that the SUnits at either end of the edge
257 // Preds/Succs - The SUnits before/after us in the graph.
530 virtual void initNodes(std::vector<SUnit> &SUnits) = 0;
583 std::vector<SUnit> SUnits; // The scheduling units.
627 /// VerifyScheduledDAG - Verify that all SUnits were scheduled and that
628 /// their state is consistent. Return the number of scheduled SUnits.
696 return G->SUnits.begin();
699 return G->SUnits.end();
704 /// ordering for SUnits and provides methods for dynamically updatin
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 33 // SUnits - The SUnits for the current graph.
34 std::vector<SUnit> *SUnits;
52 void initNodes(std::vector<SUnit> &sunits) {
53 SUnits = &sunits;
54 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
58 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
65 SUnits = 0;
69 assert(NodeNum < (*SUnits).size())
[all...] |
| ScheduleDAG.h | 90 /// classes which require default constructors. SUnits may not
181 /// as "must alias", meaning that the SUnits at either end of the edge
236 // Preds/Succs - The SUnits before/after us in the graph.
439 virtual void initNodes(std::vector<SUnit> &SUnits) = 0;
496 std::vector<SUnit> SUnits; // The scheduling units.
540 /// VerifySchedule - Verify that all SUnits were scheduled and that
550 /// BuildSchedGraph - Build SUnits and set up their Preds and Succs
651 return G->SUnits.begin();
654 return G->SUnits.end();
659 /// ordering for SUnits and provides methods for dynamically updatin
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScheduleDAGInstrs.h | 152 const SUnit *Addr = SUnits.empty() ? 0 : &SUnits[0];
154 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size()));
155 assert((Addr == 0 || Addr == &SUnits[0]) &&
156 "SUnits std::vector reallocated on the fly!");
157 SUnits.back().OrigNode = &SUnits.back();
158 return &SUnits.back();
168 /// BuildSchedGraph - Build SUnits from the MachineBasicBlock that we ar
[all...] |
| AntiDepBreaker.h | 45 virtual unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| ScheduleDAG.cpp | 71 SUnits.clear();
349 /// VerifySchedule - Verify that all SUnits were scheduled and that
356 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
357 if (!SUnits[i].isScheduled) {
358 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
364 SUnits[i].dump(this);
368 if (SUnits[i].isScheduled &&
369 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth())
[all...] |
| PostRASchedulerList.cpp | 111 /// AvailableQueue - The priority queue to use for the available SUnits.
121 /// Topo - A topological ordering for SUnits.
188 : ScheduleDAGInstrs(MF, MLI, MDT), Topo(SUnits), AA(AA),
312 AntiDepBreak->BreakAntiDependencies(SUnits, Begin, InsertPos,
322 SUnits.clear();
333 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
334 SUnits[su].dumpAll(this));
336 AvailableQueue.initNodes(SUnits);
606 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
608 bool available = SUnits[i].Preds.empty()
[all...] |
| CriticalAntiDepBreaker.h | 82 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| AggressiveAntiDepBreaker.h | 145 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGVLIW.cpp | 54 /// AvailableQueue - The priority queue to use for the available SUnits.
103 AvailableQueue->initNodes(SUnits);
176 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
178 if (SUnits[i].Preds.empty()) {
179 AvailableQueue->push(&SUnits[i]);
180 SUnits[i].isAvailable = true;
187 Sequence.reserve(SUnits.size());
|
| ScheduleDAGSDNodes.cpp | 71 if (!SUnits.empty())
72 Addr = &SUnits[0];
74 SUnits.emplace_back(N, (unsigned)SUnits.size());
75 assert((Addr == nullptr || Addr == &SUnits[0]) &&
76 "SUnits std::vector reallocated on the fly!");
77 SUnits.back().OrigNode = &SUnits.back();
78 SUnit *SU = &SUnits.back();
300 // Cluster loads from "near" addresses into combined SUnits
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGList.cpp | 51 /// AvailableQueue - The priority queue to use for the available SUnits.
95 AvailableQueue->initNodes(SUnits);
165 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
167 if (SUnits[i].Preds.empty()) {
168 AvailableQueue->push(&SUnits[i]);
169 SUnits[i].isAvailable = true;
176 Sequence.reserve(SUnits.size());
|
| ScheduleDAGSDNodes.cpp | 63 if (!SUnits.empty())
64 Addr = &SUnits[0];
66 SUnits.push_back(SUnit(N, (unsigned)SUnits.size()));
67 assert((Addr == 0 || Addr == &SUnits[0]) &&
68 "SUnits std::vector reallocated on the fly!");
69 SUnits.back().OrigNode = &SUnits.back();
70 SUnit *SU = &SUnits.back();
261 // Cluster loads from "near" addresses into combined SUnits
[all...] |
| ScheduleDAGRRList.cpp | 132 /// AvailableQueue - The priority queue to use for the available SUnits.
161 /// Topo - A topological ordering for SUnits which permits fast IsReachable
171 Topo(SUnits) {
252 unsigned NumSUnits = SUnits.size();
263 unsigned NumSUnits = SUnits.size();
338 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
339 SUnits[su].dumpAll(this));
342 AvailableQueue->initNodes(SUnits);
826 LoadSU = &SUnits[LoadNode->getNodeId()];
[all...] |
| /external/llvm/lib/CodeGen/ |
| AntiDepBreaker.h | 42 virtual unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| ScheduleDAG.cpp | 51 SUnits.clear();
379 /// VerifyScheduledDAG - Verify that all SUnits were scheduled and that
385 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
386 if (!SUnits[i].isScheduled) {
387 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
393 SUnits[i].dump(this);
397 if (SUnits[i].isScheduled &&
398 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth())
[all...] |
| CriticalAntiDepBreaker.h | 77 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| PostRASchedulerList.cpp | 115 /// AvailableQueue - The priority queue to use for the available SUnits.
397 AntiDepBreak->BreakAntiDependencies(SUnits, RegionBegin, RegionEnd,
418 for (const SUnit &SU : SUnits) {
424 AvailableQueue.initNodes(SUnits);
541 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
543 if (!SUnits[i].NumPredsLeft && !SUnits[i].isAvailable) {
544 AvailableQueue.push(&SUnits[i]);
545 SUnits[i].isAvailable = true;
556 Sequence.reserve(SUnits.size())
[all...] |
| AggressiveAntiDepBreaker.h | 138 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| MachinePipeliner.cpp | 206 /// A toplogical ordering of the SUnits, which is needed for changing
207 /// dependences and iterating over the SUnits.
236 std::vector<SUnit> &SUnits;
246 : SUnits(SUs), Stack(), Blocked(SUs.size()), B(SUs.size()),
252 B.assign(SUnits.size(), SmallPtrSet<SUnit *, 4>());
265 Topo(SUnits, &ExitSU) {}
827 for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
828 SUnits[su].dumpAll(this);
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIMachineScheduler.cpp | 179 NodeNum2Index[SU->NodeNum] = SUnits.size();
180 SUnits.push_back(SU);
273 for (SUnit* SU : SUnits) {
391 for (SUnit* SU : SUnits) {
409 assert(SUnits.size() == ScheduledSUnits.size() &&
411 for (SUnit* SU : SUnits) {
421 for (SUnit* SU : SUnits) {
428 HasLowLatencyNonWaitedParent.assign(SUnits.size(), 0);
491 HasLowLatencyNonWaitedParent.assign(SUnits.size(), 0);
506 for (SUnit* SU : SUnits) {
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 28 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) {
30 if (SUnits[su].getInstr()->isCall())
31 LastSequentialCall = &(SUnits[su]);
33 else if (SUnits[su].getInstr()->isCompare() && LastSequentialCall)
34 SUnits[su].addPred(SDep(LastSequentialCall, SDep::Barrier));
167 for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
168 if (SUnits[su].getHeight() > maxH)
169 maxH = SUnits[su].getHeight();
172 for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
173 if (SUnits[su].getDepth() > maxD
[all...] |
