Lines Matching defs:block
1905 BasicBlock* block = use_block;
1908 if (block->NodeAt(use_pos) == node) return true;
1911 block = block->dominator();
1912 if (block == nullptr) break;
1913 use_pos = static_cast<int>(block->NodeCount()) - 1;
1914 if (node == block->control_input()) return true;
1921 BasicBlock* dom = schedule->block(dominator);
1922 BasicBlock* sub = schedule->block(dominatee);
1933 static void CheckInputsDominate(Schedule* schedule, BasicBlock* block,
1936 BasicBlock* use_block = block;
1942 if (!HasDominatingDef(schedule, node->InputAt(j), block, use_block,
1945 node->id(), node->op()->mnemonic(), block->rpo_number(), j,
1957 node->id(), node->op()->mnemonic(), block->rpo_number(), ctl->id(),
1990 BasicBlock* block = rpo_order->at(b);
1991 CHECK_EQ(static_cast<int>(b), block->rpo_number());
1992 BasicBlock* dom = block->dominator();
1997 // Check that the immediate dominator appears somewhere before the block.
1999 CHECK_LT(dom->rpo_number(), block->rpo_number());
2010 BasicBlock* block = queue.front();
2012 for (size_t s = 0; s < block->SuccessorCount(); s++) {
2013 BasicBlock* succ = block->SuccessorAt(s);
2023 BasicBlock* block = schedule->GetBlockById(BasicBlock::Id::FromSize(i));
2025 CHECK_GE(block->rpo_number(), 0);
2026 CHECK_EQ(block, rpo_order->at(block->rpo_number()));
2046 BasicBlock* block = queue.front();
2048 BitVector* block_doms = dominators[block->id().ToSize()];
2049 BasicBlock* idom = block->dominator();
2051 FATAL("Block B%d is not dominated by B%d", block->rpo_number(),
2054 for (size_t s = 0; s < block->SuccessorCount(); s++) {
2055 BasicBlock* succ = block->SuccessorAt(s);
2062 succ_doms->Add(block->id().ToInt());
2067 bool had = succ_doms->Contains(block->id().ToInt());
2068 if (had) succ_doms->Remove(block->id().ToInt());
2070 if (had) succ_doms->Add(block->id().ToInt());
2078 BasicBlock* block = *b;
2079 BasicBlock* idom = block->dominator();
2081 BitVector* block_doms = dominators[block->id().ToSize()];
2088 block->rpo_number(), idom->rpo_number());
2094 // Verify phis are placed in the block of their control input.
2106 CHECK_EQ((*b), schedule->block(control));
2114 BasicBlock* block = *b;
2116 // Check inputs to control for this block.
2117 Node* control = block->control_input();
2119 CHECK_EQ(block, schedule->block(control));
2120 CheckInputsDominate(schedule, block, control,
2121 static_cast<int>(block->NodeCount()) - 1);
2123 // Check inputs for all nodes in the block.
2124 for (size_t i = 0; i < block->NodeCount(); i++) {
2125 Node* node = block->NodeAt(i);
2126 CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1);