| 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 1287 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1298 } | 1298 } |
| 1299 | 1299 |
| 1300 void BytecodeGraphBuilder::VisitDeletePropertyStrict() { | 1300 void BytecodeGraphBuilder::VisitDeletePropertyStrict() { |
| 1301 BuildDelete(LanguageMode::STRICT); | 1301 BuildDelete(LanguageMode::STRICT); |
| 1302 } | 1302 } |
| 1303 | 1303 |
| 1304 void BytecodeGraphBuilder::VisitDeletePropertySloppy() { | 1304 void BytecodeGraphBuilder::VisitDeletePropertySloppy() { |
| 1305 BuildDelete(LanguageMode::SLOPPY); | 1305 BuildDelete(LanguageMode::SLOPPY); |
| 1306 } | 1306 } |
| 1307 | 1307 |
| 1308 void BytecodeGraphBuilder::VisitDeleteLookupSlot() { | |
| 1309 FrameStateBeforeAndAfter states(this); | |
| 1310 Node* name = environment()->LookupAccumulator(); | |
| 1311 const Operator* op = javascript()->CallRuntime(Runtime::kDeleteLookupSlot); | |
| 1312 Node* result = NewNode(op, name); | |
| 1313 environment()->BindAccumulator(result, &states); | |
| 1314 } | |
| 1315 | |
| 1316 void BytecodeGraphBuilder::BuildCompareOp(const Operator* js_op) { | 1308 void BytecodeGraphBuilder::BuildCompareOp(const Operator* js_op) { |
| 1317 FrameStateBeforeAndAfter states(this); | 1309 FrameStateBeforeAndAfter states(this); |
| 1318 Node* left = | 1310 Node* left = |
| 1319 environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0)); | 1311 environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0)); |
| 1320 Node* right = environment()->LookupAccumulator(); | 1312 Node* right = environment()->LookupAccumulator(); |
| 1321 Node* node = NewNode(js_op, left, right); | 1313 Node* node = NewNode(js_op, left, right); |
| 1322 environment()->BindAccumulator(node, &states); | 1314 environment()->BindAccumulator(node, &states); |
| 1323 } | 1315 } |
| 1324 | 1316 |
| 1325 void BytecodeGraphBuilder::VisitTestEqual() { | 1317 void BytecodeGraphBuilder::VisitTestEqual() { |
| (...skipping 468 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1794 // Phi does not exist yet, introduce one. | 1786 // Phi does not exist yet, introduce one. |
| 1795 value = NewPhi(inputs, value, control); | 1787 value = NewPhi(inputs, value, control); |
| 1796 value->ReplaceInput(inputs - 1, other); | 1788 value->ReplaceInput(inputs - 1, other); |
| 1797 } | 1789 } |
| 1798 return value; | 1790 return value; |
| 1799 } | 1791 } |
| 1800 | 1792 |
| 1801 } // namespace compiler | 1793 } // namespace compiler |
| 1802 } // namespace internal | 1794 } // namespace internal |
| 1803 } // namespace v8 | 1795 } // namespace v8 |
| OLD | NEW |