Lines Matching full:blocks
75 // over a graph of basic blocks, either one block at a time (local analysis)
97 pred_counts_(graph->blocks()->length(), zone),
99 block_states_(graph->blocks()->length(), zone),
100 loop_effects_(graph->blocks()->length(), zone) {
101 loop_effects_.AddBlock(NULL, graph_->blocks()->length(), zone);
113 // Global analysis. Iterates over all blocks that are dominated by the given
119 // Iterate all dominated blocks starting from the given start block.
120 for (int i = root->block_id(); i < graph_->blocks()->length(); i++) {
121 HBasicBlock* block = graph_->blocks()->at(i);
123 // Skip blocks not dominated by the root node.
140 // Propagate the block state forward to all successor blocks.
176 // Process the blocks between the header and the end.
178 HBasicBlock* member = graph_->blocks()->at(i);
184 // Skip the nested loop's blocks.
200 return !root->Dominates(other); // Only visit dominated blocks.
214 pred_counts_.AddBlock(0, graph_->blocks()->length(), zone_);
217 block_states_.AddBlock(NULL, graph_->blocks()->length(), zone_);