![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to real4.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Research Unix] / researchv10dc / cmd / lcc / ph|
Return to real4.c CVS log | Up to [Research Unix] / researchv10dc / cmd / lcc / ph |
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 -R4 -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 = "real4.c";
66:
67: /* pre-- 4.00000E+000 => 3.00000E+000 */
68: /* 3.00000E+000 == 1.00000E+000 => 0 */
69: /* 6.00000E+000 && 5.00000E+000 => 1 */
70: /* 4.00000E+000 /= 1 => 4.00000E+000 */
71: /* 0 - 4.00000E+000 => -4.00000E+000 */
72: fequals(__LINE__, ((( -- *pf4) == f1) - (d4 /= (*pd6 && d5))), -4.00000E+000);
73: fequals(__LINE__, d4, 4.00000E+000);
74: fequals(__LINE__, f4, 3.00000E+000);
75:
76: /* post-- 0.00000E+000 => 1.00000E+000 */
77: /* 5.00000E+000 != 1.00000E+000 => 1 */
78: /* 5.00000E+000 + 3.00000E+000 => 8.00000E+000 */
79: /* 2.00000E+000 && 8.00000E+000 => 1 */
80: /* 1 + 1 => 2 */
81: iequals(__LINE__, ((*pd5 != ((*pf1)-- )) + (*pd2 && (d5 + f4))), 2);
82: fequals(__LINE__, f1, 0.00000E+000);
83:
84: /* ! 4.00000000000000E+000 => 0 */
85: /* 0 == 1.00000000000000E+000 => 0 */
86: /* 6.00000000000000E+000 *= 3.00000000000000E+000 => 1.80000000000000E+001 */
87: /* 2.00000000000000E+000 /= 1.80000000000000E+001 => 1.11111111111111E-001 */
88: /* 0 > 1.1111111111111111111111111111E-001 => 0 */
89: iequals(__LINE__, ((( ! d4) == *pd1) > (d2 /= (d6 *= d3))), 0);
90: dequals(__LINE__, d6, 1.80000000000000E+001);
91: dequals(__LINE__, d2, 1.1111111111111111111111111111E-001);
92:
93: /* post-- 0.00000000000000E+000 => 1.00000000000000E+000 */
94: /* 3.00000000000000E+000 > 1.00000000000000E+000 => 1 */
95: /* 1.80000000000000E+001 < 2.00000E+000 => 0 */
96: /* 0 >= 3.00000E+000 => 0 */
97: /* 1 - 0 => 1 */
98: iequals(__LINE__, ((d3 > ((d1)-- )) - ((*pd6 < *pf2) >= f4)), 1);
99: dequals(__LINE__, d1, 0.00000000000000E+000);
100:
101: /* 3.00000000000000E+000 < 1.80000000000000E+001 => 1 */
102: /* 1.80000000000000E+001 != 1 => 1 */
103: /* 1 >= 1 => 1 */
104: iequals(__LINE__, ((d6 != (*pd3 < *pd6)) >= (*pf4 || (*pf1 > *pd4))), 1);
105:
106: return report(Filename);
107: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.