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 1344 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1355 void BytecodeGraphBuilder::VisitForInNext() { BuildForInNext(); } | 1355 void BytecodeGraphBuilder::VisitForInNext() { BuildForInNext(); } |
1356 | 1356 |
1357 void BytecodeGraphBuilder::VisitForInStep() { | 1357 void BytecodeGraphBuilder::VisitForInStep() { |
1358 FrameStateBeforeAndAfter states(this); | 1358 FrameStateBeforeAndAfter states(this); |
1359 Node* index = | 1359 Node* index = |
1360 environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0)); | 1360 environment()->LookupRegister(bytecode_iterator().GetRegisterOperand(0)); |
1361 index = NewNode(javascript()->ForInStep(), index); | 1361 index = NewNode(javascript()->ForInStep(), index); |
1362 environment()->BindAccumulator(index, &states); | 1362 environment()->BindAccumulator(index, &states); |
1363 } | 1363 } |
1364 | 1364 |
| 1365 void BytecodeGraphBuilder::VisitSuspendGenerator() { |
| 1366 UNIMPLEMENTED(); |
| 1367 } |
| 1368 |
| 1369 void BytecodeGraphBuilder::VisitResumeGenerator() { |
| 1370 UNIMPLEMENTED(); |
| 1371 } |
| 1372 |
1365 void BytecodeGraphBuilder::VisitWide() { | 1373 void BytecodeGraphBuilder::VisitWide() { |
1366 // Consumed by the BytecodeArrayIterator. | 1374 // Consumed by the BytecodeArrayIterator. |
1367 UNREACHABLE(); | 1375 UNREACHABLE(); |
1368 } | 1376 } |
1369 | 1377 |
1370 void BytecodeGraphBuilder::VisitExtraWide() { | 1378 void BytecodeGraphBuilder::VisitExtraWide() { |
1371 // Consumed by the BytecodeArrayIterator. | 1379 // Consumed by the BytecodeArrayIterator. |
1372 UNREACHABLE(); | 1380 UNREACHABLE(); |
1373 } | 1381 } |
1374 | 1382 |
(...skipping 267 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1642 // Phi does not exist yet, introduce one. | 1650 // Phi does not exist yet, introduce one. |
1643 value = NewPhi(inputs, value, control); | 1651 value = NewPhi(inputs, value, control); |
1644 value->ReplaceInput(inputs - 1, other); | 1652 value->ReplaceInput(inputs - 1, other); |
1645 } | 1653 } |
1646 return value; | 1654 return value; |
1647 } | 1655 } |
1648 | 1656 |
1649 } // namespace compiler | 1657 } // namespace compiler |
1650 } // namespace internal | 1658 } // namespace internal |
1651 } // namespace v8 | 1659 } // namespace v8 |
OLD | NEW |