OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

20020402-1.c: New test. 

2002-04-02  Franz Sirl  <Franz.Sirl-kernel@lauterbach.com>

	* gcc.c-torture/execute/20020402-1.c: New test.

From-SVN: r51762
This commit is contained in:
Franz Sirl 2002-04-02 22:01:54 +00:00 committed by Franz Sirl
parent fe660a1a19
commit cfe834f307
2 changed files with 45 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
gcc/testsuite/ChangeLog
View File

@ -1,3 +1,7 @@
2002-04-02 Franz Sirl <Franz.Sirl-kernel@lauterbach.com>
* gcc.c-torture/execute/20020402-1.c: New test.
2002-04-01 Richard Henderson <rth@redhat.com>
* gcc.c-torture/compile/920625-1.x: XFAIL -O1.

41
gcc/testsuite/gcc.c-torture/execute/20020402-1.c Normal file
View File

@ -0,0 +1,41 @@
/* derived from PR c/2100 */
extern void abort ();
extern void exit (int);
#define SMALL_N 2
#define NUM_ELEM 4
int main(void)
{
int listElem[NUM_ELEM]={30,2,10,5};
int listSmall[SMALL_N];
int i, j;
int posGreatest=-1, greatest=-1;
for (i=0; i<SMALL_N; i++) {
listSmall[i] = listElem[i];
if (listElem[i] > greatest) {
posGreatest = i;
greatest = listElem[i];
}
}
for (i=SMALL_N; i<NUM_ELEM; i++) {
if (listElem[i] < greatest) {
listSmall[posGreatest] = listElem[i];
posGreatest = 0;
greatest = listSmall[0];
for (j=1; j<SMALL_N; j++)
if (listSmall[j] > greatest) {
posGreatest = j;
greatest = listSmall[j];
}
}
}
if (listSmall[0] != 5 || listSmall[1] != 2)
abort ();
exit (0);
}