Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dlinear_order.cc116 int block_id = successor->GetBlockId(); in LinearizeGraph() local
117 size_t number_of_remaining_predecessors = forward_predecessors[block_id]; in LinearizeGraph()
121 forward_predecessors[block_id] = number_of_remaining_predecessors - 1; in LinearizeGraph()
Dgvn.cc538 for (size_t block_id : visited_blocks_.Indexes()) { in FindVisitedBlockWithRecyclableSet() local
539 ValueSet* current_set = sets_[block_id]; in FindVisitedBlockWithRecyclableSet()
545 HBasicBlock* current_block = block->GetGraph()->GetBlocks()[block_id]; in FindVisitedBlockWithRecyclableSet()
Ddead_code_elimination.cc36 int block_id = block->GetBlockId(); in MarkReachableBlocks() local
37 DCHECK(visited->IsBitSet(block_id)); in MarkReachableBlocks()
Dfind_loops_test.cc108 uint32_t block_id, in TestBlock() argument
113 HBasicBlock* block = graph->GetBlocks()[block_id]; in TestBlock()
Dnodes.cc406 for (size_t block_id = 0u, end = blocks_.size(); block_id != end; ++block_id) { in SimplifyCFG() local
407 HBasicBlock* block = blocks_[block_id]; in SimplifyCFG()
593 size_t block_id = block->GetBlockId(); in PopulateIrreducibleRecursive() local
597 if (finalized->IsBitSet(block_id)) { in PopulateIrreducibleRecursive()
612 blocks_.SetBit(block_id); in PopulateIrreducibleRecursive()
613 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
628 blocks_.SetBit(block_id); in PopulateIrreducibleRecursive()
629 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
637 finalized->SetBit(block_id); in PopulateIrreducibleRecursive()
Dload_store_elimination.cc605 int block_id = block->GetBlockId(); in HandleLoopSideEffects() local
606 ArenaVector<HInstruction*>& heap_values = heap_values_for_[block_id]; in HandleLoopSideEffects()