OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 2595 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2606 void LCodeGen::DoMathLog(LUnaryMathOperation* instr) { | 2606 void LCodeGen::DoMathLog(LUnaryMathOperation* instr) { |
2607 ASSERT(ToDoubleRegister(instr->result()).is(xmm1)); | 2607 ASSERT(ToDoubleRegister(instr->result()).is(xmm1)); |
2608 TranscendentalCacheStub stub(TranscendentalCache::LOG, | 2608 TranscendentalCacheStub stub(TranscendentalCache::LOG, |
2609 TranscendentalCacheStub::UNTAGGED); | 2609 TranscendentalCacheStub::UNTAGGED); |
2610 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); | 2610 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); |
2611 } | 2611 } |
2612 | 2612 |
2613 | 2613 |
2614 void LCodeGen::DoMathCos(LUnaryMathOperation* instr) { | 2614 void LCodeGen::DoMathCos(LUnaryMathOperation* instr) { |
2615 ASSERT(ToDoubleRegister(instr->result()).is(xmm1)); | 2615 ASSERT(ToDoubleRegister(instr->result()).is(xmm1)); |
2616 TranscendentalCacheStub stub(TranscendentalCache::LOG, | 2616 TranscendentalCacheStub stub(TranscendentalCache::COS, |
2617 TranscendentalCacheStub::UNTAGGED); | 2617 TranscendentalCacheStub::UNTAGGED); |
2618 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); | 2618 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); |
2619 } | 2619 } |
2620 | 2620 |
2621 | 2621 |
2622 void LCodeGen::DoMathSin(LUnaryMathOperation* instr) { | 2622 void LCodeGen::DoMathSin(LUnaryMathOperation* instr) { |
2623 ASSERT(ToDoubleRegister(instr->result()).is(xmm1)); | 2623 ASSERT(ToDoubleRegister(instr->result()).is(xmm1)); |
2624 TranscendentalCacheStub stub(TranscendentalCache::LOG, | 2624 TranscendentalCacheStub stub(TranscendentalCache::SIN, |
2625 TranscendentalCacheStub::UNTAGGED); | 2625 TranscendentalCacheStub::UNTAGGED); |
2626 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); | 2626 CallCode(stub.GetCode(), RelocInfo::CODE_TARGET, instr); |
2627 } | 2627 } |
2628 | 2628 |
2629 | 2629 |
2630 void LCodeGen::DoUnaryMathOperation(LUnaryMathOperation* instr) { | 2630 void LCodeGen::DoUnaryMathOperation(LUnaryMathOperation* instr) { |
2631 switch (instr->op()) { | 2631 switch (instr->op()) { |
2632 case kMathAbs: | 2632 case kMathAbs: |
2633 DoMathAbs(instr); | 2633 DoMathAbs(instr); |
2634 break; | 2634 break; |
(...skipping 1056 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3691 RegisterEnvironmentForDeoptimization(environment); | 3691 RegisterEnvironmentForDeoptimization(environment); |
3692 ASSERT(osr_pc_offset_ == -1); | 3692 ASSERT(osr_pc_offset_ == -1); |
3693 osr_pc_offset_ = masm()->pc_offset(); | 3693 osr_pc_offset_ = masm()->pc_offset(); |
3694 } | 3694 } |
3695 | 3695 |
3696 #undef __ | 3696 #undef __ |
3697 | 3697 |
3698 } } // namespace v8::internal | 3698 } } // namespace v8::internal |
3699 | 3699 |
3700 #endif // V8_TARGET_ARCH_X64 | 3700 #endif // V8_TARGET_ARCH_X64 |
OLD | NEW |