| 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/bytecode-analysis.h" | 8 #include "src/compiler/bytecode-analysis.h" |
| 9 #include "src/compiler/js-graph.h" | 9 #include "src/compiler/js-graph.h" |
| 10 #include "src/compiler/js-type-hint-lowering.h" | 10 #include "src/compiler/js-type-hint-lowering.h" |
| (...skipping 162 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 173 void BuildTestingOp(const Operator* op); | 173 void BuildTestingOp(const Operator* op); |
| 174 void BuildDelete(LanguageMode language_mode); | 174 void BuildDelete(LanguageMode language_mode); |
| 175 void BuildCastOperator(const Operator* op); | 175 void BuildCastOperator(const Operator* op); |
| 176 | 176 |
| 177 // Optional early lowering to the simplified operator level. Returns the node | 177 // Optional early lowering to the simplified operator level. Returns the node |
| 178 // representing the lowered operation or {nullptr} if no lowering available. | 178 // representing the lowered operation or {nullptr} if no lowering available. |
| 179 // Note that the result has already been wired into the environment just like | 179 // Note that the result has already been wired into the environment just like |
| 180 // any other invocation of {NewNode} would do. | 180 // any other invocation of {NewNode} would do. |
| 181 Node* TryBuildSimplifiedBinaryOp(const Operator* op, Node* left, Node* right, | 181 Node* TryBuildSimplifiedBinaryOp(const Operator* op, Node* left, Node* right, |
| 182 FeedbackSlot slot); | 182 FeedbackSlot slot); |
| 183 Node* TryBuildSimplifiedToNumber(Node* input, FeedbackSlot slot); |
| 183 Node* TryBuildSimplifiedLoadNamed(const Operator* op, Node* receiver, | 184 Node* TryBuildSimplifiedLoadNamed(const Operator* op, Node* receiver, |
| 184 FeedbackSlot slot); | 185 FeedbackSlot slot); |
| 185 Node* TryBuildSimplifiedLoadKeyed(const Operator* op, Node* receiver, | 186 Node* TryBuildSimplifiedLoadKeyed(const Operator* op, Node* receiver, |
| 186 Node* key, FeedbackSlot slot); | 187 Node* key, FeedbackSlot slot); |
| 187 Node* TryBuildSimplifiedStoreNamed(const Operator* op, Node* receiver, | 188 Node* TryBuildSimplifiedStoreNamed(const Operator* op, Node* receiver, |
| 188 Node* value, FeedbackSlot slot); | 189 Node* value, FeedbackSlot slot); |
| 189 Node* TryBuildSimplifiedStoreKeyed(const Operator* op, Node* receiver, | 190 Node* TryBuildSimplifiedStoreKeyed(const Operator* op, Node* receiver, |
| 190 Node* key, Node* value, FeedbackSlot slot); | 191 Node* key, Node* value, FeedbackSlot slot); |
| 191 | 192 |
| 192 // Applies the given early reduction onto the current environment. | 193 // Applies the given early reduction onto the current environment. |
| (...skipping 171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 364 static int const kBinaryOperationSmiHintIndex = 2; | 365 static int const kBinaryOperationSmiHintIndex = 2; |
| 365 | 366 |
| 366 DISALLOW_COPY_AND_ASSIGN(BytecodeGraphBuilder); | 367 DISALLOW_COPY_AND_ASSIGN(BytecodeGraphBuilder); |
| 367 }; | 368 }; |
| 368 | 369 |
| 369 } // namespace compiler | 370 } // namespace compiler |
| 370 } // namespace internal | 371 } // namespace internal |
| 371 } // namespace v8 | 372 } // namespace v8 |
| 372 | 373 |
| 373 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 374 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
| OLD | NEW |