| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 // Rrdistribution and use in source and binary forms, with or without | 2 // Rrdistribution 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 // * Rrdistributions of source code must retain the above copyright | 6 // * Rrdistributions 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 // * Rrdistributions in binary form must reproduce the above | 8 // * Rrdistributions 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 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 50 &actual_size, | 50 &actual_size, |
| 51 true)); | 51 true)); |
| 52 CHECK(buffer); | 52 CHECK(buffer); |
| 53 HandleScope handles(isolate); | 53 HandleScope handles(isolate); |
| 54 MacroAssembler assm(isolate, buffer, static_cast<int>(actual_size)); | 54 MacroAssembler assm(isolate, buffer, static_cast<int>(actual_size)); |
| 55 int offset = | 55 int offset = |
| 56 source_reg.is(rsp) ? 0 : (HeapNumber::kValueOffset - kSmiTagSize); | 56 source_reg.is(rsp) ? 0 : (HeapNumber::kValueOffset - kSmiTagSize); |
| 57 DoubleToIStub stub(source_reg, destination_reg, offset, true); | 57 DoubleToIStub stub(source_reg, destination_reg, offset, true); |
| 58 byte* start = stub.GetCode(isolate)->instruction_start(); | 58 byte* start = stub.GetCode(isolate)->instruction_start(); |
| 59 | 59 |
| 60 __ push(rbx); | 60 __ pushq(rbx); |
| 61 __ push(rcx); | 61 __ pushq(rcx); |
| 62 __ push(rdx); | 62 __ pushq(rdx); |
| 63 __ push(rsi); | 63 __ pushq(rsi); |
| 64 __ push(rdi); | 64 __ pushq(rdi); |
| 65 | 65 |
| 66 if (!source_reg.is(rsp)) { | 66 if (!source_reg.is(rsp)) { |
| 67 // The argument we pass to the stub is not a heap number, but instead | 67 // The argument we pass to the stub is not a heap number, but instead |
| 68 // stack-allocated and offset-wise made to look like a heap number for | 68 // stack-allocated and offset-wise made to look like a heap number for |
| 69 // the stub. We create that "heap number" after pushing all allocatable | 69 // the stub. We create that "heap number" after pushing all allocatable |
| 70 // registers. | 70 // registers. |
| 71 int double_argument_slot = | 71 int double_argument_slot = |
| 72 (Register::NumAllocatableRegisters() - 1) * kPointerSize + kDoubleSize; | 72 (Register::NumAllocatableRegisters() - 1) * kPointerSize + kDoubleSize; |
| 73 __ lea(source_reg, MemOperand(rsp, -double_argument_slot - offset)); | 73 __ lea(source_reg, MemOperand(rsp, -double_argument_slot - offset)); |
| 74 } | 74 } |
| 75 | 75 |
| 76 // Save registers make sure they don't get clobbered. | 76 // Save registers make sure they don't get clobbered. |
| 77 int reg_num = 0; | 77 int reg_num = 0; |
| 78 for (;reg_num < Register::NumAllocatableRegisters(); ++reg_num) { | 78 for (;reg_num < Register::NumAllocatableRegisters(); ++reg_num) { |
| 79 Register reg = Register::FromAllocationIndex(reg_num); | 79 Register reg = Register::FromAllocationIndex(reg_num); |
| 80 if (!reg.is(rsp) && !reg.is(rbp) && !reg.is(destination_reg)) { | 80 if (!reg.is(rsp) && !reg.is(rbp) && !reg.is(destination_reg)) { |
| 81 __ push(reg); | 81 __ pushq(reg); |
| 82 } | 82 } |
| 83 } | 83 } |
| 84 | 84 |
| 85 // Put the double argument into the designated double argument slot. | 85 // Put the double argument into the designated double argument slot. |
| 86 __ subq(rsp, Immediate(kDoubleSize)); | 86 __ subq(rsp, Immediate(kDoubleSize)); |
| 87 __ movsd(MemOperand(rsp, 0), xmm0); | 87 __ movsd(MemOperand(rsp, 0), xmm0); |
| 88 | 88 |
| 89 // Call through to the actual stub | 89 // Call through to the actual stub |
| 90 __ Call(start, RelocInfo::EXTERNAL_REFERENCE); | 90 __ Call(start, RelocInfo::EXTERNAL_REFERENCE); |
| 91 | 91 |
| 92 __ addq(rsp, Immediate(kDoubleSize)); | 92 __ addq(rsp, Immediate(kDoubleSize)); |
| 93 | 93 |
| 94 // Make sure no registers have been unexpectedly clobbered | 94 // Make sure no registers have been unexpectedly clobbered |
| 95 for (--reg_num; reg_num >= 0; --reg_num) { | 95 for (--reg_num; reg_num >= 0; --reg_num) { |
| 96 Register reg = Register::FromAllocationIndex(reg_num); | 96 Register reg = Register::FromAllocationIndex(reg_num); |
| 97 if (!reg.is(rsp) && !reg.is(rbp) && !reg.is(destination_reg)) { | 97 if (!reg.is(rsp) && !reg.is(rbp) && !reg.is(destination_reg)) { |
| 98 __ cmpq(reg, MemOperand(rsp, 0)); | 98 __ cmpq(reg, MemOperand(rsp, 0)); |
| 99 __ Assert(equal, kRegisterWasClobbered); | 99 __ Assert(equal, kRegisterWasClobbered); |
| 100 __ addq(rsp, Immediate(kPointerSize)); | 100 __ addq(rsp, Immediate(kPointerSize)); |
| 101 } | 101 } |
| 102 } | 102 } |
| 103 | 103 |
| 104 __ movq(rax, destination_reg); | 104 __ movq(rax, destination_reg); |
| 105 | 105 |
| 106 __ pop(rdi); | 106 __ popq(rdi); |
| 107 __ pop(rsi); | 107 __ popq(rsi); |
| 108 __ pop(rdx); | 108 __ popq(rdx); |
| 109 __ pop(rcx); | 109 __ popq(rcx); |
| 110 __ pop(rbx); | 110 __ popq(rbx); |
| 111 | 111 |
| 112 __ ret(0); | 112 __ ret(0); |
| 113 | 113 |
| 114 CodeDesc desc; | 114 CodeDesc desc; |
| 115 assm.GetCode(&desc); | 115 assm.GetCode(&desc); |
| 116 return reinterpret_cast<ConvertDToIFunc>( | 116 return reinterpret_cast<ConvertDToIFunc>( |
| 117 reinterpret_cast<intptr_t>(buffer)); | 117 reinterpret_cast<intptr_t>(buffer)); |
| 118 } | 118 } |
| 119 | 119 |
| 120 #undef __ | 120 #undef __ |
| (...skipping 22 matching lines...) Expand all Loading... |
| 143 | 143 |
| 144 for (size_t s = 0; s < sizeof(source_registers) / sizeof(Register); s++) { | 144 for (size_t s = 0; s < sizeof(source_registers) / sizeof(Register); s++) { |
| 145 for (size_t d = 0; d < sizeof(dest_registers) / sizeof(Register); d++) { | 145 for (size_t d = 0; d < sizeof(dest_registers) / sizeof(Register); d++) { |
| 146 RunAllTruncationTests( | 146 RunAllTruncationTests( |
| 147 MakeConvertDToIFuncTrampoline(isolate, | 147 MakeConvertDToIFuncTrampoline(isolate, |
| 148 source_registers[s], | 148 source_registers[s], |
| 149 dest_registers[d])); | 149 dest_registers[d])); |
| 150 } | 150 } |
| 151 } | 151 } |
| 152 } | 152 } |
| OLD | NEW |