Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dgraph_checker.cc199 block->GetBlockId(), in VisitBasicBlock()
201 p->GetBlockId(), in VisitBasicBlock()
202 p->GetBlockId(), in VisitBasicBlock()
204 block->GetBlockId())); in VisitBasicBlock()
228 block->GetBlockId(), in VisitBasicBlock()
230 s->GetBlockId(), in VisitBasicBlock()
231 s->GetBlockId(), in VisitBasicBlock()
233 block->GetBlockId())); in VisitBasicBlock()
245 block->GetBlockId())); in VisitBasicBlock()
267 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()
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()
Dcode_sinking.cc158 if (!discard_blocks.IsBitSet(instruction->GetBlock()->GetBlockId()) && in AddInstruction()
192 !post_dominated.IsBitSet(user->GetBlock()->GetBlockId()); in ShouldFilterUse()
196 !post_dominated.IsBitSet(user->GetBlock()->GetBlockId()); in ShouldFilterUse()
243 if (!post_dominated.IsBitSet(target_block->GetDominator()->GetBlockId())) { in FindIdealPosition()
267 if (!post_dominated.IsBitSet(target_block->GetBlockId())) { in FindIdealPosition()
276 if (!post_dominated.IsBitSet(target_block->GetBlockId())) { in FindIdealPosition()
349 post_dominated.SetBit(block->GetBlockId()); in SinkCodeToUncommonBranch()
386 if (!post_dominated.IsBitSet(successor->GetBlockId())) { in SinkCodeToUncommonBranch()
392 post_dominated.SetBit(block->GetBlockId()); in SinkCodeToUncommonBranch()
430 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()
287 visited.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
288 visiting.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
293 uint32_t current_id = current->GetBlockId(); in FindBackEdgesLocal()
299 uint32_t successor_id = successor->GetBlockId(); in FindBackEdgesLocal()
[all …]
Dgvn.cc376 ValueSet* result = sets_[block->GetBlockId()]; in FindSetFor()
377 DCHECK(result != nullptr) << "Could not find set for block B" << block->GetBlockId(); in FindSetFor()
382 DCHECK(sets_[block->GetBlockId()] != nullptr) in AbandonSetFor()
383 << "Block B" << block->GetBlockId() << " expected to have a set"; in AbandonSetFor()
384 sets_[block->GetBlockId()] = nullptr; in AbandonSetFor()
411 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (&allocator_) ValueSet(&allocator_); in Run()
483 sets_[block->GetBlockId()] = set; in VisitBasicBlock()
521 visited_blocks_.SetBit(block->GetBlockId()); in VisitBasicBlock()
525 DCHECK(visited_blocks_.IsBitSet(block->GetBlockId())); in WillBeReferencedAgain()
528 if (!visited_blocks_.IsBitSet(dominated_block->GetBlockId())) { in WillBeReferencedAgain()
[all …]
Dload_store_elimination.cc273 constexpr uint32_t GetBlockId() const { in GetBlockId() function in art::LSEVisitor::PhiPlaceholder
470 return std::get<MergedUnknownMarker>(value_).phi_.GetBlockId(); in GetMergeBlockId()
527 phi_placeholder.GetBlockId() * heap_location_collector_.GetNumberOfHeapLocations() + in PhiPlaceholderIndex()
832 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in HandleAcquireLoad()
853 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in HandleReleaseStore()
969 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block->GetBlockId()]; in VisitDeoptimize()
1005 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block->GetBlockId()]; in HandleExit()
1088 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in HandleInvoke()
1152 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block->GetBlockId()]; in VisitNewInstance()
1195 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block->GetBlockId()]; in VisitNewArray()
[all …]
Dblock_namer.cc26 os << blk->GetBlockId(); in PrintName()
Ddead_code_elimination.cc39 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()
45 int block_id = block->GetBlockId(); in MarkReachableBlocks()
86 if (!visited->IsBitSet(successor->GetBlockId())) { in MarkReachableBlocks()
87 visited->SetBit(successor->GetBlockId()); in MarkReachableBlocks()
711 it->second.blocks_in_try.SetBit(block->GetBlockId()); in RemoveUnneededTries()
730 it->second.coalesced_try_entries.SetBit(other_block->GetBlockId()); in RemoveUnneededTries()
804 visited_blocks.SetBit(merge_true->GetBlockId()); in RemoveEmptyIfs()
807 visited_blocks.SetBit(merge_true->GetBlockId()); in RemoveEmptyIfs()
811 while (!visited_blocks.IsBitSet(merge_false->GetBlockId()) && merge_false->IsSingleGoto()) { in RemoveEmptyIfs()
815 if (!visited_blocks.IsBitSet(merge_false->GetBlockId()) || !merge_false->GetPhis().IsEmpty()) { in RemoveEmptyIfs()
[all …]
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()
Dblock_builder.cc215 auto iterator = try_block_info.find(block->GetBlockId()); in GetTryItem()
288 try_block_info.Put(block->GetBlockId(), try_item); in InsertTryBoundaryBlocks()
324 bool is_try_block = (try_block_info.find(catch_block->GetBlockId()) != try_block_info.end()); in InsertTryBoundaryBlocks()
399 targets.insert(block->GetBlockId()); in InsertSynthesizedLoopsForOsr()
408 targets.insert(block->GetBlockId()); in InsertSynthesizedLoopsForOsr()
Dlicm.cc110 DCHECK(visited->IsBitSet(inner->GetBlockId())); in Run()
114 visited->SetBit(inner->GetBlockId()); in Run()
Dsuperblock_cloner.h38 HEdge(HBasicBlock* from, HBasicBlock* to) : from_(from->GetBlockId()), to_(to->GetBlockId()) { in HEdge()
216 return IsInOrigBBSet(block->GetBlockId()); in IsInOrigBBSet()
Dnodes.cc83 visited->SetBit(entry_block_->GetBlockId()); in FindBackEdges()
84 visiting.SetBit(entry_block_->GetBlockId()); in FindBackEdges()
89 uint32_t current_id = current->GetBlockId(); in FindBackEdges()
95 uint32_t successor_id = successor->GetBlockId(); in FindBackEdges()
331 uint32_t current_id = current->GetBlockId(); in ComputeDominanceInformation()
340 if (++visits[successor->GetBlockId()] == in ComputeDominanceInformation()
681 os << "header: " << header_->GetBlockId() << std::endl; in Dump()
682 os << "pre header: " << GetPreHeader()->GetBlockId() << std::endl; in Dump()
684 os << "back edge: " << block->GetBlockId() << std::endl; in Dump()
687 os << "predecessor: " << block->GetBlockId() << std::endl; in Dump()
[all …]
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()
Dscheduler.cc305 << " is in block " << other->GetBlock()->GetBlockId() in AddDependencies()
306 << ", and expected in block " << instruction->GetBlock()->GetBlockId(); in AddDependencies()
592 << " B" << block->GetBlockId(); in Schedule()
Dscheduler.h531 << " is in block " << instruction->GetBlock()->GetBlockId() in BuildSchedulingGraph()
532 << ", and expected in block " << block->GetBlockId(); in BuildSchedulingGraph()
Doptimizing_unit_test.h196 return os << alg_.GetName(blk) << " (" << blk->GetBlockId() << ")"; in Dump()
198 return os << "<Unnamed B" << blk->GetBlockId() << ">"; in Dump()
370 oss << b->GetBlockId(); in EnsurePredecessorOrder()
375 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()
Dbounds_check_elimination.cc507 return block->GetBlockId() >= initial_block_size_; in IsAddedBlock()
589 return &maps_[basic_block->GetBlockId()]; in GetValueRangeMap()
1710 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in IsEarlyExitLoop()
1781 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in CanHandleInfiniteLoop()
1813 const uint32_t loop_id = header->GetBlockId(); in GetPreHeader()
1904 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in TransformLoopForDeoptimizationIfNeeded()
Dfind_loops_test.cc109 ASSERT_EQ(block->GetLoopInformation()->GetHeader()->GetBlockId(), parent_loop_header_id); in TestBlock()

12