| 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/bytecode-branch-analysis.h" | 10 #include "src/compiler/bytecode-branch-analysis.h" |
| (...skipping 1719 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1730 } | 1730 } |
| 1731 | 1731 |
| 1732 void BytecodeGraphBuilder::VisitJumpLoop() { BuildJump(); } | 1732 void BytecodeGraphBuilder::VisitJumpLoop() { BuildJump(); } |
| 1733 | 1733 |
| 1734 void BytecodeGraphBuilder::VisitStackCheck() { | 1734 void BytecodeGraphBuilder::VisitStackCheck() { |
| 1735 PrepareEagerCheckpoint(); | 1735 PrepareEagerCheckpoint(); |
| 1736 Node* node = NewNode(javascript()->StackCheck()); | 1736 Node* node = NewNode(javascript()->StackCheck()); |
| 1737 environment()->RecordAfterState(node, Environment::kAttachFrameState); | 1737 environment()->RecordAfterState(node, Environment::kAttachFrameState); |
| 1738 } | 1738 } |
| 1739 | 1739 |
| 1740 void BytecodeGraphBuilder::VisitSetPendingMessage() { |
| 1741 Node* previous_message = NewNode(javascript()->LoadMessage()); |
| 1742 NewNode(javascript()->StoreMessage(), environment()->LookupAccumulator()); |
| 1743 environment()->BindAccumulator(previous_message); |
| 1744 } |
| 1745 |
| 1740 void BytecodeGraphBuilder::VisitReturn() { | 1746 void BytecodeGraphBuilder::VisitReturn() { |
| 1741 BuildLoopExitsForFunctionExit(); | 1747 BuildLoopExitsForFunctionExit(); |
| 1742 Node* pop_node = jsgraph()->ZeroConstant(); | 1748 Node* pop_node = jsgraph()->ZeroConstant(); |
| 1743 Node* control = | 1749 Node* control = |
| 1744 NewNode(common()->Return(), pop_node, environment()->LookupAccumulator()); | 1750 NewNode(common()->Return(), pop_node, environment()->LookupAccumulator()); |
| 1745 MergeControlToLeaveFunction(control); | 1751 MergeControlToLeaveFunction(control); |
| 1746 } | 1752 } |
| 1747 | 1753 |
| 1748 void BytecodeGraphBuilder::VisitDebugger() { | 1754 void BytecodeGraphBuilder::VisitDebugger() { |
| 1749 PrepareEagerCheckpoint(); | 1755 PrepareEagerCheckpoint(); |
| (...skipping 459 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2209 it->source_position().ScriptOffset(), start_position_.InliningId())); | 2215 it->source_position().ScriptOffset(), start_position_.InliningId())); |
| 2210 it->Advance(); | 2216 it->Advance(); |
| 2211 } else { | 2217 } else { |
| 2212 DCHECK_GT(it->code_offset(), offset); | 2218 DCHECK_GT(it->code_offset(), offset); |
| 2213 } | 2219 } |
| 2214 } | 2220 } |
| 2215 | 2221 |
| 2216 } // namespace compiler | 2222 } // namespace compiler |
| 2217 } // namespace internal | 2223 } // namespace internal |
| 2218 } // namespace v8 | 2224 } // namespace v8 |
| OLD | NEW |