The Android Open Source Project | a27d2ba | 2008-10-21 07:00:00 -0700 | [diff] [blame^] | 1 | /*- |
| 2 | * Copyright (c) 2003 Mike Barcroft <mike@FreeBSD.org> |
| 3 | * Copyright (c) 2002, 2003 David Schultz <das@FreeBSD.ORG> |
| 4 | * All rights reserved. |
| 5 | * |
| 6 | * Redistribution and use in source and binary forms, with or without |
| 7 | * modification, are permitted provided that the following conditions |
| 8 | * are met: |
| 9 | * 1. Redistributions of source code must retain the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer. |
| 11 | * 2. Redistributions in binary form must reproduce the above copyright |
| 12 | * notice, this list of conditions and the following disclaimer in the |
| 13 | * documentation and/or other materials provided with the distribution. |
| 14 | * |
| 15 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
| 16 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 17 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 18 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 19 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 20 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 21 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 22 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 23 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 24 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 25 | * SUCH DAMAGE. |
| 26 | * |
| 27 | * $FreeBSD: src/lib/libc/ia64/_fpmath.h,v 1.6 2005/03/07 04:55:40 das Exp $ |
| 28 | */ |
| 29 | |
| 30 | #include <sys/endian.h> |
| 31 | |
| 32 | union IEEEl2bits { |
| 33 | long double e; |
| 34 | struct { |
| 35 | #if _BYTE_ORDER == _LITTLE_ENDIAN |
| 36 | unsigned int manl :32; |
| 37 | unsigned int manh :32; |
| 38 | unsigned int exp :15; |
| 39 | unsigned int sign :1; |
| 40 | unsigned long junk :48; |
| 41 | #else /* _BIG_ENDIAN */ |
| 42 | unsigned long junk :48; |
| 43 | unsigned int sign :1; |
| 44 | unsigned int exp :15; |
| 45 | unsigned int manh :32; |
| 46 | unsigned int manl :32; |
| 47 | #endif |
| 48 | } bits; |
| 49 | }; |
| 50 | |
| 51 | #if _BYTE_ORDER == _LITTLE_ENDIAN |
| 52 | #define LDBL_NBIT 0x80000000 |
| 53 | #define mask_nbit_l(u) ((u).bits.manh &= ~LDBL_NBIT) |
| 54 | #else /* _BIG_ENDIAN */ |
| 55 | /* |
| 56 | * XXX This doesn't look right. Very few machines have a different |
| 57 | * endianness for integers and floating-point, and in nextafterl() |
| 58 | * we assume that none do. If you have an environment for testing |
| 59 | * this, please let me know. --das |
| 60 | */ |
| 61 | #define LDBL_NBIT 0x80 |
| 62 | #define mask_nbit_l(u) ((u).bits.manh &= ~LDBL_NBIT) |
| 63 | #endif |
| 64 | |
| 65 | #define LDBL_MANH_SIZE 32 |
| 66 | #define LDBL_MANL_SIZE 32 |
| 67 | |
| 68 | #define LDBL_TO_ARRAY32(u, a) do { \ |
| 69 | (a)[0] = (uint32_t)(u).bits.manl; \ |
| 70 | (a)[1] = (uint32_t)(u).bits.manh; \ |
| 71 | } while(0) |