Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(55)

Side by Side Diff: test/cctest/compiler/test-js-typed-lowering.cc

Issue 985713003: [turbofan] Fix lazy deopt for JSToNumber conversions in binary operations. (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@multiple-framestates
Patch Set: Fixes, rebase Created 5 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Copyright 2014 the V8 project authors. All rights reserved. 1 // Copyright 2014 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #include "src/compiler/js-graph.h" 5 #include "src/compiler/js-graph.h"
6 #include "src/compiler/js-typed-lowering.h" 6 #include "src/compiler/js-typed-lowering.h"
7 #include "src/compiler/machine-operator.h" 7 #include "src/compiler/machine-operator.h"
8 #include "src/compiler/node-properties.h" 8 #include "src/compiler/node-properties.h"
9 #include "src/compiler/opcodes.h" 9 #include "src/compiler/opcodes.h"
10 #include "src/compiler/operator-properties.h" 10 #include "src/compiler/operator-properties.h"
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after
60 Unique<HeapObject>::CreateUninitialized(constant); 60 Unique<HeapObject>::CreateUninitialized(constant);
61 return graph.NewNode(common.HeapConstant(unique)); 61 return graph.NewNode(common.HeapConstant(unique));
62 } 62 }
63 63
64 Node* EmptyFrameState(Node* context) { 64 Node* EmptyFrameState(Node* context) {
65 Node* parameters = graph.NewNode(common.StateValues(0)); 65 Node* parameters = graph.NewNode(common.StateValues(0));
66 Node* locals = graph.NewNode(common.StateValues(0)); 66 Node* locals = graph.NewNode(common.StateValues(0));
67 Node* stack = graph.NewNode(common.StateValues(0)); 67 Node* stack = graph.NewNode(common.StateValues(0));
68 68
69 Node* state_node = 69 Node* state_node =
70 graph.NewNode(common.FrameState(JS_FRAME, BailoutId(0), 70 graph.NewNode(common.FrameState(JS_FRAME, BailoutId::None(),
71 OutputFrameStateCombine::Ignore()), 71 OutputFrameStateCombine::Ignore()),
72 parameters, locals, stack, context, UndefinedConstant()); 72 parameters, locals, stack, context, UndefinedConstant());
73 73
74 return state_node; 74 return state_node;
75 } 75 }
76 76
77 Node* reduce(Node* node) { 77 Node* reduce(Node* node) {
78 JSGraph jsgraph(main_isolate(), &graph, &common, &javascript, &machine); 78 JSGraph jsgraph(main_isolate(), &graph, &common, &javascript, &machine);
79 JSTypedLowering reducer(&jsgraph, main_zone()); 79 JSTypedLowering reducer(&jsgraph, main_zone());
80 Reduction reduction = reducer.Reduce(node); 80 Reduction reduction = reducer.Reduce(node);
(...skipping 1210 matching lines...) Expand 10 before | Expand all | Expand 10 after
1291 CHECK_EQ(p1, r->InputAt(0)); 1291 CHECK_EQ(p1, r->InputAt(0));
1292 CHECK_EQ(p0, r->InputAt(1)); 1292 CHECK_EQ(p0, r->InputAt(1));
1293 } else { 1293 } else {
1294 CHECK_EQ(p0, r->InputAt(0)); 1294 CHECK_EQ(p0, r->InputAt(0));
1295 CHECK_EQ(p1, r->InputAt(1)); 1295 CHECK_EQ(p1, r->InputAt(1));
1296 } 1296 }
1297 } 1297 }
1298 } 1298 }
1299 } 1299 }
1300 } 1300 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698