1 /* Everything you wanted to know about your machine and C compiler,
2 but didn't know who to ask. */
8 /* Author: Steven Pemberton, CWI, Amsterdam; steven@cwi.nl
9 Bugfixes and upgrades gratefully received.
11 Copyright (c) 1988, 1989, 1990 Steven Pemberton, CWI, Amsterdam.
14 Changes by Richard Stallman:
15 Undef CHAR_BIT, etc., if defined in stdio.h, Richard Stallman, Aug 90.
16 In EPROP, avoid a <= old if bad is set, Richard Stallman, May 91.
17 Use gstddef.h, not stddef.h, Richard Stallman, Nov 91.
18 Don't declare malloc, instead cast the value, Richard Stallman, Nov 91.
19 Include sys/types.h before signal.h, Apr 92.
20 Support NO_LONG_DOUBLE_IO in f_define and f_rep; new fn fake_f_rep, Apr 92.
21 Enclose -f output in #ifndef _FLOAT_H___, Richard Stallman, May 92.
23 Add #undef before every #define, Jim Wilson, Dec 92.
25 Changes by Paul Eggert, installed Feb 93:
26 (fake_f_rep): Clear all of u, initially. Make the ints in u unsigned.
27 (f_define): Use ordinary constants for long double
28 if it's same width as double. Make __convert_long_double_i unsigned.
29 Richard Stallman, May 93:
30 In F_check, check NO_LONG_DOUBLE_IO.
32 Changes by Stephen Moshier, installed Sep 93:
33 (FPROP): Recognize 80387 or 68881 XFmode format.
37 With luck and a following wind, just the following will work:
38 cc enquire.c -o enquire
39 You may get some messages about unreachable code, which you can ignore.
41 If your compiler doesn't support: add flag:
42 signed char (eg pcc) -DNO_SC
44 unsigned short and long -DNO_UI
46 signal(), or setjmp/longjmp() -DNO_SIG
47 %Lf in printf -DNO_LONG_DOUBLE_IO
49 Try to compile first with no flags, and see if you get any errors -
50 you might be surprised. (Most non-ANSI compilers need -DNO_SC, though.)
51 Some compilers need a -f flag for floating point.
53 Don't use any optimisation flags: the program may not work if you do.
54 Though "while (a+1.0-a-1.0 == 0.0)" may look like "while(1)" to an
55 optimiser, to a floating-point unit there's a world of difference.
57 Some compilers offer various flags for different floating point
58 modes; it's worth trying all possible combinations of these.
60 Add -DID=\"name\" if you want the machine/flags identified in the output.
63 Because of bugs and/or inadequacies, some compilers need the following
66 If your C preprocessor doesn't have the predefined __FILE__ macro, and
67 you don't want to call this file enquire.c but, say, tell.c, add the
68 flag -DFILENAME=\"tell.c\" .
70 Some compilers won't accept the line "#include FILENAME".
71 Add flag -DNO_FILE. In that case, this file *must* be called enquire.c.
73 Some compilers can't cope with "#ifdef __FILE__". Use -DFILENAME=
74 or -DNO_FILE as above.
76 Some naughty compilers define __STDC__, but don't really support it.
77 Some define it as 0, in which case we treat it as undefined.
78 But if your compiler defines it, and isn't really ANSI C,
79 add flag -DNO_STDC. (To those compiler writers: for shame).
81 Some naughty compilers define __STDC__, but don't have the stddef.h
82 include file. Add flag -DNO_STDDEF.
84 Summary of naughty-compiler flags:
85 If your compiler doesn't support: add flag:
86 __FILE__ (and you changed the filename) -DFILENAME=\"name.c\"
87 #ifdef __FILE__ -DNO_FILE or -DFILENAME=...
88 #include FILENAME -DNO_FILE
89 __STDC__ (properly) -DNO_STDC
92 Some systems crash when you try to malloc all store. To save users of
93 such defective systems too much grief, they may compile with -DNO_MEM,
94 which ignores that bit of the code.
96 While it is not our policy to support defective compilers, pity has been
97 taken on people with compilers that can't produce object files bigger than
98 32k (especially since it was an easy addition). Compile the program
99 into separate parts like this:
100 cc -DSEP -DPASS0 -o p0.o <other flags> enquire.c
101 cc -DSEP -DPASS1 -o p1.o <other flags> enquire.c
102 cc -DSEP -DPASS2 -o p2.o <other flags> enquire.c
103 cc -DSEP -DPASS3 -o p3.o <other flags> enquire.c
104 cc -o enquire p0.o p1.o p2.o p3.o
107 You may possibly need to add some calls to signal() for other sorts of
108 exception on your machine than SIGFPE, and SIGOVER. See lines beginning
109 #ifdef SIGxxx in main() (and communicate the differences to me!).
112 Run without argument to get the information as English text. If run
113 with argument -l (e.g. enquire -l), output is a series of #define's for
114 the ANSI standard limits.h include file, excluding MB_MAX_CHAR. If run
115 with argument -f, output is a series of #define's for the ANSI standard
116 float.h include file (according to ANSI C Draft of Dec 7, 1988).
117 Flag -v gives verbose output: output includes the English text above
118 as C comments. The program exit(0)'s if everything went ok, otherwise
119 it exits with a positive number, telling how many problems there were.
121 VERIFYING THE COMPILER
122 If, having produced the float.h and limits.h header files, you want to
123 verify that the compiler reads them back correctly (there are a lot of
124 boundary cases, of course, like minimum and maximum numbers), you can
125 recompile enquire.c with -DVERIFY set (plus the other flags that you used
126 when compiling the version that produced the header files). This then
127 recompiles the program so that it #includes "limits.h" and "float.h",
128 and checks that the constants it finds there are the same as the
129 constants it produces. Run the resulting program with enquire -fl.
130 Very few compilers have passed without error.
131 NB: You *must* recompile with the same compiler and flags, otherwise
132 you may get odd results.
134 You can also use this option if your compiler already has both files,
135 and you want to confirm that this program produces the right results.
138 This program is now quite trustworthy, and suspicious and wrong output
139 may well be caused by bugs in the compiler, not in the program (however
140 of course, this is not guaranteed, and no responsibility can be
143 The program only works if overflows are ignored by the C system or
144 are catchable with signal().
146 If the program fails to run to completion (often with the error message
147 "Unexpected signal at point x"), this often turns out to be a bug in the
148 C compiler's run-time system. Check what was about to be printed, and
149 try to narrow the problem down.
151 Another possible problem is that you have compiled the program to produce
152 loss-of-precision arithmetic traps. The program cannot cope with these,
153 and you should re-compile without them. (They should never be the default).
155 Make sure you compiled with optimisation turned off.
157 Output preceded by *** WARNING: identifies behaviour of the C system
158 deemed incorrect by the program. Likely problems are that printf or
159 scanf don't cope properly with certain boundary numbers: this program
160 goes to a lot of trouble to calculate its values, and these values
161 are mostly boundary numbers. Experience has shown that often printf
162 cannot cope with these values, and so in an attempt to increase
163 confidence in the output, for each float and double that is printed,
164 the printed value is checked by using sscanf to read it back.
165 Care is taken that numbers are printed with enough digits to uniquely
166 identify them, and therefore that they can be read back identically.
167 If the number read back is different, then there is probably a bug in
168 printf or sscanf, and the program prints the warning message.
169 If the two numbers in the warning look identical, then printf is more
170 than likely rounding the last digit(s) incorrectly. To put you at ease
171 that the two really are different, the bit patterns of the two numbers
172 are also printed. The difference is very likely in the last bit.
173 Many scanf's read the minimum double back as 0.0, and similarly cause
174 overflow when reading the maximum double. This program quite ruthlessly
175 declares all these behaviours faulty. The point is that if you get
176 one of these warnings, the output may be wrong, so you should check
177 the result carefully if you intend to use the results. Of course, printf
178 and sscanf may both be wrong, and cancel each other out, so you should
179 check the output carefully anyway.
181 The warning that "a cast didn't work" refers to cases like this:
184 #define C 1.234567890123456789
186 if (f != (float) C) printf ("Wrong!");
188 A faulty compiler will widen f to double and ignore the cast to float,
189 and because there is more accuracy in a double than a float, fail to
190 recognise that they are the same. In the actual case in point, f and C
191 are passed as parameters to a function that discovers they are not equal,
192 so it's just possible that the error was in the parameter passing,
193 not in the cast (see function Validate()).
194 For ANSI C, which has float constants, the error message is "constant has
198 If the program doesn't work for you for any reason that can't be
199 narrowed down to a problem in the C compiler, or it has to be changed in
200 order to get it to compile, or it produces suspicious output (like a very
201 low maximum float, for instance), please mail the problem and an example
202 of the incorrect output to steven@cwi.nl or ..!hp4nl!cwi.nl!steven, so that
203 improvements can be worked into future versions; cwi.nl is the European
204 backbone, and is connected to uunet and other fine hosts.
206 The program tries to catch and diagnose bugs in the compiler/run-time
207 system. I would be especially pleased to have reports of failures so
208 that I can improve this service.
210 I apologise unreservedly for the contorted use of the preprocessor...
213 You may copy and distribute verbatim copies of this source file.
215 You may modify this source file, and copy and distribute such
216 modified versions, provided that you leave the copyright notice
217 at the top of the file and also cause the modified file to carry
218 prominent notices stating that you changed the files and the date
219 of any change; and cause the whole of any work that you distribute
220 or publish, that in whole or in part contains or is a derivative of
221 this program or any part thereof, to be licensed at no charge to
222 all third parties on terms identical to those here.
224 If you do have a fix to any problem, please send it to me, so that
225 other people can have the benefits.
227 While every effort has been taken to make this program as reliable as
228 possible, no responsibility can be taken for the correctness of the
229 output, nor suitability for any particular use.
231 This program is an offshoot of a project funded by public funds.
232 If you use this program for research or commercial use (i.e. more
233 than just for the fun of knowing about your compiler) mailing a short
234 note of acknowledgement may help keep enquire.c supported.
237 Many people have given time and ideas to making this program what it is.
238 To all of them thanks, and apologies for not mentioning them by name.
241 Originally started as a program to generate configuration constants
242 for a large piece of software we were writing, which later took on
244 1.0 Length 6658!; end 1984?
245 Unix only. Only printed a dozen maximum int/double values.
246 2.0 Length 10535; Spring 1985
247 Prints values as #defines (about 20 of them)
248 More extensive floating point, using Cody and Waite
249 Handles signals better
250 Programs around optimisations
252 3.0 Length 12648; Aug 1987; prints about 42 values
253 Added PASS stuff, so treats float as well as double
254 4.0 Length 33891; Feb 1989; prints around 85 values
255 First GNU version (for gcc, where they call it hard-params.c)
256 Generates float.h and limits.h files
258 Generates warnings for dubious output
259 4.1 Length 47738; April 1989
260 Added VERIFY and TEST
261 4.2 Length 63442; Feb 1990
264 Added check for pseudo-unsigned chars
265 Added description for each #define output
266 Added check for absence of defines during verify
268 Added NO_STDC and NO_FILE
269 Fixed alignments output
270 4.3 Length 75000; Oct 1990; around 114 lines of output
271 Function xmalloc defined, Richard Stallman, June 89.
272 Alignments computed from member offsets rather than structure sizes,
273 Richard Stallman, Oct 89.
274 Print whether char* and int* pointers have the same format;
275 also char * and function *.
276 Update to Draft C version Dec 7, 1988
277 - types of constants produced in limits.h
278 (whether to put a U after unsigned shorts and chars and
279 whether to output -1024 as (-1023-1))
280 - values of SCHAR_MIN/MAX
281 - values of *_EPSILON (not the smallest but the effective smallest)
282 Added FILENAME, since standard C doesn't allow #define __FILE__
283 Renamed from config.c to enquire.c
284 Added size_t and ptrdiff_t enquiries
285 Added promotion enquiries
286 Added type checks of #defines
288 Changed endian to allow for cases where not all bits are used
289 Sanity check for max integrals
290 Fixed definition of setjmp for -DNO_SIG
291 Moved #define ... 0.0L inside #ifdef STDC, in case some cpp's tokenize
295 /* Set FILENAME to the name of this file */
298 #define FILENAME "enquire.c"
300 #ifdef __FILE__ /* It's a compiler bug if this fails. Compile with -DNO_FILE */
301 #define FILENAME __FILE__
303 #define FILENAME "enquire.c"
304 #endif /* __FILE__ */
306 #endif /* FILENAME */
308 /* If PASS isn't defined, then this is the first pass over this file. */
316 /* A description of the ANSI constants */
317 #define D_CHAR_BIT "Number of bits in a storage unit"
318 #define D_CHAR_MAX "Maximum char"
319 #define D_CHAR_MIN "Minimum char"
320 #define D_SCHAR_MAX "Maximum signed char"
321 #define D_SCHAR_MIN "Minimum signed char"
322 #define D_UCHAR_MAX "Maximum unsigned char (minimum is always 0)"
324 #define D_INT_MAX "Maximum %s"
325 #define D_INT_MIN "Minimum %s"
326 #define D_UINT_MAX "Maximum unsigned %s (minimum is always 0)"
328 #define D_FLT_ROUNDS "Addition rounds to 0: zero, 1: nearest, 2: +inf, 3: -inf, -1: unknown"
329 #define D_FLT_RADIX "Radix of exponent representation"
330 #define D_MANT_DIG "Number of base-FLT_RADIX digits in the significand of a %s"
331 #define D_DIG "Number of decimal digits of precision in a %s"
332 #define D_MIN_EXP "Minimum int x such that FLT_RADIX**(x-1) is a normalised %s"
333 #define D_MIN_10_EXP "Minimum int x such that 10**x is a normalised %s"
334 #define D_MAX_EXP "Maximum int x such that FLT_RADIX**(x-1) is a representable %s"
335 #define D_MAX_10_EXP "Maximum int x such that 10**x is a representable %s"
336 #define D_MAX "Maximum %s"
337 #define D_EPSILON "Difference between 1.0 and the minimum %s greater than 1.0"
338 #define D_MIN "Minimum normalised %s"
340 /* Procedure just marks the functions that don't return a result */
342 #define Procedure int
344 #define Procedure void
347 /* Some bad compilers define __STDC__, when they don't support it.
348 Compile with -DNO_STDC to get round this.
352 #if __STDC__ /* If __STDC__ is 0, assume it isn't supported */
358 /* Stuff different for ANSI C, and old C:
359 ARGS and NOARGS are used for function prototypes.
360 Volatile is used to reduce the chance of optimisation,
361 and to prevent variables being put in registers (when setjmp/longjmp
362 wouldn't work as we want)
363 Long_double is the longest floating point type available.
364 stdc is used in tests like "if (stdc)", which is less ugly than #ifdef.
365 U is output after unsigned constants.
370 #define NOARGS (void)
371 #define Volatile volatile
372 #define Long_double long double
376 #else /* Old style C */
380 #define Volatile static
381 #define Long_double double
392 #include "gstddef.h" /* for size_t: if this fails, define NO_STDDEF */
399 #include <sys/types.h>
404 /* Kludge around the possibility that <stdio.h> includes <limits.h> */
420 #define Vprintf if (V) printf
421 #define Unexpected(place) if (setjmp(lab)!=0) croak(place)
422 #define fabs(x) (((x)<0.0)?(-x):(x))
428 /* Prototypes for what's to come: */
433 char *malloc (); /* Old style prototype */
435 char *malloc ARGS((size_t size));
438 Procedure exit ARGS((int status));
440 char *f_rep ARGS((int precision, Long_double val));
441 char *fake_f_rep ARGS((char *type, Long_double val));
443 int maximum_int NOARGS;
446 Procedure sprop NOARGS;
447 Procedure iprop NOARGS;
448 Procedure lprop NOARGS;
449 Procedure usprop NOARGS;
450 Procedure uiprop NOARGS;
451 Procedure ulprop NOARGS;
452 int fprop ARGS((int bits_per_byte));
453 int dprop ARGS((int bits_per_byte));
454 int ldprop ARGS((int bits_per_byte));
455 Procedure efprop ARGS((int fprec, int dprec, int lprec));
456 Procedure edprop ARGS((int fprec, int dprec, int lprec));
457 Procedure eldprop ARGS((int fprec, int dprec, int lprec));
459 int setmode ARGS((char *s));
460 Procedure farewell ARGS((int bugs));
461 Procedure describe ARGS((char *description, char *extra));
462 Procedure missing ARGS((char *s));
463 Procedure fmissing ARGS((char *s));
464 Procedure check_defines NOARGS;
465 Procedure bitpattern ARGS((char *p, unsigned int size));
466 int ceil_log ARGS((int base, Long_double x));
467 Procedure croak ARGS((int place));
468 Procedure eek_a_bug ARGS((char *problem));
469 Procedure endian ARGS((int bits_per_byte));
470 int exponent ARGS((Long_double x, double *fract, int *exp));
471 int floor_log ARGS((int base, Long_double x));
472 Procedure f_define ARGS((char *desc, char *extra, char *sort, char *name,
473 int prec, Long_double val, char *mark));
474 Procedure i_define ARGS((char *desc, char *extra, char *sort, char *name,
475 long val, long lim, long req, char *mark));
476 Procedure u_define ARGS((char *desc, char *extra, char *sort, char *name,
477 unsigned long val, unsigned long req, char *mark));
479 #ifdef NO_SIG /* There's no signal(), or setjmp/longjmp() */
481 /* Dummy routines instead */
483 int setjmp ARGS((int lab));
486 int setjmp(lab) int lab; { return(0); }
487 Procedure signal(i, p) int i, (*p)(); {}
491 Procedure overflow(sig) int sig; { /* what to do on over/underflow */
492 signal(sig, overflow);
498 int V= 0, /* verbose */
499 L= 0, /* produce limits.h */
500 F= 0, /* produce float.h */
501 bugs=0; /* The number of (possible) bugs in the output */
503 char co[4], oc[4]; /* Comment starter and ender symbols */
505 int bits_per_byte; /* the number of bits per unit returned by sizeof() */
506 int flt_rounds; /* The calculated value of FLT_ROUNDS */
507 int flt_radix; /* The calculated value of FLT_RADIX */
510 /* Set the fp modes on a SUN with 68881 chip, to check that different
511 rounding modes etc. get properly detected.
512 Compile with -f68881 for cc, -m68881 for gcc, and with additional flag
513 -DTEST. Run with additional parameter +hex-number, to set the 68881 mode
514 register to hex-number
517 /* Bits 0x30 = rounding mode */
518 #define ROUND_BITS 0x30
519 #define TO_NEAREST 0x00
521 #define TO_MINUS_INF 0x20
522 #define TO_PLUS_INF 0x30 /* The SUN FP user's guide seems to be wrong here */
524 /* Bits 0xc0 = extended rounding */
525 #define EXT_BITS 0xc0
526 #define ROUND_EXTENDED 0x00
527 #define ROUND_SINGLE 0x40
528 #define ROUND_DOUBLE 0x80
531 #define EXE_INEX1 0x100
532 #define EXE_INEX2 0x200
534 #define EXE_UNFL 0x800
535 #define EXE_OVFL 0x1000
536 #define EXE_OPERR 0x2000
537 #define EXE_SNAN 0x4000
538 #define EXE_BSUN 0x8000
540 /* Only used for testing, on a Sun with 68881 chip */
541 /* Print the FP mode */
542 printmode(new) unsigned new; {
544 printf("New fp mode:\n");
545 printf(" Round toward ");
546 switch (new & ROUND_BITS) {
547 case TO_NEAREST: printf("nearest"); break;
548 case TO_ZERO: printf("zero"); break;
549 case TO_MINUS_INF: printf("minus infinity"); break;
550 case TO_PLUS_INF: printf("plus infinity"); break;
551 default: printf("???"); break;
554 printf("\n Extended rounding precision: ");
556 switch (new & EXT_BITS) {
557 case ROUND_EXTENDED: printf("extended"); break;
558 case ROUND_SINGLE: printf("single"); break;
559 case ROUND_DOUBLE: printf("double"); break;
560 default: printf("???"); break;
563 printf("\n Enabled exceptions:");
564 if (new & (unsigned) EXE_INEX1) printf(" inex1");
565 if (new & (unsigned) EXE_INEX2) printf(" inex2");
566 if (new & (unsigned) EXE_DZ) printf(" dz");
567 if (new & (unsigned) EXE_UNFL) printf(" unfl");
568 if (new & (unsigned) EXE_OVFL) printf(" ovfl");
569 if (new & (unsigned) EXE_OPERR) printf(" operr");
570 if (new & (unsigned) EXE_SNAN) printf(" snan");
571 if (new & (unsigned) EXE_BSUN) printf(" bsun");
575 /* Only used for testing, on a Sun with 68881 chip */
576 /* Set the FP mode */
577 int setmode(s) char *s; {
578 unsigned mode=0, dig;
583 if (c>='0' && c<='9') dig= c-'0';
584 else if (c>='a' && c<='f') dig= c-'a'+10;
585 else if (c>='A' && c<='F') dig= c-'A'+10;
594 int setmode(s) char *s; {
595 fprintf(stderr, "Can't set mode: not compiled with TEST\n");
600 Procedure farewell(bugs) int bugs; {
601 if (bugs == 0) exit(0);
602 printf("\n%sFor hints on dealing with the ", co);
603 if (bugs == 1) printf("problem");
604 else printf("%d problems", bugs);
605 printf(" above\n see the section 'TROUBLESHOOTING' in the file ");
606 printf("%s%s\n", FILENAME, oc);
610 /* The program has received a signal where it wasn't expecting one */
611 Procedure croak(place) int place; {
612 printf("*** Unexpected signal at point %d\n", place);
613 farewell(bugs+1); /* An exit isn't essential here, but avoids loops */
616 /* This is here in case alloca.c is used, which calls this. */
617 char *xmalloc(size) unsigned size; {
618 char *value = (char *)malloc(size);
620 fprintf(stderr, "Virtual memory exceeded\n");
629 /* Find the maximum integer */
630 Volatile int newi, int_max, two=2;
632 /* Calculate maxint ***********************************/
633 /* Calculate 2**n-1 until overflow - then use the previous value */
637 if (setjmp(lab)==0) { /* Yields int_max */
638 while(newi>int_max) {
647 int main(argc, argv) int argc; char *argv[]; {
648 int dprec, fprec, lprec;
649 int i; char *s; int bad;
652 signal(SIGFPE, overflow);
655 signal(SIGOVER, overflow);
657 /* Add more calls as necessary */
662 for (i=1; i < argc; i++) {
668 case 'v': V=1; break;
669 case 'l': L=1; break;
670 case 'f': F=1; break;
671 default: bad=1; break;
674 } else if (*s == '+') {
681 "Usage: %s [-vlf]\n v=Verbose l=Limits.h f=Float.h\n",
686 co[0]= '/'; oc[0]= ' ';
687 co[1]= '*'; oc[1]= '*';
688 co[2]= ' '; oc[2]= '/';
689 co[3]= '\0'; oc[3]= '\0';
691 co[0]= '\0'; oc[0]= '\0';
695 if (L) printf("%slimits.h%s\n", co, oc);
696 if (F) printf("%sfloat.h%s\n", co, oc);
698 printf ("#ifndef _FLOAT_H___\n");
699 printf ("#define _FLOAT_H___\n");
702 printf("%sProduced on %s by enquire version %s, CWI, Amsterdam%s\n",
703 co, ID, VERSION, oc);
705 printf("%sProduced by enquire version %s, CWI, Amsterdam%s\n",
710 printf("%sVerification phase%s\n", co, oc);
714 Vprintf("%sCompiled without signal(): %s%s\n",
716 "there's nothing that can be done if overflow occurs",
720 Vprintf("%sCompiled without signed char%s\n", co, oc);
723 Vprintf("%Compiled without unsigned char%s\n", co, oc);
726 Vprintf("%Compiled without unsigned short or long%s\n", co, oc);
729 Vprintf("%sCompiler claims to be ANSI C level %d%s\n",
732 Vprintf("%sCompiler does not claim to be ANSI C%s\n", co, oc);
737 maxint= maximum_int();
738 bits_per_byte= basic();
741 fprec= fprop(bits_per_byte);
742 dprec= dprop(bits_per_byte);
743 lprec= ldprop(bits_per_byte);
744 efprop(fprec, dprec, lprec);
745 edprop(fprec, dprec, lprec);
746 eldprop(fprec, dprec, lprec);
752 /* An extra goody: the approximate amount of data-space */
753 /* Allocate store until no more available */
754 /* Different implementations have a different argument type
755 to malloc. Here we assume that it's the same type as
756 that which sizeof() returns */
757 size=1<<((bits_per_byte*sizeof(int))-2);
760 while ( malloc((false()?sizeof(int):size)) !=
768 Vprintf("%sMemory mallocatable ~= %ld Kbytes%s\n",
769 co, (total+511)/512, oc);
773 printf ("#endif %s _FLOAT_H___%s\n", co, oc);
776 return bugs; /* To keep compilers and lint happy */
779 Procedure eek_a_bug(problem) char *problem; {
780 /* The program has discovered a problem */
781 printf("\n%s*** WARNING: %s%s\n", co, problem, oc);
785 Procedure describe(description, extra) char *description, *extra; {
786 /* Produce the description for a #define */
788 printf(description, extra);
792 Procedure i_define(desc, extra, sort, name, val, lim, req, mark)
793 char *desc, *extra, *sort, *name; long val, lim, req; char *mark; {
794 /* Produce a #define for a signed int type */
795 describe(desc, extra);
796 printf("#undef %s%s\n", sort, name);
798 printf("#define %s%s %ld%s\n", sort, name, val, mark);
799 } else if (val + lim < 0) {
800 /* We may not produce a constant like -1024 if the max
801 allowable value is 1023. It has then to be output as
802 -1023-1. lim is the max allowable value. */
803 printf("#define %s%s (%ld%s%ld%s)\n",
804 sort, name, -lim, mark, val+lim, mark);
806 printf("#define %s%s (%ld%s)\n", sort, name, val, mark);
808 /* If VERIFY is not set, val and req are just the same value;
809 if it is set, val is the value as calculated, and req is
810 the #defined constant
813 printf("%s*** Verify failed for above #define!\n", co);
814 printf(" Compiler has %ld for value%s\n\n", req, oc);
820 Procedure u_define(desc, extra, sort, name, val, req, mark)
821 char *desc, *extra, *sort, *name; unsigned long val, req; char *mark; {
822 /* Produce a #define for an unsigned value */
823 describe(desc, extra);
824 printf("#undef %s%s\n", sort, name);
825 printf("#define %s%s %lu%s%s\n", sort, name, val, U, mark);
827 printf("%s*** Verify failed for above #define!\n", co);
828 printf(" Compiler has %lu for value%s\n\n", req, oc);
834 Procedure f_define(desc, extra, sort, name, precision, val, mark)
835 char *desc, *extra, *sort, *name; int precision;
836 Long_double val; char *mark; {
837 /* Produce a #define for a float/double/long double */
838 describe(desc, extra);
839 printf ("#undef %s%s\n", sort, name);
841 #ifdef NO_LONG_DOUBLE_IO
842 static int union_defined = 0;
843 if (sizeof(double) != sizeof(Long_double)
844 && !strcmp(sort, "LDBL")) {
845 if (!union_defined) {
846 printf("#ifndef __LDBL_UNION__\n");
847 printf("#define __LDBL_UNION__\n");
848 printf("union __convert_long_double {\n");
849 printf(" unsigned __convert_long_double_i[4];\n");
850 printf(" long double __convert_long_double_d;\n");
855 printf("#define %s%s %s\n",
856 sort, name, fake_f_rep("long double", val));
858 printf("#define %s%s %s%s\n",
859 sort, name, f_rep(precision, val), mark);
862 printf("#define %s%s %s%s\n",
863 sort, name, f_rep(precision, val), mark);
865 } else if (*mark == 'F') {
866 /* non-ANSI C has no float constants, so cast the constant */
867 printf("#define %s%s ((float)%s)\n",
868 sort, name, f_rep(precision, val));
870 printf("#define %s%s %s\n", sort, name, f_rep(precision, val));
875 int floor_log(base, x) int base; Long_double x; {
876 /* return floor(log base(x)) */
878 while (x>=base) { r++; x/=base; }
882 int ceil_log(base, x) int base; Long_double x; {
884 while (x>1.0) { r++; x/=base; }
888 int exponent(x, fract, exp) Long_double x; double *fract; int *exp; {
889 /* Split x into a fraction and a power of ten;
890 returns 0 if x is unusable, 1 otherwise.
891 Only used for error messages about faulty output.
900 if (x==0.0) return 1;
904 if (old==x) return 0;
909 if (old==x) return 0;
912 if (neg) *fract= (double) -x;
913 else *fract=(double) x;
918 /* Print a value of type TYPE with value VAL,
919 assuming that sprintf can't handle this type properly (without truncation).
920 We create an expression that uses type casting to create the value from
923 char *fake_f_rep(type, val) char *type; Long_double val; {
924 static char buf[1024];
925 union { unsigned int i[4]; Long_double ld;} u;
926 u.i[0] = u.i[1] = u.i[2] = u.i[3] = 0;
928 sprintf(buf, "(__extension__ ((union __convert_long_double) {0x%x, 0x%x, 0x%x, 0x%x}).__convert_long_double_d)",
929 u.i[0], u.i[1], u.i[2], u.i[3]);
933 char *f_rep(precision, val) int precision; Long_double val; {
934 /* Return the floating representation of val */
935 static char buf[1024];
937 #ifdef NO_LONG_DOUBLE_IO
940 if (sizeof(double) == sizeof(Long_double))
944 /* Assume they're the same, and use non-stdc format */
945 /* This is for stdc compilers using non-stdc libraries */
946 sprintf(buf, "%.*e", precision, d);
948 /* It had better support Le then */
949 sprintf(buf, "%.*Le", precision, val);
954 Procedure bitpattern(p, size) char *p; unsigned int size; {
955 /* Printf the bit-pattern of p */
959 for (i=1; i<=size; i++) {
962 for (j=bits_per_byte-1; j>=0; j--)
963 printf("%c", (c>>j)&1 ? '1' : '0');
964 if (i!=size) printf(" ");
968 #define Order(x, px, mode)\
969 printf("%s%s ", co, mode); for (i=0; i<sizeof(x); i++) px[i]= ab[i]; \
970 for (i=1; i<=sizeof(x); i++) { c=((x>>(bits_per_byte*(sizeof(x)-i)))&mask);\
971 putchar(c==0 ? '?' : (char)c); }\
974 Procedure endian(bits_per_byte) int bits_per_byte; {
975 /* Printf the byte-order used on this machine */
976 /*unsigned*/ short s=0;
977 /*unsigned*/ int j=0;
978 /*unsigned*/ long l=0;
980 char *ps= (char *) &s,
983 *ab= "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
984 unsigned int mask, i, c;
987 for (i=1; i<=(unsigned)bits_per_byte; i++) mask= (mask<<1)|1;
990 printf("%sCHARACTER ORDER%s\n", co, oc);
991 Order(s, ps, "short:");
992 Order(j, pj, "int: ");
993 Order(l, pl, "long: ");
997 Procedure missing(s) char *s; {
998 printf("%s*** #define %s missing from limits.h%s\n", co, s, oc);
1002 Procedure fmissing(s) char *s; {
1003 printf("%s*** #define %s missing from float.h%s\n", co, s, oc);
1007 /* To try and fool optimisers */
1008 int false() { return 0; }
1010 #define Promoted(x) (false()?(x):(-1))
1011 #define is_signed(x) (Promoted(x) < 0)
1012 #define sign_of(x) ((x)?"signed":"unsigned")
1015 #define sgn(x) ((is_signed(x))?Signed:Unsigned)
1017 #define showtype(t, x) Vprintf("%s%s %s %s%s\n", co, t, sign_of(is_signed(x)), type_of(sizeof(x)), oc)
1019 char *type_of(x) int x; {
1020 if (x == sizeof(char)) {
1021 if (sizeof(char) == sizeof(int)) return "char/short/int";
1022 if (sizeof(char) == sizeof(short)) return "char/short";
1025 if (x == sizeof(short)) {
1026 if (sizeof(short) == sizeof(int)) return "short/int";
1029 if (x == sizeof(int)) {
1030 if (sizeof(int) == sizeof(long)) return "int/long";
1033 if (x == sizeof(long)) return "long";
1034 return "unknown-type";
1037 char *ftype_of(x) int x; {
1038 if (x == sizeof(float)) {
1041 if (x == sizeof(double)) {
1042 if (sizeof(double) == sizeof(Long_double))
1043 return "(long)double";
1046 if (x == sizeof(Long_double)) {
1047 return "long double";
1049 return "unknown-type";
1052 Procedure typerr(name, esign, esize, sign, size)
1053 char *name; int esign, esize, sign, size;
1055 Vprintf("*** %s has wrong type: expected %s %s, found %s %s\n",
1056 name, sign_of(esign), type_of(esize),
1057 sign_of(sign), type_of(size));
1060 Procedure ftyperr(name, esize, size) char *name; int esize, size; {
1061 Vprintf("*** %s has wrong type: expected %s, found %s\n",
1062 name, ftype_of(esize), ftype_of(size));
1066 int si = 0; long sl = 0;
1067 unsigned int ui; unsigned long ul;
1068 short ss; unsigned short us;
1070 Vprintf("\n%sPROMOTIONS%s\n", co, oc);
1073 /* Possible warnings here; no problem */
1074 (sizeof(Promoted(si)) != sizeof(int)) ||
1075 (sizeof(Promoted(sl)) != sizeof(long)) ||
1076 (sizeof(Promoted(ss)) != sizeof(int)) ||
1077 (sizeof(Promoted(ui)) != sizeof(int)) ||
1078 (sizeof(Promoted(ul)) != sizeof(long)) ||
1079 (sizeof(Promoted(us)) != sizeof(int)) ||
1080 is_signed(ui) || is_signed(ul) ||
1081 !is_signed(si) || !is_signed(sl)
1084 eek_a_bug("promotions don't work properly in conditional expressions\n");
1087 showtype("unsigned short promotes to", Promoted((unsigned short)0));
1088 showtype("long+unsigned gives", sl+ui);
1092 #define checktype(x, n, s, t) if((sgn(x)!=s)||(sizeof(x)!=sizeof(t))) typerr(n, s, sizeof(t), sign_of(x), sizeof(x));
1094 #define fchecktype(x, n, t) if (sizeof(x) != sizeof(t)) ftyperr(n, sizeof(x), sizeof(t));
1096 Procedure check_defines() {
1097 /* ensure that all #defines are present and have the correct type */
1104 /* Implementations promote unsigned short differently */
1105 usign= is_signed((unsigned short)0);
1110 checktype(CHAR_BIT, "CHAR_BIT", Signed, int);
1112 missing("CHAR_BIT");
1115 checktype(CHAR_MAX, "CHAR_MAX", Signed, int);
1117 missing("CHAR_MAX");
1120 checktype(CHAR_MIN, "CHAR_MIN", Signed, int);
1122 missing("CHAR_MIN");
1125 checktype(SCHAR_MAX, "SCHAR_MAX", Signed, int);
1127 missing("SCHAR_MAX");
1130 checktype(SCHAR_MIN, "SCHAR_MIN", Signed, int);
1132 missing("SCHAR_MIN");
1135 checktype(UCHAR_MAX, "UCHAR_MAX", Signed, int);
1137 missing("UCHAR_MAX");
1140 checktype(SHRT_MAX, "SHRT_MAX", Signed, int);
1142 missing("SHRT_MAX");
1145 checktype(SHRT_MIN, "SHRT_MIN", Signed, int);
1147 missing("SHRT_MIN");
1150 checktype(INT_MAX, "INT_MAX", Signed, int);
1155 checktype(INT_MIN, "INT_MIN", Signed, int);
1160 checktype(LONG_MAX, "LONG_MAX", Signed, long);
1162 missing("LONG_MAX");
1165 checktype(LONG_MIN, "LONG_MIN", Signed, long);
1167 missing("LONG_MIN");
1170 checktype(USHRT_MAX, "USHRT_MAX", usign, int);
1172 missing("USHRT_MAX");
1175 checktype(UINT_MAX, "UINT_MAX", Unsigned, int);
1177 missing("UINT_MAX");
1180 checktype(ULONG_MAX, "ULONG_MAX", Unsigned, long);
1182 missing("ULONG_MAX");
1188 checktype(FLT_RADIX, "FLT_RADIX", Signed, int);
1190 fmissing("FLT_RADIX");
1193 checktype(FLT_MANT_DIG, "FLT_MANT_DIG", Signed, int);
1195 fmissing("FLT_MANT_DIG");
1198 checktype(FLT_DIG, "FLT_DIG", Signed, int);
1200 fmissing("FLT_DIG");
1203 checktype(FLT_ROUNDS, "FLT_ROUNDS", Signed, int);
1205 fmissing("FLT_ROUNDS");
1208 fchecktype(FLT_EPSILON, "FLT_EPSILON", float);
1210 fmissing("FLT_EPSILON");
1213 checktype(FLT_MIN_EXP, "FLT_MIN_EXP", Signed, int);
1215 fmissing("FLT_MIN_EXP");
1218 fchecktype(FLT_MIN, "FLT_MIN", float);
1220 fmissing("FLT_MIN");
1222 #ifdef FLT_MIN_10_EXP
1223 checktype(FLT_MIN_10_EXP, "FLT_MIN_10_EXP", Signed, int);
1225 fmissing("FLT_MIN_10_EXP");
1228 checktype(FLT_MAX_EXP, "FLT_MAX_EXP", Signed, int);
1230 fmissing("FLT_MAX_EXP");
1233 fchecktype(FLT_MAX, "FLT_MAX", float);
1235 fmissing("FLT_MAX");
1237 #ifdef FLT_MAX_10_EXP
1238 checktype(FLT_MAX_10_EXP, "FLT_MAX_10_EXP", Signed, int);
1240 fmissing("FLT_MAX_10_EXP");
1243 checktype(DBL_MANT_DIG, "DBL_MANT_DIG", Signed, int);
1245 fmissing("DBL_MANT_DIG");
1248 checktype(DBL_DIG, "DBL_DIG", Signed, int);
1250 fmissing("DBL_DIG");
1253 fchecktype(DBL_EPSILON, "DBL_EPSILON", double);
1255 fmissing("DBL_EPSILON");
1258 checktype(DBL_MIN_EXP, "DBL_MIN_EXP", Signed, int);
1260 fmissing("DBL_MIN_EXP");
1263 fchecktype(DBL_MIN, "DBL_MIN", double);
1265 fmissing("DBL_MIN");
1267 #ifdef DBL_MIN_10_EXP
1268 checktype(DBL_MIN_10_EXP, "DBL_MIN_10_EXP", Signed, int);
1270 fmissing("DBL_MIN_10_EXP");
1273 checktype(DBL_MAX_EXP, "DBL_MAX_EXP", Signed, int);
1275 fmissing("DBL_MAX_EXP");
1278 fchecktype(DBL_MAX, "DBL_MAX", double);
1280 fmissing("DBL_MAX");
1282 #ifdef DBL_MAX_10_EXP
1283 checktype(DBL_MAX_10_EXP, "DBL_MAX_10_EXP", Signed, int);
1285 fmissing("DBL_MAX_10_EXP");
1288 #ifdef LDBL_MANT_DIG
1289 checktype(LDBL_MANT_DIG, "LDBL_MANT_DIG", Signed, int);
1291 fmissing("LDBL_MANT_DIG");
1294 checktype(LDBL_DIG, "LDBL_DIG", Signed, int);
1296 fmissing("LDBL_DIG");
1299 fchecktype(LDBL_EPSILON, "LDBL_EPSILON", long double);
1301 fmissing("LDBL_EPSILON");
1304 checktype(LDBL_MIN_EXP, "LDBL_MIN_EXP", Signed, int);
1306 fmissing("LDBL_MIN_EXP");
1309 fchecktype(LDBL_MIN, "LDBL_MIN", long double);
1311 fmissing("LDBL_MIN");
1313 #ifdef LDBL_MIN_10_EXP
1314 checktype(LDBL_MIN_10_EXP, "LDBL_MIN_10_EXP", Signed, int);
1316 fmissing("LDBL_MIN_10_EXP");
1319 checktype(LDBL_MAX_EXP, "LDBL_MAX_EXP", Signed, int);
1321 fmissing("LDBL_MAX_EXP");
1324 fchecktype(LDBL_MAX, "LDBL_MAX", long double);
1326 fmissing("LDBL_MAX");
1328 #ifdef LDBL_MAX_10_EXP
1329 checktype(LDBL_MAX_10_EXP, "LDBL_MAX_10_EXP", Signed, int);
1331 fmissing("LDBL_MAX_10_EXP");
1340 #define SCHAR_MAX char_max
1343 #define SCHAR_MIN char_min
1346 #define UCHAR_MAX char_max
1351 #define CHAR_BIT char_bit
1354 #define CHAR_MAX char_max
1357 #define CHAR_MIN char_min
1360 #define SCHAR_MAX char_max
1363 #define SCHAR_MIN char_min
1366 #define UCHAR_MAX char_max
1370 /* Properties of type char */
1371 Volatile char c, char_max, char_min;
1372 Volatile int bits_per_byte, c_signed;
1377 /* Calculate number of bits per character *************************/
1378 c=1; bits_per_byte=0;
1379 do { c=c<<1; bits_per_byte++; } while(c!=0);
1381 if (((int)c)<0) c_signed=1;
1383 Vprintf("%schar = %d bits, %ssigned%s\n",
1384 co, (int)sizeof(c)*bits_per_byte, (c_signed?"":"un"), oc);
1385 char_bit=(long)(sizeof(c)*bits_per_byte);
1386 if (L) i_define(D_CHAR_BIT, "", "CHAR", "_BIT",
1387 char_bit, 0L, (long) CHAR_BIT, "");
1391 if (setjmp(lab)==0) { /* Yields char_max */
1392 while (c>char_max) {
1397 Vprintf("%sCharacter overflow generates a trap!%s\n", co, oc);
1401 if (setjmp(lab)==0) { /* Yields char_min */
1402 while (c<char_min) {
1407 if (c_signed && char_min == 0) {
1408 Vprintf("%sBEWARE! Chars are pseudo-unsigned:%s\n", co, oc);
1409 Vprintf("%s %s%s%s\n",
1410 "They contain only nonnegative values, ",
1411 "but sign extend when used as integers.", co, oc);
1416 /* Because of the integer promotions, you must use a U after
1417 the MAX_CHARS in the following cases */
1418 if ((sizeof(char) == sizeof(int)) && !c_signed) {
1419 u_define(D_CHAR_MAX, "", "CHAR", "_MAX",
1421 (long) CHAR_MAX, "");
1423 i_define(D_CHAR_MAX, "", "CHAR", "_MAX",
1424 (long) char_max, 0L,
1425 (long) CHAR_MAX, "");
1427 i_define(D_CHAR_MIN, "", "CHAR", "_MIN",
1428 (long) char_min, (long) maxint,
1429 (long) CHAR_MIN, "");
1431 i_define(D_SCHAR_MAX, "", "SCHAR", "_MAX",
1432 (long) char_max, 0L,
1433 (long) SCHAR_MAX, "");
1434 i_define(D_SCHAR_MIN, "", "SCHAR", "_MIN",
1435 (long) char_min, (long) maxint,
1436 (long) SCHAR_MIN, "");
1438 if (sizeof(char) == sizeof(int)) {
1439 u_define(D_UCHAR_MAX, "", "UCHAR", "_MAX",
1441 (long) UCHAR_MAX, "");
1443 i_define(D_UCHAR_MAX, "", "UCHAR", "_MAX",
1444 (long) char_max, 0L,
1445 (long) UCHAR_MAX, "");
1451 Volatile unsigned char c, char_max;
1454 if (setjmp(lab)==0) { /* Yields char_max */
1455 while (c>char_max) {
1461 if (sizeof(char) == sizeof(int)) {
1462 u_define(D_UCHAR_MAX, "", "UCHAR", "_MAX",
1464 (long) UCHAR_MAX, "");
1466 i_define(D_UCHAR_MAX, "", "UCHAR", "_MAX",
1467 (long) char_max, 0L,
1468 (long) UCHAR_MAX, "");
1473 /* Define NO_SC if this gives a syntax error */ Volatile signed char c, char_max, char_min;
1476 if (setjmp(lab)==0) { /* Yields char_max */
1477 while (c>char_max) {
1484 if (setjmp(lab)==0) { /* Yields char_min */
1485 while (c<char_min) {
1491 i_define(D_SCHAR_MIN, "", "SCHAR", "_MIN",
1492 (long) char_min, (long) maxint,
1493 (long) SCHAR_MIN, "");
1494 i_define(D_SCHAR_MAX, "", "SCHAR", "_MAX",
1495 (long) char_max, 0L,
1496 (long) SCHAR_MAX, "");
1500 return bits_per_byte;
1504 /* The properties of the basic types.
1505 Returns number of bits per sizeof unit */
1506 Volatile int bits_per_byte;
1507 typedef int function ();
1511 Vprintf("%sSIZES%s\n", co, oc);
1512 bits_per_byte= cprop();
1514 /* Shorts, ints and longs *****************************************/
1515 Vprintf("%sshort=%d int=%d long=%d float=%d double=%d bits %s\n",
1517 (int) sizeof(short)*bits_per_byte,
1518 (int) sizeof(int)*bits_per_byte,
1519 (int) sizeof(long)*bits_per_byte,
1520 (int) sizeof(float)*bits_per_byte,
1521 (int) sizeof(double)*bits_per_byte, oc);
1523 Vprintf("%slong double=%d bits%s\n",
1524 co, (int) sizeof(Long_double)*bits_per_byte, oc);
1526 Vprintf("%schar*=%d bits%s%s\n",
1527 co, (int)sizeof(char *)*bits_per_byte,
1528 sizeof(char *)>sizeof(int)?" BEWARE! larger than int!":"",
1530 Vprintf("%sint* =%d bits%s%s\n",
1531 co, (int)sizeof(int *)*bits_per_byte,
1532 sizeof(int *)>sizeof(int)?" BEWARE! larger than int!":"",
1534 Vprintf("%sfunc*=%d bits%s%s\n",
1535 co, (int)sizeof(function *)*bits_per_byte,
1536 sizeof(function *)>sizeof(int)?" BEWARE! larger than int!":"",
1538 if (V) printf ("%s%s %s %s%s\n", co, "Type size_t is",
1539 ((((false()?( sizeof(int)):(-1)) < 0) )?
1540 "signed":"unsigned") ,
1546 showtype("Type size_t is", sizeof(0));
1548 /* Alignment constants ********************************************/
1550 #define alignment(TYPE) \
1551 ((long)((char *)&((struct{char c; TYPE d;}*)0)->d - (char *)0))
1553 Vprintf("\n%sALIGNMENTS%s\n", co, oc);
1555 Vprintf("%schar=%ld short=%ld int=%ld long=%ld%s\n",
1557 alignment(char), alignment(short),
1558 alignment(int), alignment(long),
1561 Vprintf("%sfloat=%ld double=%ld%s\n",
1563 alignment(float), alignment(double),
1567 Vprintf("%slong double=%ld%s\n",
1569 alignment(Long_double),
1572 Vprintf("%schar*=%ld int*=%ld func*=%ld%s\n",
1574 alignment(char *), alignment(int *), alignment(function *),
1579 /* Ten little endians *********************************************/
1581 endian(bits_per_byte);
1583 /* Pointers *******************************************************/
1585 Vprintf("\n%sPROPERTIES OF POINTERS%s\n", co, oc);
1587 if ((long) (char *) &variable == (long) (int *) &variable)
1588 Vprintf("%sChar and int pointer formats seem identical%s\n",
1591 Vprintf("%sChar and int pointer formats are different%s\n",
1593 if ((long) (char *) &variable == (long) (function *) &variable)
1594 Vprintf("%sChar and function pointer formats seem identical%s\n",
1597 Vprintf("%sChar and function pointer formats are different%s\n",
1602 printf("%sStrings are shared%s\n", co, oc);
1603 else printf("%sStrings are not shared%s\n", co, oc);
1607 showtype("Type ptrdiff_t is", p-q);
1609 Vprintf("\n%sPROPERTIES OF INTEGRAL TYPES%s\n", co, oc);
1622 return bits_per_byte;
1625 #else /* not PASS0 */
1629 extern int V, L, F, bugs, bits_per_byte;
1630 extern char co[], oc[];
1631 extern char *f_rep();
1633 #endif /* ifdef PASS0 */
1635 /* As I said, I apologise for the contortions below. The functions are
1636 expanded by the preprocessor twice or three times (for float and double,
1637 and maybe for long double, and for short, int and long). That way,
1638 I never make a change to one that I forget to make to the other.
1639 You can look on it as C's fault for not supporting multi-line macro's.
1640 This whole file is read 3 times by the preprocessor, with PASSn set for
1641 n=1, 2 or 3, to decide which parts to reprocess.
1644 /* #undef on an already undefined thing is (wrongly) flagged as an error
1645 by some compilers, therefore the #ifdef that follows:
1671 /* These are the float.h constants */
1702 /* Define the things we're going to use this pass */
1704 #define Number float
1705 #define THING "FLOAT"
1706 #define Thing "Float"
1707 #define thing "float"
1710 #define Store fStore
1722 #define F_check fCheck
1725 #define Validate(prec, val, req, same) fValidate(prec, val, req, same)
1728 #define EPROP efprop
1730 #define Integer short
1733 #define Iname "SHRT"
1739 #define UPROP usprop
1740 #define Uname "USHRT"
1744 #define I_MAX SHRT_MAX
1747 #define I_MIN SHRT_MIN
1750 #define U_MAX USHRT_MAX
1754 #define F_RADIX FLT_RADIX
1757 #define F_MANT_DIG FLT_MANT_DIG
1760 #define F_DIG FLT_DIG
1763 #define F_ROUNDS FLT_ROUNDS
1766 #define F_EPSILON FLT_EPSILON
1769 #define F_MIN_EXP FLT_MIN_EXP
1772 #define F_MIN FLT_MIN
1774 #ifdef FLT_MIN_10_EXP
1775 #define F_MIN_10_EXP FLT_MIN_10_EXP
1778 #define F_MAX_EXP FLT_MAX_EXP
1781 #define F_MAX FLT_MAX
1783 #ifdef FLT_MAX_10_EXP
1784 #define F_MAX_10_EXP FLT_MAX_10_EXP
1792 #define Number double
1793 #define THING "DOUBLE"
1794 #define Thing "Double"
1795 #define thing "double"
1798 #define Store dStore
1810 #define F_check dCheck
1813 #define Validate(prec, val, req, same) dValidate(prec, val, req, same)
1816 #define EPROP edprop
1822 #define OK_UI 1 /* Unsigned int is always possible */
1825 #define UPROP uiprop
1826 #define Uname "UINT"
1830 #define I_MAX INT_MAX
1833 #define I_MIN INT_MIN
1836 #define U_MAX UINT_MAX
1840 #define F_MANT_DIG DBL_MANT_DIG
1843 #define F_DIG DBL_DIG
1846 #define F_EPSILON DBL_EPSILON
1849 #define F_MIN_EXP DBL_MIN_EXP
1852 #define F_MIN DBL_MIN
1854 #ifdef DBL_MIN_10_EXP
1855 #define F_MIN_10_EXP DBL_MIN_10_EXP
1858 #define F_MAX_EXP DBL_MAX_EXP
1861 #define F_MAX DBL_MAX
1863 #ifdef DBL_MAX_10_EXP
1864 #define F_MAX_10_EXP DBL_MAX_10_EXP
1873 #define Number long double
1883 #define THING "LONG DOUBLE"
1884 #define Thing "Long double"
1885 #define thing "long double"
1886 #define Fname "LDBL"
1887 #define FPROP ldprop
1888 #define Store ldStore
1894 #define F_check ldCheck
1897 #define Validate(prec, val, req, same) ldValidate(prec, val, req, same)
1900 #define EPROP eldprop
1902 #define Integer long
1905 #define Iname "LONG"
1911 #define UPROP ulprop
1912 #define Uname "ULONG"
1916 #define I_MAX LONG_MAX
1919 #define I_MIN LONG_MIN
1922 #define U_MAX ULONG_MAX
1925 #ifdef LDBL_MANT_DIG
1926 #define F_MANT_DIG LDBL_MANT_DIG
1929 #define F_DIG LDBL_DIG
1932 #define F_EPSILON LDBL_EPSILON
1935 #define F_MIN_EXP LDBL_MIN_EXP
1938 #define F_MIN LDBL_MIN
1940 #ifdef LDBL_MIN_10_EXP
1941 #define F_MIN_10_EXP LDBL_MIN_10_EXP
1944 #define F_MAX_EXP LDBL_MAX_EXP
1947 #define F_MAX LDBL_MAX
1949 #ifdef LDBL_MAX_10_EXP
1950 #define F_MAX_10_EXP LDBL_MAX_10_EXP
1957 #define I_MAX int_max
1960 #define I_MIN int_min
1967 #define F_RADIX f_radix
1970 #define F_MANT_DIG f_mant_dig
1976 #define F_ROUNDS f_rounds
1979 #define F_EPSILON f_epsilon
1982 #define F_MIN_EXP f_min_exp
1987 #ifndef F_MIN_10_EXP
1988 #define F_MIN_10_EXP f_min_10_exp
1991 #define F_MAX_EXP f_max_exp
1996 #ifndef F_MAX_10_EXP
1997 #define F_MAX_10_EXP f_max_10_exp
2001 #define Validate(prec, val, req, same) {;}
2007 /* the properties of short, int, and long */
2008 Volatile Integer newi, int_max, maxeri, int_min, minneri;
2009 Volatile int ibits, ipower, two=2;
2011 /* Calculate max short/int/long ***********************************/
2012 /* Calculate 2**n-1 until overflow - then use the previous value */
2016 if (setjmp(lab)==0) { /* Yields int_max */
2017 for(ipower=0; newi>int_max; ipower++) {
2021 Vprintf("%sOverflow of a%s %s does not generate a trap%s\n",
2022 co, INT[0]=='i'?"n":"", INT, oc);
2024 Vprintf("%sOverflow of a%s %s generates a trap%s\n",
2025 co, INT[0]=='i'?"n":"", INT, oc);
2029 /* Minimum value: assume either two's or one's complement *********/
2031 if (setjmp(lab)==0) { /* Yields int_min */
2032 if (int_min-1 < int_min) int_min--;
2036 /* Now for those daft Cybers */
2038 maxeri=0; newi=int_max;
2040 if (setjmp(lab)==0) { /* Yields maxeri */
2041 for(ibits=ipower; newi>maxeri; ibits++) {
2049 if (setjmp(lab)==0) { /* Yields minneri */
2050 if (minneri-1 < minneri) minneri--;
2054 Vprintf("%sMaximum %s = %ld (= 2**%d-1)%s\n",
2055 co, INT, (long)int_max, ipower, oc);
2056 Vprintf("%sMinimum %s = %ld%s\n", co, INT, (long)int_min, oc);
2058 if (L) i_define(D_INT_MAX, INT, Iname, "_MAX",
2060 (long) I_MAX, IMARK);
2061 if (L) i_define(D_INT_MIN, INT, Iname, "_MIN",
2062 (long) int_min, (long) (PASS==1?maxint:int_max),
2063 (long) I_MIN, IMARK);
2065 if(int_max < 0) { /* It has happened */
2066 eek_a_bug("signed integral comparison faulty?");
2069 if (maxeri>int_max) {
2070 Vprintf("%sThere is a larger %s, %ld (= 2**%d-1), %s %s%s\n",
2071 co, INT, (long)maxeri, ibits,
2072 "but only for addition, not multiplication",
2073 "(I smell a Cyber!)",
2077 if (minneri<int_min) {
2078 Vprintf("%sThere is a smaller %s, %ld, %s %s%s\n",
2079 co, INT, (long)minneri,
2080 "but only for addition, not multiplication",
2081 "(I smell a Cyber!)",
2086 Procedure UPROP () {
2087 /* The properties of unsigned short/int/long */
2089 Volatile unsigned Integer u_max, newi, two;
2090 newi=1; u_max=0; two=2;
2092 if (setjmp(lab)==0) { /* Yields u_max */
2099 Vprintf("%sMaximum unsigned %s = %lu%s\n",
2100 co, INT, (unsigned long) u_max, oc);
2102 /* Oh woe: new standard C defines value preserving promotions */
2104 if (PASS == 1 && sizeof(short) < sizeof(int)) {
2105 /* Special only for short */
2106 i_define(D_UINT_MAX, INT, Uname, "_MAX",
2107 (unsigned long) u_max, 0L,
2108 (unsigned long) U_MAX, IMARK);
2110 u_define(D_UINT_MAX, INT, Uname, "_MAX",
2111 (unsigned long) u_max,
2112 (unsigned long) U_MAX, IMARK);
2118 #endif /* Integer */
2122 /* The following routines are intended to defeat any attempt at optimisation
2123 or use of extended precision, and to defeat faulty narrowing casts.
2124 The weird prototypes are because of widening incompatibilities.
2127 #define ARGS1(atype, a) (atype a)
2128 #define ARGS2(atype, a, btype, b) (atype a, btype b)
2130 #define ARGS1(atype, a) (a) atype a;
2131 #define ARGS2(atype, a, btype, b) (a, b) atype a; btype b;
2134 Procedure Store ARGS2(Number, a, Number *, b) { *b=a; }
2135 Number Sum ARGS2(Number, a, Number, b) {Number r; Store(a+b, &r); return (r); }
2136 Number Diff ARGS2(Number, a, Number, b){Number r; Store(a-b, &r); return (r); }
2137 Number Mul ARGS2(Number, a, Number, b) {Number r; Store(a*b, &r); return (r); }
2138 Number Div ARGS2(Number, a, Number, b) {Number r; Store(a/b, &r); return (r); }
2139 Number Self ARGS1(Number, a) {Number r; Store(a, &r); return (r); }
2141 Procedure F_check ARGS((int precision, Long_double val1));
2143 Procedure F_check(precision, val1) int precision; Long_double val1; {
2144 /* You don't think I'm going to go to all the trouble of writing
2145 a program that works out what all sorts of values are, only to
2146 have printf go and print the wrong values out, do you?
2147 No, you're right, so this function tries to see if printf
2148 has written the right value, by reading it back again.
2149 This introduces a new problem of course: suppose printf writes
2150 the correct value, and scanf reads it back wrong... oh well.
2151 But I'm adamant about this: the precision given is enough
2152 to uniquely identify the printed number, therefore I insist
2153 that sscanf read the number back identically. Harsh yes, but
2154 sometimes you've got to be cruel to be kind.
2156 Number val, new, diff;
2162 #ifdef NO_LONG_DOUBLE_IO
2164 /* On the Sun 3, sscanf clobbers 4 words,
2165 which leads to a crash when this function tries to return. */
2166 f2= "%le"; /* Input */
2167 /* It is no use checking long doubles if we can't
2168 read and write them. */
2169 if (sizeof (Number) > sizeof(double))
2173 if (sizeof(double) == sizeof(Long_double)) {
2174 /* Assume they're the same, and use non-stdc format */
2175 /* This is for stdc compilers using non-stdc libraries */
2176 f2= "%le"; /* Input */
2178 /* It had better support Le then */
2183 rep= f_rep(precision, (Long_double) val);
2184 if (setjmp(lab)==0) {
2185 sscanf(rep, f2, &new1);
2187 eek_a_bug("sscanf caused a trap");
2188 printf("%s scanning: %s format: %s%s\n\n", co, rep, f2, oc);
2193 if (setjmp(lab)==0) { /* See if new is usable */
2196 diff= val/new - 1.0;
2197 if (diff < 0.1) diff= 1.0;
2198 /* That should be enough to generate a trap */
2201 eek_a_bug("sscanf returned an unusable number");
2202 printf("%s scanning: %s with format: %s%s\n\n",
2210 eek_a_bug("Possibly bad output from printf above");
2211 if (!exponent((Long_double)val, &rem, &e)) {
2212 printf("%s but value was an unusable number%s\n\n",
2216 printf("%s expected value around %.*fe%d, bit pattern:\n ",
2217 co, precision, rem, e);
2218 bitpattern((char *) &val, (unsigned)sizeof(val));
2219 printf ("%s\n", oc);
2220 printf("%s sscanf gave %s, bit pattern:\n ",
2221 co, f_rep(precision, (Long_double) new));
2222 bitpattern((char *) &new, (unsigned)sizeof(new));
2223 printf ("%s\n", oc);
2224 if (setjmp(lab) == 0) {
2226 printf("%s difference= %s%s\n\n",
2227 co, f_rep(precision, (Long_double) diff), oc);
2228 } /* else forget it */
2234 Procedure Validate(prec, val, req, same) int prec, same; Long_double val, req; {
2235 /* Check that the compiler has read a #define value correctly */
2238 printf("%s*** Verify failed for above #define!\n", co);
2239 if (setjmp(lab) == 0) { /* for the case that req == nan */
2240 printf(" Compiler has %s for value%s\n",
2241 f_rep(prec, req), oc);
2243 printf(" Compiler has %s for value%s\n",
2244 "an unusable number", oc);
2246 if (setjmp(lab) == 0) {
2247 F_check(prec, (Long_double) req);
2248 } /*else forget it*/
2249 if (setjmp(lab) == 0) {
2250 if (req > 0.0 && val > 0.0) {
2251 printf("%s difference= %s%s\n",
2252 co, f_rep(prec, val-req), oc);
2254 } /*else forget it*/
2258 } else if (val != req) {
2259 if (stdc) eek_a_bug("constant has the wrong precision");
2260 else eek_a_bug("the cast didn't work");
2266 int FPROP(bits_per_byte) int bits_per_byte; {
2267 /* Properties of floating types, using algorithms by Cody and Waite
2268 from MA Malcolm, as modified by WM Gentleman and SB Marovich.
2269 Further extended by S Pemberton.
2271 Returns the number of digits in the fraction.
2275 i, f_radix, iexp, irnd, mrnd, f_rounds, f_mant_dig,
2276 iz, k, inf, machep, f_max_exp, f_min_exp, mx, negeps,
2277 mantbits, digs, f_dig, trap,
2278 hidden, normal, f_min_10_exp, f_max_10_exp;
2280 a, b, base, basein, basem1, f_epsilon, epsneg,
2281 eps, epsp1, etop, ebot,
2282 f_max, newxmax, f_min, xminner, y, y1, z, z1, z2;
2286 Vprintf("%sPROPERTIES OF %s%s\n", co, THING, oc);
2288 /* Base and size of significand **************************************/
2289 /* First repeatedly double until adding 1 has no effect. */
2290 /* For instance, if base is 10, with 3 significant digits */
2291 /* it will try 1, 2, 4, 8, ... 512, 1024, and stop there, */
2292 /* since 1024 is only representable as 1020. */
2294 if (setjmp(lab)==0) { /* inexact trap? */
2296 while (Diff(Diff(Sum(a, ONE), a), ONE) == ZERO);
2298 fprintf(stderr, "*** Program got loss-of-precision trap!\n");
2299 /* And supporting those is just TOO much trouble! */
2303 /* Now double until you find a number that can be added to the */
2304 /* above number. For 1020 this is 8 or 16, depending whether the */
2305 /* result is rounded or truncated. */
2306 /* In either case the result is 1030. 1030-1020= the base, 10. */
2308 do { b=Sum(b, b); } while ((base=Diff(Sum(a, b), a)) == ZERO);
2310 Vprintf("%sBase = %d%s\n", co, f_radix, oc);
2312 /* Sanity check; if base<2, I can't guarantee the rest will work */
2314 eek_a_bug("Function return or parameter passing faulty? (This is a guess.)");
2319 if (PASS == 1) { /* only for FLT */
2321 if (F) i_define(D_FLT_RADIX, "", "FLT", "_RADIX",
2322 (long) f_radix, 0L, (long) F_RADIX, "");
2323 } else if (f_radix != flt_radix) {
2324 printf("\n%s*** WARNING: %s %s (%d) %s%s\n",
2325 co, thing, "arithmetic has a different radix",
2326 f_radix, "from float", oc);
2330 /* Now the number of digits precision */
2331 f_mant_dig=0; b=1.0;
2332 do { f_mant_dig++; b=Mul(b, base); }
2333 while (Diff(Diff(Sum(b, ONE), b), ONE) == ZERO);
2334 f_dig=floor_log(10, (Long_double)(b/base)) + (base==10?1:0);
2335 Vprintf("%sSignificant base digits = %d %s %d %s%s\n",
2336 co, f_mant_dig, "(= at least", f_dig, "decimal digits)", oc);
2337 if (F) i_define(D_MANT_DIG, thing, Fname, "_MANT_DIG",
2338 (long) f_mant_dig, 0L, (long) F_MANT_DIG, "");
2339 if (F) i_define(D_DIG, thing, Fname, "_DIG",
2340 (long) f_dig, 0L, (long) F_DIG, "");
2341 digs= ceil_log(10, (Long_double)b); /* the number of digits to printf */
2343 /* Rounding *******************************************************/
2344 basem1=Diff(base, HALF);
2345 if (Diff(Sum(a, basem1), a) != ZERO) {
2346 if (f_radix == 2) basem1=0.375;
2348 if (Diff(Sum(a, basem1), a) != ZERO) irnd=2; /* away from 0 */
2349 else irnd=1; /* to nearest */
2350 } else irnd=0; /* towards 0 */
2352 basem1=Diff(base, HALF);
2354 if (Diff(Diff(-a, basem1), -a) != ZERO) {
2355 if (f_radix == 2) basem1=0.375;
2357 if (Diff(Diff(-a, basem1), -a) != ZERO) mrnd=2; /* away from 0*/
2358 else mrnd=1; /* to nearest */
2359 } else mrnd=0; /* towards 0 */
2361 f_rounds= -1; /* Unknown rounding */
2362 if (irnd==0 && mrnd==0) f_rounds=0; /* zero = chops */
2363 if (irnd==1 && mrnd==1) f_rounds=1; /* nearest */
2364 if (irnd==2 && mrnd==0) f_rounds=2; /* +inf */
2365 if (irnd==0 && mrnd==2) f_rounds=3; /* -inf */
2367 if (f_rounds != -1) {
2368 Vprintf("%sArithmetic rounds towards ", co);
2370 case 0: Vprintf("zero (i.e. it chops)"); break;
2371 case 1: Vprintf("nearest"); break;
2372 case 2: Vprintf("+infinity"); break;
2373 case 3: Vprintf("-infinity"); break;
2374 default: Vprintf("???"); break;
2376 Vprintf("%s\n", oc);
2377 } else { /* Hmm, try to give some help here */
2378 Vprintf("%sArithmetic rounds oddly: %s\n", co, oc);
2379 Vprintf("%s Negative numbers %s%s\n",
2380 co, mrnd==0 ? "towards zero" :
2381 mrnd==1 ? "to nearest" :
2384 Vprintf("%s Positive numbers %s%s\n",
2385 co, irnd==0 ? "towards zero" :
2386 irnd==1 ? "to nearest" :
2390 /* An extra goody */
2391 if (f_radix == 2 && f_rounds == 1) {
2392 if (Diff(Sum(a, ONE), a) != ZERO) {
2393 Vprintf("%s Tie breaking rounds up%s\n", co, oc);
2394 } else if (Diff(Sum(a, THREE), a) == FOUR) {
2395 Vprintf("%s Tie breaking rounds to even%s\n", co, oc);
2397 Vprintf("%s Tie breaking rounds down%s\n", co, oc);
2400 if (PASS == 1) { /* only for FLT */
2401 flt_rounds= f_rounds;
2403 i_define(D_FLT_ROUNDS, "", "FLT", "_ROUNDS",
2404 (long) f_rounds, 1L, (long) F_ROUNDS, "");
2405 } else if (f_rounds != flt_rounds) {
2406 printf("\n%s*** WARNING: %s %s (%d) %s%s\n",
2407 co, thing, "arithmetic rounds differently",
2408 f_rounds, "from float", oc);
2412 /* Various flavours of epsilon ************************************/
2413 negeps=f_mant_dig+f_mant_dig;
2416 for(i=1; i<=negeps; i++) a*=basein;
2419 while (Diff(Diff(ONE, a), ONE) == ZERO) {
2424 Vprintf("%sSmallest x such that 1.0-base**x != 1.0 = %d%s\n",
2429 eps = Sum(ebot, Div(Diff(etop, ebot), TWO));
2430 /* find the smallest epsneg (1-epsneg != 1) by binary search.
2431 ebot and etop are the current bounds */
2432 while (eps != ebot && eps != etop) {
2433 epsp1 = Diff(ONE, eps);
2434 if (epsp1 < ONE) etop = eps;
2436 eps = Sum(ebot, Div(Diff(etop, ebot), TWO));
2440 if (Diff(ONE, etop) >= ONE || Diff(ONE, ebot) != ONE) {
2441 eek_a_bug("internal error calculating epsneg");
2443 Vprintf("%sSmallest x such that 1.0-x != 1.0 = %s%s\n",
2444 co, f_rep(digs, (Long_double) eps), oc);
2445 if (V) F_check(digs, (Long_double) eps);
2448 if ((f_radix!=2) && irnd) {
2449 /* a=(a*(1.0+a))/(1.0+1.0); => */
2450 a=Div(Mul(a, Sum(ONE, a)), Sum(ONE, ONE));
2451 /* if ((1.0-a)-1.0 != 0.0) epsneg=a; => */
2452 if (Diff(Diff(ONE, a), ONE) != ZERO) epsneg=a;
2454 /* epsneg is used later */
2457 machep= -f_mant_dig-f_mant_dig;
2459 while (Diff(Sum(ONE, a), ONE) == ZERO) { a*=base; machep++; }
2460 Vprintf("%sSmallest x such that 1.0+base**x != 1.0 = %d%s\n",
2465 eps = Sum(ebot, Div(Diff(etop, ebot), TWO));
2466 /* find the smallest eps (1+eps != 1) by binary search.
2467 ebot and etop are the current bounds */
2468 while (eps != ebot && eps != etop) {
2469 epsp1 = Sum(ONE, eps);
2470 if (epsp1 > ONE) etop = eps;
2472 eps = Sum(ebot, Div(Diff(etop, ebot), TWO));
2475 if (Sum(ONE, etop) <= ONE || Sum(ONE, ebot) != ONE) {
2476 eek_a_bug("internal error calculating eps");
2480 Vprintf("%sSmallest x such that 1.0+x != 1.0 = %s%s\n",
2481 co, f_rep(digs, (Long_double) f_epsilon), oc);
2483 f_epsilon= Diff(Sum(ONE, f_epsilon), ONE); /* New C standard defn */
2484 Vprintf("%s(Above number + 1.0) - 1.0 = %s%s\n",
2485 co, f_rep(digs, (Long_double) (f_epsilon)), oc);
2487 /* Possible loss of precision warnings here from non-stdc compilers */
2488 if (F) f_define(D_EPSILON, thing,
2489 Fname, "_EPSILON", digs, (Long_double) f_epsilon, MARK);
2490 if (V || F) F_check(digs, (Long_double) f_epsilon);
2492 if (F) Validate(digs, (Long_double) f_epsilon, (Long_double) F_EPSILON,
2493 f_epsilon == Self(F_EPSILON));
2496 /* Extra chop info *************************************************/
2497 if (f_rounds == 0) {
2498 if (Diff(Mul(Sum(ONE,f_epsilon),ONE),ONE) != ZERO) {
2499 Vprintf("%sAlthough arithmetic chops, it uses guard digits%s\n", co, oc);
2503 /* Size of and minimum normalised exponent ************************/
2504 y=0; i=0; k=1; z=basein; z1=(1.0+f_epsilon)/base;
2506 /* Coarse search for the largest power of two */
2507 if (setjmp(lab)==0) { /* for underflow trap */ /* Yields i, k, y, y1 */
2510 z=Mul(y,y); z1=Mul(z1, y);
2513 if (z2 != y1) break;
2514 if ((Sum(a,a) == ZERO) || (fabs(z) >= y)) break;
2519 Vprintf("%s%s underflow generates a trap%s\n", co, Thing, oc);
2523 if (f_radix != 10) {
2524 iexp=i+1; /* for the sign */
2529 while (k >= iz) { iz*=f_radix; iexp++; }
2533 /* Fine tune starting with y and y1 */
2534 if (setjmp(lab)==0) { /* for underflow trap */ /* Yields k, f_min */
2537 y=Div(y,base); y1=Div(y1,base);
2540 if (z2 != z1) break;
2541 if ((Sum(a,a) == ZERO) || (fabs(y) >= f_min)) break;
2549 if ((mx <= k+k-3) && (f_radix != 10)) { mx+=mx; iexp+=1; }
2550 Vprintf("%sNumber of bits used for exponent = %d%s\n", co, iexp, oc);
2551 Vprintf("%sMinimum normalised exponent = %d%s\n", co, f_min_exp-1, oc);
2553 i_define(D_MIN_EXP, thing, Fname, "_MIN_EXP",
2554 (long) f_min_exp, (long) maxint, (long) F_MIN_EXP, "");
2556 if (setjmp(lab)==0) {
2557 Vprintf("%sMinimum normalised positive number = %s%s\n",
2558 co, f_rep(digs, (Long_double) f_min), oc);
2560 eek_a_bug("printf can't print the smallest normalised number");
2564 /* Possible loss of precision warnings here from non-stdc compilers */
2565 if (setjmp(lab) == 0) {
2566 if (F) f_define(D_MIN, thing,
2567 Fname, "_MIN", digs, (Long_double) f_min, MARK);
2568 if (V || F) F_check(digs, (Long_double) f_min);
2570 eek_a_bug("xxx_MIN caused a trap");
2574 if (setjmp(lab) == 0) {
2575 if (F) Validate(digs, (Long_double) f_min, (Long_double) F_MIN,
2576 f_min == Self(F_MIN));
2578 printf("%s*** Verify failed for above #define!\n %s %s\n\n",
2579 co, "Compiler has an unusable number for value", oc);
2584 a=1.0; f_min_10_exp=0;
2585 while (a > f_min*10.0) { a/=10.0; f_min_10_exp--; }
2586 if (F) i_define(D_MIN_10_EXP, thing, Fname, "_MIN_10_EXP",
2587 (long) f_min_10_exp, (long) maxint,
2588 (long) F_MIN_10_EXP, "");
2590 /* Minimum exponent ************************************************/
2591 if (setjmp(lab)==0) { /* for underflow trap */ /* Yields xminner */
2596 if ((Sum(a,a) == ZERO) || (fabs(y) >= xminner)) break;
2601 if (xminner != 0.0 && xminner != f_min) {
2603 Vprintf("%sThe smallest numbers are not kept normalised%s\n",
2605 if (setjmp(lab)==0) {
2606 Vprintf("%sSmallest unnormalised positive number = %s%s\n",
2607 co, f_rep(digs, (Long_double) xminner), oc);
2608 if (V) F_check(digs, (Long_double) xminner);
2610 eek_a_bug("printf can't print the smallest unnormalised number.");
2616 Vprintf("%sThe smallest numbers are normalised%s\n", co, oc);
2619 /* Maximum exponent ************************************************/
2620 f_max_exp=2; f_max=1.0; newxmax=base+1.0;
2622 while (f_max<newxmax) {
2624 if (setjmp(lab) == 0) { /* Yields inf, f_max_exp */
2625 newxmax=Mul(newxmax, base);
2630 if (Div(newxmax, base) != f_max) {
2631 inf=1; /* ieee infinity */
2638 Vprintf("%s%s overflow generates a trap%s\n", co, Thing, oc);
2641 if (inf) Vprintf("%sThere is an 'infinite' value%s\n", co, oc);
2642 Vprintf("%sMaximum exponent = %d%s\n", co, f_max_exp, oc);
2643 if (F) i_define(D_MAX_EXP, thing, Fname, "_MAX_EXP",
2644 (long) f_max_exp, 0L, (long) F_MAX_EXP, "");
2646 /* Largest number ***************************************************/
2647 f_max=Diff(ONE, epsneg);
2648 if (Mul(f_max,ONE) != f_max) f_max=Diff(ONE, Mul(base,epsneg));
2649 for (i=1; i<=f_max_exp; i++) f_max=Mul(f_max, base);
2651 if (setjmp(lab)==0) {
2652 Vprintf("%sMaximum number = %s%s\n",
2653 co, f_rep(digs, (Long_double) f_max), oc);
2655 eek_a_bug("printf can't print the largest double.");
2658 if (setjmp(lab)==0) {
2659 /* Possible loss of precision warnings here from non-stdc compilers */
2660 if (F) f_define(D_MAX, thing,
2661 Fname, "_MAX", digs, (Long_double) f_max, MARK);
2662 if (V || F) F_check(digs, (Long_double) f_max);
2664 eek_a_bug("xxx_MAX caused a trap");
2667 if (setjmp(lab)==0) {
2668 if (F) Validate(digs, (Long_double) f_max, (Long_double) F_MAX,
2669 f_max == Self(F_MAX));
2671 printf("%s*** Verify failed for above #define!\n %s %s\n\n",
2672 co, "Compiler has an unusable number for value", oc);
2677 a=1.0; f_max_10_exp=0;
2678 while (a < f_max/10.0) { a*=10.0; f_max_10_exp++; }
2679 if (F) i_define(D_MAX_10_EXP, thing, Fname, "_MAX_10_EXP",
2680 (long) f_max_10_exp, 0L, (long) F_MAX_10_EXP, "");
2682 /* Hidden bit + sanity check ****************************************/
2683 if (f_radix != 10) {
2685 mantbits=floor_log(2, (Long_double)f_radix)*f_mant_dig;
2688 && f_max_exp+f_min_exp > 0 /* ??? f_min_exp may be wrong. */
2689 && mantbits+iexp+17 == (int)sizeof(Number)*bits_per_byte) {
2690 Vprintf("%sArithmetic probably doesn't use a hidden bit%s\n", co, oc);
2691 Vprintf("%sIt's probably 80387 or 68881 extended real%s\n", co, oc);
2694 if (mantbits+iexp == (int)sizeof(Number)*bits_per_byte) {
2696 Vprintf("%sArithmetic uses a hidden bit%s\n", co, oc);
2697 } else if (mantbits+iexp+1 == (int)sizeof(Number)*bits_per_byte) {
2698 Vprintf("%sArithmetic doesn't use a hidden bit%s\n",
2701 printf("\n%s%s\n %s %s %s!%s\n\n",
2703 "*** Something fishy here!",
2704 "Exponent size + significand size doesn't match",
2705 "with the size of a", thing,
2708 if (hidden && f_radix == 2 && f_max_exp+f_min_exp==3) {
2709 Vprintf("%sIt looks like %s length IEEE format%s\n",
2710 co, f_mant_dig==24 ? "single" :
2711 f_mant_dig==53 ? "double" :
2712 f_mant_dig >53 ? "extended" :
2715 if (f_rounds != 1 || normal) {
2716 Vprintf("%s though ", co);
2717 if (f_rounds != 1) {
2718 Vprintf("the rounding is unusual");
2719 if (normal) Vprintf(" and ");
2721 if (normal) Vprintf("the normalisation is unusual");
2722 Vprintf("%s\n", oc);
2725 Vprintf("%sIt doesn't look like IEEE format%s\n",
2729 printf("\n"); /* regardless of verbosity */
2733 Procedure EPROP(fprec, dprec, lprec) int fprec, dprec, lprec; {
2734 /* See if expressions are evaluated in extended precision.
2735 Some compilers optimise even if you don't want it,
2736 and then this function fails to produce the right result.
2737 We try to diagnose this if it happens.
2740 Volatile double a, b, base, old;
2741 Volatile Number d, oldd, dbase, one, zero;
2744 /* Size of significand **************************************/
2746 if (setjmp(lab) == 0) { /* Yields nothing */
2747 do { old=a; a=a+a; }
2748 while ((((a+1.0)-a)-1.0) == 0.0 && a>old);
2751 /* Avoid the comparison if bad is set,
2752 to avoid trouble on the convex. */
2753 if (!bad && (a <= old)) bad=1;
2757 if (setjmp(lab) == 0) { /* Yields nothing */
2758 do { old=b; b=b+b; }
2759 while ((base=((a+b)-a)) == 0.0 && b>old);
2760 if (b <= old) bad=1;
2765 eprec=0; d=1.0; dbase=base; one=1.0; zero=0.0;
2766 if (setjmp(lab) == 0) { /* Yields nothing */
2767 do { eprec++; oldd=d; d=d*dbase; }
2768 while ((((d+one)-d)-one) == zero && d>oldd);
2769 if (d <= oldd) bad=1;
2776 Vprintf("%sCan't determine precision for %s expressions:\n%s%s\n",
2777 co, thing, " check that you compiled without optimisation!",
2779 } else if (eprec==dprec) {
2780 Vprintf("%s%s expressions are evaluated in double precision%s\n",
2782 } else if (eprec==fprec) {
2783 Vprintf("%s%s expressions are evaluated in float precision%s\n",
2785 } else if (eprec==lprec) {
2786 Vprintf("%s%s expressions are evaluated in long double precision%s\n",
2789 Vprintf("%s%s expressions are evaluated in a %s %s %d %s%s\n",
2790 co, Thing, eprec>dprec ? "higher" : "lower",
2791 "precision than double,\n using",
2792 eprec, "base digits",
2797 #else /* not Number */
2799 #ifdef FPROP /* Then create dummy routines for long double */
2801 int FPROP(bits_per_byte) int bits_per_byte; { return 0; }
2805 Procedure EPROP(fprec, dprec, lprec) int fprec, dprec, lprec; {}
2808 #endif /* ifdef Number */
2810 /* Increment the pass number */
2829 #ifdef PASS /* then rescan this file */
2831 #include "enquire.c"
2833 #include FILENAME /* if this line fails to compile, define NO_FILE */