Annotation of researchv10dc/cmd/lcc/ph/machin.h, revision 1.1.1.1

1.1       root        1: /* As per your license agreement, your distribution is not to be moved or copied outside the Designated Site
                      2:  * without specific permission from Plum Hall Inc.
                      3:  */
                      4: 
                      5: #ifndef MACHIN_H
                      6: #define MACHIN_H
                      7: 
                      8: #include <limits.h>
                      9: #define SIGNED_CHAR            (CHAR_MIN < 0)          /* Does char sign-extend ... */
                     10: #define UNSIGNED_CHAR  (CHAR_MIN == 0)         /* ... or not? */
                     11: 
                     12: #define MAX_UCHAR              UCHAR_MAX               /* biggest unsigned character */
                     13: #define MAX_USHORT             USHRT_MAX               /* biggest unsigned short */
                     14: #define MAX_UINT               UINT_MAX                /* biggest unsigned int */
                     15: #define MAX_INT                        INT_MAX                 /* biggest int */
                     16: #define MAX_ULONG              ULONG_MAX               /* biggest unsigned long */
                     17: #define MAX_LONG               LONG_MAX                /* biggest long int */
                     18: 
                     19: #include <float.h>
                     20: #define FDIGITS_MAX    (FLT_DIG - 1)   /* number of significant digits for single precision comparison. */
                     21: #define DIGITS_MAX             (DBL_DIG - 1)   /* number of significant digits for double precision comparison. */
                     22: #define LDIGITS_MAX    (LDBL_DIG - 1)  /* number of significant digits for long double precision comparison. */
                     23: #endif /* MACHIN_H */

unix.superglobalmegacorp.com

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