• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*-
2  * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
3  *
4  * Copyright (c) 2003 Mike Barcroft <mike@FreeBSD.org>
5  * Copyright (c) 2002 David Schultz <das@FreeBSD.ORG>
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice, this list of conditions and the following disclaimer.
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in the
15  *    documentation and/or other materials provided with the distribution.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27  * SUCH DAMAGE.
28  *
29  * $FreeBSD$
30  */
31 
32 #ifndef _FPMATH_H_
33 #define _FPMATH_H_
34 
35 #include <endian.h>
36 #ifndef LD128_ENABLE
37 #include "_fpmath.h"
38 #endif
39 
40 #ifndef _IEEE_WORD_ORDER
41 #define	_IEEE_WORD_ORDER	__BYTE_ORDER
42 #endif
43 
44 #ifdef LD128_ENABLE
45 union IEEEl2bits {
46 	long double	e;
47 	struct {
48 		unsigned long	manl	:64;
49 		unsigned long	manh	:48;
50 		unsigned int	exp	:15;
51 		unsigned int	sign	:1;
52 	} bits;
53 	/* TODO andrew: Check the packing here */
54 	struct {
55 		unsigned long	manl	:64;
56 		unsigned long	manh	:48;
57 		unsigned int	expsign	:16;
58 	} xbits;
59 };
60 
61 #define	LDBL_NBIT	0
62 #define	LDBL_IMPLICIT_NBIT
63 #define	mask_nbit_l(u)	((void)0)
64 
65 #define	LDBL_MANH_SIZE	48
66 #define	LDBL_MANL_SIZE	64
67 
68 #define	LDBL_TO_ARRAY32(u, a) do {			\
69 	(a)[0] = (uint32_t)(u).bits.manl;		\
70 	(a)[1] = (uint32_t)((u).bits.manl >> 32);	\
71 	(a)[2] = (uint32_t)(u).bits.manh;		\
72 	(a)[3] = (uint32_t)((u).bits.manh >> 32);	\
73 } while(0)
74 #else
75 union IEEEf2bits {
76 	float	f;
77 	struct {
78 #if __BYTE_ORDER == __LITTLE_ENDIAN
79 		unsigned int	man	:23;
80 		unsigned int	exp	:8;
81 		unsigned int	sign	:1;
82 #else /* __BIG_ENDIAN */
83 		unsigned int	sign	:1;
84 		unsigned int	exp	:8;
85 		unsigned int	man	:23;
86 #endif
87 	} bits;
88 };
89 
90 #define	DBL_MANH_SIZE	20
91 #define	DBL_MANL_SIZE	32
92 
93 union IEEEd2bits {
94 	double	d;
95 	struct {
96 #if __BYTE_ORDER == __LITTLE_ENDIAN
97 #if _IEEE_WORD_ORDER == __LITTLE_ENDIAN
98 		unsigned int	manl	:32;
99 #endif
100 		unsigned int	manh	:20;
101 		unsigned int	exp	:11;
102 		unsigned int	sign	:1;
103 #if _IEEE_WORD_ORDER == __BIG_ENDIAN
104 		unsigned int	manl	:32;
105 #endif
106 #else /* __BIG_ENDIAN */
107 		unsigned int	sign	:1;
108 		unsigned int	exp	:11;
109 		unsigned int	manh	:20;
110 		unsigned int	manl	:32;
111 #endif
112 	} bits;
113 };
114 #endif
115 #endif /* !_FPMATH_H */