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 1195 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1206 | 1206 |
1207 void BytecodeGraphBuilder::VisitTestGreaterThanOrEqual() { | 1207 void BytecodeGraphBuilder::VisitTestGreaterThanOrEqual() { |
1208 BuildCompareOp(javascript()->GreaterThanOrEqual()); | 1208 BuildCompareOp(javascript()->GreaterThanOrEqual()); |
1209 } | 1209 } |
1210 | 1210 |
1211 void BytecodeGraphBuilder::VisitTestIn() { | 1211 void BytecodeGraphBuilder::VisitTestIn() { |
1212 BuildCompareOp(javascript()->HasProperty()); | 1212 BuildCompareOp(javascript()->HasProperty()); |
1213 } | 1213 } |
1214 | 1214 |
1215 void BytecodeGraphBuilder::VisitTestInstanceOf() { | 1215 void BytecodeGraphBuilder::VisitTestInstanceOf() { |
1216 DCHECK(!FLAG_harmony_instanceof); | |
1217 BuildCompareOp(javascript()->InstanceOf()); | 1216 BuildCompareOp(javascript()->InstanceOf()); |
1218 } | 1217 } |
1219 | 1218 |
1220 void BytecodeGraphBuilder::BuildCastOperator(const Operator* js_op) { | 1219 void BytecodeGraphBuilder::BuildCastOperator(const Operator* js_op) { |
1221 FrameStateBeforeAndAfter states(this); | 1220 FrameStateBeforeAndAfter states(this); |
1222 Node* node = NewNode(js_op, environment()->LookupAccumulator()); | 1221 Node* node = NewNode(js_op, environment()->LookupAccumulator()); |
1223 environment()->BindAccumulator(node, &states); | 1222 environment()->BindAccumulator(node, &states); |
1224 } | 1223 } |
1225 | 1224 |
1226 void BytecodeGraphBuilder::VisitToName() { | 1225 void BytecodeGraphBuilder::VisitToName() { |
(...skipping 463 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1690 // Phi does not exist yet, introduce one. | 1689 // Phi does not exist yet, introduce one. |
1691 value = NewPhi(inputs, value, control); | 1690 value = NewPhi(inputs, value, control); |
1692 value->ReplaceInput(inputs - 1, other); | 1691 value->ReplaceInput(inputs - 1, other); |
1693 } | 1692 } |
1694 return value; | 1693 return value; |
1695 } | 1694 } |
1696 | 1695 |
1697 } // namespace compiler | 1696 } // namespace compiler |
1698 } // namespace internal | 1697 } // namespace internal |
1699 } // namespace v8 | 1698 } // namespace v8 |
OLD | NEW |