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_RAW_MACHINE_ASSEMBLER_H_ | 5 #ifndef V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ |
6 #define V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ | 6 #define V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ |
7 | 7 |
8 #include "src/assembler.h" | 8 #include "src/assembler.h" |
9 #include "src/compiler/common-operator.h" | 9 #include "src/compiler/common-operator.h" |
10 #include "src/compiler/graph.h" | 10 #include "src/compiler/graph.h" |
(...skipping 306 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
317 Node* Uint64GreaterThan(Node* a, Node* b) { return Uint64LessThan(b, a); } | 317 Node* Uint64GreaterThan(Node* a, Node* b) { return Uint64LessThan(b, a); } |
318 Node* Uint64GreaterThanOrEqual(Node* a, Node* b) { | 318 Node* Uint64GreaterThanOrEqual(Node* a, Node* b) { |
319 return Uint64LessThanOrEqual(b, a); | 319 return Uint64LessThanOrEqual(b, a); |
320 } | 320 } |
321 Node* Uint64Div(Node* a, Node* b) { | 321 Node* Uint64Div(Node* a, Node* b) { |
322 return AddNode(machine()->Uint64Div(), a, b); | 322 return AddNode(machine()->Uint64Div(), a, b); |
323 } | 323 } |
324 Node* Uint64Mod(Node* a, Node* b) { | 324 Node* Uint64Mod(Node* a, Node* b) { |
325 return AddNode(machine()->Uint64Mod(), a, b); | 325 return AddNode(machine()->Uint64Mod(), a, b); |
326 } | 326 } |
| 327 Node* Int32AddPair(Node* a_low, Node* a_high, Node* b_low, Node* b_high) { |
| 328 return AddNode(machine()->Int32AddPair(), a_low, a_high, b_low, b_high); |
| 329 } |
327 Node* Word32PairShl(Node* low_word, Node* high_word, Node* shift) { | 330 Node* Word32PairShl(Node* low_word, Node* high_word, Node* shift) { |
328 return AddNode(machine()->Word32PairShl(), low_word, high_word, shift); | 331 return AddNode(machine()->Word32PairShl(), low_word, high_word, shift); |
329 } | 332 } |
330 | 333 |
331 #define INTPTR_BINOP(prefix, name) \ | 334 #define INTPTR_BINOP(prefix, name) \ |
332 Node* IntPtr##name(Node* a, Node* b) { \ | 335 Node* IntPtr##name(Node* a, Node* b) { \ |
333 return kPointerSize == 8 ? prefix##64##name(a, b) \ | 336 return kPointerSize == 8 ? prefix##64##name(a, b) \ |
334 : prefix##32##name(a, b); \ | 337 : prefix##32##name(a, b); \ |
335 } | 338 } |
336 | 339 |
(...skipping 379 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
716 bool deferred_; | 719 bool deferred_; |
717 friend class RawMachineAssembler; | 720 friend class RawMachineAssembler; |
718 DISALLOW_COPY_AND_ASSIGN(RawMachineLabel); | 721 DISALLOW_COPY_AND_ASSIGN(RawMachineLabel); |
719 }; | 722 }; |
720 | 723 |
721 } // namespace compiler | 724 } // namespace compiler |
722 } // namespace internal | 725 } // namespace internal |
723 } // namespace v8 | 726 } // namespace v8 |
724 | 727 |
725 #endif // V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ | 728 #endif // V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ |
OLD | NEW |