e_rem_pio2.c 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187
  1. /* @(#)e_rem_pio2.c 1.4 95/01/18 */
  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. * Optimized by Bruce D. Evans.
  13. */
  14. #include <sys/cdefs.h>
  15. //__FBSDID("$FreeBSD: src/lib/msun/src/e_rem_pio2.c,v 1.22 2011/06/19 17:07:58 kargl Exp $");
  16. /* __ieee754_rem_pio2(x,y)
  17. *
  18. * return the remainder of x rem pi/2 in y[0]+y[1]
  19. * use __kernel_rem_pio2()
  20. */
  21. #include <float.h>
  22. #include "openlibm.h"
  23. #include "math_private.h"
  24. /*
  25. * invpio2: 53 bits of 2/pi
  26. * pio2_1: first 33 bit of pi/2
  27. * pio2_1t: pi/2 - pio2_1
  28. * pio2_2: second 33 bit of pi/2
  29. * pio2_2t: pi/2 - (pio2_1+pio2_2)
  30. * pio2_3: third 33 bit of pi/2
  31. * pio2_3t: pi/2 - (pio2_1+pio2_2+pio2_3)
  32. */
  33. static const double
  34. zero = 0.00000000000000000000e+00, /* 0x00000000, 0x00000000 */
  35. two24 = 1.67772160000000000000e+07, /* 0x41700000, 0x00000000 */
  36. invpio2 = 6.36619772367581382433e-01, /* 0x3FE45F30, 0x6DC9C883 */
  37. pio2_1 = 1.57079632673412561417e+00, /* 0x3FF921FB, 0x54400000 */
  38. pio2_1t = 6.07710050650619224932e-11, /* 0x3DD0B461, 0x1A626331 */
  39. pio2_2 = 6.07710050630396597660e-11, /* 0x3DD0B461, 0x1A600000 */
  40. pio2_2t = 2.02226624879595063154e-21, /* 0x3BA3198A, 0x2E037073 */
  41. pio2_3 = 2.02226624871116645580e-21, /* 0x3BA3198A, 0x2E000000 */
  42. pio2_3t = 8.47842766036889956997e-32; /* 0x397B839A, 0x252049C1 */
  43. #ifndef INLINE_REM_PIO2
  44. extern
  45. #endif
  46. //__inline int
  47. int
  48. __ieee754_rem_pio2(double x, double *y)
  49. {
  50. double z,w,t,r,fn;
  51. double tx[3],ty[2];
  52. int32_t e0,i,j,nx,n,ix,hx;
  53. u_int32_t low;
  54. GET_HIGH_WORD(hx,x); /* high word of x */
  55. ix = hx&0x7fffffff;
  56. #if 0 /* Must be handled in caller. */
  57. if(ix<=0x3fe921fb) /* |x| ~<= pi/4 , no need for reduction */
  58. {y[0] = x; y[1] = 0; return 0;}
  59. #endif
  60. if (ix <= 0x400f6a7a) { /* |x| ~<= 5pi/4 */
  61. if ((ix & 0xfffff) == 0x921fb) /* |x| ~= pi/2 or 2pi/2 */
  62. goto medium; /* cancellation -- use medium case */
  63. if (ix <= 0x4002d97c) { /* |x| ~<= 3pi/4 */
  64. if (hx > 0) {
  65. z = x - pio2_1; /* one round good to 85 bits */
  66. y[0] = z - pio2_1t;
  67. y[1] = (z-y[0])-pio2_1t;
  68. return 1;
  69. } else {
  70. z = x + pio2_1;
  71. y[0] = z + pio2_1t;
  72. y[1] = (z-y[0])+pio2_1t;
  73. return -1;
  74. }
  75. } else {
  76. if (hx > 0) {
  77. z = x - 2*pio2_1;
  78. y[0] = z - 2*pio2_1t;
  79. y[1] = (z-y[0])-2*pio2_1t;
  80. return 2;
  81. } else {
  82. z = x + 2*pio2_1;
  83. y[0] = z + 2*pio2_1t;
  84. y[1] = (z-y[0])+2*pio2_1t;
  85. return -2;
  86. }
  87. }
  88. }
  89. if (ix <= 0x401c463b) { /* |x| ~<= 9pi/4 */
  90. if (ix <= 0x4015fdbc) { /* |x| ~<= 7pi/4 */
  91. if (ix == 0x4012d97c) /* |x| ~= 3pi/2 */
  92. goto medium;
  93. if (hx > 0) {
  94. z = x - 3*pio2_1;
  95. y[0] = z - 3*pio2_1t;
  96. y[1] = (z-y[0])-3*pio2_1t;
  97. return 3;
  98. } else {
  99. z = x + 3*pio2_1;
  100. y[0] = z + 3*pio2_1t;
  101. y[1] = (z-y[0])+3*pio2_1t;
  102. return -3;
  103. }
  104. } else {
  105. if (ix == 0x401921fb) /* |x| ~= 4pi/2 */
  106. goto medium;
  107. if (hx > 0) {
  108. z = x - 4*pio2_1;
  109. y[0] = z - 4*pio2_1t;
  110. y[1] = (z-y[0])-4*pio2_1t;
  111. return 4;
  112. } else {
  113. z = x + 4*pio2_1;
  114. y[0] = z + 4*pio2_1t;
  115. y[1] = (z-y[0])+4*pio2_1t;
  116. return -4;
  117. }
  118. }
  119. }
  120. if(ix<0x413921fb) { /* |x| ~< 2^20*(pi/2), medium size */
  121. medium:
  122. /* Use a specialized rint() to get fn. Assume round-to-nearest. */
  123. STRICT_ASSIGN(double,fn,x*invpio2+0x1.8p52);
  124. fn = fn-0x1.8p52;
  125. #ifdef HAVE_EFFICIENT_IRINT
  126. n = irint(fn);
  127. #else
  128. n = (int32_t)fn;
  129. #endif
  130. r = x-fn*pio2_1;
  131. w = fn*pio2_1t; /* 1st round good to 85 bit */
  132. {
  133. u_int32_t high;
  134. j = ix>>20;
  135. y[0] = r-w;
  136. GET_HIGH_WORD(high,y[0]);
  137. i = j-((high>>20)&0x7ff);
  138. if(i>16) { /* 2nd iteration needed, good to 118 */
  139. t = r;
  140. w = fn*pio2_2;
  141. r = t-w;
  142. w = fn*pio2_2t-((t-r)-w);
  143. y[0] = r-w;
  144. GET_HIGH_WORD(high,y[0]);
  145. i = j-((high>>20)&0x7ff);
  146. if(i>49) { /* 3rd iteration need, 151 bits acc */
  147. t = r; /* will cover all possible cases */
  148. w = fn*pio2_3;
  149. r = t-w;
  150. w = fn*pio2_3t-((t-r)-w);
  151. y[0] = r-w;
  152. }
  153. }
  154. }
  155. y[1] = (r-y[0])-w;
  156. return n;
  157. }
  158. /*
  159. * all other (large) arguments
  160. */
  161. if(ix>=0x7ff00000) { /* x is inf or NaN */
  162. y[0]=y[1]=x-x; return 0;
  163. }
  164. /* set z = scalbn(|x|,ilogb(x)-23) */
  165. GET_LOW_WORD(low,x);
  166. e0 = (ix>>20)-1046; /* e0 = ilogb(z)-23; */
  167. INSERT_WORDS(z, ix - ((int32_t)(e0<<20)), low);
  168. for(i=0;i<2;i++) {
  169. tx[i] = (double)((int32_t)(z));
  170. z = (z-tx[i])*two24;
  171. }
  172. tx[2] = z;
  173. nx = 3;
  174. while(tx[nx-1]==zero) nx--; /* skip zero term */
  175. n = __kernel_rem_pio2(tx,ty,e0,nx,1);
  176. if(hx<0) {y[0] = -ty[0]; y[1] = -ty[1]; return -n;}
  177. y[0] = ty[0]; y[1] = ty[1]; return n;
  178. }