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, see
19 <http://www.gnu.org/licenses/>. */
21 #include <machine/asm.h>
23 .section .rodata.cst8,"aM",@progbits,8
26 ASM_TYPE_DIRECTIVE(one,@object)
28 ASM_SIZE_DIRECTIVE(one)
29 ASM_TYPE_DIRECTIVE(limit,@object)
31 ASM_SIZE_DIRECTIVE(limit)
32 ASM_TYPE_DIRECTIVE(p63,@object)
33 p63: .byte 0, 0, 0, 0, 0, 0, 0xe0, 0x43
34 ASM_SIZE_DIRECTIVE(p63)
35 ASM_TYPE_DIRECTIVE(p64,@object)
36 p64: .byte 0, 0, 0, 0, 0, 0, 0xf0, 0x43
37 ASM_SIZE_DIRECTIVE(p64)
39 .section .rodata.cst16,"aM",@progbits,16
42 ASM_TYPE_DIRECTIVE(infinity,@object)
45 .byte 0, 0, 0, 0, 0, 0, 0xf0, 0x7f
46 ASM_SIZE_DIRECTIVE(infinity)
47 ASM_TYPE_DIRECTIVE(zero,@object)
49 ASM_SIZE_DIRECTIVE(zero)
50 ASM_TYPE_DIRECTIVE(minf_mzero,@object)
53 .byte 0, 0, 0, 0, 0, 0, 0xf0, 0xff
55 .byte 0, 0, 0, 0, 0, 0, 0, 0x80
56 ASM_SIZE_DIRECTIVE(minf_mzero)
59 # define MO(op) op##(%rip)
73 cmpb $0x40, %ah // is y == 0 ?
76 cmpb $0x05, %ah // is y == ±inf ?
79 cmpb $0x01, %ah // is y == NaN ?
96 /* fistpll raises invalid exception for |y| >= 1L<<63. */
97 fldl MO(p63) // 1L<<63 : y : x
98 fld %st(1) // y : 1L<<63 : y : x
99 fabs // |y| : 1L<<63 : y : x
100 fcomip %st(1), %st // 1L<<63 : y : x
104 /* First see whether `y' is a natural number. In this case we
105 can use a more precise algorithm. */
107 fistpll -8(%rsp) // y : x
108 fildll -8(%rsp) // int(y) : y : x
109 fucomip %st(1),%st // y : x
112 /* OK, we have an integer value for y. */
117 jns 4f // y >= 0, jump
118 fdivrl MO(one) // 1/x (now referred to as x)
122 4: fldl MO(one) // 1 : x
125 6: shrdl $1, %edx, %eax
128 fmul %st(1) // x : ST*x
130 5: fmul %st(0), %st // x*x : ST*x
139 30: fldt 8(%rsp) // x : y
140 fldl MO(one) // 1.0 : x : y
141 fucomip %st(1),%st // x : y
148 2: /* y is a real number. */
150 fldl MO(one) // 1.0 : x : y
151 fldl MO(limit) // 0.29 : 1.0 : x : y
152 fld %st(2) // x : 0.29 : 1.0 : x : y
153 fsub %st(2) // x-1 : 0.29 : 1.0 : x : y
154 fabs // |x-1| : 0.29 : 1.0 : x : y
155 fucompp // 1.0 : x : y
160 fsub %st(1) // x-1 : 1.0 : y
161 fyl2xp1 // log2(x) : y
164 7: fyl2x // log2(x) : y
165 8: fmul %st(1) // y*log2(x) : y
169 cmpb $0x05, %ah // is y*log2(x) == ±inf ?
171 fst %st(1) // y*log2(x) : y*log2(x)
172 frndint // int(y*log2(x)) : y*log2(x)
173 fsubr %st, %st(1) // int(y*log2(x)) : fract(y*log2(x))
174 fxch // fract(y*log2(x)) : int(y*log2(x))
175 f2xm1 // 2^fract(y*log2(x))-1 : int(y*log2(x))
176 faddl MO(one) // 2^fract(y*log2(x)) : int(y*log2(x))
177 fscale // 2^fract(y*log2(x))*2^int(y*log2(x)) : int(y*log2(x))
178 fstp %st(1) // 2^fract(y*log2(x))*2^int(y*log2(x))
181 28: fstp %st(1) // y*log2(x)
182 fldl MO(one) // 1 : y*log2(x)
183 fscale // 2^(y*log2(x)) : y*log2(x)
184 fstp %st(1) // 2^(y*log2(x))
189 11: fstp %st(0) // pop y
195 12: fstp %st(0) // pop y
197 fldt 8(%rsp) // x : 1
199 fucompp // < 1, == 1, or > 1
203 je 13f // jump if x is NaN
206 je 14f // jump if |x| == 1
212 lea inf_zero(%rip),%rcx
215 fldl inf_zero(,%rdx, 4)
224 13: fldt 8(%rsp) // load x == NaN
231 jz 16f // jump if x == +inf
233 // fistpll raises invalid exception for |y| >= 1L<<63, but y
234 // may be odd unless we know |y| >= 1L<<64.
235 fldl MO(p64) // 1L<<64 : y
236 fld %st(1) // y : 1L<<64 : y
237 fabs // |y| : 1L<<64 : y
238 fcomip %st(1), %st // 1L<<64 : y
241 fldl MO(p63) // p63 : y
246 // We must find out whether y is an odd integer.
248 fistpll -8(%rsp) // y
249 fildll -8(%rsp) // int(y) : y
251 ffreep %st // <empty>
254 // OK, the value is an integer, but is it odd?
258 jz 18f // jump if not odd
259 // It's an odd integer.
262 lea minf_mzero(%rip),%rcx
265 fldl minf_mzero(,%rdx, 8)
275 lea inf_zero(%rip),%rcx
278 fldl inf_zero(,%rax, 1)
283 17: shll $30, %edx // sign bit for y in right position
286 lea inf_zero(%rip),%rcx
289 fldl inf_zero(,%rdx, 8)
299 // x is ±0 and y is < 0. We must find out whether y is an odd integer.
303 // fistpll raises invalid exception for |y| >= 1L<<63, but y
304 // may be odd unless we know |y| >= 1L<<64.
305 fldl MO(p64) // 1L<<64 : y
306 fld %st(1) // y : 1L<<64 : y
307 fabs // |y| : 1L<<64 : y
308 fcomip %st(1), %st // 1L<<64 : y
311 fldl MO(p63) // p63 : y
317 fistpll -8(%rsp) // y
318 fildll -8(%rsp) // int(y) : y
320 ffreep %st // <empty>
323 // OK, the value is an integer, but is it odd?
327 jz 27f // jump if not odd
328 // It's an odd integer.
329 // Raise divide-by-zero exception and get minus infinity value.
337 27: // Raise divide-by-zero exception and get infinity value.
343 // x is ±0 and y is > 0. We must find out whether y is an odd integer.
347 // fistpll raises invalid exception for |y| >= 1L<<63, but y
348 // may be odd unless we know |y| >= 1L<<64.
349 fldl MO(p64) // 1L<<64 : y
351 fcomi %st(1), %st // y : 1L<<64
354 fldl MO(p63) // p63 : y
360 fistpll -8(%rsp) // y
361 fildll -8(%rsp) // int(y) : y
363 ffreep %st // <empty>
366 // OK, the value is an integer, but is it odd?
370 jz 24f // jump if not odd
371 // It's an odd integer.
381 strong_alias (__ieee754_powl, __powl_finite)