fast-math-vect-reduc-7.c: Clean up temp files.

* gcc.dg/vect/fast-math-vect-reduc-7.c: Clean up temp files.
	* gcc.dg/vect/pr22480.c: Clean up temp files.
	* gcc.dg/vect/pr23831.c: Clean up temp files.
	* gcc.dg/vect/pr23816-1.c: Require effective-target vect_condition.
	Clean up temp files.
	* gcc.dg/vect/pr23816-2.c: Require effective-target vect_condition.
	Clean up temp files.

	* gcc.dg/20050309-1.c: Clean up temp files.
	* gcc.dg/20050325-1.c: Clean up temp files.

From-SVN: r104813
This commit is contained in:
Uros Bizjak 2005-09-30 08:17:54 +02:00 committed by Uros Bizjak
parent e0854e30a2
commit 7a6a7d975b
8 changed files with 27 additions and 0 deletions

View file

@ -1,3 +1,16 @@
2005-09-30 Uros Bizjak <uros@kss-loka.si>
* gcc.dg/vect/fast-math-vect-reduc-7.c: Clean up temp files.
* gcc.dg/vect/pr22480.c: Clean up temp files.
* gcc.dg/vect/pr23831.c: Clean up temp files.
* gcc.dg/vect/pr23816-1.c: Require effective-target vect_condition.
Clean up temp files.
* gcc.dg/vect/pr23816-2.c: Require effective-target vect_condition.
Clean up temp files.
* gcc.dg/20050309-1.c: Clean up temp files.
* gcc.dg/20050325-1.c: Clean up temp files.
2005-09-30 Uros Bizjak <uros@kss-loka.si>
PR tree-optimization/24059

View file

@ -35,3 +35,4 @@ test(char *ret, int *counter, void *schema,
return 0;
}
/* { dg-final { cleanup-coverage-files } } */

View file

@ -17,3 +17,5 @@ f ()
{
g (42, ff);
}
/* { dg-final { cleanup-coverage-files } } */

View file

@ -51,3 +51,4 @@ int main (void)
}
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */

View file

@ -28,3 +28,5 @@ test_3 (void)
for (j = 0; j < 16;j++)
bm[j] <<= am[j];
}
/* { dg-final { cleanup-tree-dump "vect" } } */

View file

@ -1,4 +1,5 @@
/* { dg-do compile } */
/* { dg-require-effective-target vect_condition } */
void
foo (float a[32], float b[2][32])
@ -7,3 +8,5 @@ foo (float a[32], float b[2][32])
for (i = 0; i < 32; i++)
a[i] = (b[0][i] > b[1][i]) ? b[0][i] : b[1][i];
}
/* { dg-final { cleanup-tree-dump "vect" } } */

View file

@ -1,4 +1,5 @@
/* { dg-do compile } */
/* { dg-require-effective-target vect_condition } */
void
foo (double a[32], double b[2][32])
@ -7,3 +8,5 @@ foo (double a[32], double b[2][32])
for (i = 0; i < 32; i++)
a[i] = (b[0][i] > b[1][i]) ? b[0][i] : b[1][i];
}
/* { dg-final { cleanup-tree-dump "vect" } } */

View file

@ -8,3 +8,5 @@ void foo (void)
for (j = 0; j < 16; j++)
bm[j] = bm[j] * 8;
}
/* { dg-final { cleanup-tree-dump "vect" } } */