1d3f9671aSDavid Schultz /*-
2*4d846d26SWarner Losh * SPDX-License-Identifier: BSD-2-Clause
35e53a4f9SPedro F. Giffuni *
4d3f9671aSDavid Schultz * Copyright (c) 2008 David Schultz <das@FreeBSD.ORG>
5d3f9671aSDavid Schultz * All rights reserved.
6d3f9671aSDavid Schultz *
7d3f9671aSDavid Schultz * Redistribution and use in source and binary forms, with or without
8d3f9671aSDavid Schultz * modification, are permitted provided that the following conditions
9d3f9671aSDavid Schultz * are met:
10d3f9671aSDavid Schultz * 1. Redistributions of source code must retain the above copyright
11d3f9671aSDavid Schultz * notice, this list of conditions and the following disclaimer.
12d3f9671aSDavid Schultz * 2. Redistributions in binary form must reproduce the above copyright
13d3f9671aSDavid Schultz * notice, this list of conditions and the following disclaimer in the
14d3f9671aSDavid Schultz * documentation and/or other materials provided with the distribution.
15d3f9671aSDavid Schultz *
16d3f9671aSDavid Schultz * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17d3f9671aSDavid Schultz * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18d3f9671aSDavid Schultz * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19d3f9671aSDavid Schultz * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20d3f9671aSDavid Schultz * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21d3f9671aSDavid Schultz * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22d3f9671aSDavid Schultz * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23d3f9671aSDavid Schultz * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24d3f9671aSDavid Schultz * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25d3f9671aSDavid Schultz * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26d3f9671aSDavid Schultz * SUCH DAMAGE.
27d3f9671aSDavid Schultz */
28d3f9671aSDavid Schultz
29d3f9671aSDavid Schultz #include <float.h>
30d3f9671aSDavid Schultz #include <math.h>
31d3f9671aSDavid Schultz
32d3f9671aSDavid Schultz #include "fpmath.h"
33d3f9671aSDavid Schultz
34f839bac2SBruce Evans #if LDBL_MAX_EXP != 0x4000
35f839bac2SBruce Evans /* We also require the usual bias, min exp and expsign packing. */
36f839bac2SBruce Evans #error "Unsupported long double format"
37f839bac2SBruce Evans #endif
38f839bac2SBruce Evans
39a2d171e4SDavid Schultz #define BIAS (LDBL_MAX_EXP - 1)
40a2d171e4SDavid Schultz
41a2d171e4SDavid Schultz static const float
42d3f9671aSDavid Schultz shift[2] = {
43d3f9671aSDavid Schultz #if LDBL_MANT_DIG == 64
44d3f9671aSDavid Schultz 0x1.0p63, -0x1.0p63
45d3f9671aSDavid Schultz #elif LDBL_MANT_DIG == 113
46d3f9671aSDavid Schultz 0x1.0p112, -0x1.0p112
47d3f9671aSDavid Schultz #else
48d3f9671aSDavid Schultz #error "Unsupported long double format"
49d3f9671aSDavid Schultz #endif
50d3f9671aSDavid Schultz };
51a7aa8cc9SBruce Evans static const float zero[2] = { 0.0, -0.0 };
52d3f9671aSDavid Schultz
53d3f9671aSDavid Schultz long double
rintl(long double x)54d3f9671aSDavid Schultz rintl(long double x)
55d3f9671aSDavid Schultz {
56d3f9671aSDavid Schultz union IEEEl2bits u;
57f839bac2SBruce Evans uint32_t expsign;
58f839bac2SBruce Evans int ex, sign;
59d3f9671aSDavid Schultz
60d3f9671aSDavid Schultz u.e = x;
61f839bac2SBruce Evans expsign = u.xbits.expsign;
62f839bac2SBruce Evans ex = expsign & 0x7fff;
63d3f9671aSDavid Schultz
64f839bac2SBruce Evans if (ex >= BIAS + LDBL_MANT_DIG - 1) {
65f839bac2SBruce Evans if (ex == BIAS + LDBL_MAX_EXP)
6633843eefSBruce Evans return (x + x); /* Inf, NaN, or unsupported format */
6733843eefSBruce Evans return (x); /* finite and already an integer */
68d3f9671aSDavid Schultz }
69f839bac2SBruce Evans sign = expsign >> 15;
70d3f9671aSDavid Schultz
71d3f9671aSDavid Schultz /*
72d3f9671aSDavid Schultz * The following code assumes that intermediate results are
73d3f9671aSDavid Schultz * evaluated in long double precision. If they are evaluated in
74a2d171e4SDavid Schultz * greater precision, double rounding may occur, and if they are
75d3f9671aSDavid Schultz * evaluated in less precision (as on i386), results will be
76d3f9671aSDavid Schultz * wildly incorrect.
77d3f9671aSDavid Schultz */
78a2d171e4SDavid Schultz x += shift[sign];
79a2d171e4SDavid Schultz x -= shift[sign];
80a2d171e4SDavid Schultz
81a2d171e4SDavid Schultz /*
82a2d171e4SDavid Schultz * If the result is +-0, then it must have the same sign as x, but
83a2d171e4SDavid Schultz * the above calculation doesn't always give this. Fix up the sign.
84a2d171e4SDavid Schultz */
85f839bac2SBruce Evans if (ex < BIAS && x == 0.0L)
86a7aa8cc9SBruce Evans return (zero[sign]);
87a7aa8cc9SBruce Evans
88a2d171e4SDavid Schultz return (x);
89d3f9671aSDavid Schultz }
90