Mercurial > hg > CbC > CbC_gcc

annotate gcc/testsuite/gcc.dg/graphite/block-8.c @ 158:494b0b89df80 default tip

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
...
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Mon, 25 May 2020 18:13:55 +0900
parents 04ced10e8804
children
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
111
kono
parents:
diff changeset
1 /* { dg-require-effective-target size32plus } */
kono
parents:
diff changeset
2 /* { dg-require-effective-target run_expensive_tests } PR testsuite/48283 */
kono
parents:
diff changeset
3
kono
parents:
diff changeset
4 #define DEBUG 0
kono
parents:
diff changeset
5 #if DEBUG
kono
parents:
diff changeset
6 #include <stdio.h>
kono
parents:
diff changeset
7 #endif
kono
parents:
diff changeset
8
kono
parents:
diff changeset
9 #define N 200
kono
parents:
diff changeset
10
kono
parents:
diff changeset
11 int A[N][N], B[N][N], C[N][N];
kono
parents:
diff changeset
12
kono
parents:
diff changeset
13 static void __attribute__((noinline))
kono
parents:
diff changeset
14 matmult (void)
kono
parents:
diff changeset
15 {
kono
parents:
diff changeset
16 int i, j, k;
kono
parents:
diff changeset
17
kono
parents:
diff changeset
18 for (i = 0; i < N; i++)
kono
parents:
diff changeset
19 for (j = 0; j < N; j++)
kono
parents:
diff changeset
20 A[i][j] = 0;
kono
parents:
diff changeset
21
kono
parents:
diff changeset
22 /* This should be blocked. */
kono
parents:
diff changeset
23 for (i = 0; i < N; i++)
kono
parents:
diff changeset
24 for (j = 0; j < N; j++)
kono
parents:
diff changeset
25 for (k = 0; k < N; k++)
kono
parents:
diff changeset
26 A[i][j] += B[i][k] * C[k][j];
kono
parents:
diff changeset
27 }
kono
parents:
diff changeset
28
kono
parents:
diff changeset
29 extern void abort ();
kono
parents:
diff changeset
30
kono
parents:
diff changeset
31 int
kono
parents:
diff changeset
32 main (void)
kono
parents:
diff changeset
33 {
kono
parents:
diff changeset
34 int i, j, res = 0;
kono
parents:
diff changeset
35
kono
parents:
diff changeset
36 for (i = 0; i < N; i++)
kono
parents:
diff changeset
37 for (j = 0; j < N; j++)
kono
parents:
diff changeset
38 {
kono
parents:
diff changeset
39 B[i][j] = j;
kono
parents:
diff changeset
40 C[i][j] = i;
kono
parents:
diff changeset
41 }
kono
parents:
diff changeset
42
kono
parents:
diff changeset
43 matmult ();
kono
parents:
diff changeset
44
kono
parents:
diff changeset
45 for (i = 0; i < N; i++)
kono
parents:
diff changeset
46 res += A[i][i];
kono
parents:
diff changeset
47
kono
parents:
diff changeset
48 #if DEBUG
kono
parents:
diff changeset
49 fprintf (stderr, "res = %d \n", res);
kono
parents:
diff changeset
50 #endif
kono
parents:
diff changeset
51
kono
parents:
diff changeset
52 if (res != 529340000)
kono
parents:
diff changeset
53 abort ();
kono
parents:
diff changeset
54
kono
parents:
diff changeset
55 return 0;
kono
parents:
diff changeset
56 }
kono
parents:
diff changeset
57
kono
parents:
diff changeset
58 /* { dg-final { scan-tree-dump "tiled by" "graphite" } } */