Coverage Report

Created: 2026-01-10 06:30

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/moddable/xs/tools/fdlibm/e_fmod.c
Line
Count
Source
1
2
/*
3
 * ====================================================
4
 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
5
 *
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 
9
 * is preserved.
10
 * ====================================================
11
 */
12
13
/* 
14
 * __ieee754_fmod(x,y)
15
 * Return x mod y in exact arithmetic
16
 * Method: shift and subtract
17
 */
18
19
#include <float.h>
20
21
#include "math.h"
22
#include "math_private.h"
23
24
static const double one = 1.0, Zero[] = {0.0, -0.0,};
25
26
double
27
__ieee754_fmod(double x, double y)
28
12.8M
{
29
12.8M
  int32_t hx, hy, hz, ix, iy, n, sx;
30
12.8M
  u_int32_t lx, ly, lz;
31
32
12.8M
  EXTRACT_WORDS(hx,lx,x);
33
12.8M
  EXTRACT_WORDS(hy,ly,y);
34
12.8M
  sx = hx&0x80000000;   /* sign of x */
35
12.8M
  hx ^= sx;     /* |x| */
36
12.8M
  hy &= 0x7fffffff;   /* |y| */
37
38
    /* purge off exception values */
39
12.8M
  if((hy|ly)==0||(hx>=0x7ff00000)||  /* y=0,or x not finite */
40
11.5M
    ((hy|((ly|-ly)>>31))>0x7ff00000))  /* or y is NaN */
41
1.31M
      return nan_mix_op(x, y, *)/nan_mix_op(x, y, *);
42
11.5M
  if(hx<=hy) {
43
4.24M
      if((hx<hy)||(lx<ly)) return x;  /* |x|<|y| return x */
44
212k
      if(lx==ly) 
45
106k
    return Zero[(u_int32_t)sx>>31]; /* |x|=|y| return x*0*/
46
212k
  }
47
48
    /* determine ix = ilogb(x) */
49
7.44M
  if(hx<0x00100000)
50
0
      ix = subnormal_ilogb(hx, lx);
51
7.44M
  else
52
7.44M
      ix = (hx>>20)-1023;
53
54
    /* determine iy = ilogb(y) */
55
7.44M
  if(hy<0x00100000)
56
22
      iy = subnormal_ilogb(hy, ly);
57
7.44M
  else
58
7.44M
      iy = (hy>>20)-1023;
59
60
    /* set up {hx,lx}, {hy,ly} and align y to x */
61
7.44M
  if(ix >= -1022) 
62
7.44M
      hx = 0x00100000|(0x000fffff&hx);
63
0
  else {   /* subnormal x, shift x to normal */
64
0
      n = -1022-ix;
65
0
      if(n<=31) {
66
0
          hx = (hx<<n)|(lx>>(32-n));
67
0
          lx <<= n;
68
0
      } else {
69
0
    hx = lx<<(n-32);
70
0
    lx = 0;
71
0
      }
72
0
  }
73
7.44M
  if(iy >= -1022) 
74
7.44M
      hy = 0x00100000|(0x000fffff&hy);
75
22
  else {   /* subnormal y, shift y to normal */
76
22
      n = -1022-iy;
77
22
      if(n<=31) {
78
14
          hy = (hy<<n)|(ly>>(32-n));
79
14
          ly <<= n;
80
14
      } else {
81
8
    hy = ly<<(n-32);
82
8
    ly = 0;
83
8
      }
84
22
  }
85
86
    /* fix point fmod */
87
7.44M
  n = ix - iy;
88
192M
  while(n--) {
89
186M
      hz=hx-hy;lz=lx-ly; if(lx<ly) hz -= 1;
90
186M
      if(hz<0){hx = hx+hx+(lx>>31); lx = lx+lx;}
91
93.6M
      else {
92
93.6M
        if((hz|lz)==0)    /* return sign(x)*0 */
93
1.35M
        return Zero[(u_int32_t)sx>>31];
94
92.2M
        hx = hz+hz+(lz>>31); lx = lz+lz;
95
92.2M
      }
96
186M
  }
97
6.08M
  hz=hx-hy;lz=lx-ly; if(lx<ly) hz -= 1;
98
6.08M
  if(hz>=0) {hx=hz;lx=lz;}
99
100
    /* convert back to floating value and restore the sign */
101
6.08M
  if((hx|lx)==0)      /* return sign(x)*0 */
102
679k
      return Zero[(u_int32_t)sx>>31];
103
21.8M
  while(hx<0x00100000) {   /* normalize x */
104
16.4M
      hx = hx+hx+(lx>>31); lx = lx+lx;
105
16.4M
      iy -= 1;
106
16.4M
  }
107
5.40M
  if(iy>= -1022) { /* normalize output */
108
5.40M
      hx = ((hx-0x00100000)|((iy+1023)<<20));
109
5.40M
      INSERT_WORDS(x,hx|sx,lx);
110
5.40M
  } else {   /* subnormal output */
111
22
      n = -1022 - iy;
112
22
      if(n<=20) {
113
7
    lx = (lx>>n)|((u_int32_t)hx<<(32-n));
114
7
    hx >>= n;
115
15
      } else if (n<=31) {
116
8
    lx = (hx<<(32-n))|(lx>>n); hx = sx;
117
8
      } else {
118
7
    lx = hx>>(n-32); hx = sx;
119
7
      }
120
22
      INSERT_WORDS(x,hx|sx,lx);
121
22
      x *= one;   /* create necessary signal */
122
22
  }
123
5.40M
  return x;   /* exact output */
124
6.08M
}