Return to real12.c CVS log

Up to [Research Unix] / researchv10no / cmd / lcc / ph

researchv10 Norman

/* The Plum Hall Validation Suite for C
 * Unpublished copyright (c) 1986-1991, Chiron Systems Inc and Plum Hall Inc.
 * VERSION: 4
 * DATE: 1993-01-01
 * The "ANSI" mode of the Suite corresponds to the official ANSI C, X3.159-1989.
 * As per your license agreement, your distribution is not to be moved or copied outside the Designated Site
 * without specific permission from Plum Hall Inc.
 */

/****************************************************************************
 ** Self-checking C source code generated by EGEN component of             **
 **    The Plum Hall Validation Suite for C.                               **
 **    (C) 1986-1988 Chiron Systems Inc and Plum Hall Inc                  **
 **    EGEN Version 1.09.000  88/08/21                                     **
 **                                                                        **
 **    EGEN -P -R12 -V -A -N5 -Dreal.gen ( @ @ ) @ ( @ @ )                 **
 ****************************************************************************/
#include  "defs.h"


int main()
	{
	extern char *Filename;
	auto float f1;
	auto float * pf1;
	auto float f2;
	auto float * pf2;
	auto float f3;
	auto float * pf3;
	auto float f4;
	auto float * pf4;
	auto double d1;
	auto double * pd1;
	auto double d2;
	auto double * pd2;
	auto double d3;
	auto double * pd3;
	auto double d4;
	auto double * pd4;
	auto double d5;
	auto double * pd5;
	auto double d6;
	auto double * pd6;

	f1 = fvalue(1.000000E+000);
	pf1 = &f1;
	f2 = fvalue(2.000000E+000);
	pf2 = &f2;
	f3 = fvalue(3.000000E+000);
	pf3 = &f3;
	f4 = fvalue(4.000000E+000);
	pf4 = &f4;
	d1 = dvalue(1.000000000000000E+000);
	pd1 = &d1;
	d2 = dvalue(2.000000000000000E+000);
	pd2 = &d2;
	d3 = dvalue(3.000000000000000E+000);
	pd3 = &d3;
	d4 = dvalue(4.000000000000000E+000);
	pd4 = &d4;
	d5 = dvalue(5.000000000000000E+000);
	pd5 = &d5;
	d6 = dvalue(6.000000000000000E+000);
	pd6 = &d6;
	Filename = "real12.c";

	/* 6.00000000000000E+000 -= 1.00000000000000E+000 => 5.00000000000000E+000 */
	/* 2.00000000000000E+000 += 5.00000000000000E+000 => 7.00000000000000E+000 */
	/* pre++ 3.00000E+000 => 4.00000E+000 */
	/* 2.00000E+000 += 4.00000E+000 => 6.00000E+000 */
	/* 7.00000E+000 <= 6.00000E+000 => 0 */
	iequals(__LINE__, ((*pd2 += (*pd6 -= *pd1)) <= (f2 += ( ++ f3))), 0);
	fequals(__LINE__, f3, 4.00000E+000);
	fequals(__LINE__, f2, 6.00000E+000);
	fequals(__LINE__, d6, 5.00000E+000);
	fequals(__LINE__, d2, 7.00000E+000);

	/* 1.00000000000000E+000 += 6.00000E+000 => 7.00000000000000E+000 */
	/* 3.00000000000000E+000 += 7.00000000000000E+000 => 1.00000000000000E+001 */
	/* 4.00000000000000E+000 != 4.00000E+000 => 0 */
	/* 0 != 4.00000000000000E+000 => 1 */
	/* 1.00000000000000E+001 <= 1 => 0 */
	iequals(__LINE__, ((*pd3 += (d1 += f2)) <= ((*pd4 != f4) != d4)), 0);
	dequals(__LINE__, d1, 7.00000000000000E+000);
	dequals(__LINE__, d3, 1.00000000000000E+001);

	/* 4.00000E+000 <= 6.00000E+000 => 1 */
	/* 1 != 5.00000000000000E+000 => 1 */
	/* post-- 6.00000000000000E+000 => 7.00000000000000E+000 */
	/* 4.00000E+000 *= 7.00000E+000 => 2.80000E+001 */
	/* 1 && 2.80000E+001 => 1 */
	iequals(__LINE__, (((f3 <= *pf2) != d5) && (*pf4 *= ((d1)-- ))), 1);
	fequals(__LINE__, d1, 6.00000E+000);
	fequals(__LINE__, f4, 2.80000E+001);

	/* post++ 6.00000000000000E+000 => 5.00000000000000E+000 */
	/* ! 5.00000000000000E+000 => 0 */
	/* 5.00000000000000E+000 + 5.00000000000000E+000 => 1.00000000000000E+001 */
	/* 5.00000000000000E+000 && 1.00000000000000E+001 => 1 */
	/* 0 / 1 => 0 */
	iequals(__LINE__, (( ! ((*pd5)++ )) / (d6 && (d6 + d6))), 0);
	dequals(__LINE__, d5, 6.00000000000000E+000);

	/* post++ 5.00000E+000 => 4.00000E+000 */
	/* pre++ 2.80000E+001 => 2.90000E+001 */
	/* 4.00000E+000 * 2.90000E+001 => 1.16000E+002 */
	/* 1 >= 1.16000E+002 => 0 */
	iequals(__LINE__, ((((*pf3)++ ) || d6) >= (d4 * ( ++ f4))), 0);
	fequals(__LINE__, f4, 2.90000E+001);
	fequals(__LINE__, f3, 5.00000E+000);

	return 	report(Filename);
	}

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.