| 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/js-graph.h" | 9 #include "src/compiler/js-graph.h" |
| 10 #include "src/interpreter/bytecode-array-iterator.h" | 10 #include "src/interpreter/bytecode-array-iterator.h" |
| (...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 79 | 79 |
| 80 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs, | 80 Node* MakeNode(const Operator* op, int value_input_count, Node** value_inputs, |
| 81 bool incomplete); | 81 bool incomplete); |
| 82 | 82 |
| 83 Node* MergeControl(Node* control, Node* other); | 83 Node* MergeControl(Node* control, Node* other); |
| 84 | 84 |
| 85 Node** EnsureInputBufferSize(int size); | 85 Node** EnsureInputBufferSize(int size); |
| 86 | 86 |
| 87 void UpdateControlDependencyToLeaveFunction(Node* exit); | 87 void UpdateControlDependencyToLeaveFunction(Node* exit); |
| 88 | 88 |
| 89 void BuildBinaryOp(const Operator* op, | |
| 90 const interpreter::BytecodeArrayIterator& iterator); | |
| 91 | |
| 92 void BuildNamedLoad(const interpreter::BytecodeArrayIterator& iterator); | |
| 93 | |
| 94 Node* ProcessCallArguments(const Operator* call_op, | 89 Node* ProcessCallArguments(const Operator* call_op, |
| 95 interpreter::Register callee, | 90 interpreter::Register callee, |
| 96 interpreter::Register receiver, size_t arity); | 91 interpreter::Register receiver, size_t arity); |
| 97 | 92 |
| 93 void BuildLoadGlobal(const interpreter::BytecodeArrayIterator& iterator, |
| 94 TypeofMode typeof_mode); |
| 95 void BuildStoreGlobal(const interpreter::BytecodeArrayIterator& iterator); |
| 96 void BuildNamedLoad(const interpreter::BytecodeArrayIterator& iterator); |
| 98 void BuildCall(const interpreter::BytecodeArrayIterator& iterator); | 97 void BuildCall(const interpreter::BytecodeArrayIterator& iterator); |
| 98 void BuildBinaryOp(const Operator* op, |
| 99 const interpreter::BytecodeArrayIterator& iterator); |
| 99 | 100 |
| 100 // Growth increment for the temporary buffer used to construct input lists to | 101 // Growth increment for the temporary buffer used to construct input lists to |
| 101 // new nodes. | 102 // new nodes. |
| 102 static const int kInputBufferSizeIncrement = 64; | 103 static const int kInputBufferSizeIncrement = 64; |
| 103 | 104 |
| 104 // Field accessors | 105 // Field accessors |
| 105 CommonOperatorBuilder* common() const { return jsgraph_->common(); } | 106 CommonOperatorBuilder* common() const { return jsgraph_->common(); } |
| 106 Zone* graph_zone() const { return graph()->zone(); } | 107 Zone* graph_zone() const { return graph()->zone(); } |
| 107 CompilationInfo* info() const { return info_; } | 108 CompilationInfo* info() const { return info_; } |
| 108 JSGraph* jsgraph() const { return jsgraph_; } | 109 JSGraph* jsgraph() const { return jsgraph_; } |
| (...skipping 90 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 199 NodeVector values_; | 200 NodeVector values_; |
| 200 int register_base_; | 201 int register_base_; |
| 201 }; | 202 }; |
| 202 | 203 |
| 203 | 204 |
| 204 } // namespace compiler | 205 } // namespace compiler |
| 205 } // namespace internal | 206 } // namespace internal |
| 206 } // namespace v8 | 207 } // namespace v8 |
| 207 | 208 |
| 208 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 209 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
| OLD | NEW |