Make Value not a subclass of Computation.

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"
@@ skipping 99 matching lines @@
   // Append a computation with one use.  Assumes this graph is open.
   UseVal* Bind(Computation* computation);
   // Append a computation with no uses.  Assumes this graph is open.
   void Do(Computation* computation);
   // Append a single (non-Definition, non-Entry) instruction.  Assumes this
   // graph is open.
   void AddInstruction(Instruction* instruction);
   // Append a Goto (unconditional control flow) instruction and close
   // the graph fragment.  Assumes this graph fragment is open.
   void Goto(JoinEntryInstr* join);
+  // Build a computation for a constant value.

[srdjan, 2012/08/21 22:14:53]

s/Build/Builds/

+  MaterializeComp* Constant(const Object& value);
 
   // Append a 'diamond' branch and join to this graph, depending on which
   // parts are reachable.  Assumes this graph is open.
   void Join(const TestGraphVisitor& test_fragment,
             const EffectGraphVisitor& true_fragment,
             const EffectGraphVisitor& false_fragment);
 
   // 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.
@@ skipping 220 matching lines @@
   // Output parameters.
   TargetEntryInstr** true_successor_address_;
   TargetEntryInstr** false_successor_address_;
 
   intptr_t condition_token_pos_;
 };
 
 }  // namespace dart
 
 #endif  // VM_FLOW_GRAPH_BUILDER_H_