1 /* $NetBSD: float.h,v 1.4 1994/10/26 21:09:41 cgd Exp $ */ 2 3 /* 4 * Copyright (c) 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * @(#)float.h 8.1 (Berkeley) 6/10/93 36 */ 37 38 #define FLT_RADIX 2 /* b */ 39 #define FLT_ROUNDS 1 /* FP addition rounds to nearest */ 40 41 #define FLT_MANT_DIG 24 /* p */ 42 #define FLT_EPSILON 1.19209290E-07F /* b**(1-p) */ 43 #define FLT_DIG 6 /* floor((p-1)*log10(b))+(b == 10) */ 44 #define FLT_MIN_EXP -125 /* emin */ 45 #define FLT_MIN 1.17549435E-38F /* b**(emin-1) */ 46 #define FLT_MIN_10_EXP -37 /* ceil(log10(b**(emin-1))) */ 47 #define FLT_MAX_EXP 128 /* emax */ 48 #define FLT_MAX 3.40282347E+38F /* (1-b**(-p))*b**emax */ 49 #define FLT_MAX_10_EXP 38 /* floor(log10((1-b**(-p))*b**emax)) */ 50 51 #define DBL_MANT_DIG 53 52 #define DBL_EPSILON 2.2204460492503131E-16 53 #define DBL_DIG 15 54 #define DBL_MIN_EXP -1021 55 #define DBL_MIN 2.225073858507201E-308 56 #define DBL_MIN_10_EXP -307 57 #define DBL_MAX_EXP 1024 58 #define DBL_MAX 1.797693134862316E+308 59 #define DBL_MAX_10_EXP 308 60 61 #define LDBL_MANT_DIG DBL_MANT_DIG 62 #define LDBL_EPSILON DBL_EPSILON 63 #define LDBL_DIG DBL_DIG 64 #define LDBL_MIN_EXP DBL_MIN_EXP 65 #define LDBL_MIN DBL_MIN 66 #define LDBL_MIN_10_EXP DBL_MIN_10_EXP 67 #define LDBL_MAX_EXP DBL_MAX_EXP 68 #define LDBL_MAX DBL_MAX 69 #define LDBL_MAX_10_EXP DBL_MAX_10_EXP 70