HomeSort by relevance Sort by last modified time
    Searched defs:SUnits (Results 1 - 8 of 8) sorted by null

  /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();
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/llvm/lib/Target/AMDGPU/
SIMachineScheduler.h 56 std::vector<SUnit*> SUnits;
96 DAG(DAG), BC(BC), SUnits(), TopReadySUs(), ScheduledSUnits(),
130 int getCost() { return SUnits.size(); }
235 // 1 to SUnits.size() -> Reserved group (you should only add elements to them).
  /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
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/
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...]

Completed in 559 milliseconds