| 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 170 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 181 Node* name = nullptr); | 181 Node* name = nullptr); |
| 182 | 182 |
| 183 // Optional early lowering to the simplified operator level. Returns the node | 183 // Optional early lowering to the simplified operator level. Returns the node |
| 184 // representing the lowered operation or {nullptr} if no lowering available. | 184 // representing the lowered operation or {nullptr} if no lowering available. |
| 185 // Note that the result has already been wired into the environment just like | 185 // Note that the result has already been wired into the environment just like |
| 186 // any other invocation of {NewNode} would do. | 186 // any other invocation of {NewNode} would do. |
| 187 Node* TryBuildSimplifiedBinaryOp(const Operator* op, Node* left, Node* right, | 187 Node* TryBuildSimplifiedBinaryOp(const Operator* op, Node* left, Node* right, |
| 188 FeedbackSlot slot); | 188 FeedbackSlot slot); |
| 189 Node* TryBuildSimplifiedToNumber(Node* input, FeedbackSlot slot); | 189 Node* TryBuildSimplifiedToNumber(Node* input, FeedbackSlot slot); |
| 190 Node* TryBuildSimplifiedToPrimitiveToString(Node* input, FeedbackSlot slot); | 190 Node* TryBuildSimplifiedToPrimitiveToString(Node* input, FeedbackSlot slot); |
| 191 Node* TryBuildSimplifiedCall(const Operator* op, Node* const* args, |
| 192 int arg_count, FeedbackSlot slot); |
| 191 Node* TryBuildSimplifiedLoadNamed(const Operator* op, Node* receiver, | 193 Node* TryBuildSimplifiedLoadNamed(const Operator* op, Node* receiver, |
| 192 FeedbackSlot slot); | 194 FeedbackSlot slot); |
| 193 Node* TryBuildSimplifiedLoadKeyed(const Operator* op, Node* receiver, | 195 Node* TryBuildSimplifiedLoadKeyed(const Operator* op, Node* receiver, |
| 194 Node* key, FeedbackSlot slot); | 196 Node* key, FeedbackSlot slot); |
| 195 Node* TryBuildSimplifiedStoreNamed(const Operator* op, Node* receiver, | 197 Node* TryBuildSimplifiedStoreNamed(const Operator* op, Node* receiver, |
| 196 Node* value, FeedbackSlot slot); | 198 Node* value, FeedbackSlot slot); |
| 197 Node* TryBuildSimplifiedStoreKeyed(const Operator* op, Node* receiver, | 199 Node* TryBuildSimplifiedStoreKeyed(const Operator* op, Node* receiver, |
| 198 Node* key, Node* value, FeedbackSlot slot); | 200 Node* key, Node* value, FeedbackSlot slot); |
| 199 | 201 |
| 200 // Applies the given early reduction onto the current environment. | 202 // Applies the given early reduction onto the current environment. |
| (...skipping 172 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 373 static int const kBinaryOperationSmiHintIndex = 1; | 375 static int const kBinaryOperationSmiHintIndex = 1; |
| 374 | 376 |
| 375 DISALLOW_COPY_AND_ASSIGN(BytecodeGraphBuilder); | 377 DISALLOW_COPY_AND_ASSIGN(BytecodeGraphBuilder); |
| 376 }; | 378 }; |
| 377 | 379 |
| 378 } // namespace compiler | 380 } // namespace compiler |
| 379 } // namespace internal | 381 } // namespace internal |
| 380 } // namespace v8 | 382 } // namespace v8 |
| 381 | 383 |
| 382 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ | 384 #endif // V8_COMPILER_BYTECODE_GRAPH_BUILDER_H_ |
| OLD | NEW |