| 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_INSTRUCTION_SELECTOR_H_ | 5 #ifndef V8_COMPILER_INSTRUCTION_SELECTOR_H_ |
| 6 #define V8_COMPILER_INSTRUCTION_SELECTOR_H_ | 6 #define V8_COMPILER_INSTRUCTION_SELECTOR_H_ |
| 7 | 7 |
| 8 #include <deque> | 8 #include <deque> |
| 9 | 9 |
| 10 #include "src/compiler/common-operator.h" | 10 #include "src/compiler/common-operator.h" |
| (...skipping 151 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 162 // code if necessary. | 162 // code if necessary. |
| 163 void VisitControl(BasicBlock* block); | 163 void VisitControl(BasicBlock* block); |
| 164 | 164 |
| 165 // Visit the node and generate code, if any. | 165 // Visit the node and generate code, if any. |
| 166 void VisitNode(Node* node); | 166 void VisitNode(Node* node); |
| 167 | 167 |
| 168 #define DECLARE_GENERATOR(x) void Visit##x(Node* node); | 168 #define DECLARE_GENERATOR(x) void Visit##x(Node* node); |
| 169 MACHINE_OP_LIST(DECLARE_GENERATOR) | 169 MACHINE_OP_LIST(DECLARE_GENERATOR) |
| 170 #undef DECLARE_GENERATOR | 170 #undef DECLARE_GENERATOR |
| 171 | 171 |
| 172 void VisitInt32AddWithOverflow(Node* node, FlagsContinuation* cont); | |
| 173 void VisitInt32SubWithOverflow(Node* node, FlagsContinuation* cont); | |
| 174 | |
| 175 void VisitWord32Test(Node* node, FlagsContinuation* cont); | |
| 176 void VisitWord64Test(Node* node, FlagsContinuation* cont); | |
| 177 void VisitWord32Compare(Node* node, FlagsContinuation* cont); | |
| 178 void VisitWord64Compare(Node* node, FlagsContinuation* cont); | |
| 179 void VisitFloat64Compare(Node* node, FlagsContinuation* cont); | |
| 180 | |
| 181 void VisitFinish(Node* node); | 172 void VisitFinish(Node* node); |
| 182 void VisitParameter(Node* node); | 173 void VisitParameter(Node* node); |
| 183 void VisitPhi(Node* node); | 174 void VisitPhi(Node* node); |
| 184 void VisitProjection(Node* node); | 175 void VisitProjection(Node* node); |
| 185 void VisitConstant(Node* node); | 176 void VisitConstant(Node* node); |
| 186 void VisitCall(Node* call, BasicBlock* continuation, | 177 void VisitCall(Node* call); |
| 187 BasicBlock* deoptimization); | |
| 188 void VisitGoto(BasicBlock* target); | 178 void VisitGoto(BasicBlock* target); |
| 189 void VisitBranch(Node* input, BasicBlock* tbranch, BasicBlock* fbranch); | 179 void VisitBranch(Node* input, BasicBlock* tbranch, BasicBlock* fbranch); |
| 190 void VisitReturn(Node* value); | 180 void VisitReturn(Node* value); |
| 191 void VisitThrow(Node* value); | 181 void VisitThrow(Node* value); |
| 192 void VisitDeoptimize(Node* deopt); | 182 void VisitDeoptimize(Node* deopt); |
| 193 | 183 |
| 194 // =========================================================================== | 184 // =========================================================================== |
| 195 | 185 |
| 196 Graph* graph() const { return sequence()->graph(); } | 186 Graph* graph() const { return sequence()->graph(); } |
| 197 Linkage* linkage() const { return sequence()->linkage(); } | 187 Linkage* linkage() const { return sequence()->linkage(); } |
| (...skipping 12 matching lines...) Expand all Loading... |
| 210 ZoneDeque<Instruction*> instructions_; | 200 ZoneDeque<Instruction*> instructions_; |
| 211 BoolVector defined_; | 201 BoolVector defined_; |
| 212 BoolVector used_; | 202 BoolVector used_; |
| 213 }; | 203 }; |
| 214 | 204 |
| 215 } // namespace compiler | 205 } // namespace compiler |
| 216 } // namespace internal | 206 } // namespace internal |
| 217 } // namespace v8 | 207 } // namespace v8 |
| 218 | 208 |
| 219 #endif // V8_COMPILER_INSTRUCTION_SELECTOR_H_ | 209 #endif // V8_COMPILER_INSTRUCTION_SELECTOR_H_ |
| OLD | NEW |