Skeleton of a linear scan register allocator.

runtime/vm/intermediate_language_x64.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/globals.h"  // Needed here to get TARGET_ARCH_X64.
 #if defined(TARGET_ARCH_X64)
 
 #include "vm/intermediate_language.h"
 
 #include "lib/error.h"
@@ skipping 14 matching lines @@
 // on the stack and return the result in a fixed register RAX.
 LocationSummary* Computation::MakeCallSummary() {
   LocationSummary* result = new LocationSummary(0, 0, LocationSummary::kCall);
   result->set_out(Location::RegisterLocation(RAX));
   return result;
 }
 
 
 void BindInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
   computation()->EmitNativeCode(compiler);
-  if (is_used() && locs()->out().kind() == Location::kRegister) {
+  if (is_used() && locs()->out().IsRegister()) {
     // TODO(vegorov): this should really happen only for comparisons fused
     // with branches.  Currrently IR does not provide an easy way to remove
     // instructions from the graph so we just leave fused comparison in it
     // but change its result location to be NoLocation.
     compiler->frame_register_allocator()->Push(locs()->out().reg(), this);
   }
 }
 
 
 LocationSummary* ReturnInstr::MakeLocationSummary() const {
@@ skipping 102 matching lines @@
 }
 
 
 LocationSummary* ConstantVal::MakeLocationSummary() const {
   return LocationSummary::Make(0, Location::RequiresRegister());
 }
 
 
 void ConstantVal::EmitNativeCode(FlowGraphCompiler* compiler) {
   Register result = locs()->out().reg();
-  if (value().IsSmi()) {
-    int64_t imm = reinterpret_cast<int64_t>(value().raw());
-    __ movq(result, Immediate(imm));
-  } else {
-    __ LoadObject(result, value());
-  }
+  __ LoadObject(result, value());
 }
 
 
 LocationSummary* AssertAssignableComp::MakeLocationSummary() const {
   const intptr_t kNumInputs = 3;
   const intptr_t kNumTemps = 0;
   LocationSummary* summary = new LocationSummary(kNumInputs,
                                                  kNumTemps,
                                                  LocationSummary::kCall);
   summary->set_in(0, Location::RegisterLocation(RAX));  // Value.
@@ skipping 267 matching lines @@
 LocationSummary* RelationalOpComp::MakeLocationSummary() const {
   const LocationSummary::ContainsBranch contains_branch =
       is_fused_with_branch() ? LocationSummary::kBranch
                              : LocationSummary::kNoBranch;
 
   if (operands_class_id() == kSmi || operands_class_id() == kDouble) {
     const intptr_t kNumInputs = 2;
     const intptr_t kNumTemps = 1;
     LocationSummary* summary = new LocationSummary(kNumInputs,
                                                    kNumTemps,
-                                                   LocationSummary::kCall,
+                                                   LocationSummary::kNoCall,
                                                    contains_branch);
     summary->set_in(0, Location::RequiresRegister());
     summary->set_in(1, Location::RequiresRegister());
     if (!is_fused_with_branch()) {
       summary->set_out(Location::RequiresRegister());
     }
     summary->set_temp(0, Location::RequiresRegister());
     return summary;
   }
   ASSERT(!is_fused_with_branch());
@@ skipping 1512 matching lines @@
     compiler->GenerateStaticCall(instance_call()->cid(),
                                  instance_call()->token_pos(),
                                  instance_call()->try_index(),
                                  target,
                                  instance_call()->ArgumentCount(),
                                  instance_call()->argument_names());
   }
   __ Bind(&done);
 }
 
+
 }  // namespace dart
 
 #undef __
 
 #endif  // defined TARGET_ARCH_X64