Commit 3f3181b1 by Richard Biener Committed by Richard Biener

re PR tree-optimization/76957 (XFAIL: gcc.dg/graphite/scop-dsyr2k.c…

re PR tree-optimization/76957 (XFAIL: gcc.dg/graphite/scop-dsyr2k.c scan-tree-dump-times graphite "number of SCoPs)

2017-02-01  Richard Biener  <rguenther@suse.de>

	PR testsuite/76957
	* gcc.dg/graphite/scop-dsyr2k-2.c: New testcase.
	* gcc.dg/graphite/scop-dsyrk-2.c: Likewise.
	* gcc.dg/graphite/scop-dsyr2k.c: XFAIL.
	* gcc.dg/graphite/scop-dsyrk.c: Likewise.

From-SVN: r245094
parent 2cf9276b
2017-02-01 Richard Biener <rguenther@suse.de>
PR testsuite/76957
* gcc.dg/graphite/scop-dsyr2k-2.c: New testcase.
* gcc.dg/graphite/scop-dsyrk-2.c: Likewise.
* gcc.dg/graphite/scop-dsyr2k.c: XFAIL.
* gcc.dg/graphite/scop-dsyrk.c: Likewise.
2017-02-01 Richard Biener <rguenther@suse.de>
PR middle-end/79315
* gfortran.dg/pr79315.f90: New testcase.
......
/* { dg-require-effective-target size32plus } */
#define NMAX 3000
static double a[NMAX][NMAX], b[NMAX][NMAX], c[NMAX][NMAX];
typedef __INT32_TYPE__ int32_t;
typedef __INT64_TYPE__ int64_t;
void dsyr2k(int64_t N) {
int32_t i,j,k;
#pragma scop
for (i=0; i<N; i++) {
for (j=0; j<N; j++) {
for (k=j; k<N; k++) {
c[j][k] += a[i][j] * b[i][k] + b[i][j] * a[i][k];
}
}
}
#pragma endscop
}
/* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite"} } */
......@@ -3,7 +3,7 @@
static double a[NMAX][NMAX], b[NMAX][NMAX], c[NMAX][NMAX];
void dsyr2k(long N) {
void dsyr2k(int N) {
int i,j,k;
#pragma scop
......@@ -17,5 +17,4 @@ void dsyr2k(long N) {
#pragma endscop
}
/* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite"} } */
/* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite" { xfail *-*-* } } } */
/* { dg-require-effective-target size32plus } */
#define NMAX 3000
#define MEASURE_TIME 1
static double a[NMAX][NMAX], c[NMAX][NMAX];
typedef __INT32_TYPE__ int32_t;
typedef __INT64_TYPE__ int64_t;
void dsyrk(int64_t N)
{
int32_t i,j,k;
#pragma scop
for (i=0; i<N; i++) {
for (j=0; j<N; j++) {
for (k=j; k<N; k++) {
c[j][k] += a[i][j] * a[i][k];
}
}
}
#pragma endscop
}
/* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite" } } */
......@@ -4,7 +4,7 @@
static double a[NMAX][NMAX], c[NMAX][NMAX];
void dsyrk(long N)
void dsyrk(int N)
{
int i,j,k;
......@@ -19,4 +19,4 @@ void dsyrk(long N)
#pragma endscop
}
/* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite" } } */
/* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite" { xfail *-*-* } } } */
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment