1 /* Math functions for i387.
2 Copyright (C) 1995, 1996, 1997 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Contributed by John C. Bowman <bowman@ipp-garching.mpg.de>, 1995.
6 The GNU C Library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Library General Public License as
8 published by the Free Software Foundation; either version 2 of the
9 License, or (at your option) any later version.
11 The GNU C Library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Library General Public License for more details.
16 You should have received a copy of the GNU Library General Public
17 License along with the GNU C Library; see the file COPYING.LIB. If not,
18 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
24 double atan (double __x);
25 double atan2 (double __y, double __x);
26 double ceil (double __x);
27 double cos (double __x);
28 double fabs (double __x);
29 double floor (double __x);
30 long _ftol (double fl);
31 double log (double __x);
32 double __log2 (double __x);
33 double pow (double __x, double __y);
34 double sin (double __x);
35 double sqrt (double __x);
36 double tan (double __x);
37 div_t div(int num, int denom);
38 int mod(int num, int denom);
40 double atan (double __x)
42 register double __value;
46 : "=t" (__value) : "0" (__x));
51 double atan2 (double __y, double __x)
53 register double __value;
57 : "=t" (__value) : "0" (__x), "u" (__y));
62 double ceil (double __x)
64 register double __value;
65 __volatile unsigned short int __cw, __cwtmp;
67 __asm __volatile ("fnstcw %0" : "=m" (__cw));
68 __cwtmp = (__cw & 0xf3ff) | 0x0800; /* rounding up */
69 __asm __volatile ("fldcw %0" : : "m" (__cwtmp));
70 __asm __volatile ("frndint" : "=t" (__value) : "0" (__x));
71 __asm __volatile ("fldcw %0" : : "m" (__cw));
76 double cos (double __x)
78 register double __value;
81 : "=t" (__value): "0" (__x));
86 double fabs (double __x)
88 register double __value;
91 : "=t" (__value) : "0" (__x));
96 double floor (double __x)
98 register double __value;
99 __volatile unsigned short int __cw, __cwtmp;
101 __asm __volatile ("fnstcw %0" : "=m" (__cw));
102 __cwtmp = (__cw & 0xf3ff) | 0x0400; /* rounding down */
103 __asm __volatile ("fldcw %0" : : "m" (__cwtmp));
104 __asm __volatile ("frndint" : "=t" (__value) : "0" (__x));
105 __asm __volatile ("fldcw %0" : : "m" (__cw));
110 long _ftol (double fl)
115 double log (double __x)
117 register double __value;
122 : "=t" (__value) : "0" (__x));
127 double __log2 (double __x)
129 register double __value;
134 : "=t" (__value) : "0" (__x));
139 double pow (double __x, double __y)
141 register double __value, __exponent;
142 long __p = (long) __y;
144 if (__x == 0.0 && __y > 0.0)
146 if (__y == (double) __p)
168 ("fmul %%st(1) # y * log2(x)\n\t"
170 "frndint # int(y * log2(x))\n\t"
172 "fsub %%st(1) # fract(y * log2(x))\n\t"
173 "f2xm1 # 2^(fract(y * log2(x))) - 1\n\t"
174 : "=t" (__value), "=u" (__exponent) : "0" (__log2 (__x)), "1" (__y));
178 : "=t" (__value) : "0" (__value), "u" (__exponent));
183 double sin (double __x)
185 register double __value;
188 : "=t" (__value) : "0" (__x));
193 double sqrt (double __x)
195 register double __value;
198 : "=t" (__value) : "0" (__x));
203 double tan (double __x)
205 register double __value;
206 register double __value2 __attribute__ ((unused));
209 : "=t" (__value2), "=u" (__value) : "0" (__x));
214 div_t div(int num, int denom)
217 if (num > 0 && denom < 0) {
221 r.quot = num / denom;
223 if (num < 0 && denom > 0)
234 int mod(int num, int denom)
236 div_t dvt = div(num, denom);
240 //FIXME! Is there a better algorithm. like FT_MulDiv
241 INT STDCALL EngMulDiv(
246 #if SIZEOF_LONG_LONG >= 8
249 if (!nDivisor) return -1;
251 /* We want to deal with a positive divisor to simplify the logic. */
254 nMultiplicand = - nMultiplicand;
255 nDivisor = -nDivisor;
258 /* If the result is positive, we "add" to round. else, we subtract to round. */
259 if ( ( (nMultiplicand < 0) && (nMultiplier < 0) ) ||
260 ( (nMultiplicand >= 0) && (nMultiplier >= 0) ) )
261 ret = (((long long)nMultiplicand * nMultiplier) + (nDivisor/2)) / nDivisor;
263 ret = (((long long)nMultiplicand * nMultiplier) - (nDivisor/2)) / nDivisor;
265 if ((ret > 2147483647) || (ret < -2147483647)) return -1;
268 if (!nDivisor) return -1;
270 /* We want to deal with a positive divisor to simplify the logic. */
273 nMultiplicand = - nMultiplicand;
274 nDivisor = -nDivisor;
277 /* If the result is positive, we "add" to round. else, we subtract to round. */
278 if ( ( (nMultiplicand < 0) && (nMultiplier < 0) ) ||
279 ( (nMultiplicand >= 0) && (nMultiplier >= 0) ) )
280 return ((nMultiplicand * nMultiplier) + (nDivisor/2)) / nDivisor;
282 return ((nMultiplicand * nMultiplier) - (nDivisor/2)) / nDivisor;