| 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 1374 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1385 void BytecodeGraphBuilder::VisitJumpIfUndefinedConstant() { | 1385 void BytecodeGraphBuilder::VisitJumpIfUndefinedConstant() { |
| 1386 BuildJumpIfEqual(jsgraph()->UndefinedConstant()); | 1386 BuildJumpIfEqual(jsgraph()->UndefinedConstant()); |
| 1387 } | 1387 } |
| 1388 | 1388 |
| 1389 void BytecodeGraphBuilder::VisitStackCheck() { | 1389 void BytecodeGraphBuilder::VisitStackCheck() { |
| 1390 FrameStateBeforeAndAfter states(this); | 1390 FrameStateBeforeAndAfter states(this); |
| 1391 Node* node = NewNode(javascript()->StackCheck()); | 1391 Node* node = NewNode(javascript()->StackCheck()); |
| 1392 environment()->RecordAfterState(node, &states); | 1392 environment()->RecordAfterState(node, &states); |
| 1393 } | 1393 } |
| 1394 | 1394 |
| 1395 void BytecodeGraphBuilder::VisitOsrPoll() { |
| 1396 // TODO(4764): Implement OSR graph construction. Not marked UNIMPLEMENTED to |
| 1397 // ensure the --ignition-osr flag can already be fuzzed without crashing. |
| 1398 } |
| 1399 |
| 1395 void BytecodeGraphBuilder::VisitReturn() { | 1400 void BytecodeGraphBuilder::VisitReturn() { |
| 1396 Node* control = | 1401 Node* control = |
| 1397 NewNode(common()->Return(), environment()->LookupAccumulator()); | 1402 NewNode(common()->Return(), environment()->LookupAccumulator()); |
| 1398 MergeControlToLeaveFunction(control); | 1403 MergeControlToLeaveFunction(control); |
| 1399 } | 1404 } |
| 1400 | 1405 |
| 1401 void BytecodeGraphBuilder::VisitDebugger() { | 1406 void BytecodeGraphBuilder::VisitDebugger() { |
| 1402 FrameStateBeforeAndAfter states(this); | 1407 FrameStateBeforeAndAfter states(this); |
| 1403 Node* call = | 1408 Node* call = |
| 1404 NewNode(javascript()->CallRuntime(Runtime::kHandleDebuggerStatement)); | 1409 NewNode(javascript()->CallRuntime(Runtime::kHandleDebuggerStatement)); |
| (...skipping 382 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1787 // Phi does not exist yet, introduce one. | 1792 // Phi does not exist yet, introduce one. |
| 1788 value = NewPhi(inputs, value, control); | 1793 value = NewPhi(inputs, value, control); |
| 1789 value->ReplaceInput(inputs - 1, other); | 1794 value->ReplaceInput(inputs - 1, other); |
| 1790 } | 1795 } |
| 1791 return value; | 1796 return value; |
| 1792 } | 1797 } |
| 1793 | 1798 |
| 1794 } // namespace compiler | 1799 } // namespace compiler |
| 1795 } // namespace internal | 1800 } // namespace internal |
| 1796 } // namespace v8 | 1801 } // namespace v8 |
| OLD | NEW |