Lines Matching refs:blocks
246 // Only loop header blocks can have a predecessor added after
270 // Keep the list of dominated blocks sorted such that if there is two
370 // Checks reachability of the blocks in this graph and stores a bit in
374 // returns the number of reachable blocks.
452 // Check that all join blocks have predecessors that end with an
643 for (int i = 0; i < blocks()->length(); ++i) {
644 HInstruction* instr = blocks()->at(i)->first();
676 for (int i = 0; i < loop->blocks()->length(); ++i) {
677 HBasicBlock* b = loop->blocks()->at(i);
879 Analyze(graph_->blocks()->at(0));
909 // Continue analysis in all dominated blocks.
1213 for (int i = 0; i < graph_->blocks()->length(); i++) {
1214 HBasicBlock* block = graph_->blocks()->at(i);
1252 block_side_effects_(graph_->blocks()->length()),
1253 loop_side_effects_(graph_->blocks()->length()) {
1255 block_side_effects_.AddBlock(0, graph_->blocks()->length());
1256 loop_side_effects_.AddBlock(0, graph_->blocks()->length());
1295 AnalyzeBlock(graph_->blocks()->at(0), map);
1300 for (int i = graph_->blocks()->length() - 1; i >= 0; --i) {
1302 HBasicBlock* block = graph_->blocks()->at(i);
1328 for (int i = graph_->blocks()->length() - 1; i >= 0; --i) {
1329 HBasicBlock* block = graph_->blocks()->at(i);
1338 ProcessLoopBlock(graph_->blocks()->at(j), block, side_effects);
1456 // Recursively continue analysis for all immediately dominated blocks.
1652 for (int i = 0; i < graph_->blocks()->length(); ++i) {
1653 HBasicBlock* block = graph_->blocks()->at(i);
1700 // Skip all blocks already processed by the recursive call.
2300 for (int i = 0; i < blocks()->length(); ++i) {
2301 HInstruction* instr = blocks()->at(i)->first();
5003 // actually two empty blocks (one here and one inserted by
5824 const ZoneList<HBasicBlock*>* blocks = graph->blocks();
5825 for (int i = 0; i < blocks->length(); i++) {
5826 HBasicBlock* current = blocks->at(i);
