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/compiler/common-operator.h" | 8 #include "src/compiler/common-operator.h" |
9 #include "src/compiler/graph-builder.h" | 9 #include "src/compiler/graph-builder.h" |
10 #include "src/compiler/linkage.h" | 10 #include "src/compiler/linkage.h" |
(...skipping 267 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
278 Node* Int64Div(Node* a, Node* b) { | 278 Node* Int64Div(Node* a, Node* b) { |
279 return NewNode(machine()->Int64Div(), a, b); | 279 return NewNode(machine()->Int64Div(), a, b); |
280 } | 280 } |
281 Node* Int64Mod(Node* a, Node* b) { | 281 Node* Int64Mod(Node* a, Node* b) { |
282 return NewNode(machine()->Int64Mod(), a, b); | 282 return NewNode(machine()->Int64Mod(), a, b); |
283 } | 283 } |
284 Node* Int64Neg(Node* a) { return Int64Sub(Int64Constant(0), a); } | 284 Node* Int64Neg(Node* a) { return Int64Sub(Int64Constant(0), a); } |
285 Node* Int64LessThan(Node* a, Node* b) { | 285 Node* Int64LessThan(Node* a, Node* b) { |
286 return NewNode(machine()->Int64LessThan(), a, b); | 286 return NewNode(machine()->Int64LessThan(), a, b); |
287 } | 287 } |
| 288 Node* Int64LessThanOrEqual(Node* a, Node* b) { |
| 289 return NewNode(machine()->Int64LessThanOrEqual(), a, b); |
| 290 } |
288 Node* Uint64LessThan(Node* a, Node* b) { | 291 Node* Uint64LessThan(Node* a, Node* b) { |
289 return NewNode(machine()->Uint64LessThan(), a, b); | 292 return NewNode(machine()->Uint64LessThan(), a, b); |
290 } | 293 } |
291 Node* Int64LessThanOrEqual(Node* a, Node* b) { | 294 Node* Uint64LessThanOrEqual(Node* a, Node* b) { |
292 return NewNode(machine()->Int64LessThanOrEqual(), a, b); | 295 return NewNode(machine()->Uint64LessThanOrEqual(), a, b); |
293 } | 296 } |
294 Node* Int64GreaterThan(Node* a, Node* b) { return Int64LessThan(b, a); } | 297 Node* Int64GreaterThan(Node* a, Node* b) { return Int64LessThan(b, a); } |
295 Node* Int64GreaterThanOrEqual(Node* a, Node* b) { | 298 Node* Int64GreaterThanOrEqual(Node* a, Node* b) { |
296 return Int64LessThanOrEqual(b, a); | 299 return Int64LessThanOrEqual(b, a); |
297 } | 300 } |
298 Node* Uint64Div(Node* a, Node* b) { | 301 Node* Uint64Div(Node* a, Node* b) { |
299 return NewNode(machine()->Uint64Div(), a, b); | 302 return NewNode(machine()->Uint64Div(), a, b); |
300 } | 303 } |
301 Node* Uint64Mod(Node* a, Node* b) { | 304 Node* Uint64Mod(Node* a, Node* b) { |
302 return NewNode(machine()->Uint64Mod(), a, b); | 305 return NewNode(machine()->Uint64Mod(), a, b); |
(...skipping 228 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
531 BasicBlock* current_block_; | 534 BasicBlock* current_block_; |
532 | 535 |
533 DISALLOW_COPY_AND_ASSIGN(RawMachineAssembler); | 536 DISALLOW_COPY_AND_ASSIGN(RawMachineAssembler); |
534 }; | 537 }; |
535 | 538 |
536 } // namespace compiler | 539 } // namespace compiler |
537 } // namespace internal | 540 } // namespace internal |
538 } // namespace v8 | 541 } // namespace v8 |
539 | 542 |
540 #endif // V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ | 543 #endif // V8_COMPILER_RAW_MACHINE_ASSEMBLER_H_ |
OLD | NEW |