OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 #include "src/compiler/code-generator.h" | 5 #include "src/compiler/code-generator.h" |
6 | 6 |
7 #include "src/compiler/code-generator-impl.h" | 7 #include "src/compiler/code-generator-impl.h" |
8 #include "src/compiler/gap-resolver.h" | 8 #include "src/compiler/gap-resolver.h" |
9 #include "src/compiler/node-matchers.h" | 9 #include "src/compiler/node-matchers.h" |
10 #include "src/compiler/node-properties-inl.h" | 10 #include "src/compiler/node-properties-inl.h" |
(...skipping 633 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
644 | 644 |
645 // Assembles boolean materializations after this instruction. | 645 // Assembles boolean materializations after this instruction. |
646 void CodeGenerator::AssembleArchBoolean(Instruction* instr, | 646 void CodeGenerator::AssembleArchBoolean(Instruction* instr, |
647 FlagsCondition condition) { | 647 FlagsCondition condition) { |
648 X64OperandConverter i(this, instr); | 648 X64OperandConverter i(this, instr); |
649 Label done; | 649 Label done; |
650 | 650 |
651 // Materialize a full 64-bit 1 or 0 value. The result register is always the | 651 // Materialize a full 64-bit 1 or 0 value. The result register is always the |
652 // last output of the instruction. | 652 // last output of the instruction. |
653 Label check; | 653 Label check; |
654 DCHECK_NE(0, instr->OutputCount()); | 654 DCHECK_NE(0, static_cast<int>(instr->OutputCount())); |
655 Register reg = i.OutputRegister(static_cast<int>(instr->OutputCount() - 1)); | 655 Register reg = i.OutputRegister(static_cast<int>(instr->OutputCount() - 1)); |
656 Condition cc = no_condition; | 656 Condition cc = no_condition; |
657 switch (condition) { | 657 switch (condition) { |
658 case kUnorderedEqual: | 658 case kUnorderedEqual: |
659 __ j(parity_odd, &check, Label::kNear); | 659 __ j(parity_odd, &check, Label::kNear); |
660 __ movl(reg, Immediate(0)); | 660 __ movl(reg, Immediate(0)); |
661 __ jmp(&done, Label::kNear); | 661 __ jmp(&done, Label::kNear); |
662 // Fall through. | 662 // Fall through. |
663 case kEqual: | 663 case kEqual: |
664 cc = equal; | 664 cc = equal; |
(...skipping 324 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
989 } | 989 } |
990 } | 990 } |
991 MarkLazyDeoptSite(); | 991 MarkLazyDeoptSite(); |
992 } | 992 } |
993 | 993 |
994 #undef __ | 994 #undef __ |
995 | 995 |
996 } // namespace internal | 996 } // namespace internal |
997 } // namespace compiler | 997 } // namespace compiler |
998 } // namespace v8 | 998 } // namespace v8 |
OLD | NEW |