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 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
110 void BuildNamedLoad(const interpreter::BytecodeArrayIterator& iterator); | 110 void BuildNamedLoad(const interpreter::BytecodeArrayIterator& iterator); |
111 void BuildKeyedLoad(const interpreter::BytecodeArrayIterator& iterator); | 111 void BuildKeyedLoad(const interpreter::BytecodeArrayIterator& iterator); |
112 void BuildNamedStore(const interpreter::BytecodeArrayIterator& iterator); | 112 void BuildNamedStore(const interpreter::BytecodeArrayIterator& iterator); |
113 void BuildKeyedStore(const interpreter::BytecodeArrayIterator& iterator); | 113 void BuildKeyedStore(const interpreter::BytecodeArrayIterator& iterator); |
114 void BuildCall(const interpreter::BytecodeArrayIterator& iterator); | 114 void BuildCall(const interpreter::BytecodeArrayIterator& iterator); |
115 void BuildBinaryOp(const Operator* op, | 115 void BuildBinaryOp(const Operator* op, |
116 const interpreter::BytecodeArrayIterator& iterator); | 116 const interpreter::BytecodeArrayIterator& iterator); |
117 void BuildCompareOp(const Operator* op, | 117 void BuildCompareOp(const Operator* op, |
118 const interpreter::BytecodeArrayIterator& iterator); | 118 const interpreter::BytecodeArrayIterator& iterator); |
119 void BuildDelete(const interpreter::BytecodeArrayIterator& iterator); | 119 void BuildDelete(const interpreter::BytecodeArrayIterator& iterator); |
| 120 void BuildCastOperator(const Operator* js_op, |
| 121 const interpreter::BytecodeArrayIterator& iterator); |
120 | 122 |
121 // Growth increment for the temporary buffer used to construct input lists to | 123 // Growth increment for the temporary buffer used to construct input lists to |
122 // new nodes. | 124 // new nodes. |
123 static const int kInputBufferSizeIncrement = 64; | 125 static const int kInputBufferSizeIncrement = 64; |
124 | 126 |
125 // Field accessors | 127 // Field accessors |
126 CommonOperatorBuilder* common() const { return jsgraph_->common(); } | 128 CommonOperatorBuilder* common() const { return jsgraph_->common(); } |
127 Zone* graph_zone() const { return graph()->zone(); } | 129 Zone* graph_zone() const { return graph()->zone(); } |
128 CompilationInfo* info() const { return info_; } | 130 CompilationInfo* info() const { return info_; } |
129 JSGraph* jsgraph() const { return jsgraph_; } | 131 JSGraph* jsgraph() const { return jsgraph_; } |
(...skipping 90 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
220 NodeVector values_; | 222 NodeVector values_; |
221 int register_base_; | 223 int register_base_; |
222 }; | 224 }; |
223 | 225 |
224 | 226 |
225 } // namespace compiler | 227 } // namespace compiler |
226 } // namespace internal | 228 } // namespace internal |
227 } // namespace v8 | 229 } // namespace v8 |
228 | 230 |
229 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 231 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
OLD | NEW |