Home
last modified time | relevance | path

Searched refs:subgraph_ (Results 1 – 4 of 4) sorted by relevance

/aosp12/art/compiler/optimizing/
H A Dload_store_analysis.h53 subgraph_(nullptr) { in ReferenceInfo()
60 subgraph_.reset( in ReferenceInfo()
76 DCHECK(subgraph_ != nullptr); in ReferenceInfo()
77 subgraph_->Finalize(); in ReferenceInfo()
79 DCHECK(subgraph_ == nullptr); in ReferenceInfo()
85 return subgraph_.get(); in GetNoEscapeSubgraph()
109 subgraph_ != nullptr && in IsPartialSingleton()
110 subgraph_->IsValid(); in IsPartialSingleton()
130 DCHECK(subgraph_ != nullptr); in HandleEscape()
131 subgraph_->RemoveBlock(escape); in HandleEscape()
[all …]
H A Dload_store_analysis.cc97 DCHECK(subgraph_ != nullptr); in PrunePartialEscapeWrites()
98 if (!subgraph_->IsValid()) { in PrunePartialEscapeWrites()
108 subgraph_->ContainsBlock(user->GetBlock()) && in PrunePartialEscapeWrites()
112 std::any_of(subgraph_->UnreachableBlocks().begin(), in PrunePartialEscapeWrites()
113 subgraph_->UnreachableBlocks().end(), in PrunePartialEscapeWrites()
126 subgraph_->RemoveBlock(graph->GetBlocks()[exc]); in PrunePartialEscapeWrites()
H A Dexecution_subgraph.h282 return subgraph_->ContainsBlock(blk); in operator()
286 explicit ContainsFunctor(const ExecutionSubgraph* subgraph) : subgraph_(subgraph) {} in ContainsFunctor()
287 const ExecutionSubgraph* const subgraph_; variable
H A Dload_store_elimination.cc2967 subgraph_(subgraph) {} in HeapReferenceData()
2979 return subgraph_; in GetNoEscapeSubgraph()
2984 subgraph_->GetExcludedCohorts().cbegin(), in IsPostEscape()
2985 subgraph_->GetExcludedCohorts().cend(), in IsPostEscape()
2991 subgraph_->GetExcludedCohorts().cbegin(), in InEscapeCohort()
2992 subgraph_->GetExcludedCohorts().cend(), in InEscapeCohort()
2997 return std::none_of(subgraph_->GetExcludedCohorts().cbegin(), in BeforeAllEscapes()
2998 subgraph_->GetExcludedCohorts().cend(), in BeforeAllEscapes()
3372 const ExecutionSubgraph* subgraph_; member in art::PartialLoadStoreEliminationHelper::HeapReferenceData