xref: /minix3/lib/libm/src/lroundf.c (revision 2fe8fb192fe7e8720e3e7a77f928da545e872a6a)
1*2fe8fb19SBen Gras /* $NetBSD: lroundf.c,v 1.3 2008/04/26 23:49:50 christos Exp $ */
2*2fe8fb19SBen Gras 
3*2fe8fb19SBen Gras /*-
4*2fe8fb19SBen Gras  * Copyright (c) 2004
5*2fe8fb19SBen Gras  *	Matthias Drochner. All rights reserved.
6*2fe8fb19SBen Gras  *
7*2fe8fb19SBen Gras  * Redistribution and use in source and binary forms, with or without
8*2fe8fb19SBen Gras  * modification, are permitted provided that the following conditions
9*2fe8fb19SBen Gras  * are met:
10*2fe8fb19SBen Gras  * 1. Redistributions of source code must retain the above copyright
11*2fe8fb19SBen Gras  *    notice, this list of conditions and the following disclaimer.
12*2fe8fb19SBen Gras  * 2. Redistributions in binary form must reproduce the above copyright
13*2fe8fb19SBen Gras  *    notice, this list of conditions and the following disclaimer in the
14*2fe8fb19SBen Gras  *    documentation and/or other materials provided with the distribution.
15*2fe8fb19SBen Gras  *
16*2fe8fb19SBen Gras  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17*2fe8fb19SBen Gras  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18*2fe8fb19SBen Gras  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19*2fe8fb19SBen Gras  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20*2fe8fb19SBen Gras  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21*2fe8fb19SBen Gras  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22*2fe8fb19SBen Gras  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23*2fe8fb19SBen Gras  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24*2fe8fb19SBen Gras  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25*2fe8fb19SBen Gras  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26*2fe8fb19SBen Gras  * SUCH DAMAGE.
27*2fe8fb19SBen Gras  */
28*2fe8fb19SBen Gras 
29*2fe8fb19SBen Gras #include <math.h>
30*2fe8fb19SBen Gras #include <sys/ieee754.h>
31*2fe8fb19SBen Gras #include <machine/limits.h>
32*2fe8fb19SBen Gras #include "math_private.h"
33*2fe8fb19SBen Gras 
34*2fe8fb19SBen Gras #ifndef LROUNDNAME
35*2fe8fb19SBen Gras #define LROUNDNAME lroundf
36*2fe8fb19SBen Gras #define RESTYPE long int
37*2fe8fb19SBen Gras #define RESTYPE_MIN LONG_MIN
38*2fe8fb19SBen Gras #define RESTYPE_MAX LONG_MAX
39*2fe8fb19SBen Gras #endif
40*2fe8fb19SBen Gras 
41*2fe8fb19SBen Gras #define RESTYPE_BITS (sizeof(RESTYPE) * 8)
42*2fe8fb19SBen Gras 
43*2fe8fb19SBen Gras RESTYPE
LROUNDNAME(float x)44*2fe8fb19SBen Gras LROUNDNAME(float x)
45*2fe8fb19SBen Gras {
46*2fe8fb19SBen Gras 	u_int32_t i0;
47*2fe8fb19SBen Gras 	int e, s, shift;
48*2fe8fb19SBen Gras 	RESTYPE res;
49*2fe8fb19SBen Gras 
50*2fe8fb19SBen Gras 	GET_FLOAT_WORD(i0, x);
51*2fe8fb19SBen Gras 	e = i0 >> SNG_FRACBITS;
52*2fe8fb19SBen Gras 	s = (uint32_t)e >> SNG_EXPBITS;
53*2fe8fb19SBen Gras 	e = (e & 0xff) - SNG_EXP_BIAS;
54*2fe8fb19SBen Gras 
55*2fe8fb19SBen Gras 	/* 1.0 x 2^-1 is the smallest number which can be rounded to 1 */
56*2fe8fb19SBen Gras 	if (e < -1)
57*2fe8fb19SBen Gras 		return (0);
58*2fe8fb19SBen Gras 	/* 1.0 x 2^31 (or 2^63) is already too large */
59*2fe8fb19SBen Gras 	if (e >= (int)RESTYPE_BITS - 1)
60*2fe8fb19SBen Gras 		return (s ? RESTYPE_MIN : RESTYPE_MAX); /* ??? unspecified */
61*2fe8fb19SBen Gras 
62*2fe8fb19SBen Gras 	/* >= 2^23 is already an exact integer */
63*2fe8fb19SBen Gras 	if (e < SNG_FRACBITS) {
64*2fe8fb19SBen Gras 		/* add 0.5, extraction below will truncate */
65*2fe8fb19SBen Gras 		x += (s ? -0.5 : 0.5);
66*2fe8fb19SBen Gras 	}
67*2fe8fb19SBen Gras 
68*2fe8fb19SBen Gras 	GET_FLOAT_WORD(i0, x);
69*2fe8fb19SBen Gras 	e = ((i0 >> SNG_FRACBITS) & 0xff) - SNG_EXP_BIAS;
70*2fe8fb19SBen Gras 	i0 &= 0x7fffff;
71*2fe8fb19SBen Gras 	i0 |= (1 << SNG_FRACBITS);
72*2fe8fb19SBen Gras 
73*2fe8fb19SBen Gras 	shift = e - SNG_FRACBITS;
74*2fe8fb19SBen Gras 	if (shift >=0)
75*2fe8fb19SBen Gras 		res = (shift < 32 ? (RESTYPE)i0 << shift : 0);
76*2fe8fb19SBen Gras 	else
77*2fe8fb19SBen Gras 		res = (shift > -32 ? i0 >> -shift : 0);
78*2fe8fb19SBen Gras 
79*2fe8fb19SBen Gras 	return (s ? -res : res);
80*2fe8fb19SBen Gras }
81