OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 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/bytecode-graph-builder.h" | 5 #include "src/compiler/bytecode-graph-builder.h" |
6 | 6 |
7 #include "src/compiler/bytecode-branch-analysis.h" | 7 #include "src/compiler/bytecode-branch-analysis.h" |
8 #include "src/compiler/linkage.h" | 8 #include "src/compiler/linkage.h" |
9 #include "src/compiler/operator-properties.h" | 9 #include "src/compiler/operator-properties.h" |
10 #include "src/interpreter/bytecodes.h" | 10 #include "src/interpreter/bytecodes.h" |
(...skipping 1288 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1299 | 1299 |
1300 void BytecodeGraphBuilder::VisitTestGreaterThanOrEqual() { | 1300 void BytecodeGraphBuilder::VisitTestGreaterThanOrEqual() { |
1301 BuildCompareOp(javascript()->GreaterThanOrEqual()); | 1301 BuildCompareOp(javascript()->GreaterThanOrEqual()); |
1302 } | 1302 } |
1303 | 1303 |
1304 void BytecodeGraphBuilder::VisitTestIn() { | 1304 void BytecodeGraphBuilder::VisitTestIn() { |
1305 BuildCompareOp(javascript()->HasProperty()); | 1305 BuildCompareOp(javascript()->HasProperty()); |
1306 } | 1306 } |
1307 | 1307 |
1308 void BytecodeGraphBuilder::VisitTestInstanceOf() { | 1308 void BytecodeGraphBuilder::VisitTestInstanceOf() { |
| 1309 DCHECK(!FLAG_harmony_instanceof); |
1309 BuildCompareOp(javascript()->InstanceOf()); | 1310 BuildCompareOp(javascript()->InstanceOf()); |
1310 } | 1311 } |
1311 | 1312 |
1312 void BytecodeGraphBuilder::BuildCastOperator(const Operator* js_op) { | 1313 void BytecodeGraphBuilder::BuildCastOperator(const Operator* js_op) { |
1313 FrameStateBeforeAndAfter states(this); | 1314 FrameStateBeforeAndAfter states(this); |
1314 Node* node = NewNode(js_op, environment()->LookupAccumulator()); | 1315 Node* node = NewNode(js_op, environment()->LookupAccumulator()); |
1315 environment()->BindAccumulator(node, &states); | 1316 environment()->BindAccumulator(node, &states); |
1316 } | 1317 } |
1317 | 1318 |
1318 void BytecodeGraphBuilder::VisitToName() { | 1319 void BytecodeGraphBuilder::VisitToName() { |
(...skipping 437 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1756 // Phi does not exist yet, introduce one. | 1757 // Phi does not exist yet, introduce one. |
1757 value = NewPhi(inputs, value, control); | 1758 value = NewPhi(inputs, value, control); |
1758 value->ReplaceInput(inputs - 1, other); | 1759 value->ReplaceInput(inputs - 1, other); |
1759 } | 1760 } |
1760 return value; | 1761 return value; |
1761 } | 1762 } |
1762 | 1763 |
1763 } // namespace compiler | 1764 } // namespace compiler |
1764 } // namespace internal | 1765 } // namespace internal |
1765 } // namespace v8 | 1766 } // namespace v8 |
OLD | NEW |