![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to mix7.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Research Unix] / researchv10no / cmd / lcc / ph|
Return to mix7.c CVS log | Up to [Research Unix] / researchv10no / 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 -R7 -V -A -N5 -Dmixed.gen ( @ @ ) @ ( @ @ ) **
17: ****************************************************************************/
18: #include "defs.h"
19:
20:
21: int main()
22: {
23: extern char *Filename;
24: static float f1;
25: auto float * pf1;
26: static long stlong1;
27: static float f2;
28: auto float * pf2;
29: static long stlong2;
30: static float f3;
31: static float * pf3;
32: auto long stlong3;
33: static float f4;
34: static float * pf4;
35: static long stlong4;
36: static double d1;
37: auto double * pd1;
38: static long stlong5;
39: static double d2;
40: static double * pd2;
41: static long stlong6;
42: auto double d3;
43: static double * pd3;
44: static long stlong7;
45: static double d4;
46: static double * pd4;
47: auto long stlong8;
48:
49: f1 = fvalue(1.100000E+000);
50: pf1 = &f1;
51: stlong1 = lvalue(1L);
52: f2 = fvalue(2.200000E+000);
53: pf2 = &f2;
54: stlong2 = lvalue(2L);
55: f3 = fvalue(3.300000E+000);
56: pf3 = &f3;
57: stlong3 = lvalue(3L);
58: f4 = fvalue(4.400000E+000);
59: pf4 = &f4;
60: stlong4 = lvalue(4L);
61: d1 = dvalue(1.100000000000000E+000);
62: pd1 = &d1;
63: stlong5 = lvalue(5L);
64: d2 = dvalue(2.200000000000000E+000);
65: pd2 = &d2;
66: stlong6 = lvalue(6L);
67: d3 = dvalue(3.300000000000000E+000);
68: pd3 = &d3;
69: stlong7 = lvalue(7L);
70: d4 = dvalue(4.400000000000000E+000);
71: pd4 = &d4;
72: stlong8 = lvalue(8L);
73: Filename = "mix7.c";
74:
75: /* 1.10000000000000E+000 < 3.30000000000000E+000 => 1 */
76: /* 1L != 1 => 0 */
77: /* 2L /= 6L => 0L */
78: /* 7L ^= 0L => 7L */
79: /* 0 || 7L => 1 */
80: iequals(__LINE__, ((stlong1 != (d1 < *pd3)) || (stlong7 ^= (stlong2 /= stlong6))), 1);
81: lequals(__LINE__, stlong2, 0L);
82: lequals(__LINE__, stlong7, 7L);
83:
84: /* ! 8L => 0 */
85: /* 3L << 0 => 3L */
86: /* 6L && 3L => 1 */
87: /* 4L |= 1 => 5L */
88: /* 3L - 5L => -2L */
89: lequals(__LINE__, ((stlong3 << ( ! stlong8)) - (stlong4 |= (stlong6 && stlong3))), -2L);
90: lequals(__LINE__, stlong4, 5L);
91:
92: /* 7L * 6L => 42L */
93: /* 0L & 42L => 0L */
94: /* neg 5L => -5L */
95: /* -5L % 3L => -2L */
96: /* 0L < -2L => 0 */
97: iequals(__LINE__, ((stlong2 & (stlong7 * stlong6)) < (( - stlong4) % stlong3)), 0);
98:
99: /* 1L ^ 5L => 4L */
100: /* 4L && 4.40000E+000 => 1 */
101: /* post-- 4L => 5L */
102: /* 1.10000000000000E+000 = 5L => 5.00000000000000E+000 */
103: /* 1 - 5.00000000000000E+000 => -4.00000000000000E+000 */
104: dequals(__LINE__, (((stlong1 ^ stlong4) && f4) - (d1 = ((stlong5)-- ))), -4.00000000000000E+000);
105: lequals(__LINE__, stlong5, 4L);
106: dequals(__LINE__, d1, 5.00000000000000E+000);
107:
108: /* 0L - 5.00000000000000E+000 => -5.00000000000000E+000 */
109: /* 2.20000E+000 /= -5.00000E+000 => -4.40000E-001 */
110: /* 2.20000E+000 + 1.10000E+000 => 3.30000E+000 */
111: /* 8L && 3.30000E+000 => 1 */
112: /* -4.40000E-001 + 1 => 5.60000E-001 */
113: fequals(__LINE__, ((f2 /= (stlong2 - *pd1)) + (stlong8 && (d2 + *pf1))), 5.60000E-001);
114: fequals(__LINE__, f2, -4.40000E-001);
115:
116: return report(Filename);
117: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.