OLD | NEW |
1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 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_SIMPLIFIED_LOWERING_H_ | 5 #ifndef V8_COMPILER_SIMPLIFIED_LOWERING_H_ |
6 #define V8_COMPILER_SIMPLIFIED_LOWERING_H_ | 6 #define V8_COMPILER_SIMPLIFIED_LOWERING_H_ |
7 | 7 |
8 #include "src/compiler/js-graph.h" | 8 #include "src/compiler/js-graph.h" |
9 #include "src/compiler/machine-operator.h" | 9 #include "src/compiler/machine-operator.h" |
10 #include "src/compiler/node.h" | 10 #include "src/compiler/node.h" |
(...skipping 19 matching lines...) Expand all Loading... |
30 ~SimplifiedLowering() {} | 30 ~SimplifiedLowering() {} |
31 | 31 |
32 void LowerAllNodes(); | 32 void LowerAllNodes(); |
33 | 33 |
34 // TODO(turbofan): The representation can be removed once the result of the | 34 // TODO(turbofan): The representation can be removed once the result of the |
35 // representation analysis is stored in the node bounds. | 35 // representation analysis is stored in the node bounds. |
36 void DoLoadBuffer(Node* node, MachineRepresentation rep, | 36 void DoLoadBuffer(Node* node, MachineRepresentation rep, |
37 RepresentationChanger* changer); | 37 RepresentationChanger* changer); |
38 void DoStoreBuffer(Node* node); | 38 void DoStoreBuffer(Node* node); |
39 void DoShift(Node* node, Operator const* op, Type* rhs_type); | 39 void DoShift(Node* node, Operator const* op, Type* rhs_type); |
40 void DoStringEqual(Node* node); | |
41 void DoStringLessThan(Node* node); | 40 void DoStringLessThan(Node* node); |
42 void DoStringLessThanOrEqual(Node* node); | 41 void DoStringLessThanOrEqual(Node* node); |
43 | 42 |
44 // TODO(bmeurer): This is a gigantic hack to support the gigantic LoadBuffer | 43 // TODO(bmeurer): This is a gigantic hack to support the gigantic LoadBuffer |
45 // typing hack to support the gigantic "asm.js should be fast without proper | 44 // typing hack to support the gigantic "asm.js should be fast without proper |
46 // verifier"-hack, ... Kill this! Soon! Really soon! I'm serious! | 45 // verifier"-hack, ... Kill this! Soon! Really soon! I'm serious! |
47 bool abort_compilation_ = false; | 46 bool abort_compilation_ = false; |
48 | 47 |
49 private: | 48 private: |
50 JSGraph* const jsgraph_; | 49 JSGraph* const jsgraph_; |
(...skipping 21 matching lines...) Expand all Loading... |
72 Graph* graph() { return jsgraph()->graph(); } | 71 Graph* graph() { return jsgraph()->graph(); } |
73 CommonOperatorBuilder* common() { return jsgraph()->common(); } | 72 CommonOperatorBuilder* common() { return jsgraph()->common(); } |
74 MachineOperatorBuilder* machine() { return jsgraph()->machine(); } | 73 MachineOperatorBuilder* machine() { return jsgraph()->machine(); } |
75 }; | 74 }; |
76 | 75 |
77 } // namespace compiler | 76 } // namespace compiler |
78 } // namespace internal | 77 } // namespace internal |
79 } // namespace v8 | 78 } // namespace v8 |
80 | 79 |
81 #endif // V8_COMPILER_SIMPLIFIED_LOWERING_H_ | 80 #endif // V8_COMPILER_SIMPLIFIED_LOWERING_H_ |
OLD | NEW |