Lines Matching defs:block
139 for (InstructionBlock* block : code()->instruction_blocks()) {
140 CompressBlock(block);
142 for (InstructionBlock* block : code()->instruction_blocks()) {
143 if (block->PredecessorCount() <= 1) continue;
144 if (!block->IsDeferred()) {
146 for (RpoNumber& pred_id : block->predecessors()) {
155 // current block is not deferred.
158 OptimizeMerge(block);
185 // Input operands block elisions.
349 void MoveOptimizer::CompressBlock(InstructionBlock* block) {
350 int first_instr_index = block->first_instruction_index();
351 int last_instr_index = block->last_instruction_index();
369 const InstructionBlock* block) const {
370 return code()->instructions()[block->last_instruction_index()];
373 void MoveOptimizer::OptimizeMerge(InstructionBlock* block) {
374 DCHECK_LT(1, block->PredecessorCount());
377 for (RpoNumber& pred_index : block->predecessors()) {
381 // move down to this block (one of the successors) any of the gap moves,
399 for (RpoNumber& pred_index : block->predecessors()) {
414 if (res.first->second == block->PredecessorCount()) {
423 Instruction* instr = code()->instructions()[block->first_instruction_index()];
432 if (current->second != block->PredecessorCount()) {
451 DCHECK_EQ(block->PredecessorCount(), current->second);
473 // Delete relevant entries in predecessors and move everything to block.
475 for (RpoNumber& pred_index : block->predecessors()) {
494 CompressBlock(block);