Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dgraph_checker.cc66 block->GetBlockId(), p_count_in_block_predecessors, p->GetBlockId(), in VisitBasicBlock()
67 p->GetBlockId(), block_count_in_p_successors, block->GetBlockId())); in VisitBasicBlock()
89 block->GetBlockId(), s_count_in_block_successors, s->GetBlockId(), in VisitBasicBlock()
90 s->GetBlockId(), block_count_in_s_predecessors, block->GetBlockId())); in VisitBasicBlock()
100 block->GetBlockId())); in VisitBasicBlock()
124 current_block_->GetBlockId())); in VisitBasicBlock()
129 current_block_->GetBlockId(), in VisitBasicBlock()
141 current_block_->GetBlockId())); in VisitBasicBlock()
146 current_block_->GetBlockId(), in VisitBasicBlock()
157 successor->GetBlockId(), in VisitBasicBlock()
[all …]
Dpretty_printer.h73 PrintInt(block->GetBlockId()); in VisitBasicBlock()
78 PrintInt(predecessors[i]->GetBlockId()); in VisitBasicBlock()
81 PrintInt(predecessors.back()->GetBlockId()); in VisitBasicBlock()
87 PrintInt(successors[i]->GetBlockId()); in VisitBasicBlock()
90 PrintInt(successors.back()->GetBlockId()); in VisitBasicBlock()
134 PrintInt(current_block_->GetSuccessors()[0]->GetBlockId()); in VisitGoto()
Dside_effects_analysis.cc57 block_effects_[block->GetBlockId()] = effects; in Run()
79 return loop_effects_[block->GetBlockId()]; in GetLoopEffects()
83 return block_effects_[block->GetBlockId()]; in GetBlockEffects()
87 uint32_t id = info->GetHeader()->GetBlockId(); in UpdateLoopEffects()
Dgvn.cc375 ValueSet* result = sets_[block->GetBlockId()]; in FindSetFor()
376 DCHECK(result != nullptr) << "Could not find set for block B" << block->GetBlockId(); in FindSetFor()
381 DCHECK(sets_[block->GetBlockId()] != nullptr) in AbandonSetFor()
382 << "Block B" << block->GetBlockId() << " expected to have a set"; in AbandonSetFor()
383 sets_[block->GetBlockId()] = nullptr; in AbandonSetFor()
410 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (allocator_) ValueSet(allocator_); in Run()
481 sets_[block->GetBlockId()] = set; in VisitBasicBlock()
513 visited_blocks_.SetBit(block->GetBlockId()); in VisitBasicBlock()
517 DCHECK(visited_blocks_.IsBitSet(block->GetBlockId())); in WillBeReferencedAgain()
520 if (!visited_blocks_.IsBitSet(dominated_block->GetBlockId())) { in WillBeReferencedAgain()
[all …]
Ddead_code_elimination.cc29 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()
35 int block_id = block->GetBlockId(); in MarkReachableBlocks()
76 if (!visited->IsBitSet(successor->GetBlockId())) { in MarkReachableBlocks()
77 visited->SetBit(successor->GetBlockId()); in MarkReachableBlocks()
111 int id = block->GetBlockId(); in RemoveDeadBlocks()
Dgraph_visualizer.cc258 output_ << " \"B" << predecessor->GetBlockId() << "\" "; in PrintPredecessors()
270 output_ << " \"B" << successor->GetBlockId() << "\" "; in PrintSuccessors()
279 output_ << " \"B" << handler->GetBlockId() << "\" "; in PrintExceptionHandlers()
556 StartAttributeStream("loop") << "B" << loop_info->GetHeader()->GetBlockId(); in PrintInstruction()
559 StartAttributeStream("outer_loop") << "B" << outer->GetHeader()->GetBlockId(); in PrintInstruction()
654 GetGraph()->GetEntryBlock()->GetBlockId()); in DumpDisassemblyBlockForFrameEntry()
674 GetGraph()->HasExitBlock() ? GetGraph()->GetExitBlock()->GetBlockId() : -1, in DumpDisassemblyBlockForSlowPaths()
705 PrintProperty("name", "B", block->GetBlockId()); in VisitBasicBlock()
725 PrintProperty("dominator", "B", block->GetDominator()->GetBlockId()); in VisitBasicBlock()
Dlicm.cc109 DCHECK(visited->IsBitSet(inner->GetBlockId())); in Run()
113 visited->SetBit(inner->GetBlockId()); in Run()
Dload_store_elimination.cc598 int block_id = block->GetBlockId(); in HandleLoopSideEffects()
614 heap_values_for_[pre_header->GetBlockId()]; in HandleLoopSideEffects()
645 ArenaVector<HInstruction*>& heap_values = heap_values_for_[block->GetBlockId()]; in MergePredecessorValues()
647 HInstruction* pred0_value = heap_values_for_[predecessors[0]->GetBlockId()][i]; in MergePredecessorValues()
651 HInstruction* pred_value = heap_values_for_[predecessors[j]->GetBlockId()][i]; in MergePredecessorValues()
662 ArenaVector<HInstruction*>& pred_values = heap_values_for_[predecessors[j]->GetBlockId()]; in MergePredecessorValues()
720 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in VisitGetLocation()
784 heap_values_for_[instruction->GetBlock()->GetBlockId()]; in VisitSetLocation()
915 heap_values_for_[invoke->GetBlock()->GetBlockId()]; in HandleInvoke()
979 heap_values_for_[new_instance->GetBlock()->GetBlockId()]; in VisitNewInstance()
Dnodes.cc66 visited->SetBit(entry_block_->GetBlockId()); in FindBackEdges()
67 visiting.SetBit(entry_block_->GetBlockId()); in FindBackEdges()
72 uint32_t current_id = current->GetBlockId(); in FindBackEdges()
78 uint32_t successor_id = successor->GetBlockId(); in FindBackEdges()
246 uint32_t current_id = current->GetBlockId(); in ComputeDominanceInformation()
255 if (++visits[successor->GetBlockId()] == in ComputeDominanceInformation()
467 os << "header: " << header_->GetBlockId() << std::endl; in Dump()
468 os << "pre header: " << GetPreHeader()->GetBlockId() << std::endl; in Dump()
470 os << "back edge: " << block->GetBlockId() << std::endl; in Dump()
473 os << "predecessor: " << block->GetBlockId() << std::endl; in Dump()
[all …]
Dblock_builder.cc194 auto iterator = try_block_info.find(block->GetBlockId()); in GetTryItem()
265 try_block_info.Put(block->GetBlockId(), DexFile::GetTryItems(code_item_, try_item_idx)); in InsertTryBoundaryBlocks()
293 bool is_try_block = (try_block_info.find(catch_block->GetBlockId()) != try_block_info.end()); in InsertTryBoundaryBlocks()
Dlinearize_test.cc51 ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]); in TestCode()
Dssa_liveness_analysis.cc80 forward_predecessors[block->GetBlockId()] = number_of_forward_predecessors; in LinearizeGraph()
95 int block_id = successor->GetBlockId(); in LinearizeGraph()
162 block_infos_[block->GetBlockId()] = in ComputeLiveness()
Ddominator_test.cc45 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
Dliveness_test.cc61 buffer << "Block " << block->GetBlockId() << std::endl; in TestCode()
Dbounds_check_elimination.cc521 return block->GetBlockId() >= initial_block_size_; in IsAddedBlock()
589 return &maps_[basic_block->GetBlockId()]; in GetValueRangeMap()
1396 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in IsEarlyExitLoop()
1468 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in CanHandleInfiniteLoop()
1505 const uint32_t loop_id = header->GetBlockId(); in GetPreHeader()
1587 const uint32_t loop_id = loop->GetHeader()->GetBlockId(); in TransformLoopForDeoptimizationIfNeeded()
Dssa_liveness_analysis.h1163 return &block_infos_[block.GetBlockId()]->live_in_; in GetLiveInSet()
1167 return &block_infos_[block.GetBlockId()]->live_out_; in GetLiveOutSet()
1171 return &block_infos_[block.GetBlockId()]->kill_; in GetKillSet()
Dfind_loops_test.cc118 ASSERT_EQ(block->GetLoopInformation()->GetHeader()->GetBlockId(), parent_loop_header_id); in TestBlock()
Dcode_generator_arm64.h357 return &(block_labels_[block->GetBlockId()]); in GetLabelOf()
Dcode_generator.h575 return raw_pointer_to_labels_array + block->GetBlockId(); in CommonGetLabelOf()
Dregister_allocator.cc1778 << " " << from->GetBlockId() << " -> " << to->GetBlockId(); in ConnectSplitSiblings()
Dinduction_var_range.cc111 DCHECK(block->GetLastInstruction() != nullptr) << block->GetBlockId(); in Insert()
Dnodes.h881 uint32_t GetBlockId() const { return block_id_; } in GetBlockId() function
6531 if (!blocks_in_loop_.IsBitSet(blocks_[index_]->GetBlockId())) { in HBlocksInLoopReversePostOrderIterator()
6541 if (blocks_in_loop_.IsBitSet(blocks_[index_]->GetBlockId())) { in Advance()
Dinstruction_builder.cc37 ArenaVector<HInstruction*>* locals = &locals_for_[block->GetBlockId()]; in GetLocalsFor()