Lines Matching full:blocks
65 int block_count = graph()->blocks()->length();
67 HBasicBlock* block = graph()->blocks()->at(i);
166 // over affected basic blocks. All non-escaping instructions are handled
170 block_states_.AddBlock(NULL, graph()->blocks()->length(), zone());
172 // Iterate all blocks starting with the allocation block, since the
173 // allocation cannot dominate blocks that come before.
175 for (int i = start; i < graph()->blocks()->length(); i++) {
176 HBasicBlock* block = graph()->blocks()->at(i);
179 // Skip blocks that are not dominated by the captured allocation.
255 // Propagate the block state forward to all successor blocks.
