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 1292 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1303 } | 1303 } |
1304 | 1304 |
1305 | 1305 |
1306 void BytecodeGraphBuilder::VisitDeletePropertySloppy( | 1306 void BytecodeGraphBuilder::VisitDeletePropertySloppy( |
1307 const interpreter::BytecodeArrayIterator& iterator) { | 1307 const interpreter::BytecodeArrayIterator& iterator) { |
1308 DCHECK(is_sloppy(language_mode())); | 1308 DCHECK(is_sloppy(language_mode())); |
1309 BuildDelete(iterator); | 1309 BuildDelete(iterator); |
1310 } | 1310 } |
1311 | 1311 |
1312 | 1312 |
| 1313 void BytecodeGraphBuilder::VisitDeleteLookupSlot( |
| 1314 const interpreter::BytecodeArrayIterator& iterator) { |
| 1315 FrameStateBeforeAndAfter states(this, iterator); |
| 1316 Node* name = environment()->LookupAccumulator(); |
| 1317 const Operator* op = javascript()->CallRuntime(Runtime::kDeleteLookupSlot, 2); |
| 1318 Node* result = NewNode(op, environment()->Context(), name); |
| 1319 environment()->BindAccumulator(result, &states); |
| 1320 } |
| 1321 |
| 1322 |
1313 void BytecodeGraphBuilder::BuildCompareOp( | 1323 void BytecodeGraphBuilder::BuildCompareOp( |
1314 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { | 1324 const Operator* js_op, const interpreter::BytecodeArrayIterator& iterator) { |
1315 FrameStateBeforeAndAfter states(this, iterator); | 1325 FrameStateBeforeAndAfter states(this, iterator); |
1316 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); | 1326 Node* left = environment()->LookupRegister(iterator.GetRegisterOperand(0)); |
1317 Node* right = environment()->LookupAccumulator(); | 1327 Node* right = environment()->LookupAccumulator(); |
1318 Node* node = NewNode(js_op, left, right); | 1328 Node* node = NewNode(js_op, left, right); |
1319 environment()->BindAccumulator(node, &states); | 1329 environment()->BindAccumulator(node, &states); |
1320 } | 1330 } |
1321 | 1331 |
1322 | 1332 |
(...skipping 448 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1771 | 1781 |
1772 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 1782 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
1773 if (environment()->IsMarkedAsUnreachable()) return; | 1783 if (environment()->IsMarkedAsUnreachable()) return; |
1774 environment()->MarkAsUnreachable(); | 1784 environment()->MarkAsUnreachable(); |
1775 exit_controls_.push_back(exit); | 1785 exit_controls_.push_back(exit); |
1776 } | 1786 } |
1777 | 1787 |
1778 } // namespace compiler | 1788 } // namespace compiler |
1779 } // namespace internal | 1789 } // namespace internal |
1780 } // namespace v8 | 1790 } // namespace v8 |
OLD | NEW |