Introduce Goto instructions to the flow graph.

runtime/vm/flow_graph_optimizer.cc

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/flow_graph_optimizer.h"
 
 #include "vm/flow_graph_builder.h"
 #include "vm/il_printer.h"
 #include "vm/object_store.h"
 
@@ skipping 537 matching lines @@
     if (next_comp->IsBooleanNegate()) {
       Instruction* next_next_instr = next_instr->next();
       if ((next_next_instr != NULL) && next_next_instr->IsBranch()) {
         BooleanNegateComp* negate = next_comp->AsBooleanNegate();
         BranchInstr* branch = next_next_instr->AsBranch();
         if ((branch->value()->AsUse()->definition() == next_instr) &&
             (negate->value()->AsUse()->definition() == instr)) {
           comp->MarkFusedWithBranch(branch);
           branch->MarkFusedWithComparison(comp);
           branch->set_is_negated(true);
-
-          // Remove comparison and boolean negation from the graph.
+          // Remove the comparison and the boolean negation from the graph.
           branch->set_previous(instr->previous());
           instr->previous()->set_next(branch);
           return;
         }
       }
     }
   }
 }
 
 
@@ skipping 55 matching lines @@
       LocationSummary* locs = it.Current()->locs();
       if ((locs != NULL) && locs->is_call()) {
         is_leaf_ = false;
         return;
       }
     }
   }
 }
 
 }  // namespace dart