Lines Matching defs:block
36 // TODO(leszeks): Consider using the block iterator instead.
50 // fallthrough (jump to the immediately next block). Otherwise, it will point
109 // subsequent holes are in "post-dominators" of the current block.
152 // the block. Such a list of jumps terminates in return or jumploop.
153 for (BasicBlock* block : base::Reversed(*graph)) {
154 ControlNode* control = block->control_node();
218 BasicBlock* block = *block_it_;
221 if (block->has_state()) {
222 InitializeRegisterValues(block->state()->register_state());
226 printing_visitor_->PreProcessBasicBlock(compilation_unit_, block);
230 ControlNode* control = NearestPostDominatingHole(block->control_node());
259 if (block->has_phi()) {
262 for (Phi* phi : *block->phis()) {
267 for (Phi* phi : *block->phis()) {
282 for (Phi* phi : *block->phis()) {
302 node_it_ = block->nodes().begin();
303 for (; node_it_ != block->nodes().end(); ++node_it_) {
306 AllocateControlNode(block->control_node(), block);
476 // Jumping over an empty block, so we're in fact merging.
500 BasicBlock* block) {
516 Input& input = phi->input(block->predecessor_id());
519 for (Phi* phi : *phis) UpdateUse(&phi->input(block->predecessor_id()));
530 if (!block->is_empty_block()) {
532 block->predecessor_id());
806 // This is the first block we're merging, initialize the values.