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.h208 bool IsInOrigBBSet(uint32_t block_id) const { in IsInOrigBBSet() argument
209 return orig_bb_set_.IsBitSet(block_id); in IsInOrigBBSet()
327 HBasicBlock* GetBlockById(uint32_t block_id) const { in GetBlockById() argument
328 DCHECK(block_id < graph_->GetBlocks().size()); in GetBlockById()
329 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.cc531 for (size_t block_id : visited_blocks_.Indexes()) { in FindVisitedBlockWithRecyclableSet() local
532 ValueSet* current_set = sets_[block_id]; in FindVisitedBlockWithRecyclableSet()
538 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()
Dnodes.cc567 for (size_t block_id = 0u, end = blocks_.size(); block_id != end; ++block_id) { in SimplifyCFG() local
568 HBasicBlock* block = blocks_[block_id]; in SimplifyCFG()
765 size_t block_id = block->GetBlockId(); in PopulateIrreducibleRecursive() local
769 if (finalized->IsBitSet(block_id)) { in PopulateIrreducibleRecursive()
784 blocks_.SetBit(block_id); in PopulateIrreducibleRecursive()
785 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
800 blocks_.SetBit(block_id); in PopulateIrreducibleRecursive()
801 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
809 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
Dload_store_elimination.cc347 int block_id = block->GetBlockId(); in HandleLoopSideEffects() local
348 ScopedArenaVector<HInstruction*>& heap_values = heap_values_for_[block_id]; in HandleLoopSideEffects()
Dsuperblock_cloner.cc415 for (uint32_t block_id : orig_bb_set_.Indexes()) { in SearchForSubgraphExits() local
416 HBasicBlock* block = GetBlockById(block_id); in SearchForSubgraphExits()