1 /* ix87 specific implementation of pow function.
2 Copyright (C) 1996-1999, 2001, 2004, 2007, 2011-2012
3 Free Software Foundation, Inc.
4 This file is part of the GNU C Library.
5 Contributed by Ulrich Drepper <drepper@cygnus.com>, 1996.
7 The GNU C Library is free software; you can redistribute it and/or
8 modify it under the terms of the GNU Lesser General Public
9 License as published by the Free Software Foundation; either
10 version 2.1 of the License, or (at your option) any later version.
12 The GNU C Library is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 Lesser General Public License for more details.
17 You should have received a copy of the GNU Lesser General Public
18 License along with the GNU C Library; if not, write to the Free
19 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
22 #include <machine/asm.h>
24 .section .rodata.cst8,"aM",@progbits,8
27 ASM_TYPE_DIRECTIVE(one,@object)
29 ASM_SIZE_DIRECTIVE(one)
30 ASM_TYPE_DIRECTIVE(limit,@object)
32 ASM_SIZE_DIRECTIVE(limit)
33 ASM_TYPE_DIRECTIVE(p63,@object)
34 p63: .byte 0, 0, 0, 0, 0, 0, 0xe0, 0x43
35 ASM_SIZE_DIRECTIVE(p63)
37 .section .rodata.cst16,"aM",@progbits,16
40 ASM_TYPE_DIRECTIVE(infinity,@object)
43 .byte 0, 0, 0, 0, 0, 0, 0xf0, 0x7f
44 ASM_SIZE_DIRECTIVE(infinity)
45 ASM_TYPE_DIRECTIVE(zero,@object)
47 ASM_SIZE_DIRECTIVE(zero)
48 ASM_TYPE_DIRECTIVE(minf_mzero,@object)
51 .byte 0, 0, 0, 0, 0, 0, 0xf0, 0xff
53 .byte 0, 0, 0, 0, 0, 0, 0, 0x80
54 ASM_SIZE_DIRECTIVE(minf_mzero)
57 # define MO(op) op##(%rip)
71 cmpb $0x40, %ah // is y == 0 ?
74 cmpb $0x05, %ah // is y == ±inf ?
77 cmpb $0x01, %ah // is y == NaN ?
94 /* fistpll raises invalid exception for |y| >= 1L<<63. */
95 fldl MO(p63) // 1L<<63 : y : x
96 fld %st(1) // y : 1L<<63 : y : x
97 fabs // |y| : 1L<<63 : y : x
98 fcomip %st(1), %st // 1L<<63 : y : x
102 /* First see whether `y' is a natural number. In this case we
103 can use a more precise algorithm. */
105 fistpll -8(%rsp) // y : x
106 fildll -8(%rsp) // int(y) : y : x
107 fucomip %st(1),%st // y : x
110 /* OK, we have an integer value for y. */
115 jns 4f // y >= 0, jump
116 fdivrl MO(one) // 1/x (now referred to as x)
120 4: fldl MO(one) // 1 : x
123 6: shrdl $1, %edx, %eax
126 fmul %st(1) // x : ST*x
128 5: fmul %st(0), %st // x*x : ST*x
137 30: fldt 8(%rsp) // x : y
138 fldl MO(one) // 1.0 : x : y
139 fucomip %st(1),%st // x : y
146 2: /* y is a real number. */
148 fldl MO(one) // 1.0 : x : y
149 fldl MO(limit) // 0.29 : 1.0 : x : y
150 fld %st(2) // x : 0.29 : 1.0 : x : y
151 fsub %st(2) // x-1 : 0.29 : 1.0 : x : y
152 fabs // |x-1| : 0.29 : 1.0 : x : y
153 fucompp // 1.0 : x : y
158 fsub %st(1) // x-1 : 1.0 : y
159 fyl2xp1 // log2(x) : y
162 7: fyl2x // log2(x) : y
163 8: fmul %st(1) // y*log2(x) : y
167 cmpb $0x05, %ah // is y*log2(x) == ±inf ?
169 fst %st(1) // y*log2(x) : y*log2(x)
170 frndint // int(y*log2(x)) : y*log2(x)
171 fsubr %st, %st(1) // int(y*log2(x)) : fract(y*log2(x))
172 fxch // fract(y*log2(x)) : int(y*log2(x))
173 f2xm1 // 2^fract(y*log2(x))-1 : int(y*log2(x))
174 faddl MO(one) // 2^fract(y*log2(x)) : int(y*log2(x))
175 fscale // 2^fract(y*log2(x))*2^int(y*log2(x)) : int(y*log2(x))
176 fstp %st(1) // 2^fract(y*log2(x))*2^int(y*log2(x))
179 28: fstp %st(1) // y*log2(x)
180 fldl MO(one) // 1 : y*log2(x)
181 fscale // 2^(y*log2(x)) : y*log2(x)
182 fstp %st(1) // 2^(y*log2(x))
187 11: fstp %st(0) // pop y
193 12: fstp %st(0) // pop y
195 fldt 8(%rsp) // x : 1
197 fucompp // < 1, == 1, or > 1
201 je 13f // jump if x is NaN
204 je 14f // jump if |x| == 1
210 lea inf_zero(%rip),%rcx
213 fldl inf_zero(,%rdx, 4)
222 13: fldt 8(%rsp) // load x == NaN
229 jz 16f // jump if x == +inf
231 // We must find out whether y is an odd integer.
233 fistpll -8(%rsp) // y
234 fildll -8(%rsp) // int(y) : y
236 ffreep %st // <empty>
239 // OK, the value is an integer, but is it odd?
243 jz 18f // jump if not odd
244 // It's an odd integer.
247 lea minf_mzero(%rip),%rcx
250 fldl minf_mzero(,%rdx, 8)
260 lea inf_zero(%rip),%rcx
263 fldl inf_zero(,%rax, 1)
268 17: shll $30, %edx // sign bit for y in right position
271 lea inf_zero(%rip),%rcx
274 fldl inf_zero(,%rdx, 8)
284 // x is ±0 and y is < 0. We must find out whether y is an odd integer.
289 fistpll -8(%rsp) // y
290 fildll -8(%rsp) // int(y) : y
292 ffreep %st // <empty>
295 // OK, the value is an integer, but is it odd?
299 jz 27f // jump if not odd
300 // It's an odd integer.
301 // Raise divide-by-zero exception and get minus infinity value.
309 27: // Raise divide-by-zero exception and get infinity value.
315 // x is ±0 and y is > 0. We must find out whether y is an odd integer.
320 fistpll -8(%rsp) // y
321 fildll -8(%rsp) // int(y) : y
323 ffreep %st // <empty>
326 // OK, the value is an integer, but is it odd?
330 jz 24f // jump if not odd
331 // It's an odd integer.
341 strong_alias (__ieee754_powl, __powl_finite)