diff options
author | Chris Lattner <sabre@nondot.org> | 2001-07-15 00:18:50 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2001-07-15 00:18:50 +0000 |
commit | 9674104416677ace7ac863c00ce8533b95906c92 (patch) | |
tree | b0b2c624a86394eb49cb9de803a18f9714af55ac | |
parent | a59c266d843ffef164a5038ed7d14ffd90b9d445 (diff) | |
download | llvm-9674104416677ace7ac863c00ce8533b95906c92.tar.gz llvm-9674104416677ace7ac863c00ce8533b95906c92.tar.bz2 llvm-9674104416677ace7ac863c00ce8533b95906c92.tar.xz |
New testcase from GCC doing array operations
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@192 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r-- | test/array.c | 30 |
1 files changed, 30 insertions, 0 deletions
diff --git a/test/array.c b/test/array.c new file mode 100644 index 0000000000..c24321e8fb --- /dev/null +++ b/test/array.c @@ -0,0 +1,30 @@ +extern printf(const char *, double, double); + +int +checkIdxCode(int N, int* A, float F[][30]) +{ + int i, j; + float sumA=0.0, sumF=0.0; + for (i=0; i < 12; i++) + { + sumA = sumA + A[i]; + for (j=0; j < 10; j++) + { + F[i][j] = 0.5 * (F[i][j-1] + F[i-1][j]); + sumF = sumF + F[i][j]; + } + } + printf("sumA = %lf, sumF = %lf\n", sumA, sumF); +} + +#if 0 +int +main(int argc, char** argv) +{ + int N = argc+20; + int* A = (int*) malloc(N * sizeof(int)); + float F[25][30]; + return checkIdxCode(N, A, F); +} + +#endif |