Lines Matching full:blocks
257 // Only loop header blocks can have a predecessor added after
281 // Keep the list of dominated blocks sorted such that if there is two
320 // Mark blocks that dominate all subsequent reachable blocks inside their
321 // loop. Exploit the fact that blocks are sorted in reverse post order. When
327 // dominator_candidate block is guaranteed to dominate all blocks reachable
334 HBasicBlock* dominator_candidate = graph_->blocks()->at(j);
346 // all of the blocks with higher IDs. In this case, assume conservatively
437 // Checks reachability of the blocks in this graph and stores a bit in
441 // returns the number of reachable blocks.
520 // Check that all join blocks have predecessors that end with an
734 for (int i = 0; i < blocks()->length(); ++i) {
735 HInstruction* instr = blocks()->at(i)->first();
767 for (int i = 0; i < loop->blocks()->length(); ++i) {
768 HBasicBlock* b = loop->blocks()->at(i);
824 // Mark all blocks that are dominated by an unconditional soft deoptimize to
825 // prevent code motion across those blocks.
1044 // Continue analysis in all dominated blocks.
1340 for (int i = 0; i < graph_->blocks()->length(); i++) {
1341 HBasicBlock* block = graph_->blocks()->at(i);
1412 block_side_effects_(graph->blocks()->length()),
1413 loop_side_effects_(graph->blocks()->length()),
1414 visited_on_paths_(graph->zone(), graph->blocks()->length()) {
1416 block_side_effects_.AddBlock(GVNFlagSet(), graph_->blocks()->length());
1417 loop_side_effects_.AddBlock(GVNFlagSet(), graph_->blocks()->length());
1480 for (int i = graph_->blocks()->length() - 1; i >= 0; --i) {
1482 HBasicBlock* block = graph_->blocks()->at(i);
1514 for (int i = graph_->blocks()->length() - 1; i >= 0; --i) {
1515 HBasicBlock* block = graph_->blocks()->at(i);
1526 ProcessLoopBlock(graph_->blocks()->at(j), block, side_effects,
1589 // they dominate all of the successor blocks in the same loop and there
1702 // Recursively continue analysis for all immediately dominated blocks.
1905 for (int i = 0; i < graph_->blocks()->length(); ++i) {
1906 HBasicBlock* block = graph_->blocks()->at(i);
1954 // Skip all blocks already processed by the recursive call.
2580 for (int i = 0; i < blocks()->length(); ++i) {
2581 HInstruction* instr = blocks()->at(i)->first();
4822 // TODO(jkummerow): The need for these two blocks could be avoided
6655 // actually two empty blocks (one here and one inserted by
7895 const ZoneList<HBasicBlock*>* blocks = graph->blocks();
7896 for (int i = 0; i < blocks->length(); i++) {
7897 HBasicBlock* current = blocks->at(i);
