Adjust testcase after relax O2 vectorization.
gcc/testsuite/ChangeLog: * gcc.dg/fstack-protector-strong.c: Adjust scan-assembler-times. * gcc.dg/graphite/scop-6.c: Refine the testcase to avoid array out of bounds. * gcc.dg/graphite/scop-9.c: Ditto. * gcc.dg/tree-ssa/ivopts-lt-2.c: Add -fno-tree-vectorize. * gcc.dg/tree-ssa/ivopts-lt.c: Ditto. * gcc.dg/tree-ssa/loop-16.c: Ditto. * gcc.dg/tree-ssa/loop-28.c: Ditto. * gcc.dg/tree-ssa/loop-bound-2.c: Ditto. * gcc.dg/tree-ssa/loop-bound-4.c: Ditto. * gcc.dg/tree-ssa/loop-bound-6.c: Ditto. * gcc.dg/tree-ssa/predcom-4.c: Ditto. * gcc.dg/tree-ssa/predcom-5.c: Ditto. * gcc.dg/tree-ssa/scev-11.c: Ditto. * gcc.dg/tree-ssa/scev-9.c: Ditto. * gcc.dg/tree-ssa/split-path-11.c: Ditto. * gcc.dg/unroll-8.c: Ditto. * gcc.dg/var-expand1.c: Ditto. * gcc.dg/vect/vect-cost-model-6.c: Removed. * gcc.target/i386/pr86270.c: Ditto. * gcc.target/i386/pr86722.c: Ditto. * gcc.target/x86_64/abi/callabi/leaf-2.c: Ditto.
This commit is contained in:
parent
70c3db511b
commit
d5d1189c12
21 changed files with 23 additions and 37 deletions
|
@ -154,4 +154,4 @@ void foo12 ()
|
|||
global3 ();
|
||||
}
|
||||
|
||||
/* { dg-final { scan-assembler-times "stack_chk_fail" 12 } } */
|
||||
/* { dg-final { scan-assembler-times "stack_chk_fail" 11 } } */
|
||||
|
|
|
@ -4,7 +4,7 @@ int toto()
|
|||
{
|
||||
int i, j, k;
|
||||
int a[100][100];
|
||||
int b[100];
|
||||
int b[200];
|
||||
|
||||
for (i = 1; i < 100; i++)
|
||||
{
|
||||
|
@ -18,9 +18,8 @@ int toto()
|
|||
for (k = 1; k < 100; k++)
|
||||
b[i+k] = b[i+k-1] + 2;
|
||||
}
|
||||
|
||||
for (k = 1; k < 100; k++)
|
||||
b[i+k] = b[i+k-5] + 2;
|
||||
for (k = 4; k < 100; k++)
|
||||
b[i+k] = b[i+k-5] + 2;
|
||||
}
|
||||
|
||||
return a[3][5] + b[2];
|
||||
|
|
|
@ -4,7 +4,7 @@ int toto()
|
|||
{
|
||||
int i, j, k;
|
||||
int a[100][100];
|
||||
int b[100];
|
||||
int b[200];
|
||||
|
||||
for (i = 1; i < 100; i++)
|
||||
{
|
||||
|
@ -14,7 +14,7 @@ int toto()
|
|||
if (i * 2 == i + 8)
|
||||
a[i][i] = 2;
|
||||
|
||||
for (k = 1; k < 100; k++)
|
||||
for (k = 4; k < 100; k++)
|
||||
b[i+k] = b[i+k-5] + 2;
|
||||
}
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fno-tree-loop-distribute-patterns -fdump-tree-ivopts" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fno-tree-loop-distribute-patterns -fdump-tree-ivopts" } */
|
||||
/* { dg-skip-if "PR68644" { hppa*-*-* powerpc*-*-* } } */
|
||||
|
||||
void
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fno-tree-loop-distribute-patterns -fdump-tree-ivopts" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fno-tree-loop-distribute-patterns -fdump-tree-ivopts" } */
|
||||
/* { dg-require-effective-target stdint_types } */
|
||||
|
||||
#include "stdint.h"
|
||||
|
|
|
@ -2,7 +2,7 @@
|
|||
at most 100 times, thus the (32-bit) induction variables do not overflow,
|
||||
and we may use 64-bit variable to represent them. */
|
||||
|
||||
/* { dg-options "-O2 -fdump-tree-optimized" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fdump-tree-optimized" } */
|
||||
/* { dg-do compile { target i?86-*-* x86_64-*-* } } */
|
||||
|
||||
unsigned a[100];
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile { target { i?86-*-* x86_64-*-* } } } */
|
||||
/* { dg-options "-O2 -fprefetch-loop-arrays -march=amdfam10 -fdump-tree-optimized -fdump-tree-aprefetch --param max-unrolled-insns=1000" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fprefetch-loop-arrays -march=amdfam10 -fdump-tree-optimized -fdump-tree-aprefetch --param max-unrolled-insns=1000" } */
|
||||
|
||||
char x[100000];
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fdump-tree-ivopts-details" } */
|
||||
|
||||
int *a;
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fdump-tree-ivopts-details" } */
|
||||
|
||||
int *a;
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fdump-tree-ivopts-details" } */
|
||||
|
||||
int *a;
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do run } */
|
||||
/* { dg-options "-O2 -funroll-loops --param max-unroll-times=8 -fpredictive-commoning -fdump-tree-pcom-details-blocks" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -funroll-loops --param max-unroll-times=8 -fpredictive-commoning -fdump-tree-pcom-details-blocks" } */
|
||||
|
||||
/* Test for predictive commoning of expressions, without reassociation. */
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do run } */
|
||||
/* { dg-options "-O2 -funroll-loops --param max-unroll-times=8 -fpredictive-commoning -fdump-tree-pcom-details-blocks" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -funroll-loops --param max-unroll-times=8 -fpredictive-commoning -fdump-tree-pcom-details-blocks" } */
|
||||
|
||||
/* Test for predictive commoning of expressions, with reassociation. */
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fdump-tree-ivopts-details" } */
|
||||
|
||||
int a[128];
|
||||
extern int b[];
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fdump-tree-ivopts-details" } */
|
||||
|
||||
int *a;
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fsplit-paths -fdump-tree-split-paths-details -w" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fsplit-paths -fdump-tree-split-paths-details -w" } */
|
||||
|
||||
void foo(unsigned long long *M)
|
||||
{
|
||||
|
|
|
@ -1,6 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fdump-rtl-loop2_unroll-details-blocks -funroll-loops" } */
|
||||
/* { dg-additional-options "-fno-tree-vectorize" { target amdgcn-*-* } } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fdump-rtl-loop2_unroll-details-blocks -funroll-loops" } */
|
||||
|
||||
struct a {int a[7];};
|
||||
int t(struct a *a, int n)
|
||||
|
|
|
@ -2,7 +2,7 @@
|
|||
/* We don't (and don't want to) perform this optimisation on soft-float
|
||||
targets, where each addition is a library call. */
|
||||
/* { dg-require-effective-target hard_float } */
|
||||
/* { dg-options "-O2 -funroll-loops --fast-math -fvariable-expansion-in-unroller -fdump-rtl-loop2_unroll" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -funroll-loops --fast-math -fvariable-expansion-in-unroller -fdump-rtl-loop2_unroll" } */
|
||||
/* { dg-additional-options "--param max-completely-peel-times=16 --param max-unroll-times=8" { target s390*-*-* } } */
|
||||
|
||||
extern void abort (void);
|
||||
|
|
|
@ -1,12 +0,0 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-additional-options "-O2 -ftree-vectorize -fvect-cost-model=very-cheap" } */
|
||||
|
||||
void
|
||||
f (int *restrict x, int *restrict y)
|
||||
{
|
||||
for (unsigned int i = 0; i < 1023; ++i)
|
||||
x[i] += y[i];
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump {LOOP VECTORIZED} vect { target { vect_int && vect_partial_vectors_usage_2 } } } } */
|
||||
/* { dg-final { scan-tree-dump-not {LOOP VECTORIZED} vect { target { vect_int && { ! vect_partial_vectors_usage_2 } } } } } */
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -fno-unroll-loops" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -fno-unroll-loops" } */
|
||||
|
||||
int *a;
|
||||
long len;
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile { target { ! ia32 } } } */
|
||||
/* { dg-options "-O2 -mno-avx -msse" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -mno-avx -msse" } */
|
||||
|
||||
void f(double*d,double*e){
|
||||
for(;d<e;++d)
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
/* { dg-do compile } */
|
||||
/* { dg-options "-O2 -mabi=sysv" } */
|
||||
/* { dg-options "-O2 -fno-tree-vectorize -mabi=sysv" } */
|
||||
|
||||
extern int glb1, gbl2, gbl3;
|
||||
|
||||
|
|
Loading…
Add table
Reference in a new issue