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 DoObjectIsNumber(Node* node); | 39 void DoObjectIsNumber(Node* node); |
| 40 void DoObjectIsReceiver(Node* node); |
40 void DoObjectIsSmi(Node* node); | 41 void DoObjectIsSmi(Node* node); |
41 void DoShift(Node* node, Operator const* op, Type* rhs_type); | 42 void DoShift(Node* node, Operator const* op, Type* rhs_type); |
42 void DoStringEqual(Node* node); | 43 void DoStringEqual(Node* node); |
43 void DoStringLessThan(Node* node); | 44 void DoStringLessThan(Node* node); |
44 void DoStringLessThanOrEqual(Node* node); | 45 void DoStringLessThanOrEqual(Node* node); |
45 | 46 |
46 private: | 47 private: |
47 JSGraph* const jsgraph_; | 48 JSGraph* const jsgraph_; |
48 Zone* const zone_; | 49 Zone* const zone_; |
49 TypeCache const& type_cache_; | 50 TypeCache const& type_cache_; |
50 | 51 |
51 // TODO(danno): SimplifiedLowering shouldn't know anything about the source | 52 // TODO(danno): SimplifiedLowering shouldn't know anything about the source |
52 // positions table, but must for now since there currently is no other way to | 53 // positions table, but must for now since there currently is no other way to |
53 // pass down source position information to nodes created during | 54 // pass down source position information to nodes created during |
54 // lowering. Once this phase becomes a vanilla reducer, it should get source | 55 // lowering. Once this phase becomes a vanilla reducer, it should get source |
55 // position information via the SourcePositionWrapper like all other reducers. | 56 // position information via the SourcePositionWrapper like all other reducers. |
56 SourcePositionTable* source_positions_; | 57 SourcePositionTable* source_positions_; |
57 | 58 |
| 59 Node* IsSmi(Node* value); |
| 60 Node* LoadHeapObjectMap(Node* object, Node* control); |
| 61 Node* LoadMapInstanceType(Node* map); |
58 Node* StringComparison(Node* node); | 62 Node* StringComparison(Node* node); |
59 Node* Int32Div(Node* const node); | 63 Node* Int32Div(Node* const node); |
60 Node* Int32Mod(Node* const node); | 64 Node* Int32Mod(Node* const node); |
61 Node* Uint32Div(Node* const node); | 65 Node* Uint32Div(Node* const node); |
62 Node* Uint32Mod(Node* const node); | 66 Node* Uint32Mod(Node* const node); |
63 | 67 |
64 friend class RepresentationSelector; | 68 friend class RepresentationSelector; |
65 | 69 |
66 Isolate* isolate() { return jsgraph_->isolate(); } | 70 Isolate* isolate() { return jsgraph_->isolate(); } |
67 Zone* zone() { return jsgraph_->zone(); } | 71 Zone* zone() { return jsgraph_->zone(); } |
68 JSGraph* jsgraph() { return jsgraph_; } | 72 JSGraph* jsgraph() { return jsgraph_; } |
69 Graph* graph() { return jsgraph()->graph(); } | 73 Graph* graph() { return jsgraph()->graph(); } |
70 CommonOperatorBuilder* common() { return jsgraph()->common(); } | 74 CommonOperatorBuilder* common() { return jsgraph()->common(); } |
71 MachineOperatorBuilder* machine() { return jsgraph()->machine(); } | 75 MachineOperatorBuilder* machine() { return jsgraph()->machine(); } |
72 }; | 76 }; |
73 | 77 |
74 } // namespace compiler | 78 } // namespace compiler |
75 } // namespace internal | 79 } // namespace internal |
76 } // namespace v8 | 80 } // namespace v8 |
77 | 81 |
78 #endif // V8_COMPILER_SIMPLIFIED_LOWERING_H_ | 82 #endif // V8_COMPILER_SIMPLIFIED_LOWERING_H_ |
OLD | NEW |