Lines Matching full:blocks
43 int block_count = graph()->blocks()->length();
45 HBasicBlock* block = graph()->blocks()->at(i);
161 // over affected basic blocks. All non-escaping instructions are handled
165 block_states_.AddBlock(NULL, graph()->blocks()->length(), zone());
167 // Iterate all blocks starting with the allocation block, since the
168 // allocation cannot dominate blocks that come before.
170 for (int i = start; i < graph()->blocks()->length(); i++) {
171 HBasicBlock* block = graph()->blocks()->at(i);
174 // Skip blocks that are not dominated by the captured allocation.
251 // Propagate the block state forward to all successor blocks.
