|
|
1.1 root 1: /* The Plum Hall Validation Suite for C
2: * Unpublished copyright (c) 1986-1991, Chiron Systems Inc and Plum Hall Inc.
3: * VERSION: 4
4: * DATE: 1993-01-01
5: * The "ANSI" mode of the Suite corresponds to the official ANSI C, X3.159-1989.
6: * As per your license agreement, your distribution is not to be moved or copied outside the Designated Site
7: * without specific permission from Plum Hall Inc.
8: */
9:
10: /****************************************************************************
11: ** Self-checking C source code generated by EGEN component of **
12: ** The Plum Hall Validation Suite for C. **
13: ** (C) 1986-1988 Chiron Systems Inc and Plum Hall Inc **
14: ** EGEN Version 1.09.000 88/08/21 **
15: ** **
16: ** EGEN -P -R8 -V -A -N5 -Dreal.gen ( @ @ ) @ ( @ @ ) **
17: ****************************************************************************/
18: #include "defs.h"
19:
20:
21: int main()
22: {
23: extern char *Filename;
24: auto float f1;
25: auto float * pf1;
26: auto float f2;
27: auto float * pf2;
28: auto float f3;
29: auto float * pf3;
30: auto float f4;
31: auto float * pf4;
32: auto double d1;
33: auto double * pd1;
34: auto double d2;
35: auto double * pd2;
36: auto double d3;
37: auto double * pd3;
38: auto double d4;
39: auto double * pd4;
40: auto double d5;
41: auto double * pd5;
42: auto double d6;
43: auto double * pd6;
44:
45: f1 = fvalue(1.000000E+000);
46: pf1 = &f1;
47: f2 = fvalue(2.000000E+000);
48: pf2 = &f2;
49: f3 = fvalue(3.000000E+000);
50: pf3 = &f3;
51: f4 = fvalue(4.000000E+000);
52: pf4 = &f4;
53: d1 = dvalue(1.000000000000000E+000);
54: pd1 = &d1;
55: d2 = dvalue(2.000000000000000E+000);
56: pd2 = &d2;
57: d3 = dvalue(3.000000000000000E+000);
58: pd3 = &d3;
59: d4 = dvalue(4.000000000000000E+000);
60: pd4 = &d4;
61: d5 = dvalue(5.000000000000000E+000);
62: pd5 = &d5;
63: d6 = dvalue(6.000000000000000E+000);
64: pd6 = &d6;
65: Filename = "real8.c";
66:
67: /* 1.00000000000000E+000 * 1.00000000000000E+000 => 1.00000000000000E+000 */
68: /* 1.00000000000000E+000 + 5.00000000000000E+000 => 6.00000000000000E+000 */
69: /* 6.00000000000000E+000 /= 3.00000E+000 => 2.00000000000000E+000 */
70: /* 4.00000E+000 += 2.00000E+000 => 6.00000E+000 */
71: /* 6.00000E+000 - 6.00000E+000 => 0.00000E+000 */
72: fequals(__LINE__, (((d1 * d1) + *pd5) - (f4 += (d6 /= *pf3))), 0.00000E+000);
73: fequals(__LINE__, d6, 2.00000E+000);
74: fequals(__LINE__, f4, 6.00000E+000);
75:
76: /* pre-- 2.00000000000000E+000 => 1.00000000000000E+000 */
77: /* 5.00000000000000E+000 == 1.00000000000000E+000 => 0 */
78: /* 2.00000E+000 * 1.00000000000000E+000 => 2.00000000000000E+000 */
79: /* 2.00000000000000E+000 < 1.00000000000000E+000 => 0 */
80: /* 0 - 0 => 0 */
81: iequals(__LINE__, ((d5 == ( -- d6)) - ((f2 * d1) < d1)), 0);
82: dequals(__LINE__, d6, 1.00000000000000E+000);
83:
84: /* neg 5.00000000000000E+000 => -5.00000000000000E+000 */
85: /* -5.00000000000000E+000 - 5.00000000000000E+000 => -1.00000000000000E+001 */
86: /* 5.00000000000000E+000 < 3.00000E+000 => 0 */
87: /* 0 >= 1.00000E+000 => 0 */
88: /* -1.00000000000000E+001 == 0 => 0 */
89: iequals(__LINE__, ((( - d5) - d5) == ((*pd5 < f3) >= *pf1)), 0);
90:
91: /* post-- 1.00000000000000E+000 => 2.00000000000000E+000 */
92: /* 1.00000E+000 + 2.00000000000000E+000 => 3.00000000000000E+000 */
93: /* pre-- 3.00000E+000 => 2.00000E+000 */
94: /* 2.00000E+000 && 2.00000E+000 => 1 */
95: /* 3.00000E+000 < 1 => 0 */
96: iequals(__LINE__, ((f1 + ((*pd2)-- )) < (( -- *pf3) && f2)), 0);
97: fequals(__LINE__, f3, 2.00000E+000);
98: fequals(__LINE__, d2, 1.00000E+000);
99:
100: /* post++ 3.00000E+000 => 2.00000E+000 */
101: /* 2.00000E+000 + 6.00000E+000 => 8.00000E+000 */
102: /* ! 1.00000E+000 => 0 */
103: /* 0 || 2.00000E+000 => 1 */
104: /* 8.00000E+000 && 1 => 1 */
105: iequals(__LINE__, ((((*pf2)++ ) + f4) && (( ! *pf1) || *pf3)), 1);
106: fequals(__LINE__, f2, 3.00000E+000);
107:
108: return report(Filename);
109: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.