Searched defs:node (Results 1 – 9 of 9) sorted by relevance
36 void SchedulingGraph::AddDependency(SchedulingNode* node, in AddDependency()54 static bool MayHaveReorderingDependency(SideEffects node, SideEffects other) { in MayHaveReorderingDependency()81 bool SchedulingGraph::ArrayAccessMayAlias(const HInstruction* node, in ArrayAccessMayAlias()163 bool SchedulingGraph::FieldAccessMayAlias(const HInstruction* node, in FieldAccessMayAlias()197 bool SchedulingGraph::HasMemoryDependency(const HInstruction* node, in HasMemoryDependency()248 bool SchedulingGraph::HasExceptionDependency(const HInstruction* node, in HasExceptionDependency()267 bool SchedulingGraph::HasSideEffectDependency(const HInstruction* node, in HasSideEffectDependency()362 bool SchedulingGraph::HasImmediateDataDependency(const SchedulingNode* node, in HasImmediateDataDependency()369 const SchedulingNode* node = GetNode(instruction); in HasImmediateDataDependency() local381 bool SchedulingGraph::HasImmediateOtherDependency(const SchedulingNode* node, in HasImmediateOtherDependency()[all …]
105 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Lookup() local121 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Contains() local131 DeleteAllImpureWhich([side_effects](Node* node) { in Kill()153 DeleteAllImpureWhich([predecessor](Node* node) { in IntersectWith()178 for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) { in PopulateFromInternal() local197 void SetNext(Node* node) { next_ = node; } in SetNext()220 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in CloneBucket() local241 Node* node = buckets_[i]; in DeleteAllImpureWhich() local
307 void AddDataDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddDataDependency()310 void AddOtherDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddOtherDependency()360 void CalculateLatency(SchedulingNode* node) { in CalculateLatency()473 void CalculateLatency(SchedulingNode* node) { in CalculateLatency()
508 LoopNode* node = new (loop_allocator_) LoopNode(loop_info); in AddLoop() local530 void HLoopOptimization::RemoveLoop(LoopNode* node) { in RemoveLoop()553 bool HLoopOptimization::TraverseLoopsInnerToOuter(LoopNode* node) { in TraverseLoopsInnerToOuter()582 void HLoopOptimization::SimplifyInduction(LoopNode* node) { in SimplifyInduction()609 void HLoopOptimization::SimplifyBlocks(LoopNode* node) { in SimplifyBlocks()646 bool HLoopOptimization::OptimizeInnerLoop(LoopNode* node) { in OptimizeInnerLoop()722 bool HLoopOptimization::ShouldVectorize(LoopNode* node, HBasicBlock* block, int64_t trip_count) { in ShouldVectorize()838 void HLoopOptimization::Vectorize(LoopNode* node, in Vectorize()1008 void HLoopOptimization::GenerateNewLoop(LoopNode* node, in GenerateNewLoop()1070 bool HLoopOptimization::VectorizeDef(LoopNode* node, in VectorizeDef()[all …]
1209 InterferenceNode* node = in BuildInterferenceGraph() local1252 InterferenceNode* node; in BuildInterferenceGraph() local1453 static bool IsLowDegreeNode(InterferenceNode* node, size_t num_regs) { in IsLowDegreeNode()1457 static bool IsHighDegreeNode(InterferenceNode* node, size_t num_regs) { in IsHighDegreeNode()1499 InterferenceNode* node = simplify_worklist_.front(); in PruneInterferenceGraph() local1514 InterferenceNode* node = freeze_worklist_.front(); in PruneInterferenceGraph() local1525 InterferenceNode* node = spill_worklist_.top(); in PruneInterferenceGraph() local1540 void ColoringIteration::EnableCoalesceOpportunities(InterferenceNode* node) { in EnableCoalesceOpportunities()1549 void ColoringIteration::PruneNode(InterferenceNode* node) { in PruneNode()1587 void ColoringIteration::CheckTransitionFromFreezeWorklist(InterferenceNode* node) { in CheckTransitionFromFreezeWorklist()[all …]
92 std::string LoopStructureRecurse(HLoopOptimization::LoopNode* node) { in LoopStructureRecurse()
101 public Node node; field in DominatorsComputation.NodeS
230 Node node = new Node("n" + i); in stackOverflow() local
383 bool ContainsNode(const_reference node) const { in ContainsNode()