Home
last modified time | relevance | path

Searched refs:GetBlockId (Results 1 – 25 of 41) sorted by relevance

12

/art/compiler/optimizing/
Dexecution_subgraph.cc53 uint32_t id = to_remove->GetBlockId(); in RemoveBlock()
118 DCHECK(std::find(current_path.cbegin(), current_path.cend(), cur_block->GetBlockId()) == in Prune()
126 current_path.push_back(cur_block->GetBlockId()); in Prune()
127 visiting.SetBit(cur_block->GetBlockId()); in Prune()
136 DCHECK_GE(last_succ_seen[graph_->GetEntryBlock()->GetBlockId()], in Prune()
158 const uint32_t entry_block_id = graph_->GetEntryBlock()->GetBlockId(); in Prune()
161 uint32_t id = cur_block->GetBlockId(); in Prune()
163 current_path.front() == graph_->GetEntryBlock()->GetBlockId()) in Prune()
165 << " cur_block id: " << cur_block->GetBlockId() << " entry id " in Prune()
166 << graph_->GetEntryBlock()->GetBlockId(); in Prune()
[all …]
Dgraph_checker.cc192 block->GetBlockId(), p_count_in_block_predecessors, p->GetBlockId(), in VisitBasicBlock()
193 p->GetBlockId(), block_count_in_p_successors, block->GetBlockId())); in VisitBasicBlock()
215 block->GetBlockId(), s_count_in_block_successors, s->GetBlockId(), in VisitBasicBlock()
216 s->GetBlockId(), block_count_in_s_predecessors, block->GetBlockId())); in VisitBasicBlock()
226 block->GetBlockId())); in VisitBasicBlock()
248 current_block_->GetBlockId())); in VisitBasicBlock()
257 current_block_->GetBlockId())); in VisitBasicBlock()
268 current_block_->GetBlockId())); in VisitBasicBlock()
273 current_block_->GetBlockId(), in VisitBasicBlock()
285 current_block_->GetBlockId())); in VisitBasicBlock()
[all …]
Dpretty_printer.h76 PrintInt(block->GetBlockId()); in VisitBasicBlock()
81 PrintInt(predecessors[i]->GetBlockId()); in VisitBasicBlock()
84 PrintInt(predecessors.back()->GetBlockId()); in VisitBasicBlock()
90 PrintInt(successors[i]->GetBlockId()); in VisitBasicBlock()
93 PrintInt(successors.back()->GetBlockId()); in VisitBasicBlock()
137 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId()); in VisitGoto()
Dexecution_subgraph.h48 return b->GetBlockId(); in operator()
85 return inner_.IsBitSet(b->GetBlockId()); in operator()
155 return entry_blocks_.IsBitSet(blk->GetBlockId()); in IsEntryBlock()
169 return blocks_.IsBitSet(blk->GetBlockId()); in ContainsBlock()
181 return blk->GetGraph()->PathBetween(blk->GetBlockId(), entry); in SucceedsBlock()
194 return blk->GetGraph()->PathBetween(exit, blk->GetBlockId()); in PrecedesBlock()
245 return !unreachable_blocks_.IsBitSet(blk->GetBlockId()); in ContainsBlock()
311 return allowed_successors_[blk->GetBlockId()]; in GetAllowedSuccessors()
317 allowed_successors_[block->GetBlockId()] &= allowed; in LimitBlockSuccessors()
Dside_effects_analysis.cc54 block_effects_[block->GetBlockId()] = effects; in Run()
77 return loop_effects_[block->GetBlockId()]; in GetLoopEffects()
81 return block_effects_[block->GetBlockId()]; in GetBlockEffects()
85 uint32_t id = info->GetHeader()->GetBlockId(); in UpdateLoopEffects()
Dload_store_elimination.cc352 constexpr uint32_t GetBlockId() const { in GetBlockId() function in art::LSEVisitor::PhiPlaceholder
549 return std::get<MergedUnknownMarker>(value_).phi_.GetBlockId(); in GetMergeBlockId()
606 phi_placeholder.GetBlockId() * heap_location_collector_.GetNumberOfHeapLocations() + in PhiPlaceholderIndex()
986 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in HandleAcquireLoad()
1007 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in HandleReleaseStore()
1095 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block->GetBlockId()]; in VisitDeoptimize()
1131 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block->GetBlockId()]; in HandleExit()
1214 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in HandleInvoke()
1299 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block->GetBlockId()]; in VisitNewInstance()
1342 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block->GetBlockId()]; in VisitNewArray()
[all …]
Dcode_sinking.cc156 if (!discard_blocks.IsBitSet(instruction->GetBlock()->GetBlockId()) && in AddInstruction()
190 !post_dominated.IsBitSet(user->GetBlock()->GetBlockId()); in ShouldFilterUse()
194 !post_dominated.IsBitSet(user->GetBlock()->GetBlockId()); in ShouldFilterUse()
241 if (!post_dominated.IsBitSet(target_block->GetDominator()->GetBlockId())) { in FindIdealPosition()
265 if (!post_dominated.IsBitSet(target_block->GetBlockId())) { in FindIdealPosition()
274 if (!post_dominated.IsBitSet(target_block->GetBlockId())) { in FindIdealPosition()
352 post_dominated.SetBit(block->GetBlockId()); in SinkCodeToUncommonBranch()
389 if (!post_dominated.IsBitSet(successor->GetBlockId())) { in SinkCodeToUncommonBranch()
395 post_dominated.SetBit(block->GetBlockId()); in SinkCodeToUncommonBranch()
427 if (!post_dominated.IsBitSet(user->GetBlock()->GetBlockId()) && in SinkCodeToUncommonBranch()
[all …]
Dsuperblock_cloner.cc46 if (!bb_set.IsBitSet(user->GetBlock()->GetBlockId())) { in IsUsedOutsideRegion()
54 if (!bb_set.IsBitSet(user->GetBlock()->GetBlockId())) { in IsUsedOutsideRegion()
102 DCHECK(bb_set->IsBitSet(block->GetBlockId())); in TraverseSubgraphForConnectivity()
103 bb_set->ClearBit(block->GetBlockId()); in TraverseSubgraphForConnectivity()
106 if (bb_set->IsBitSet(succ->GetBlockId())) { in TraverseSubgraphForConnectivity()
241 uint32_t orig_pred_id = orig_pred->GetBlockId(); in CopyIncomingEdgesForVersioning()
289 visited.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
290 visiting.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
295 uint32_t current_id = current->GetBlockId(); in FindBackEdgesLocal()
301 uint32_t successor_id = successor->GetBlockId(); in FindBackEdgesLocal()
[all …]
Dgvn.cc379 ValueSet* result = sets_[block->GetBlockId()]; in FindSetFor()
380 DCHECK(result != nullptr) << "Could not find set for block B" << block->GetBlockId(); in FindSetFor()
385 DCHECK(sets_[block->GetBlockId()] != nullptr) in AbandonSetFor()
386 << "Block B" << block->GetBlockId() << " expected to have a set"; in AbandonSetFor()
387 sets_[block->GetBlockId()] = nullptr; in AbandonSetFor()
414 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (&allocator_) ValueSet(&allocator_); in Run()
486 sets_[block->GetBlockId()] = set; in VisitBasicBlock()
524 visited_blocks_.SetBit(block->GetBlockId()); in VisitBasicBlock()
528 DCHECK(visited_blocks_.IsBitSet(block->GetBlockId())); in WillBeReferencedAgain()
531 if (!visited_blocks_.IsBitSet(dominated_block->GetBlockId())) { in WillBeReferencedAgain()
[all …]
Dblock_namer.cc26 os << blk->GetBlockId(); in PrintName()
Dcha_guard_optimization.cc139 if (block_has_cha_guard_[dominator->GetBlockId()] == 1) { in OptimizeWithDominatingGuard()
211 block_has_cha_guard_[pre_header->GetBlockId()] = 1; in HoistGuard()
241 block_has_cha_guard_[flag->GetBlock()->GetBlockId()] = 1; in VisitShouldDeoptimizeFlag()
Dlinear_order.cc105 forward_predecessors[block->GetBlockId()] = number_of_forward_predecessors; in LinearizeGraphInternal()
120 int block_id = successor->GetBlockId(); in LinearizeGraphInternal()
Dlicm.cc110 DCHECK(visited->IsBitSet(inner->GetBlockId())); in Run()
114 visited->SetBit(inner->GetBlockId()); in Run()
Dblock_builder.cc228 auto iterator = try_block_info.find(block->GetBlockId()); in GetTryItem()
301 try_block_info.Put(block->GetBlockId(), try_item); in InsertTryBoundaryBlocks()
337 bool is_try_block = (try_block_info.find(catch_block->GetBlockId()) != try_block_info.end()); in InsertTryBoundaryBlocks()
412 targets.insert(block->GetBlockId()); in InsertSynthesizedLoopsForOsr()
421 targets.insert(block->GetBlockId()); in InsertSynthesizedLoopsForOsr()
Dnodes.cc81 visited->SetBit(entry_block_->GetBlockId()); in FindBackEdges()
82 visiting.SetBit(entry_block_->GetBlockId()); in FindBackEdges()
87 uint32_t current_id = current->GetBlockId(); in FindBackEdges()
93 uint32_t successor_id = successor->GetBlockId(); in FindBackEdges()
314 size_t source_idx = source->GetBlockId(); in PathBetween()
315 size_t dest_idx = dest->GetBlockId(); in PathBetween()
363 not_post_order_visited_.ClearBit(blk->GetBlockId()); in CalculateReachability()
365 all_visited_nodes_.SetBit(blk->GetBlockId()); in CalculateReachability()
374 all_visited_nodes_.SetBit(blk->GetBlockId()); in CalculateReachability()
380 reachability_graph_->SetBit(source, dest->GetBlockId()); in AddEdge()
[all …]
Dsuperblock_cloner.h38 HEdge(HBasicBlock* from, HBasicBlock* to) : from_(from->GetBlockId()), to_(to->GetBlockId()) { in HEdge()
216 return IsInOrigBBSet(block->GetBlockId()); in IsInOrigBBSet()
Dscheduler.cc327 << " is in block " << other->GetBlock()->GetBlockId() in AddDependencies()
328 << ", and expected in block " << instruction->GetBlock()->GetBlockId(); in AddDependencies()
581 << " is in block " << instruction->GetBlock()->GetBlockId() in Schedule()
582 << ", and expected in block " << block->GetBlockId(); in Schedule()
624 << " B" << block->GetBlockId(); in Schedule()
Ddead_code_elimination.cc38 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()
44 int block_id = block->GetBlockId(); in MarkReachableBlocks()
85 if (!visited->IsBitSet(successor->GetBlockId())) { in MarkReachableBlocks()
86 visited->SetBit(successor->GetBlockId()); in MarkReachableBlocks()
795 int id = block->GetBlockId(); in RemoveDeadBlocks()
Dload_store_analysis.cc107 if (!additional_exclusions.IsBitSet(user->GetBlock()->GetBlockId()) && in PrunePartialEscapeWrites()
121 additional_exclusions.SetBit(user->GetBlock()->GetBlockId()); in PrunePartialEscapeWrites()
Dlinearize_test.cc53 ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]); in TestCode()
Dsuperblock_cloner_test.cc280 bb_set.SetBit(header->GetBlockId()); in TEST_F()
281 bb_set.SetBit(loop_body->GetBlockId()); in TEST_F()
282 bb_set.SetBit(unreachable_block->GetBlockId()); in TEST_F()
286 EXPECT_TRUE(bb_set.IsBitSet(unreachable_block->GetBlockId())); in TEST_F()
652 orig_bb_set.SetBit(preheader->GetBlockId()); in TEST_F()
Doptimizing_unit_test.h198 return os << alg_.GetName(blk) << " (" << blk->GetBlockId() << ")"; in Dump()
200 return os << "<Unnamed B" << blk->GetBlockId() << ">"; in Dump()
373 oss << b->GetBlockId(); in EnsurePredecessorOrder()
378 ASSERT_TRUE(correct_preds) << "Predecessors of " << target->GetBlockId() << " are " in EnsurePredecessorOrder()
Ddominator_test.cc49 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
Dliveness_test.cc60 buffer << "Block " << block->GetBlockId() << std::endl; in TestCode()
Dreference_type_propagation_test.cc330 CHECK(single_value[pred] != nullptr) << pred->GetBlockId() << " " << alg.GetName(pred); in RunVisitListTest()
335 CHECK(single_value[blk]->IsPhi()) << blk->GetBlockId(); in RunVisitListTest()

12