Lines Matching defs:block
33 HBasicBlock* block = worklist.back();
35 int block_id = block->GetBlockId();
38 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors());
39 HInstruction* last_instruction = block->GetLastInstruction();
66 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]);
84 void HDeadCodeElimination::MaybeRecordDeadBlock(HBasicBlock* block) {
87 block->GetPhis().CountSize() + block->GetInstructions().CountSize());
107 // block's chain of dominators and nested loops need to be updated from the
110 HBasicBlock* block = it.Current();
111 int id = block->GetBlockId();
113 MaybeRecordDeadBlock(block);
114 block->DisconnectAndDelete();
116 if (block->IsInLoop()) {
122 // If we removed at least one block, we need to recompute the full
123 // dominator tree and try block membership.
138 HBasicBlock* block = it.Current();
139 if (block->IsEntryBlock() || !block->GetLastInstruction()->IsGoto()) {
143 HBasicBlock* successor = block->GetSingleSuccessor();
148 block->MergeWith(successor);
150 // Reiterate on this block in case it can be merged with its new successor.
158 HBasicBlock* block = b.Current();
159 // Traverse this block's instructions in backward order and remove
161 HBackwardInstructionIterator i(block->GetInstructions());
162 // Skip the first iteration, as the last instruction of a block is
176 block->RemoveInstruction(inst);