1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
/* { dg-do compile } */
/* { dg-options "-O2 -fgraphite -fdump-tree-graphite-all" } */
#define FLOAT float
int foo (void);
/* Multiply two n x n matrices A and B and store the result in C. */
void matmult (FLOAT **A, FLOAT **B, FLOAT **C, int n)
{
int i,j,k;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
for (k = 0; k < n; k++)
A[i][j] += B[i][k] * C[k][j];
}
/* { dg-final { scan-tree-dump-times "number of SCoPs: 3" 1 "graphite"} } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
/* { dg-do compile } */
/* { dg-options "-O2 -fgraphite -fdump-tree-graphite-all" } */
#define FLOAT float
int foo (void);
/* Multiply two n x n matrices A and B and store the result in C. */
void matmult (FLOAT **A, FLOAT **B, FLOAT **C, int n)
{
int i,j,k;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
for (k = 0; k < n; k++)
A[i][j] += B[i][k] * C[k][j];
}
/* { dg-final { scan-tree-dump-times "number of SCoPs: 3" 1 "graphite"} } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
/* { dg-do compile } */
/* { dg-options "-O2 -fgraphite -fdump-tree-graphite-all" } */
#define FLOAT float
int foo (void);
/* Multiply two n x n matrices A and B and store the result in C. */
void matmult (FLOAT **A, FLOAT **B, FLOAT **C, int n)
{
int i,j,k;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
for (k = 0; k < n; k++)
A[i][j] += B[i][k] * C[k][j];
}
/* { dg-final { scan-tree-dump-times "number of SCoPs: 3" 1 "graphite"} } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
