| _fpmath.h (143214) | _fpmath.h (296113) |
|---|---|
| 1/*- 2 * Copyright (c) 2003 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 --- 9 unchanged lines hidden (view full) --- 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 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 * | 1/*- 2 * Copyright (c) 2003 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 --- 9 unchanged lines hidden (view full) --- 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 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 * $FreeBSD: head/lib/libc/powerpc/_fpmath.h 143214 2005-03-07 04:55:22Z das $ | 26 * $FreeBSD: head/lib/libc/powerpc/_fpmath.h 296113 2016-02-26 20:38:23Z nwhitehorn $ |
| 27 */ 28 29union IEEEl2bits { 30 long double e; 31 struct { | 27 */ 28 29union IEEEl2bits { 30 long double e; 31 struct { |
| 32#if _BYTE_ORDER == _LITTLE_ENDIAN 33 unsigned int manl :32; 34 unsigned int manh :20; 35 unsigned int exp :11; 36 unsigned int sign :1; 37#else /* _BYTE_ORDER == _LITTLE_ENDIAN */ |
|
| 32 unsigned int sign :1; 33 unsigned int exp :11; 34 unsigned int manh :20; 35 unsigned int manl :32; | 38 unsigned int sign :1; 39 unsigned int exp :11; 40 unsigned int manh :20; 41 unsigned int manl :32; |
| 42#endif |
|
| 36 } bits; 37}; 38 39#define mask_nbit_l(u) ((void)0) 40#define LDBL_IMPLICIT_NBIT 41#define LDBL_NBIT 0 42 43#define LDBL_MANH_SIZE 20 44#define LDBL_MANL_SIZE 32 45 46#define LDBL_TO_ARRAY32(u, a) do { \ 47 (a)[0] = (uint32_t)(u).bits.manl; \ 48 (a)[1] = (uint32_t)(u).bits.manh; \ 49} while(0) | 43 } bits; 44}; 45 46#define mask_nbit_l(u) ((void)0) 47#define LDBL_IMPLICIT_NBIT 48#define LDBL_NBIT 0 49 50#define LDBL_MANH_SIZE 20 51#define LDBL_MANL_SIZE 32 52 53#define LDBL_TO_ARRAY32(u, a) do { \ 54 (a)[0] = (uint32_t)(u).bits.manl; \ 55 (a)[1] = (uint32_t)(u).bits.manh; \ 56} while(0) |