summaryrefslogtreecommitdiffstats
path: root/llvm/test/array.c
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2001-07-15 00:18:50 +0000
committerChris Lattner <sabre@nondot.org>2001-07-15 00:18:50 +0000
commitabc1609342fd0a9a64a6c9d239fdd3adabdcc044 (patch)
tree2c1eafe0d347daa1e981ae0b69f1b1f8fca3915c /llvm/test/array.c
parentd06dd69e73d000d5c379d2fd59e20b4e57614cc0 (diff)
downloadbcm5719-llvm-abc1609342fd0a9a64a6c9d239fdd3adabdcc044.tar.gz
bcm5719-llvm-abc1609342fd0a9a64a6c9d239fdd3adabdcc044.zip
New testcase from GCC doing array operations
llvm-svn: 192
Diffstat (limited to 'llvm/test/array.c')
-rw-r--r--llvm/test/array.c30
1 files changed, 30 insertions, 0 deletions
diff --git a/llvm/test/array.c b/llvm/test/array.c
new file mode 100644
index 00000000000..c24321e8fbe
--- /dev/null
+++ b/llvm/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
OpenPOWER on IntegriCloud