summaryrefslogtreecommitdiff
path: root/gcc/testsuite/gcc.c-torture/execute/20020402-1.c
diff options
context:
space:
mode:
authorupstream source tree <ports@midipix.org>2015-03-15 20:14:05 -0400
committerupstream source tree <ports@midipix.org>2015-03-15 20:14:05 -0400
commit554fd8c5195424bdbcabf5de30fdc183aba391bd (patch)
tree976dc5ab7fddf506dadce60ae936f43f58787092 /gcc/testsuite/gcc.c-torture/execute/20020402-1.c
downloadcbb-gcc-4.6.4-554fd8c5195424bdbcabf5de30fdc183aba391bd.tar.bz2
cbb-gcc-4.6.4-554fd8c5195424bdbcabf5de30fdc183aba391bd.tar.xz
obtained gcc-4.6.4.tar.bz2 from upstream website;upstream
verified gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream tarball. downloading a git-generated archive based on the 'upstream' tag should provide you with a source tree that is binary identical to the one extracted from the above tarball. if you have obtained the source via the command 'git clone', however, do note that line-endings of files in your working directory might differ from line-endings of the respective files in the upstream repository.
Diffstat (limited to 'gcc/testsuite/gcc.c-torture/execute/20020402-1.c')
-rw-r--r--gcc/testsuite/gcc.c-torture/execute/20020402-1.c41
1 files changed, 41 insertions, 0 deletions
diff --git a/gcc/testsuite/gcc.c-torture/execute/20020402-1.c b/gcc/testsuite/gcc.c-torture/execute/20020402-1.c
new file mode 100644
index 000000000..fe2a6f657
--- /dev/null
+++ b/gcc/testsuite/gcc.c-torture/execute/20020402-1.c
@@ -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);
+}
+