libcpp, c, middle-end: Optimize initializers using #embed in C
[official-gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / loop-interchange-1b.c
bloba3063bbef45824bbfb95a5711cf6ed5bf8fc2d9e
1 /* { dg-do run } */
2 /* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */
3 /* { dg-require-effective-target size32plus } */
4 /* { dg-skip-if "too big data segment" { visium-*-* } } */
6 /* Copied from graphite/interchange-4.c */
8 #define DEBUG 0
9 #if DEBUG
10 #include <stdio.h>
11 #endif
13 double u[1782225];
15 static void __attribute__((noinline))
16 foo (int N, double *res)
18 int i, j;
19 double sum = 0;
20 for (i = 0; i < N; i++)
21 for (j = 0; j < N; j++)
22 sum = sum + u[i + 1335 * j];
24 *res = sum;
27 extern void abort ();
29 int
30 main (void)
32 int i, j;
33 double res;
35 for (i = 0; i < 1782225; i++)
36 u[i] = 0;
37 u[0] = __DBL_MAX__;
38 u[1335] = -__DBL_MAX__;
39 u[1] = __DBL_MAX__;
40 u[1336] = -__DBL_MAX__;
42 foo (1335, &res);
44 #if DEBUG
45 fprintf (stderr, "res = %d \n", res);
46 #endif
48 if (res != 0.0)
49 abort ();
51 return 0;
54 /* { dg-final { scan-tree-dump-not "is interchanged" "linterchange"} } */