OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 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_CODE_ASSEMBLER_H_ | 5 #ifndef V8_COMPILER_CODE_ASSEMBLER_H_ |
6 #define V8_COMPILER_CODE_ASSEMBLER_H_ | 6 #define V8_COMPILER_CODE_ASSEMBLER_H_ |
7 | 7 |
8 #include <map> | 8 #include <map> |
9 | 9 |
10 // Clients of this interface shouldn't depend on lots of compiler internals. | 10 // Clients of this interface shouldn't depend on lots of compiler internals. |
(...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
45 V(Float64LessThan) \ | 45 V(Float64LessThan) \ |
46 V(Float64LessThanOrEqual) \ | 46 V(Float64LessThanOrEqual) \ |
47 V(Float64GreaterThan) \ | 47 V(Float64GreaterThan) \ |
48 V(Float64GreaterThanOrEqual) \ | 48 V(Float64GreaterThanOrEqual) \ |
49 V(Int32GreaterThan) \ | 49 V(Int32GreaterThan) \ |
50 V(Int32GreaterThanOrEqual) \ | 50 V(Int32GreaterThanOrEqual) \ |
51 V(Int32LessThan) \ | 51 V(Int32LessThan) \ |
52 V(Int32LessThanOrEqual) \ | 52 V(Int32LessThanOrEqual) \ |
53 V(IntPtrLessThan) \ | 53 V(IntPtrLessThan) \ |
54 V(IntPtrLessThanOrEqual) \ | 54 V(IntPtrLessThanOrEqual) \ |
| 55 V(IntPtrGreaterThan) \ |
| 56 V(IntPtrGreaterThanOrEqual) \ |
55 V(IntPtrEqual) \ | 57 V(IntPtrEqual) \ |
56 V(Uint32LessThan) \ | 58 V(Uint32LessThan) \ |
57 V(UintPtrGreaterThanOrEqual) \ | 59 V(UintPtrGreaterThanOrEqual) \ |
58 V(WordEqual) \ | 60 V(WordEqual) \ |
59 V(WordNotEqual) \ | 61 V(WordNotEqual) \ |
60 V(Word32Equal) \ | 62 V(Word32Equal) \ |
61 V(Word32NotEqual) \ | 63 V(Word32NotEqual) \ |
62 V(Word64Equal) \ | 64 V(Word64Equal) \ |
63 V(Word64NotEqual) | 65 V(Word64NotEqual) |
64 | 66 |
(...skipping 165 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
230 Node* StoreNoWriteBarrier(MachineRepresentation rep, Node* base, Node* value); | 232 Node* StoreNoWriteBarrier(MachineRepresentation rep, Node* base, Node* value); |
231 Node* StoreNoWriteBarrier(MachineRepresentation rep, Node* base, Node* index, | 233 Node* StoreNoWriteBarrier(MachineRepresentation rep, Node* base, Node* index, |
232 Node* value); | 234 Node* value); |
233 | 235 |
234 // Basic arithmetic operations. | 236 // Basic arithmetic operations. |
235 #define DECLARE_CODE_ASSEMBLER_BINARY_OP(name) Node* name(Node* a, Node* b); | 237 #define DECLARE_CODE_ASSEMBLER_BINARY_OP(name) Node* name(Node* a, Node* b); |
236 CODE_ASSEMBLER_BINARY_OP_LIST(DECLARE_CODE_ASSEMBLER_BINARY_OP) | 238 CODE_ASSEMBLER_BINARY_OP_LIST(DECLARE_CODE_ASSEMBLER_BINARY_OP) |
237 #undef DECLARE_CODE_ASSEMBLER_BINARY_OP | 239 #undef DECLARE_CODE_ASSEMBLER_BINARY_OP |
238 | 240 |
239 Node* WordShl(Node* value, int shift); | 241 Node* WordShl(Node* value, int shift); |
| 242 Node* WordShr(Node* value, int shift); |
240 | 243 |
241 // Unary | 244 // Unary |
242 #define DECLARE_CODE_ASSEMBLER_UNARY_OP(name) Node* name(Node* a); | 245 #define DECLARE_CODE_ASSEMBLER_UNARY_OP(name) Node* name(Node* a); |
243 CODE_ASSEMBLER_UNARY_OP_LIST(DECLARE_CODE_ASSEMBLER_UNARY_OP) | 246 CODE_ASSEMBLER_UNARY_OP_LIST(DECLARE_CODE_ASSEMBLER_UNARY_OP) |
244 #undef DECLARE_CODE_ASSEMBLER_UNARY_OP | 247 #undef DECLARE_CODE_ASSEMBLER_UNARY_OP |
245 | 248 |
246 // No-op on 32-bit, otherwise zero extend. | 249 // No-op on 32-bit, otherwise zero extend. |
247 Node* ChangeUint32ToWord(Node* value); | 250 Node* ChangeUint32ToWord(Node* value); |
248 // No-op on 32-bit, otherwise sign extend. | 251 // No-op on 32-bit, otherwise sign extend. |
249 Node* ChangeInt32ToIntPtr(Node* value); | 252 Node* ChangeInt32ToIntPtr(Node* value); |
(...skipping 135 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
385 // Map of variables to the list of value nodes that have been added from each | 388 // Map of variables to the list of value nodes that have been added from each |
386 // merge path in their order of merging. | 389 // merge path in their order of merging. |
387 std::map<Variable::Impl*, std::vector<Node*>> variable_merges_; | 390 std::map<Variable::Impl*, std::vector<Node*>> variable_merges_; |
388 }; | 391 }; |
389 | 392 |
390 } // namespace compiler | 393 } // namespace compiler |
391 } // namespace internal | 394 } // namespace internal |
392 } // namespace v8 | 395 } // namespace v8 |
393 | 396 |
394 #endif // V8_COMPILER_CODE_ASSEMBLER_H_ | 397 #endif // V8_COMPILER_CODE_ASSEMBLER_H_ |
OLD | NEW |