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