Home
last modified time | relevance | path

Searched refs:SchedulingNode (Results 1 – 2 of 2) sorted by relevance

/art/compiler/optimizing/
Dscheduler.h157 class SchedulingNode : public DeletableArenaObject<kArenaAllocScheduler> {
159 SchedulingNode(HInstruction* instr, ScopedArenaAllocator* allocator, bool is_scheduling_barrier) in SchedulingNode() function
171 void AddDataPredecessor(SchedulingNode* predecessor) { in AddDataPredecessor()
176 const ScopedArenaVector<SchedulingNode*>& GetDataPredecessors() const { in GetDataPredecessors()
180 void AddOtherPredecessor(SchedulingNode* predecessor) { in AddOtherPredecessor()
185 const ScopedArenaVector<SchedulingNode*>& GetOtherPredecessors() const { in GetOtherPredecessors()
238 ScopedArenaVector<SchedulingNode*> data_predecessors_;
239 ScopedArenaVector<SchedulingNode*> other_predecessors_;
261 SchedulingNode* AddNode(HInstruction* instr, bool is_scheduling_barrier = false) {
262 std::unique_ptr<SchedulingNode> node(
[all …]
Dscheduler.cc36 void SchedulingGraph::AddDependency(SchedulingNode* node, in AddDependency()
37 SchedulingNode* dependency, in AddDependency()
284 SchedulingNode* instruction_node = GetNode(instruction); in AddDependencies()
297 SchedulingNode* other_node = GetNode(other); in AddDependencies()
335 SchedulingNode* other_node = GetNode(other); in AddDependencies()
362 bool SchedulingGraph::HasImmediateDataDependency(const SchedulingNode* node, in HasImmediateDataDependency()
363 const SchedulingNode* other) const { in HasImmediateDataDependency()
369 const SchedulingNode* node = GetNode(instruction); in HasImmediateDataDependency()
370 const SchedulingNode* other = GetNode(other_instruction); in HasImmediateDataDependency()
381 bool SchedulingGraph::HasImmediateOtherDependency(const SchedulingNode* node, in HasImmediateOtherDependency()
[all …]