Home
last modified time | relevance | path

Searched refs:block_id (Results 1 – 9 of 9) sorted by relevance

/art/compiler/optimizing/
Dlinear_order.cc120 int block_id = successor->GetBlockId(); in LinearizeGraphInternal() local
121 size_t number_of_remaining_predecessors = forward_predecessors[block_id]; in LinearizeGraphInternal()
125 forward_predecessors[block_id] = number_of_remaining_predecessors - 1; in LinearizeGraphInternal()
Dsuperblock_cloner.h210 bool IsInOrigBBSet(uint32_t block_id) const { in IsInOrigBBSet() argument
211 return orig_bb_set_.IsBitSet(block_id); in IsInOrigBBSet()
341 HBasicBlock* GetBlockById(uint32_t block_id) const { in GetBlockById() argument
342 DCHECK(block_id < graph_->GetBlocks().size()); in GetBlockById()
343 HBasicBlock* block = graph_->GetBlocks()[block_id]; in GetBlockById()
Dblock_builder.cc358 uint32_t block_id = entry.first; in InsertTryBoundaryBlocks() local
360 HBasicBlock* try_block = graph_->GetBlocks()[block_id]; in InsertTryBoundaryBlocks()
377 uint32_t block_id = entry.first; in InsertTryBoundaryBlocks() local
379 HBasicBlock* try_block = graph_->GetBlocks()[block_id]; in InsertTryBoundaryBlocks()
428 for (uint32_t block_id : targets) { in InsertSynthesizedLoopsForOsr() local
429 HBasicBlock* block = graph_->GetBlocks()[block_id]; in InsertSynthesizedLoopsForOsr()
Dgvn.cc549 for (size_t block_id : visited_blocks_.Indexes()) { in FindVisitedBlockWithRecyclableSet() local
550 ValueSet* current_set = sets_[block_id]; in FindVisitedBlockWithRecyclableSet()
556 HBasicBlock* current_block = block->GetGraph()->GetBlocks()[block_id]; in FindVisitedBlockWithRecyclableSet()
Dfind_loops_test.cc98 uint32_t block_id, in TestBlock() argument
103 HBasicBlock* block = graph->GetBlocks()[block_id]; in TestBlock()
Ddead_code_elimination.cc41 int block_id = block->GetBlockId(); in MarkReachableBlocks() local
42 DCHECK(visited->IsBitSet(block_id)); in MarkReachableBlocks()
Dload_store_elimination.cc344 constexpr PhiPlaceholder(uint32_t block_id, size_t heap_location) in PhiPlaceholder() argument
345 : block_id_(block_id), heap_location_(dchecked_integral_cast<uint32_t>(heap_location)) {} in PhiPlaceholder()
644 PhiPlaceholder GetPhiPlaceholder(uint32_t block_id, size_t idx) const { in GetPhiPlaceholder() argument
645 DCHECK(GetGraph()->GetBlocks()[block_id] != nullptr) << block_id; in GetPhiPlaceholder()
646 return PhiPlaceholder(block_id, idx); in GetPhiPlaceholder()
1542 int block_id = block->GetBlockId(); in PrepareLoopRecords() local
1548 ScopedArenaVector<ValueRecord>& heap_values = heap_values_for_[block_id]; in PrepareLoopRecords()
1628 uint32_t block_id = merged_value.GetPhiPlaceholder().GetBlockId(); in MergePredecessorRecords() local
1629 CHECK(GetGraph()->GetBlocks()[block_id]->Dominates(block)); in MergePredecessorRecords()
1746 uint32_t block_id = instruction->GetBlock()->GetBlockId(); in VisitGetLocation() local
[all …]
Dnodes.cc740 for (size_t block_id = 0u, end = blocks_.size(); block_id != end; ++block_id) { in SimplifyCFG() local
741 HBasicBlock* block = blocks_[block_id]; in SimplifyCFG()
938 size_t block_id = block->GetBlockId(); in PopulateIrreducibleRecursive() local
942 if (finalized->IsBitSet(block_id)) { in PopulateIrreducibleRecursive()
957 blocks_.SetBit(block_id); in PopulateIrreducibleRecursive()
958 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
973 blocks_.SetBit(block_id); in PopulateIrreducibleRecursive()
974 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
982 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
Dsuperblock_cloner.cc449 for (uint32_t block_id : orig_bb_set_.Indexes()) { in SearchForSubgraphExits() local
450 HBasicBlock* block = GetBlockById(block_id); in SearchForSubgraphExits()