|
|
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 -R6 -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 = "real6.c"; ! 66: ! 67: /* 2.00000000000000E+000 = 1 => 1.00000000000000E+000 */ ! 68: /* pre++ 4.00000E+000 => 5.00000E+000 */ ! 69: /* 5.00000E+000 += 5.00000E+000 => 1.00000E+001 */ ! 70: /* 1.00000E+000 <= 1.00000E+001 => 1 */ ! 71: iequals(__LINE__, ((d2 = (f1 || d4)) <= (d5 += ( ++ *pf4))), 1); ! 72: fequals(__LINE__, f4, 5.00000E+000); ! 73: fequals(__LINE__, d5, 1.00000E+001); ! 74: fequals(__LINE__, d2, 1.00000E+000); ! 75: ! 76: /* 4.00000000000000E+000 * 2.00000E+000 => 8.00000000000000E+000 */ ! 77: /* 1.00000000000000E+000 - 8.00000000000000E+000 => -7.00000000000000E+000 */ ! 78: /* 2.00000E+000 <= 5.00000E+000 => 1 */ ! 79: /* -7.00000000000000E+000 == 1 => 0 */ ! 80: iequals(__LINE__, ((d2 - (*pd4 * *pf2)) == ((f2 <= f4) || *pd5)), 0); ! 81: ! 82: /* 1.00000000000000E+000 < 1.00000000000000E+000 => 0 */ ! 83: /* 3.00000000000000E+000 += 0 => 3.00000000000000E+000 */ ! 84: /* post-- 9.00000000000000E+000 => 1.00000000000000E+001 */ ! 85: /* 4.00000000000000E+000 != 1.00000000000000E+001 => 1 */ ! 86: /* 3.00000000000000E+000 != 1 => 1 */ ! 87: iequals(__LINE__, ((*pd3 += (d2 < d1)) != (d4 != ((*pd5)-- ))), 1); ! 88: dequals(__LINE__, d5, 9.00000000000000E+000); ! 89: dequals(__LINE__, d3, 3.00000000000000E+000); ! 90: ! 91: /* ! 6.00000000000000E+000 => 0 */ ! 92: /* 1.00000000000000E+000 >= 0 => 1 */ ! 93: /* 5.00000E+000 != 3.00000000000000E+000 => 1 */ ! 94: /* 1 != 2.00000E+000 => 1 */ ! 95: /* 1 && 1 => 1 */ ! 96: iequals(__LINE__, ((d2 >= ( ! d6)) && ((*pf4 != d3) != *pf2)), 1); ! 97: ! 98: /* 5.00000E+000 + 1.00000E+000 => 6.00000E+000 */ ! 99: /* 3.00000E+000 < 6.00000E+000 => 1 */ ! 100: /* pre-- 6.00000E+000 => 5.00000E+000 */ ! 101: /* 2.00000E+000 -= 5.00000E+000 => -3.00000E+000 */ ! 102: /* 1 - -3.00000E+000 => 4.00000E+000 */ ! 103: fequals(__LINE__, ((d3 < (*pf4 + *pf1)) - (f2 -= ( -- d6))), 4.00000E+000); ! 104: fequals(__LINE__, d6, 5.00000E+000); ! 105: fequals(__LINE__, f2, -3.00000E+000); ! 106: ! 107: return report(Filename); ! 108: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.