Convert Linkage to use MachineSignature.

test/cctest/compiler/test-codegen-deopt.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/v8.h"
 #include "test/cctest/cctest.h"
 
 #include "src/compiler/code-generator.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/instruction-selector.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node.h"
 #include "src/compiler/operator.h"
 #include "src/compiler/raw-machine-assembler.h"
 #include "src/compiler/register-allocator.h"
 #include "src/compiler/schedule.h"
 
 #include "src/full-codegen.h"
 #include "src/parser.h"
 #include "src/rewriter.h"
 
+#include "test/cctest/compiler/c-signature.h"
 #include "test/cctest/compiler/function-tester.h"
 
 using namespace v8::internal;
 using namespace v8::internal::compiler;
 
 
 #if V8_TURBOFAN_TARGET
 
 typedef RawMachineAssembler::Label MLabel;
 
@@ skipping 24 matching lines @@
 
     DCHECK(info.shared_info()->has_deoptimization_support());
 
     graph = new (scope_->main_zone()) Graph(scope_->main_zone());
   }
 
   virtual ~DeoptCodegenTester() { delete code; }
 
   void GenerateCodeFromSchedule(Schedule* schedule) {
     OFStream os(stdout);
-    os << *schedule;
+    if (FLAG_trace_turbo) {
+      os << *schedule;
+    }
 
     // Initialize the codegen and generate code.
     Linkage* linkage = new (scope_->main_zone()) Linkage(&info);
     code = new v8::internal::compiler::InstructionSequence(linkage, graph,
                                                            schedule);
     SourcePositionTable source_positions(graph);
     InstructionSelector selector(code, &source_positions);
     selector.SelectInstructions();
 
-    os << "----- Instruction sequence before register allocation -----\n"
-       << *code;
+    if (FLAG_trace_turbo) {
+      os << "----- Instruction sequence before register allocation -----\n"
+         << *code;
+    }
 
     RegisterAllocator allocator(code);
     CHECK(allocator.Allocate());
 
-    os << "----- Instruction sequence after register allocation -----\n"
-       << *code;
+    if (FLAG_trace_turbo) {
+      os << "----- Instruction sequence after register allocation -----\n"
+         << *code;
+    }
 
     compiler::CodeGenerator generator(code);
     result_code = generator.GenerateCode();
 
-#ifdef DEBUG
-    result_code->Print();
-#endif
+    if (FLAG_print_opt_code || FLAG_trace_turbo) {
+      result_code->Print();
+    }
   }
 
   Zone* zone() { return scope_->main_zone(); }
 
   HandleAndZoneScope* scope_;
   Handle<JSFunction> function;
   CompilationInfo info;
   BailoutId bailout_id;
   Handle<Code> result_code;
   v8::internal::compiler::InstructionSequence* code;
@@ skipping 13 matching lines @@
 
   Schedule* BuildGraphAndSchedule(Graph* graph) {
     Isolate* isolate = info.isolate();
     CommonOperatorBuilder common(zone());
 
     // Manually construct a schedule for the function below:
     // function foo() {
     //   deopt();
     // }
 
-    MachineType parameter_reps[] = {kMachAnyTagged};
-    MachineCallDescriptorBuilder descriptor_builder(kMachAnyTagged, 1,
-                                                    parameter_reps);
-
-    RawMachineAssembler m(graph, &descriptor_builder);
+    CSignature1<Object*, Object*> sig;
+    RawMachineAssembler m(graph, &sig);
 
     Handle<Object> undef_object =
         Handle<Object>(isolate->heap()->undefined_value(), isolate);
     PrintableUnique<Object> undef_constant =
         PrintableUnique<Object>::CreateUninitialized(zone(), undef_object);
     Node* undef_node = m.NewNode(common.HeapConstant(undef_constant));
 
     Handle<JSFunction> deopt_function =
         NewFunction("function deopt() { %DeoptimizeFunction(foo); }; deopt");
     PrintableUnique<Object> deopt_fun_constant =
         PrintableUnique<Object>::CreateUninitialized(zone(), deopt_function);
     Node* deopt_fun_node = m.NewNode(common.HeapConstant(deopt_fun_constant));
 
+    Handle<Context> context(deopt_function->context(), isolate);
+    PrintableUnique<Object> context_constant =
+        PrintableUnique<Object>::CreateUninitialized(zone(), context);
+    Node* context_node = m.NewNode(common.HeapConstant(context_constant));
 
     bailout_id = GetCallBailoutId();
     Node* parameters = m.NewNode(common.StateValues(1), undef_node);
     Node* locals = m.NewNode(common.StateValues(0));
     Node* stack = m.NewNode(common.StateValues(0));
 
     Node* state_node = m.NewNode(common.FrameState(bailout_id, kIgnoreOutput),
                                  parameters, locals, stack, undef_node);
 
-    m.CallJS0(deopt_fun_node, undef_node, state_node);
+    m.CallJS0(deopt_fun_node, undef_node, context_node, state_node);
 
     m.Return(undef_node);
 
     // Schedule the graph:
     Schedule* schedule = m.Export();
 
     return schedule;
   }
 
   BailoutId GetCallBailoutId() {
@@ skipping 68 matching lines @@
 
   Schedule* BuildGraphAndSchedule(Graph* graph) {
     Isolate* isolate = info.isolate();
     CommonOperatorBuilder common(zone());
 
     // Manually construct a schedule for the function below:
     // function foo() {
     //   %DeoptimizeFunction(foo);
     // }
 
-    MachineType parameter_reps[] = {kMachAnyTagged};
-    MachineCallDescriptorBuilder descriptor_builder(kMachAnyTagged, 2,
-                                                    parameter_reps);
-
-    RawMachineAssembler m(graph, &descriptor_builder);
+    CSignature1<Object*, Object*> sig;
+    RawMachineAssembler m(graph, &sig);
 
     Handle<Object> undef_object =
         Handle<Object>(isolate->heap()->undefined_value(), isolate);
     PrintableUnique<Object> undef_constant =
         PrintableUnique<Object>::CreateUninitialized(zone(), undef_object);
     Node* undef_node = m.NewNode(common.HeapConstant(undef_constant));
 
     PrintableUnique<Object> this_fun_constant =
         PrintableUnique<Object>::CreateUninitialized(zone(), function);
     Node* this_fun_node = m.NewNode(common.HeapConstant(this_fun_constant));
 
+    Handle<Context> context(function->context(), isolate);
+    PrintableUnique<Object> context_constant =
+        PrintableUnique<Object>::CreateUninitialized(zone(), context);
+    Node* context_node = m.NewNode(common.HeapConstant(context_constant));
+
     bailout_id = GetCallBailoutId();
     Node* parameters = m.NewNode(common.StateValues(1), undef_node);
     Node* locals = m.NewNode(common.StateValues(0));
     Node* stack = m.NewNode(common.StateValues(0));
 
     Node* state_node = m.NewNode(common.FrameState(bailout_id, kIgnoreOutput),
                                  parameters, locals, stack, undef_node);
 
-    m.CallRuntime1(Runtime::kDeoptimizeFunction, this_fun_node, state_node);
+    m.CallRuntime1(Runtime::kDeoptimizeFunction, this_fun_node, context_node,
+                   state_node);
 
     m.Return(undef_node);
 
     // Schedule the graph:
     Schedule* schedule = m.Export();
 
     return schedule;
   }
 
   BailoutId GetCallBailoutId() {
@@ skipping 27 matching lines @@
   Handle<Object> result;
   bool has_pending_exception =
       !Execution::Call(isolate, t.function,
                        isolate->factory()->undefined_value(), 0, NULL,
                        false).ToHandle(&result);
   CHECK(!has_pending_exception);
   CHECK(result->SameValue(Smi::FromInt(42)));
 }
 
 #endif