Searched refs:PathBetween (Results 1 – 6 of 6) sorted by relevance
| /art/compiler/optimizing/ |
| D | execution_subgraph.h | 180 return blk->GetGraph()->PathBetween(blk->GetBlockId(), entry); in SucceedsBlock()
193 return blk->GetGraph()->PathBetween(exit, blk->GetBlockId()); in PrecedesBlock()
|
| D | execution_subgraph.cc | 255 [&](uint32_t skipped) { return graph_->PathBetween(skipped, blkid); }) && in RemoveConcavity()
258 [&](uint32_t skipped) { return graph_->PathBetween(blkid, skipped); })) { in RemoveConcavity()
|
| D | load_store_analysis.cc | 115 return reference_->GetBlock()->GetGraph()->PathBetween(excluded, in PrunePartialEscapeWrites()
|
| D | load_store_analysis_test.cc | 733 if (graph_->PathBetween(blk, other)) { in CheckReachability()
741 } else if (graph_->PathBetween(blk, other)) { in CheckReachability()
751 EXPECT_FALSE(graph_->PathBetween(blk, other)) in CheckReachability()
827 if (graph->PathBetween(exit, entry)) { in AreExclusionsIndependent()
|
| D | nodes.cc | 276 bool HGraph::PathBetween(uint32_t source_idx, uint32_t dest_idx) const { in PathBetween() function in art::HGraph
284 bool HGraph::PathBetween(const HBasicBlock* source, const HBasicBlock* dest) const { in PathBetween() function in art::HGraph
290 return PathBetween(source_idx, dest_idx); in PathBetween()
|
| D | nodes.h | 610 bool PathBetween(const HBasicBlock* source, const HBasicBlock* dest) const;
611 bool PathBetween(uint32_t source_id, uint32_t dest_id) const;
|