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 146 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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 | 162 |
163 // Control flow plumbing. | 163 // Control flow plumbing. |
164 void BuildJump(int source_offset, int target_offset); | 164 void BuildJump(int source_offset, int target_offset); |
165 void BuildJump(); | 165 void BuildJump(); |
166 void BuildConditionalJump(Node* condition); | 166 void BuildConditionalJump(Node* condition); |
167 | 167 void BuildJumpIfEqual(Node* comperand); |
168 // Helpers for building conditions for conditional jumps. | 168 void BuildJumpIfToBooleanEqual(Node* boolean_comperand); |
169 Node* BuildCondition(Node* comperand); | |
170 Node* BuildToBooleanCondition(Node* comperand); | |
171 | 169 |
172 // Constructing merge and loop headers. | 170 // Constructing merge and loop headers. |
173 void MergeEnvironmentsOfBackwardBranches(int source_offset, | 171 void MergeEnvironmentsOfBackwardBranches(int source_offset, |
174 int target_offset); | 172 int target_offset); |
175 void MergeEnvironmentsOfForwardBranches(int source_offset); | 173 void MergeEnvironmentsOfForwardBranches(int source_offset); |
176 void BuildLoopHeaderForBackwardBranches(int source_offset); | 174 void BuildLoopHeaderForBackwardBranches(int source_offset); |
177 | 175 |
178 // Growth increment for the temporary buffer used to construct input lists to | 176 // Growth increment for the temporary buffer used to construct input lists to |
179 // new nodes. | 177 // new nodes. |
180 static const int kInputBufferSizeIncrement = 64; | 178 static const int kInputBufferSizeIncrement = 64; |
(...skipping 152 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
333 Node* accumulator_state_values_; | 331 Node* accumulator_state_values_; |
334 int register_base_; | 332 int register_base_; |
335 int accumulator_base_; | 333 int accumulator_base_; |
336 }; | 334 }; |
337 | 335 |
338 } // namespace compiler | 336 } // namespace compiler |
339 } // namespace internal | 337 } // namespace internal |
340 } // namespace v8 | 338 } // namespace v8 |
341 | 339 |
342 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 340 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
OLD | NEW |