Add deoptimization translations.

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"
@@ skipping 131 matching lines @@
     Node* call = m.CallJS0(deopt_fun_node, undef_node, &cont, &deopt);
 
     m.Bind(&cont);
     m.NewNode(common.Continuation(), call);
     m.Return(undef_node);
 
     m.Bind(&deopt);
     m.NewNode(common.LazyDeoptimization(), call);
 
     bailout_id = GetCallBailoutId();
-    FrameStateDescriptor stateDescriptor(bailout_id);
-    Node* state_node = m.NewNode(common.FrameState(stateDescriptor));
+    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), parameters, locals, stack);
     m.Deoptimize(state_node);
 
     // Schedule the graph:
     Schedule* schedule = m.Export();
 
     cont_block = cont.block();
     deopt_block = deopt.block();
 
     return schedule;
   }
@@ skipping 109 matching lines @@
                                 &cont, &deopt);
 
     m.Bind(&cont);
     m.NewNode(common.Continuation(), call);
     m.Return(undef_node);
 
     m.Bind(&deopt);
     m.NewNode(common.LazyDeoptimization(), call);
 
     bailout_id = GetCallBailoutId();
-    FrameStateDescriptor stateDescriptor(bailout_id);
-    Node* state_node = m.NewNode(common.FrameState(stateDescriptor));
+    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), parameters, locals, stack);
     m.Deoptimize(state_node);
 
     // Schedule the graph:
     Schedule* schedule = m.Export();
 
     cont_block = cont.block();
     deopt_block = deopt.block();
 
     return schedule;
   }
@@ skipping 32 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