_fpmath.h (186461) | _fpmath.h (230188) |
---|---|
1/*- 2 * Copyright (c) 2002, 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) 2002, 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/arm/_fpmath.h 186461 2008-12-23 22:20:59Z marcel $ | 26 * $FreeBSD: head/lib/libc/arm/_fpmath.h 230188 2012-01-16 04:04:35Z das $ |
27 */ 28 29#if defined(__VFP_FP__) 30#define _IEEE_WORD_ORDER _BYTE_ORDER 31#else 32#define _IEEE_WORD_ORDER _BIG_ENDIAN 33#endif 34 --- 15 unchanged lines hidden (view full) --- 50 unsigned int exp :11; 51 unsigned int manh :20; 52 unsigned int manl :32; 53#endif 54 } bits; 55}; 56 57#define LDBL_NBIT 0 | 27 */ 28 29#if defined(__VFP_FP__) 30#define _IEEE_WORD_ORDER _BYTE_ORDER 31#else 32#define _IEEE_WORD_ORDER _BIG_ENDIAN 33#endif 34 --- 15 unchanged lines hidden (view full) --- 50 unsigned int exp :11; 51 unsigned int manh :20; 52 unsigned int manl :32; 53#endif 54 } bits; 55}; 56 57#define LDBL_NBIT 0 |
58#define LDBL_IMPLICIT_NBIT |
|
58#define mask_nbit_l(u) ((void)0) 59 | 59#define mask_nbit_l(u) ((void)0) 60 |
60#define LDBL_MANH_SIZE 32 | 61#define LDBL_MANH_SIZE 20 |
61#define LDBL_MANL_SIZE 32 62 63#define LDBL_TO_ARRAY32(u, a) do { \ 64 (a)[0] = (uint32_t)(u).bits.manl; \ 65 (a)[1] = (uint32_t)(u).bits.manh; \ 66} while(0) | 62#define LDBL_MANL_SIZE 32 63 64#define LDBL_TO_ARRAY32(u, a) do { \ 65 (a)[0] = (uint32_t)(u).bits.manl; \ 66 (a)[1] = (uint32_t)(u).bits.manh; \ 67} while(0) |