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/ast/ast.h" | 7 #include "src/ast/ast.h" |
8 #include "src/ast/scopes.h" | 8 #include "src/ast/scopes.h" |
9 #include "src/compilation-info.h" | 9 #include "src/compilation-info.h" |
10 #include "src/compiler/compiler-source-position-table.h" | 10 #include "src/compiler/compiler-source-position-table.h" |
(...skipping 1608 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1619 } | 1619 } |
1620 | 1620 |
1621 void BytecodeGraphBuilder::VisitDeletePropertyStrict() { | 1621 void BytecodeGraphBuilder::VisitDeletePropertyStrict() { |
1622 BuildDelete(LanguageMode::STRICT); | 1622 BuildDelete(LanguageMode::STRICT); |
1623 } | 1623 } |
1624 | 1624 |
1625 void BytecodeGraphBuilder::VisitDeletePropertySloppy() { | 1625 void BytecodeGraphBuilder::VisitDeletePropertySloppy() { |
1626 BuildDelete(LanguageMode::SLOPPY); | 1626 BuildDelete(LanguageMode::SLOPPY); |
1627 } | 1627 } |
1628 | 1628 |
| 1629 void BytecodeGraphBuilder::VisitGetSuperConstructor() { |
| 1630 Node* node = NewNode(javascript()->GetSuperConstructor(), |
| 1631 environment()->LookupAccumulator()); |
| 1632 environment()->BindRegister(bytecode_iterator().GetRegisterOperand(0), node, |
| 1633 Environment::kAttachFrameState); |
| 1634 } |
| 1635 |
1629 void BytecodeGraphBuilder::BuildCompareOp(const Operator* js_op) { | 1636 void BytecodeGraphBuilder::BuildCompareOp(const Operator* js_op) { |
1630 PrepareEagerCheckpoint(); | 1637 PrepareEagerCheckpoint(); |
1631 Node* left = | 1638 Node* left = |
1632 environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0)); | 1639 environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0)); |
1633 Node* right = environment()->LookupAccumulator(); | 1640 Node* right = environment()->LookupAccumulator(); |
1634 Node* node = NewNode(js_op, left, right); | 1641 Node* node = NewNode(js_op, left, right); |
1635 environment()->BindAccumulator(node, Environment::kAttachFrameState); | 1642 environment()->BindAccumulator(node, Environment::kAttachFrameState); |
1636 } | 1643 } |
1637 | 1644 |
1638 void BytecodeGraphBuilder::VisitTestEqual() { | 1645 void BytecodeGraphBuilder::VisitTestEqual() { |
(...skipping 637 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2276 it->source_position().ScriptOffset(), start_position_.InliningId())); | 2283 it->source_position().ScriptOffset(), start_position_.InliningId())); |
2277 it->Advance(); | 2284 it->Advance(); |
2278 } else { | 2285 } else { |
2279 DCHECK_GT(it->code_offset(), offset); | 2286 DCHECK_GT(it->code_offset(), offset); |
2280 } | 2287 } |
2281 } | 2288 } |
2282 | 2289 |
2283 } // namespace compiler | 2290 } // namespace compiler |
2284 } // namespace internal | 2291 } // namespace internal |
2285 } // namespace v8 | 2292 } // namespace v8 |
OLD | NEW |