| k_exp.c (226597) | k_exp.c (275819) |
|---|---|
| 1/*- 2 * Copyright (c) 2011 David Schultz <das@FreeBSD.ORG> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 11 unchanged lines hidden (view full) --- 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 */ 26 27#include <sys/cdefs.h> | 1/*- 2 * Copyright (c) 2011 David Schultz <das@FreeBSD.ORG> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright --- 11 unchanged lines hidden (view full) --- 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 */ 26 27#include <sys/cdefs.h> |
| 28__FBSDID("$FreeBSD: head/lib/msun/src/k_exp.c 226597 2011-10-21 06:27:56Z das $"); | 28__FBSDID("$FreeBSD: head/lib/msun/src/k_exp.c 275819 2014-12-16 09:21:56Z ed $"); |
| 29 30#include <complex.h> 31 32#include "math.h" 33#include "math_private.h" 34 35static const uint32_t k = 1799; /* constant for reduction */ 36static const double kln2 = 1246.97177782734161156; /* k * ln2 */ --- 61 unchanged lines hidden (view full) --- 98 * Arrange so that scale1 * scale2 == 2**expt. We use this to 99 * compensate for scalbn being horrendously slow. 100 */ 101 half_expt = expt / 2; 102 INSERT_WORDS(scale1, (0x3ff + half_expt) << 20, 0); 103 half_expt = expt - half_expt; 104 INSERT_WORDS(scale2, (0x3ff + half_expt) << 20, 0); 105 | 29 30#include <complex.h> 31 32#include "math.h" 33#include "math_private.h" 34 35static const uint32_t k = 1799; /* constant for reduction */ 36static const double kln2 = 1246.97177782734161156; /* k * ln2 */ --- 61 unchanged lines hidden (view full) --- 98 * Arrange so that scale1 * scale2 == 2**expt. We use this to 99 * compensate for scalbn being horrendously slow. 100 */ 101 half_expt = expt / 2; 102 INSERT_WORDS(scale1, (0x3ff + half_expt) << 20, 0); 103 half_expt = expt - half_expt; 104 INSERT_WORDS(scale2, (0x3ff + half_expt) << 20, 0); 105 |
| 106 return (cpack(cos(y) * exp_x * scale1 * scale2, | 106 return (CMPLX(cos(y) * exp_x * scale1 * scale2, |
| 107 sin(y) * exp_x * scale1 * scale2)); 108} | 107 sin(y) * exp_x * scale1 * scale2)); 108} |