1 /* origin: FreeBSD /usr/src/lib/msun/src/e_fmodl.c */
3 * ====================================================
4 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
6 * Developed at SunSoft, a Sun Microsystems, Inc. business.
7 * Permission to use, copy, modify, and distribute this
8 * software is freely granted, provided that this notice
10 * ====================================================
15 #if LDBL_MANT_DIG == 53 && LDBL_MAX_EXP == 1024
16 long double fmodl(long double x, long double y)
20 #elif (LDBL_MANT_DIG == 64 || LDBL_MANT_DIG == 113) && LDBL_MAX_EXP == 16384
22 #define BIAS (LDBL_MAX_EXP - 1)
24 #if LDBL_MANL_SIZE > 32
25 typedef uint64_t manl_t;
27 typedef uint32_t manl_t;
30 #if LDBL_MANH_SIZE > 32
31 typedef uint64_t manh_t;
33 typedef uint32_t manh_t;
37 * These macros add and remove an explicit integer bit in front of the
38 * fractional mantissa, if the architecture doesn't have such a bit by
41 #ifdef LDBL_IMPLICIT_NBIT
42 #define SET_NBIT(hx) ((hx) | (1ULL << LDBL_MANH_SIZE))
43 #define HFRAC_BITS LDBL_MANH_SIZE
45 #define SET_NBIT(hx) (hx)
46 #define HFRAC_BITS (LDBL_MANH_SIZE - 1)
49 #define MANL_SHIFT (LDBL_MANL_SIZE - 1)
51 static const long double Zero[] = {0.0, -0.0,};
55 * Return x mod y in exact arithmetic
56 * Method: shift and subtract
59 * - The low part of the mantissa fits in a manl_t exactly.
60 * - The high part of the mantissa fits in an int64_t with enough room
61 * for an explicit integer bit in front of the fractional bits.
63 long double fmodl(long double x, long double y)
65 union IEEEl2bits ux, uy;
66 int64_t hx,hz; /* We need a carry bit even if LDBL_MANH_SIZE is 32. */
75 /* purge off exception values */
76 if ((uy.bits.exp|uy.bits.manh|uy.bits.manl) == 0 || /* y=0 */
77 ux.bits.exp == BIAS + LDBL_MAX_EXP || /* or x not finite */
78 (uy.bits.exp == BIAS + LDBL_MAX_EXP &&
79 ((uy.bits.manh&~LDBL_NBIT)|uy.bits.manl) != 0)) /* or y is NaN */
81 if (ux.bits.exp <= uy.bits.exp) {
82 if (ux.bits.exp < uy.bits.exp ||
83 (ux.bits.manh<=uy.bits.manh &&
84 (ux.bits.manh<uy.bits.manh ||
85 ux.bits.manl<uy.bits.manl))) /* |x|<|y| return x or x-y */
87 if (ux.bits.manh==uy.bits.manh && ux.bits.manl==uy.bits.manl)
88 return Zero[sx]; /* |x| = |y| return x*0 */
91 /* determine ix = ilogb(x) */
92 if (ux.bits.exp == 0) { /* subnormal x */
94 ix = ux.bits.exp - (BIAS + 512);
96 ix = ux.bits.exp - BIAS;
99 /* determine iy = ilogb(y) */
100 if (uy.bits.exp == 0) { /* subnormal y */
102 iy = uy.bits.exp - (BIAS + 512);
104 iy = uy.bits.exp - BIAS;
107 /* set up {hx,lx}, {hy,ly} and align y to x */
108 hx = SET_NBIT(ux.bits.manh);
109 hy = SET_NBIT(uy.bits.manh);
122 hx = hx+hx+(lx>>MANL_SHIFT);
125 if ((hz|lz)==0) /* return sign(x)*0 */
127 hx = hz+hz+(lz>>MANL_SHIFT);
140 /* convert back to floating value and restore the sign */
141 if ((hx|lx) == 0) /* return sign(x)*0 */
143 while (hx < (1ULL<<HFRAC_BITS)) { /* normalize x */
144 hx = hx+hx+(lx>>MANL_SHIFT);
148 ux.bits.manh = hx; /* The mantissa is truncated here if needed. */
150 if (iy < LDBL_MIN_EXP) {
151 ux.bits.exp = iy + (BIAS + 512);
154 ux.bits.exp = iy + BIAS;
156 return ux.e; /* exact output */