| /art/compiler/optimizing/ |
| D | execution_subgraph.h | 64 HBasicBlock* blk = graph_->GetBlocks()[id]; in GetBlock() local
65 DCHECK(blk != nullptr); in GetBlock()
66 return blk; in GetBlock()
153 bool IsEntryBlock(const HBasicBlock* blk) const { in IsEntryBlock() argument
154 return entry_blocks_.IsBitSet(blk->GetBlockId()); in IsEntryBlock()
167 bool ContainsBlock(const HBasicBlock* blk) const { in ContainsBlock() argument
168 return blocks_.IsBitSet(blk->GetBlockId()); in ContainsBlock()
174 bool SucceedsBlock(const HBasicBlock* blk) const { in SucceedsBlock() argument
175 if (ContainsBlock(blk)) { in SucceedsBlock()
180 return blk->GetGraph()->PathBetween(blk->GetBlockId(), entry); in SucceedsBlock()
[all …]
|
| D | block_namer.h | 32 virtual std::ostream& PrintName(std::ostream& os, HBasicBlock* blk) const;
33 NameWrapper GetName(HBasicBlock* blk) const { in GetName()
34 return NameWrapper{blk, *this}; in GetName()
38 inline std::ostream& operator<<(std::ostream& os, const BlockNamer::NameWrapper& blk) {
39 return blk.namer_.PrintName(os, blk.blk_);
|
| D | execution_subgraph.cc | 123 auto push_block = [&](const HBasicBlock* blk) { in Prune() argument
134 cur_block = blk; in Prune()
226 for (const HBasicBlock* blk : graph_->GetBlocks()) { in Prune() local
227 if (blk != nullptr && in Prune()
228 results[blk->GetBlockId()].none() && in Prune()
229 blk != graph_->GetExitBlock() && in Prune()
230 blk != graph_->GetEntryBlock()) { in Prune()
232 unreachable_blocks_.SetBit(blk->GetBlockId()); in Prune()
248 for (const HBasicBlock* blk : graph_->GetBlocks()) { in RemoveConcavity() local
249 if (blk == nullptr || unreachable_blocks_.IsBitSet(blk->GetBlockId())) { in RemoveConcavity()
[all …]
|
| D | reference_type_propagation_test.cc | 322 for (HBasicBlock* blk : succ_blocks) { in RunVisitListTest()
324 GetAllocator(), kNoRegNumber, blk->GetPredecessors().size(), DataType::Type::kReference); in RunVisitListTest()
325 single_value[blk] = phi_inst; in RunVisitListTest()
327 for (HBasicBlock* blk : succ_blocks) { in RunVisitListTest()
328 HInstruction* my_val = single_value[blk]; in RunVisitListTest()
329 for (const auto& [pred, index] : ZipCount(MakeIterationRange(blk->GetPredecessors()))) { in RunVisitListTest()
334 for (HBasicBlock* blk : succ_blocks) { in RunVisitListTest()
335 CHECK(single_value[blk]->IsPhi()) << blk->GetBlockId(); in RunVisitListTest()
336 blk->AddPhi(single_value[blk]->AsPhi()); in RunVisitListTest()
338 auto vals = MakeTransformRange(succ_blocks, [&](HBasicBlock* blk) { in RunVisitListTest() argument
[all …]
|
| D | block_namer.cc | 23 std::ostream& BlockNamer::PrintName(std::ostream& os, HBasicBlock* blk) const { in PrintName()
25 if (blk != nullptr) { in PrintName()
26 os << blk->GetBlockId(); in PrintName()
|
| D | load_store_elimination.cc | 618 bool IsPartialNoEscape(HBasicBlock* blk, size_t idx) { in IsPartialNoEscape() argument
629 return ex.PrecedesBlock(blk) || in IsPartialNoEscape()
630 ex.ContainsBlock(blk) || in IsPartialNoEscape()
631 ex.SucceedsBlock(blk); in IsPartialNoEscape()
980 HBasicBlock* blk);
1102 HBasicBlock* blk = instruction->GetBlock(); in HandleInvoke() local
1109 auto partial_singleton_did_not_escape = [](ReferenceInfo* ref_info, HBasicBlock* blk) { in HandleInvoke() argument
1111 if (!ref_info->GetNoEscapeSubgraph()->ContainsBlock(blk)) { in HandleInvoke()
1119 return cohort.PrecedesBlock(blk); in HandleInvoke()
1124 (ref_info->IsPartialSingleton() && partial_singleton_did_not_escape(ref_info, blk))) { in HandleInvoke()
[all …]
|
| D | optimizing_unit_test.h | 151 HBasicBlock* blk = new (alloc) HBasicBlock(graph_); in AdjacencyListGraph() local
152 graph_->AddBlock(blk); in AdjacencyListGraph()
153 return blk; in AdjacencyListGraph()
169 for (auto [name, blk] : name_to_block_) { in AdjacencyListGraph()
170 block_to_name_.Put(blk, name); in AdjacencyListGraph()
174 bool HasBlock(const HBasicBlock* blk) const { in HasBlock() argument
175 return block_to_name_.find(blk) != block_to_name_.end(); in HasBlock()
178 std::string_view GetName(const HBasicBlock* blk) const { in GetName() argument
179 return block_to_name_.Get(blk); in GetName()
195 std::ostream& PrintName(std::ostream& os, HBasicBlock* blk) const override { in Dump()
[all …]
|
| D | load_store_analysis.cc | 176 for (HBasicBlock* blk : graph->GetActiveBlocks()) { in CollectPartialEscapes()
177 if (blk->IsLoopHeader() && blk->GetLoopInformation()->IsIrreducible()) { in CollectPartialEscapes()
178 HandleEscape(blk); in CollectPartialEscapes()
|
| D | graph_visualizer.h | 127 std::ostream& PrintName(std::ostream& os, HBasicBlock* blk) const override;
|
| D | graph_visualizer.cc | 241 void PrintProperty(const char* name, HBasicBlock* blk) { in PrintProperty() argument
243 output_ << name << " \"" << namer_.GetName(blk) << "\"\n"; in PrintProperty()
959 HBasicBlock* blk) const { in PrintName()
961 return namer_->get().PrintName(os, blk); in PrintName()
963 return BlockNamer::PrintName(os, blk); in PrintName()
|
| D | load_store_analysis_test.cc | 721 for (HBasicBlock* blk : graph_->GetBlocks()) { in CheckReachability()
722 if (adj.HasBlock(blk)) { in CheckReachability()
731 AdjacencyListGraph::Edge { adj.GetName(blk), adj.GetName(other) }) != in CheckReachability()
733 if (graph_->PathBetween(blk, other)) { in CheckReachability()
735 EXPECT_TRUE(contains_edge) << "Unexpected edge found between " << adj.GetName(blk) in CheckReachability()
738 EXPECT_FALSE(contains_edge) << "Expected edge not found between " << adj.GetName(blk) in CheckReachability()
741 } else if (graph_->PathBetween(blk, other)) { in CheckReachability()
742 ADD_FAILURE() << "block " << adj.GetName(blk) in CheckReachability()
751 EXPECT_FALSE(graph_->PathBetween(blk, other)) in CheckReachability()
|
| D | nodes.cc | 333 for (const HBasicBlock* blk : graph_->GetPostOrder()) { in CalculateReachability() local
334 if (blk == nullptr) { in CalculateReachability()
337 not_post_order_visited_.ClearBit(blk->GetBlockId()); in CalculateReachability()
338 CalculateConnectednessOn(blk); in CalculateReachability()
339 all_visited_nodes_.SetBit(blk->GetBlockId()); in CalculateReachability()
343 const HBasicBlock* blk = graph_->GetBlocks()[idx]; in CalculateReachability() local
344 if (blk == nullptr) { in CalculateReachability()
347 CalculateConnectednessOn(blk); in CalculateReachability()
348 all_visited_nodes_.SetBit(blk->GetBlockId()); in CalculateReachability()
|
| D | load_store_elimination_test.cc | 419 void AddSetup(HBasicBlock* blk) const { in AddSetup()
421 blk->AddInstruction(i); in AddSetup()
|
| /art/test/988-method-trace/ |
| D | gen_srcs.py | 205 for blk in KLASS_BLACK_LIST:
206 if self.klass.startswith(blk):
|