Lines Matching defs:block
42 for (BasicBlock* block : *graph_) {
43 block->nodes().RevalidateTail();
84 // Set the old predecessor's (the conditional block) reference to
85 // point to the new empty predecessor block.
89 // Re-register the block in the offset's ref list.
97 // For loops, the JumpLoop block hasn't been generated yet, and so isn't
119 // Called when a block is killed by an unconditional eager deopt.
121 // Create a block rather than calling finish, since we don't yet know the
122 // next block's offset before the loop skipping the rest of the bytecodes.
123 BasicBlock* block = CreateBlock<Deopt>({});
124 ResolveJumpsToBlockAtOffset(block, block_offset_);
126 // Skip any bytecodes remaining in the block, up to the next merge point.
132 // If there is control flow out of this block, we need to kill the merges
165 // bytecodes in this basic block were only register juggling.
394 BasicBlock* block = current_block_;
397 graph()->Add(block);
399 graph_labeller()->RegisterBasicBlock(block);
401 return block;
404 // Update all jumps which were targetting the not-yet-created block at the
405 // given `block_offset`, to now point to the given `block`.
406 void ResolveJumpsToBlockAtOffset(BasicBlock* block, int block_offset) const {
408 jump_targets_[block_offset].SetToBlockAndReturnNext(block);
411 jump_target_refs_head->SetToBlockAndReturnNext(block);
413 DCHECK_EQ(jump_targets_[block_offset].block_ptr(), block);
420 BasicBlock* block =
422 ResolveJumpsToBlockAtOffset(block, block_offset_);
424 // If the next block has merge states, then it's not a simple fallthrough,
429 // Start a new block for the fallthrough path, unless it's a merge point, in
438 MergeIntoFrameState(block, next_block_offset);
441 return block;
464 void MergeIntoFrameState(BasicBlock* block, int target);
535 // Current block information.