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 #ifndef V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 5 #ifndef V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
6 #define V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 6 #define V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
7 | 7 |
8 #include "src/compiler.h" | 8 #include "src/compiler.h" |
9 #include "src/compiler/bytecode-branch-analysis.h" | 9 #include "src/compiler/bytecode-branch-analysis.h" |
10 #include "src/compiler/js-graph.h" | 10 #include "src/compiler/js-graph.h" |
(...skipping 129 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
140 void BuildStoreGlobal(const interpreter::BytecodeArrayIterator& iterator); | 140 void BuildStoreGlobal(const interpreter::BytecodeArrayIterator& iterator); |
141 void BuildNamedLoad(const interpreter::BytecodeArrayIterator& iterator); | 141 void BuildNamedLoad(const interpreter::BytecodeArrayIterator& iterator); |
142 void BuildKeyedLoad(const interpreter::BytecodeArrayIterator& iterator); | 142 void BuildKeyedLoad(const interpreter::BytecodeArrayIterator& iterator); |
143 void BuildNamedStore(const interpreter::BytecodeArrayIterator& iterator); | 143 void BuildNamedStore(const interpreter::BytecodeArrayIterator& iterator); |
144 void BuildKeyedStore(const interpreter::BytecodeArrayIterator& iterator); | 144 void BuildKeyedStore(const interpreter::BytecodeArrayIterator& iterator); |
145 void BuildLdaLookupSlot(TypeofMode typeof_mode, | 145 void BuildLdaLookupSlot(TypeofMode typeof_mode, |
146 const interpreter::BytecodeArrayIterator& iterator); | 146 const interpreter::BytecodeArrayIterator& iterator); |
147 void BuildStaLookupSlot(LanguageMode language_mode, | 147 void BuildStaLookupSlot(LanguageMode language_mode, |
148 const interpreter::BytecodeArrayIterator& iterator); | 148 const interpreter::BytecodeArrayIterator& iterator); |
149 void BuildCall(const interpreter::BytecodeArrayIterator& iterator); | 149 void BuildCall(const interpreter::BytecodeArrayIterator& iterator); |
| 150 void BuildCallJSRuntime(const interpreter::BytecodeArrayIterator& iterator); |
| 151 void BuildCallRuntime(const interpreter::BytecodeArrayIterator& iterator); |
| 152 void BuildCallRuntimeForPair( |
| 153 const interpreter::BytecodeArrayIterator& iterator); |
| 154 void BuildCallConstruct(const interpreter::BytecodeArrayIterator& iterator); |
150 void BuildBinaryOp(const Operator* op, | 155 void BuildBinaryOp(const Operator* op, |
151 const interpreter::BytecodeArrayIterator& iterator); | 156 const interpreter::BytecodeArrayIterator& iterator); |
152 void BuildCompareOp(const Operator* op, | 157 void BuildCompareOp(const Operator* op, |
153 const interpreter::BytecodeArrayIterator& iterator); | 158 const interpreter::BytecodeArrayIterator& iterator); |
154 void BuildDelete(const interpreter::BytecodeArrayIterator& iterator); | 159 void BuildDelete(const interpreter::BytecodeArrayIterator& iterator); |
155 void BuildCastOperator(const Operator* js_op, | 160 void BuildCastOperator(const Operator* js_op, |
156 const interpreter::BytecodeArrayIterator& iterator); | 161 const interpreter::BytecodeArrayIterator& iterator); |
| 162 void BuildForInPrepare(const interpreter::BytecodeArrayIterator& iterator); |
| 163 void BuildForInNext(const interpreter::BytecodeArrayIterator& iterator); |
157 | 164 |
158 // Control flow plumbing. | 165 // Control flow plumbing. |
159 void BuildJump(int source_offset, int target_offset); | 166 void BuildJump(int source_offset, int target_offset); |
160 void BuildJump(); | 167 void BuildJump(); |
161 void BuildConditionalJump(Node* condition); | 168 void BuildConditionalJump(Node* condition); |
162 void BuildJumpIfEqual(Node* comperand); | 169 void BuildJumpIfEqual(Node* comperand); |
163 void BuildJumpIfToBooleanEqual(Node* boolean_comperand); | 170 void BuildJumpIfToBooleanEqual(Node* boolean_comperand); |
164 | 171 |
165 // Constructing merge and loop headers. | 172 // Constructing merge and loop headers. |
166 void MergeEnvironmentsOfBackwardBranches(int source_offset, | 173 void MergeEnvironmentsOfBackwardBranches(int source_offset, |
(...skipping 168 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
335 Node* accumulator_state_values_; | 342 Node* accumulator_state_values_; |
336 int register_base_; | 343 int register_base_; |
337 int accumulator_base_; | 344 int accumulator_base_; |
338 }; | 345 }; |
339 | 346 |
340 } // namespace compiler | 347 } // namespace compiler |
341 } // namespace internal | 348 } // namespace internal |
342 } // namespace v8 | 349 } // namespace v8 |
343 | 350 |
344 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 351 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
OLD | NEW |