Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dgraph_checker.cc109 block->GetBlockId(), p_count_in_block_predecessors, p->GetBlockId(), in VisitBasicBlock()
110 p->GetBlockId(), block_count_in_p_successors, block->GetBlockId())); in VisitBasicBlock()
132 block->GetBlockId(), s_count_in_block_successors, s->GetBlockId(), in VisitBasicBlock()
133 s->GetBlockId(), block_count_in_s_predecessors, block->GetBlockId())); in VisitBasicBlock()
143 block->GetBlockId())); in VisitBasicBlock()
167 current_block_->GetBlockId())); in VisitBasicBlock()
172 current_block_->GetBlockId(), in VisitBasicBlock()
184 current_block_->GetBlockId())); in VisitBasicBlock()
189 current_block_->GetBlockId(), in VisitBasicBlock()
200 successor->GetBlockId(), in VisitBasicBlock()
[all …]
Dpretty_printer.h75 PrintInt(block->GetBlockId()); in VisitBasicBlock()
80 PrintInt(predecessors[i]->GetBlockId()); in VisitBasicBlock()
83 PrintInt(predecessors.back()->GetBlockId()); in VisitBasicBlock()
89 PrintInt(successors[i]->GetBlockId()); in VisitBasicBlock()
92 PrintInt(successors.back()->GetBlockId()); in VisitBasicBlock()
136 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.cc128 if (!discard_blocks.IsBitSet(instruction->GetBlock()->GetBlockId()) && in AddInstruction()
162 !post_dominated.IsBitSet(user->GetBlock()->GetBlockId()); in ShouldFilterUse()
166 !post_dominated.IsBitSet(user->GetBlock()->GetBlockId()); in ShouldFilterUse()
211 if (!post_dominated.IsBitSet(target_block->GetDominator()->GetBlockId())) { in FindIdealPosition()
280 post_dominated.SetBit(block->GetBlockId()); in SinkCodeToUncommonBranch()
288 if (!post_dominated.IsBitSet(successor->GetBlockId())) { in SinkCodeToUncommonBranch()
295 post_dominated.SetBit(block->GetBlockId()); in SinkCodeToUncommonBranch()
327 if (!post_dominated.IsBitSet(user->GetBlock()->GetBlockId()) && in SinkCodeToUncommonBranch()
350 if (!post_dominated.IsBitSet(user->GetBlock()->GetBlockId())) { in SinkCodeToUncommonBranch()
380 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()
255 visited.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
256 visiting.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
261 uint32_t current_id = current->GetBlockId(); in FindBackEdgesLocal()
267 uint32_t successor_id = successor->GetBlockId(); in FindBackEdgesLocal()
290 outer_loop_bb_set->SetBit(block->GetBlockId()); in RecalculateBackEdgesInfo()
[all …]
Dgvn.cc364 ValueSet* result = sets_[block->GetBlockId()]; in FindSetFor()
365 DCHECK(result != nullptr) << "Could not find set for block B" << block->GetBlockId(); in FindSetFor()
370 DCHECK(sets_[block->GetBlockId()] != nullptr) in AbandonSetFor()
371 << "Block B" << block->GetBlockId() << " expected to have a set"; in AbandonSetFor()
372 sets_[block->GetBlockId()] = nullptr; in AbandonSetFor()
399 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (&allocator_) ValueSet(&allocator_); in Run()
471 sets_[block->GetBlockId()] = set; in VisitBasicBlock()
506 visited_blocks_.SetBit(block->GetBlockId()); in VisitBasicBlock()
510 DCHECK(visited_blocks_.IsBitSet(block->GetBlockId())); in WillBeReferencedAgain()
513 if (!visited_blocks_.IsBitSet(dominated_block->GetBlockId())) { in WillBeReferencedAgain()
[all …]
Dload_store_elimination.cc339 int block_id = block->GetBlockId(); in HandleLoopSideEffects()
343 heap_values_for_[pre_header->GetBlockId()]; in HandleLoopSideEffects()
396 ScopedArenaVector<HInstruction*>& heap_values = heap_values_for_[block->GetBlockId()]; in MergePredecessorValues()
415 HInstruction* pred_value = heap_values_for_[predecessor->GetBlockId()][i]; in MergePredecessorValues()
473 heap_values_for_[predecessor->GetBlockId()]; in MergePredecessorValues()
493 DCHECK_EQ(heap_values_for_[predecessors[0]->GetBlockId()][i], merged_value); in MergePredecessorValues()
553 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in VisitGetLocation()
599 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in VisitSetLocation()
697 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in VisitDeoptimize()
736 heap_values_for_[block->GetBlockId()]; in HandleExit()
[all …]
Dcha_guard_optimization.cc139 if (block_has_cha_guard_[dominator->GetBlockId()] == 1) { in OptimizeWithDominatingGuard()
210 block_has_cha_guard_[pre_header->GetBlockId()] = 1; in HoistGuard()
240 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()
Ddead_code_elimination.cc35 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()
41 int block_id = block->GetBlockId(); in MarkReachableBlocks()
82 if (!visited->IsBitSet(successor->GetBlockId())) { in MarkReachableBlocks()
83 visited->SetBit(successor->GetBlockId()); in MarkReachableBlocks()
463 int id = block->GetBlockId(); in RemoveDeadBlocks()
Dgraph_visualizer.cc253 output_ << " \"B" << predecessor->GetBlockId() << "\" "; in PrintPredecessors()
265 output_ << " \"B" << successor->GetBlockId() << "\" "; in PrintSuccessors()
274 output_ << " \"B" << handler->GetBlockId() << "\" "; in PrintExceptionHandlers()
664 StartAttributeStream("loop") << "B" << loop_info->GetHeader()->GetBlockId(); in PrintInstruction()
667 StartAttributeStream("outer_loop") << "B" << outer->GetHeader()->GetBlockId(); in PrintInstruction()
775 GetGraph()->GetEntryBlock()->GetBlockId()); in DumpDisassemblyBlockForFrameEntry()
795 GetGraph()->HasExitBlock() ? GetGraph()->GetExitBlock()->GetBlockId() : -1, in DumpDisassemblyBlockForSlowPaths()
826 PrintProperty("name", "B", block->GetBlockId()); in VisitBasicBlock()
846 PrintProperty("dominator", "B", block->GetDominator()->GetBlockId()); in VisitBasicBlock()
Dsuperblock_cloner.h36 HEdge(HBasicBlock* from, HBasicBlock* to) : from_(from->GetBlockId()), to_(to->GetBlockId()) { in HEdge()
213 return IsInOrigBBSet(block->GetBlockId()); in IsInOrigBBSet()
Dnodes.cc73 visited->SetBit(entry_block_->GetBlockId()); in FindBackEdges()
74 visiting.SetBit(entry_block_->GetBlockId()); in FindBackEdges()
79 uint32_t current_id = current->GetBlockId(); in FindBackEdges()
85 uint32_t successor_id = successor->GetBlockId(); in FindBackEdges()
288 uint32_t current_id = current->GetBlockId(); in ComputeDominanceInformation()
297 if (++visits[successor->GetBlockId()] == in ComputeDominanceInformation()
623 os << "header: " << header_->GetBlockId() << std::endl; in Dump()
624 os << "pre header: " << GetPreHeader()->GetBlockId() << std::endl; in Dump()
626 os << "back edge: " << block->GetBlockId() << std::endl; in Dump()
629 os << "predecessor: " << block->GetBlockId() << std::endl; in Dump()
[all …]
Dscheduler.cc317 << " is in block " << other->GetBlock()->GetBlockId() in AddDependencies()
318 << ", and expected in block " << instruction->GetBlock()->GetBlockId(); in AddDependencies()
602 << " is in block " << instruction->GetBlock()->GetBlockId() in Schedule()
603 << ", and expected in block " << block->GetBlockId(); in Schedule()
645 << " B" << block->GetBlockId(); in Schedule()
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()
Dsuperblock_cloner_test.cc276 bb_set.SetBit(header->GetBlockId()); in TEST_F()
277 bb_set.SetBit(loop_body->GetBlockId()); in TEST_F()
278 bb_set.SetBit(unreachable_block->GetBlockId()); in TEST_F()
282 EXPECT_TRUE(bb_set.IsBitSet(unreachable_block->GetBlockId())); in TEST_F()
646 orig_bb_set.SetBit(preheader->GetBlockId()); in TEST_F()
Dlinearize_test.cc50 ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]); in TestCode()
Ddominator_test.cc48 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
Dliveness_test.cc57 buffer << "Block " << block->GetBlockId() << std::endl; in TestCode()
Dbounds_check_elimination.cc507 return block->GetBlockId() >= initial_block_size_; in IsAddedBlock()
576 return &maps_[basic_block->GetBlockId()]; in GetValueRangeMap()
1587 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in IsEarlyExitLoop()
1658 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in CanHandleInfiniteLoop()
1690 const uint32_t loop_id = header->GetBlockId(); in GetPreHeader()
1780 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in TransformLoopForDeoptimizationIfNeeded()
Dfind_loops_test.cc108 ASSERT_EQ(block->GetLoopInformation()->GetHeader()->GetBlockId(), parent_loop_header_id); in TestBlock()
Dssa_liveness_analysis.h1190 return &block_infos_[block.GetBlockId()]->live_in_; in GetLiveInSet()
1194 return &block_infos_[block.GetBlockId()]->live_out_; in GetLiveOutSet()
1198 return &block_infos_[block.GetBlockId()]->kill_; in GetKillSet()
Dregister_allocation_resolver.cc448 << " " << from->GetBlockId() << " -> " << to->GetBlockId(); in ConnectSplitSiblings()
Dssa_liveness_analysis.cc91 block_infos_[block->GetBlockId()] = in ComputeLiveness()

12