| OLD | NEW |
| 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/compilation-dependencies.h" | 5 #include "src/compilation-dependencies.h" |
| 6 #include "src/compiler/js-graph.h" | 6 #include "src/compiler/js-graph.h" |
| 7 #include "src/compiler/js-typed-lowering.h" | 7 #include "src/compiler/js-typed-lowering.h" |
| 8 #include "src/compiler/machine-operator.h" | 8 #include "src/compiler/machine-operator.h" |
| 9 #include "src/compiler/node-properties.h" | 9 #include "src/compiler/node-properties.h" |
| 10 #include "src/compiler/opcodes.h" | 10 #include "src/compiler/opcodes.h" |
| (...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 70 Node* UndefinedConstant() { | 70 Node* UndefinedConstant() { |
| 71 Handle<HeapObject> value = isolate->factory()->undefined_value(); | 71 Handle<HeapObject> value = isolate->factory()->undefined_value(); |
| 72 return graph.NewNode(common.HeapConstant(value)); | 72 return graph.NewNode(common.HeapConstant(value)); |
| 73 } | 73 } |
| 74 | 74 |
| 75 Node* HeapConstant(Handle<HeapObject> constant) { | 75 Node* HeapConstant(Handle<HeapObject> constant) { |
| 76 return graph.NewNode(common.HeapConstant(constant)); | 76 return graph.NewNode(common.HeapConstant(constant)); |
| 77 } | 77 } |
| 78 | 78 |
| 79 Node* EmptyFrameState(Node* context) { | 79 Node* EmptyFrameState(Node* context) { |
| 80 Node* parameters = graph.NewNode(common.StateValues(0)); | 80 Node* parameters = |
| 81 Node* locals = graph.NewNode(common.StateValues(0)); | 81 graph.NewNode(common.StateValues(0, SparseInputMask::Dense())); |
| 82 Node* stack = graph.NewNode(common.StateValues(0)); | 82 Node* locals = |
| 83 graph.NewNode(common.StateValues(0, SparseInputMask::Dense())); |
| 84 Node* stack = |
| 85 graph.NewNode(common.StateValues(0, SparseInputMask::Dense())); |
| 83 | 86 |
| 84 Node* state_node = graph.NewNode( | 87 Node* state_node = graph.NewNode( |
| 85 common.FrameState(BailoutId::None(), OutputFrameStateCombine::Ignore(), | 88 common.FrameState(BailoutId::None(), OutputFrameStateCombine::Ignore(), |
| 86 nullptr), | 89 nullptr), |
| 87 parameters, locals, stack, context, UndefinedConstant(), graph.start()); | 90 parameters, locals, stack, context, UndefinedConstant(), graph.start()); |
| 88 | 91 |
| 89 return state_node; | 92 return state_node; |
| 90 } | 93 } |
| 91 | 94 |
| 92 Node* reduce(Node* node) { | 95 Node* reduce(Node* node) { |
| (...skipping 1147 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1240 CHECK_EQ(p1, r->InputAt(1)); | 1243 CHECK_EQ(p1, r->InputAt(1)); |
| 1241 } | 1244 } |
| 1242 } | 1245 } |
| 1243 } | 1246 } |
| 1244 } | 1247 } |
| 1245 } | 1248 } |
| 1246 | 1249 |
| 1247 } // namespace compiler | 1250 } // namespace compiler |
| 1248 } // namespace internal | 1251 } // namespace internal |
| 1249 } // namespace v8 | 1252 } // namespace v8 |
| OLD | NEW |