Added LongJump for bailout. When trying to fix all crashes, CHECK_ALIVE did not scale well as bail…

runtime/vm/flow_graph_builder.h

 // 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.
 
 #ifndef VM_FLOW_GRAPH_BUILDER_H_
 #define VM_FLOW_GRAPH_BUILDER_H_
 
 #include "vm/allocation.h"
 #include "vm/ast.h"
 #include "vm/growable_array.h"
 #include "vm/intermediate_language.h"
 
 namespace dart {
 
 class Instruction;
 class ParsedFunction;
 
 // Build a flow graph from a parsed function's AST.
 class FlowGraphBuilder: public ValueObject {
  public:
   explicit FlowGraphBuilder(const ParsedFunction& parsed_function)
       : parsed_function_(parsed_function),
-        bailout_reason_(NULL),
-        postorder_() { }
+        postorder_block_entries_() { }
 
   void BuildGraph();
 
   const ParsedFunction& parsed_function() const { return parsed_function_; }
 
-  bool HasBailedOut() const { return bailout_reason_ != NULL; }
-  void Bailout(const char* reason) {
-    // Cannot give a NULL reason because we use it to detect bailout.
-    ASSERT(!HasBailedOut() && (reason != NULL));
-    bailout_reason_ = reason;
-  }
-  void TraceBailout() const;
+  void Bailout(const char* reason);
   void PrintGraph() const;
 
  private:
   const ParsedFunction& parsed_function_;
-  const char* bailout_reason_;
-  GrowableArray<Instruction*> postorder_;
+  GrowableArray<Instruction*> postorder_block_entries_;
 };
 
 
 #define DEFINE_VISIT(type, name) virtual void Visit##type(type* node);
 
 class TestGraphVisitor;
 
 // Translate an AstNode to a control-flow graph fragment for its effects
 // (e.g., a statement or an expression in an effect context).  Implements a
 // function from an AstNode and next temporary index to a graph fragment
@@ skipping 37 matching lines @@
   // Append a 'while loop' test and back edge to this graph, depending on
   // which parts are reachable.  Afterward, the graph exit is the false
   // successor of the loop condition.
   void TieLoop(const TestGraphVisitor& test_fragment,
                const EffectGraphVisitor& body_fragment);
 
  protected:
   // Implement the core part of the translation of expression node types.
   AssertAssignableComp* TranslateAssignable(const AssignableNode& node);
   InstanceCallComp* TranslateBinaryOp(const BinaryOpNode& node);
+  InstanceCallComp* TranslateUnaryOp(const UnaryOpNode& node);
   InstanceCallComp* TranslateComparison(const ComparisonNode& node);
   StoreLocalComp* TranslateStoreLocal(const StoreLocalNode& node);
   StaticCallComp* TranslateStaticCall(const StaticCallNode& node);
 
   void CloseFragment() { exit_ = NULL; }
   intptr_t AllocateTempIndex() { return temp_index_++; }
 
  private:
   // Helper to append a Do instruction to the graph.
   void DoComputation(Computation* computation) {
@@ skipping 103 matching lines @@
   TargetEntryInstr** true_successor_address_;
   TargetEntryInstr** false_successor_address_;
 };
 
 #undef DEFINE_VISIT
 
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_BUILDER_H_