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 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
67 // stack-allocated and offset-wise made to look like a heap number for | 67 // stack-allocated and offset-wise made to look like a heap number for |
68 // the stub. We create that "heap number" after pushing all allocatable | 68 // the stub. We create that "heap number" after pushing all allocatable |
69 // registers. | 69 // registers. |
70 int double_argument_slot = | 70 int double_argument_slot = |
71 (Register::NumAllocatableRegisters() - 1) * kPointerSize + kDoubleSize; | 71 (Register::NumAllocatableRegisters() - 1) * kPointerSize + kDoubleSize; |
72 __ leaq(source_reg, MemOperand(rsp, -double_argument_slot - offset)); | 72 __ leaq(source_reg, MemOperand(rsp, -double_argument_slot - offset)); |
73 } | 73 } |
74 | 74 |
75 // Save registers make sure they don't get clobbered. | 75 // Save registers make sure they don't get clobbered. |
76 int reg_num = 0; | 76 int reg_num = 0; |
77 for (;reg_num < Register::NumAllocatableRegisters(); ++reg_num) { | 77 for (; reg_num < Register::NumAllocatableRegisters(); ++reg_num) { |
78 Register reg = Register::FromAllocationIndex(reg_num); | 78 Register reg = Register::FromAllocationIndex(reg_num); |
79 if (!reg.is(rsp) && !reg.is(rbp) && !reg.is(destination_reg)) { | 79 if (!reg.is(rsp) && !reg.is(rbp) && !reg.is(destination_reg)) { |
80 __ pushq(reg); | 80 __ pushq(reg); |
81 } | 81 } |
82 } | 82 } |
83 | 83 |
84 // Put the double argument into the designated double argument slot. | 84 // Put the double argument into the designated double argument slot. |
85 __ subq(rsp, Immediate(kDoubleSize)); | 85 __ subq(rsp, Immediate(kDoubleSize)); |
86 __ movsd(MemOperand(rsp, 0), xmm0); | 86 __ movsd(MemOperand(rsp, 0), xmm0); |
87 | 87 |
(...skipping 54 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
142 | 142 |
143 for (size_t s = 0; s < sizeof(source_registers) / sizeof(Register); s++) { | 143 for (size_t s = 0; s < sizeof(source_registers) / sizeof(Register); s++) { |
144 for (size_t d = 0; d < sizeof(dest_registers) / sizeof(Register); d++) { | 144 for (size_t d = 0; d < sizeof(dest_registers) / sizeof(Register); d++) { |
145 RunAllTruncationTests( | 145 RunAllTruncationTests( |
146 MakeConvertDToIFuncTrampoline(isolate, | 146 MakeConvertDToIFuncTrampoline(isolate, |
147 source_registers[s], | 147 source_registers[s], |
148 dest_registers[d])); | 148 dest_registers[d])); |
149 } | 149 } |
150 } | 150 } |
151 } | 151 } |
OLD | NEW |