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 143 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
154 void BuildCallConstruct(const interpreter::BytecodeArrayIterator& iterator); | 154 void BuildCallConstruct(const interpreter::BytecodeArrayIterator& iterator); |
155 void BuildBinaryOp(const Operator* op, | 155 void BuildBinaryOp(const Operator* op, |
156 const interpreter::BytecodeArrayIterator& iterator); | 156 const interpreter::BytecodeArrayIterator& iterator); |
157 void BuildCompareOp(const Operator* op, | 157 void BuildCompareOp(const Operator* op, |
158 const interpreter::BytecodeArrayIterator& iterator); | 158 const interpreter::BytecodeArrayIterator& iterator); |
159 void BuildDelete(const interpreter::BytecodeArrayIterator& iterator); | 159 void BuildDelete(const interpreter::BytecodeArrayIterator& iterator); |
160 void BuildCastOperator(const Operator* js_op, | 160 void BuildCastOperator(const Operator* js_op, |
161 const interpreter::BytecodeArrayIterator& iterator); | 161 const interpreter::BytecodeArrayIterator& iterator); |
162 void BuildForInPrepare(const interpreter::BytecodeArrayIterator& iterator); | 162 void BuildForInPrepare(const interpreter::BytecodeArrayIterator& iterator); |
163 void BuildForInNext(const interpreter::BytecodeArrayIterator& iterator); | 163 void BuildForInNext(const interpreter::BytecodeArrayIterator& iterator); |
| 164 void BuildIntrinsicOneArg(const interpreter::BytecodeArrayIterator& iterator); |
164 | 165 |
165 // Control flow plumbing. | 166 // Control flow plumbing. |
166 void BuildJump(int source_offset, int target_offset); | 167 void BuildJump(int source_offset, int target_offset); |
167 void BuildJump(); | 168 void BuildJump(); |
168 void BuildConditionalJump(Node* condition); | 169 void BuildConditionalJump(Node* condition); |
169 void BuildJumpIfEqual(Node* comperand); | 170 void BuildJumpIfEqual(Node* comperand); |
170 void BuildJumpIfToBooleanEqual(Node* boolean_comperand); | 171 void BuildJumpIfToBooleanEqual(Node* boolean_comperand); |
171 | 172 |
172 // Constructing merge and loop headers. | 173 // Constructing merge and loop headers. |
173 void MergeEnvironmentsOfBackwardBranches(int source_offset, | 174 void MergeEnvironmentsOfBackwardBranches(int source_offset, |
(...skipping 188 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
362 Node* accumulator_state_values_; | 363 Node* accumulator_state_values_; |
363 int register_base_; | 364 int register_base_; |
364 int accumulator_base_; | 365 int accumulator_base_; |
365 }; | 366 }; |
366 | 367 |
367 } // namespace compiler | 368 } // namespace compiler |
368 } // namespace internal | 369 } // namespace internal |
369 } // namespace v8 | 370 } // namespace v8 |
370 | 371 |
371 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 372 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
OLD | NEW |