e_rem_pio2l.h 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  1. /* From: @(#)e_rem_pio2.c 1.4 95/01/18 */
  2. /*
  3. * ====================================================
  4. * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
  5. * Copyright (c) 2008 Steven G. Kargl, David Schultz, Bruce D. Evans.
  6. *
  7. * Developed at SunSoft, a Sun Microsystems, Inc. business.
  8. * Permission to use, copy, modify, and distribute this
  9. * software is freely granted, provided that this notice
  10. * is preserved.
  11. * ====================================================
  12. *
  13. * Optimized by Bruce D. Evans.
  14. */
  15. #include "cdefs-compat.h"
  16. //__FBSDID("$FreeBSD: src/lib/msun/ld128/e_rem_pio2l.h,v 1.2 2011/05/30 19:41:28 kargl Exp $");
  17. /* ld128 version of __ieee754_rem_pio2l(x,y)
  18. *
  19. * return the remainder of x rem pi/2 in y[0]+y[1]
  20. * use __kernel_rem_pio2()
  21. */
  22. #include <float.h>
  23. #include <openlibm_math.h>
  24. #include "math_private.h"
  25. #include "fpmath.h"
  26. #define BIAS (LDBL_MAX_EXP - 1)
  27. /*
  28. * XXX need to verify that nonzero integer multiples of pi/2 within the
  29. * range get no closer to a long double than 2**-140, or that
  30. * ilogb(x) + ilogb(min_delta) < 45 - -140.
  31. */
  32. /*
  33. * invpio2: 113 bits of 2/pi
  34. * pio2_1: first 68 bits of pi/2
  35. * pio2_1t: pi/2 - pio2_1
  36. * pio2_2: second 68 bits of pi/2
  37. * pio2_2t: pi/2 - (pio2_1+pio2_2)
  38. * pio2_3: third 68 bits of pi/2
  39. * pio2_3t: pi/2 - (pio2_1+pio2_2+pio2_3)
  40. */
  41. static const double
  42. zero = 0.00000000000000000000e+00, /* 0x00000000, 0x00000000 */
  43. two24 = 1.67772160000000000000e+07; /* 0x41700000, 0x00000000 */
  44. static const long double
  45. invpio2 = 6.3661977236758134307553505349005747e-01L, /* 0x145f306dc9c882a53f84eafa3ea6a.0p-113 */
  46. pio2_1 = 1.5707963267948966192292994253909555e+00L, /* 0x1921fb54442d18469800000000000.0p-112 */
  47. pio2_1t = 2.0222662487959507323996846200947577e-21L, /* 0x13198a2e03707344a4093822299f3.0p-181 */
  48. pio2_2 = 2.0222662487959507323994779168837751e-21L, /* 0x13198a2e03707344a400000000000.0p-181 */
  49. pio2_2t = 2.0670321098263988236496903051604844e-43L, /* 0x127044533e63a0105df531d89cd91.0p-254 */
  50. pio2_3 = 2.0670321098263988236499468110329591e-43L, /* 0x127044533e63a0105e00000000000.0p-254 */
  51. pio2_3t = -2.5650587247459238361625433492959285e-65L; /* -0x159c4ec64ddaeb5f78671cbfb2210.0p-327 */
  52. //VBS
  53. //static inline __always_inline int
  54. //__ieee754_rem_pio2l(long double x, long double *y)
  55. static inline int
  56. __ieee754_rem_pio2l(long double x, long double *y)
  57. {
  58. union IEEEl2bits u,u1;
  59. long double z,w,t,r,fn;
  60. double tx[5],ty[3];
  61. int64_t n;
  62. int e0,ex,i,j,nx;
  63. int16_t expsign;
  64. u.e = x;
  65. expsign = u.xbits.expsign;
  66. ex = expsign & 0x7fff;
  67. if (ex < BIAS + 45 || ex == BIAS + 45 &&
  68. u.bits.manh < 0x921fb54442d1LL) {
  69. /* |x| ~< 2^45*(pi/2), medium size */
  70. /* Use a specialized rint() to get fn. Assume round-to-nearest. */
  71. fn = x*invpio2+0x1.8p112;
  72. fn = fn-0x1.8p112;
  73. #ifdef HAVE_EFFICIENT_I64RINT
  74. n = i64rint(fn);
  75. #else
  76. n = fn;
  77. #endif
  78. r = x-fn*pio2_1;
  79. w = fn*pio2_1t; /* 1st round good to 180 bit */
  80. {
  81. union IEEEl2bits u2;
  82. int ex1;
  83. j = ex;
  84. y[0] = r-w;
  85. u2.e = y[0];
  86. ex1 = u2.xbits.expsign & 0x7fff;
  87. i = j-ex1;
  88. if(i>51) { /* 2nd iteration needed, good to 248 */
  89. t = r;
  90. w = fn*pio2_2;
  91. r = t-w;
  92. w = fn*pio2_2t-((t-r)-w);
  93. y[0] = r-w;
  94. u2.e = y[0];
  95. ex1 = u2.xbits.expsign & 0x7fff;
  96. i = j-ex1;
  97. if(i>119) { /* 3rd iteration need, 316 bits acc */
  98. t = r; /* will cover all possible cases */
  99. w = fn*pio2_3;
  100. r = t-w;
  101. w = fn*pio2_3t-((t-r)-w);
  102. y[0] = r-w;
  103. }
  104. }
  105. }
  106. y[1] = (r-y[0])-w;
  107. return n;
  108. }
  109. /*
  110. * all other (large) arguments
  111. */
  112. if(ex==0x7fff) { /* x is inf or NaN */
  113. y[0]=y[1]=x-x; return 0;
  114. }
  115. /* set z = scalbn(|x|,ilogb(x)-23) */
  116. u1.e = x;
  117. e0 = ex - BIAS - 23; /* e0 = ilogb(|x|)-23; */
  118. u1.xbits.expsign = ex - e0;
  119. z = u1.e;
  120. for(i=0;i<4;i++) {
  121. tx[i] = (double)((int32_t)(z));
  122. z = (z-tx[i])*two24;
  123. }
  124. tx[4] = z;
  125. nx = 5;
  126. while(tx[nx-1]==zero) nx--; /* skip zero term */
  127. n = __kernel_rem_pio2(tx,ty,e0,nx,3);
  128. t = (long double)ty[2] + ty[1];
  129. r = t + ty[0];
  130. w = ty[0] - (r - t);
  131. if(expsign<0) {y[0] = -r; y[1] = -w; return -n;}
  132. y[0] = r; y[1] = w; return n;
  133. }