anchor.diff:        // The join block is dominated by a block in one of the branches.
         // The subgraph traversal never reached it, so we visit it here
         // instead.
  -      visitBasicBlock(joinBlock);
  +      continueSubGraph(joinBlock);
       }
   
       // Visit all the dominated blocks that are not part of the then or else
  
positive.code:           node, 'node.block != currentGraph.entry');
      }
      assert(dominated[0] == block.successors[0]);
      visitBasicBlock(dominated[0]);
    }
  
    visitLoopBranch(HLoopBranch node) {
  
negative.code:   visitGraph(HGraph graph) {
      preGenerateMethod(graph);
      currentGraph = graph;
      visitSubGraph(new SubGraph(graph.entry, graph.exit));
      handleDelayedVariableDeclarations(graph.sourceInformation);
    }
  
    void visitSubGraph(SubGraph newSubGraph) {
      SubGraph oldSubGraph = subGraph;
      Queue<HBasicBlock> oldBlockQueue = blockQueue;
      subGraph = newSubGraph;
      blockQueue = new Queue<HBasicBlock>();
      enterSubGraph(subGraph.start);
      blockQueue = oldBlockQueue;
      subGraph = oldSubGraph;
    }
  
  