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 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
47 Zone* const zone_; | 47 Zone* const zone_; |
48 Type* const zero_thirtyone_range_; | 48 Type* const zero_thirtyone_range_; |
49 | 49 |
50 // TODO(danno): SimplifiedLowering shouldn't know anything about the source | 50 // TODO(danno): SimplifiedLowering shouldn't know anything about the source |
51 // positions table, but must for now since there currently is no other way to | 51 // positions table, but must for now since there currently is no other way to |
52 // pass down source position information to nodes created during | 52 // pass down source position information to nodes created during |
53 // lowering. Once this phase becomes a vanilla reducer, it should get source | 53 // lowering. Once this phase becomes a vanilla reducer, it should get source |
54 // position information via the SourcePositionWrapper like all other reducers. | 54 // position information via the SourcePositionWrapper like all other reducers. |
55 SourcePositionTable* source_positions_; | 55 SourcePositionTable* source_positions_; |
56 | 56 |
57 Node* SmiTag(Node* node); | |
58 Node* IsTagged(Node* node); | |
59 Node* Untag(Node* node); | |
60 Node* OffsetMinusTagConstant(int32_t offset); | |
61 Node* ComputeIndex(const ElementAccess& access, Node* const key); | 57 Node* ComputeIndex(const ElementAccess& access, Node* const key); |
62 Node* StringComparison(Node* node); | 58 Node* StringComparison(Node* node); |
63 Node* Int32Div(Node* const node); | 59 Node* Int32Div(Node* const node); |
64 Node* Int32Mod(Node* const node); | 60 Node* Int32Mod(Node* const node); |
65 Node* Uint32Div(Node* const node); | 61 Node* Uint32Div(Node* const node); |
66 Node* Uint32Mod(Node* const node); | 62 Node* Uint32Mod(Node* const node); |
67 | 63 |
68 friend class RepresentationSelector; | 64 friend class RepresentationSelector; |
69 | 65 |
70 Isolate* isolate() { return jsgraph_->isolate(); } | 66 Isolate* isolate() { return jsgraph_->isolate(); } |
71 Zone* zone() { return jsgraph_->zone(); } | 67 Zone* zone() { return jsgraph_->zone(); } |
72 JSGraph* jsgraph() { return jsgraph_; } | 68 JSGraph* jsgraph() { return jsgraph_; } |
73 Graph* graph() { return jsgraph()->graph(); } | 69 Graph* graph() { return jsgraph()->graph(); } |
74 CommonOperatorBuilder* common() { return jsgraph()->common(); } | 70 CommonOperatorBuilder* common() { return jsgraph()->common(); } |
75 MachineOperatorBuilder* machine() { return jsgraph()->machine(); } | 71 MachineOperatorBuilder* machine() { return jsgraph()->machine(); } |
76 }; | 72 }; |
77 | 73 |
78 } // namespace compiler | 74 } // namespace compiler |
79 } // namespace internal | 75 } // namespace internal |
80 } // namespace v8 | 76 } // namespace v8 |
81 | 77 |
82 #endif // V8_COMPILER_SIMPLIFIED_LOWERING_H_ | 78 #endif // V8_COMPILER_SIMPLIFIED_LOWERING_H_ |
OLD | NEW |