Return to float.h CVS log

Up to [CSRG BSD Unix] / 43BSDReno / sys / hp300

Annotation of 43BSDReno/sys/hp300/float.h, revision 1.1.1.1

1.1       root        1: /*
                      2:  * Copyright (c) 1989 Regents of the University of California.
                      3:  * All rights reserved.
                      4:  *
                      5:  * Redistribution is only permitted until one year after the first shipment
                      6:  * of 4.4BSD by the Regents.  Otherwise, redistribution and use in source and
                      7:  * binary forms are permitted provided that: (1) source distributions retain
                      8:  * this entire copyright notice and comment, and (2) distributions including
                      9:  * binaries display the following acknowledgement:  This product includes
                     10:  * software developed by the University of California, Berkeley and its
                     11:  * contributors'' in the documentation or other materials provided with the
                     12:  * distribution and in all advertising materials mentioning features or use
                     13:  * of this software.  Neither the name of the University nor the names of
                     14:  * its contributors may be used to endorse or promote products derived from
                     15:  * this software without specific prior written permission.
                     16:  * THIS SOFTWARE IS PROVIDED AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
                     17:  * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
                     18:  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
                     19:  *
                     20:  *     @(#)float.h     7.1 (Berkeley) 5/8/90
                     21:  */
                     22: 
                     23: #define FLT_RADIX      2               /* b */
                     24: #define FLT_ROUNDS     1               /* FP addition rounds to nearest */
                     25: 
                     26: #define FLT_MANT_DIG   24              /* p */
                     27: #define FLT_EPSILON    1.19209290E-07F /* b**(1-p) */
                     28: #define FLT_DIG                6               /* floor((p-1)*log10(b))+(b == 10) */
                     29: #define FLT_MIN_EXP    -125            /* emin */
                     30: #define FLT_MIN                1.17549435E-38F /* b**(emin-1) */
                     31: #define FLT_MIN_10_EXP -37             /* ceil(log10(b**(emin-1))) */
                     32: #define FLT_MAX_EXP    128             /* emax */
                     33: #define FLT_MAX                3.40282347E+38F /* (1-b**(-p))*b**emax */
                     34: #define FLT_MAX_10_EXP 38              /* floor(log10((1-b**(-p))*b**emax)) */
                     35: 
                     36: #define DBL_MANT_DIG   53
                     37: #define DBL_EPSILON    2.2204460492503131E-16
                     38: #define DBL_DIG                15
                     39: #define DBL_MIN_EXP    -1021
                     40: #define DBL_MIN                2.225073858507201E-308
                     41: #define DBL_MIN_10_EXP -307
                     42: #define DBL_MAX_EXP    1024
                     43: #define DBL_MAX                1.797693134862316E+308
                     44: #define DBL_MAX_10_EXP 308
                     45: 
                     46: #define LDBL_MANT_DIG  DBL_MANT_DIG
                     47: #define LDBL_EPSILON   DBL_EPSILON
                     48: #define LDBL_DIG       DBL_DIG
                     49: #define LDBL_MIN_EXP   DBL_MIN_EXP
                     50: #define LDBL_MIN       DBL_MIN
                     51: #define LDBL_MIN_10_EXP        DBL_MIN_10_EXP
                     52: #define LDBL_MAX_EXP   DBL_MAX_EXP
                     53: #define LDBL_MAX       DBL_MAX
                     54: #define LDBL_MAX_10_EXP        DBL_MAX_10_EXP

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.