![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to int8.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 int8.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 -R8 -V -A -N5 -Dinteger.gen ( @ @ ) @ ( @ @ ) **
17: ****************************************************************************/
18: #include "defs.h"
19:
20:
21: int main()
22: {
23: extern char *Filename;
24: auto unsigned int ui;
25: static unsigned int * pui;
26: auto unsigned int ** ppui;
27: auto int i;
28: static int * pi;
29: auto int ** ppi;
30: auto unsigned short us;
31: static unsigned short * pus;
32: auto unsigned short ** ppus;
33: auto short s;
34: static short * ps;
35: auto short ** pps;
36: auto unsigned char uc;
37: static unsigned char * puc;
38: auto unsigned char ** ppuc;
39: auto char c;
40: static char * pc;
41: auto char ** ppc;
42: auto unsigned long ul;
43: static unsigned long * pul;
44: auto unsigned long ** ppul;
45: auto long l;
46: static long * pl;
47: auto long ** ppl;
48: register int rint1;
49: register int rint2;
50: register int rint3;
51: register int rint4;
52: register int rint5;
53:
54: ui = ivalue(100);
55: pui = &ui;
56: ppui = &pui;
57: i = ivalue(10);
58: pi = &i;
59: ppi = π
60: us = lvalue(33000);
61: pus = &us;
62: ppus = &pus;
63: s = ivalue(13);
64: ps = &s;
65: pps = &ps;
66: uc = ivalue(128);
67: puc = &uc;
68: ppuc = &puc;
69: c = ivalue(20);
70: pc = &c;
71: ppc = &pc;
72: ul = lvalue(65000L);
73: pul = &ul;
74: ppul = &pul;
75: l = lvalue(97L);
76: pl = &l;
77: ppl = &pl;
78: rint1 = ivalue(1);
79: rint2 = ivalue(2);
80: rint3 = ivalue(3);
81: rint4 = ivalue(4);
82: rint5 = ivalue(5);
83: Filename = "int8.c";
84:
85: /* 1 % 13 => 1 */
86: /* 1 > 1 => 0 */
87: /* post-- 1 => 2 */
88: /* 97L %= 2 => 1L */
89: /* 0 & 1L => 0L */
90: lequals(__LINE__, (((rint1 % s) > rint1) & (**ppl %= ((rint2)-- ))), 0L);
91: iequals(__LINE__, rint2, 1);
92: lequals(__LINE__, l, 1L);
93:
94: /* 1L * 0x64 => 100L */
95: /* 100L + 0x64 => 200L */
96: /* 0x80 /= 20 => 0x6 */
97: /* 10 += 0x6 => 16 */
98: /* 200L - 16 => 184L */
99: lequals(__LINE__, (((*pl * ui) + **ppui) - (**ppi += (**ppuc /= **ppc))), 184L);
100: iequals(__LINE__, uc, (unsigned)6);
101: iequals(__LINE__, i, 16);
102:
103: /* 1 >>= 1 => 0 */
104: /* 1L >>= 0 => 1L */
105: /* 1L + 1 => 2L */
106: lequals(__LINE__, ((*pl >>= (rint1 >>= rint2)) + (**ppc || ( ! ui))), 2L);
107: iequals(__LINE__, rint1, 0);
108: lequals(__LINE__, l, 1L);
109:
110: /* post-- 2 => 3 */
111: /* 0x64 = 3 => 0x3 */
112: /* pre++ 0xfde8L => 0xfde9L */
113: /* 4 ^ 0xfde9L => 0xfdedL */
114: /* 0x3 | 0xfdedL => 0xfdefL */
115: lequals(__LINE__, ((**ppui = ((rint3)-- )) | (rint4 ^ ( ++ ul))), 0xfdefL);
116: lequals(__LINE__, ul, 65001L);
117: iequals(__LINE__, rint3, 2);
118: iequals(__LINE__, ui, (unsigned)3);
119:
120: /* pre-- 0x6 => 0x5 */
121: /* 2 == 5 => 0 */
122: /* 1L * 20 => 20L */
123: /* 20L < 1L => 0 */
124: /* 0 - 0 => 0 */
125: iequals(__LINE__, ((rint3 == ( -- **ppuc)) - ((l * c) < **ppl)), 0);
126: iequals(__LINE__, uc, (unsigned)5);
127:
128: return report(Filename);
129: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.