/lib/msun/src/k_exp.c

https://bitbucket.org/freebsd/freebsd-base · C · 110 lines · 44 code · 13 blank · 53 comment · 0 complexity · b960d289a161c72584e68171c3f4fdd6 MD5 · raw file

  1. /*-
  2. * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
  3. *
  4. * Copyright (c) 2011 David Schultz <das@FreeBSD.ORG>
  5. * All rights reserved.
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions
  9. * are met:
  10. * 1. Redistributions of source code must retain the above copyright
  11. * notice, this list of conditions and the following disclaimer.
  12. * 2. Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in the
  14. * documentation and/or other materials provided with the distribution.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  17. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  19. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  20. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  22. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  23. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  24. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  25. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  26. * SUCH DAMAGE.
  27. */
  28. #include <sys/cdefs.h>
  29. __FBSDID("$FreeBSD$");
  30. #include <complex.h>
  31. #include "math.h"
  32. #include "math_private.h"
  33. static const uint32_t k = 1799; /* constant for reduction */
  34. static const double kln2 = 1246.97177782734161156; /* k * ln2 */
  35. /*
  36. * Compute exp(x), scaled to avoid spurious overflow. An exponent is
  37. * returned separately in 'expt'.
  38. *
  39. * Input: ln(DBL_MAX) <= x < ln(2 * DBL_MAX / DBL_MIN_DENORM) ~= 1454.91
  40. * Output: 2**1023 <= y < 2**1024
  41. */
  42. static double
  43. __frexp_exp(double x, int *expt)
  44. {
  45. double exp_x;
  46. uint32_t hx;
  47. /*
  48. * We use exp(x) = exp(x - kln2) * 2**k, carefully chosen to
  49. * minimize |exp(kln2) - 2**k|. We also scale the exponent of
  50. * exp_x to MAX_EXP so that the result can be multiplied by
  51. * a tiny number without losing accuracy due to denormalization.
  52. */
  53. exp_x = exp(x - kln2);
  54. GET_HIGH_WORD(hx, exp_x);
  55. *expt = (hx >> 20) - (0x3ff + 1023) + k;
  56. SET_HIGH_WORD(exp_x, (hx & 0xfffff) | ((0x3ff + 1023) << 20));
  57. return (exp_x);
  58. }
  59. /*
  60. * __ldexp_exp(x, expt) and __ldexp_cexp(x, expt) compute exp(x) * 2**expt.
  61. * They are intended for large arguments (real part >= ln(DBL_MAX))
  62. * where care is needed to avoid overflow.
  63. *
  64. * The present implementation is narrowly tailored for our hyperbolic and
  65. * exponential functions. We assume expt is small (0 or -1), and the caller
  66. * has filtered out very large x, for which overflow would be inevitable.
  67. */
  68. double
  69. __ldexp_exp(double x, int expt)
  70. {
  71. double exp_x, scale;
  72. int ex_expt;
  73. exp_x = __frexp_exp(x, &ex_expt);
  74. expt += ex_expt;
  75. INSERT_WORDS(scale, (0x3ff + expt) << 20, 0);
  76. return (exp_x * scale);
  77. }
  78. double complex
  79. __ldexp_cexp(double complex z, int expt)
  80. {
  81. double x, y, exp_x, scale1, scale2;
  82. int ex_expt, half_expt;
  83. x = creal(z);
  84. y = cimag(z);
  85. exp_x = __frexp_exp(x, &ex_expt);
  86. expt += ex_expt;
  87. /*
  88. * Arrange so that scale1 * scale2 == 2**expt. We use this to
  89. * compensate for scalbn being horrendously slow.
  90. */
  91. half_expt = expt / 2;
  92. INSERT_WORDS(scale1, (0x3ff + half_expt) << 20, 0);
  93. half_expt = expt - half_expt;
  94. INSERT_WORDS(scale2, (0x3ff + half_expt) << 20, 0);
  95. return (CMPLX(cos(y) * exp_x * scale1 * scale2,
  96. sin(y) * exp_x * scale1 * scale2));
  97. }