mirror of
https://gcc.gnu.org/git/gcc.git
synced 2025-01-21 03:44:22 +08:00
vect-28.c: Fix test to not expect peeling on !vector_alignment_reachable targets.
* gcc.dg/vect/vect-28.c: Fix test to not expect peeling on
!vector_alignment_reachable targets.
* gcc.dg/vect/vect-33.c: Likewise.
* gcc.dg/vect/vect-42.c: Likewise.
* gcc.dg/vect/vect-44.c: Likewise.
* gcc.dg/vect/vect-50.c: Likewise.
* gcc.dg/vect/vect-70.c: Likewise.
* gcc.dg/vect/vect-71.c: Likewise.
* gcc.dg/vect/vect-87.c: Likewise.
* gcc.dg/vect/vect-88.c: Likewise.
* gcc.dg/vect/vect-91.c: Likewise.
* gcc.dg/vect/vect-93.c: Likewise.
* gcc.dg/vect/vect-96.c: Likewise.
* gcc.dg/vect/no-section-anchors-69.c: Likewise.
* gcc.dg/vect/section-anchors-69.c: Likewise.
* gcc.dg/vect/pr25413.c: Likewise.
* gcc.dg/vect/costmodel/ppc/costmodel-33.c: Likewise.
* gcc.dg/vect/costmodel/ppc/costmodel-76b.c: Likewise.
* gfortran.dg/vect-2.f90: Likewise.
* gfortran.dg/vect-3.f90: Likewise.
* gfortran.dg/vect-4.f90: Likewise.
* gfortran.dg/vect-5.f90: Likewise.
* lib/target-supports.exp (check_effective_target_natural_alignment):
Return false for darwin.
(check_effective_target_vector_alignment_reachable_for_double): New.
From-SVN: r127276
This commit is contained in:
Dorit Nuzman
Dorit Nuzman
parent
dc60b7754d
commit
b11040a8b1
@ -1,3 +1,31 @@
|
||||
2007-08-07 Dorit Nuzman <dorit@il.ibm.com>
|
||||
|
||||
* gcc.dg/vect/vect-28.c: Fix test to not expect peeling on
|
||||
!vector_alignment_reachable targets.
|
||||
* gcc.dg/vect/vect-33.c: Likewise.
|
||||
* gcc.dg/vect/vect-42.c: Likewise.
|
||||
* gcc.dg/vect/vect-44.c: Likewise.
|
||||
* gcc.dg/vect/vect-50.c: Likewise.
|
||||
* gcc.dg/vect/vect-70.c: Likewise.
|
||||
* gcc.dg/vect/vect-71.c: Likewise.
|
||||
* gcc.dg/vect/vect-87.c: Likewise.
|
||||
* gcc.dg/vect/vect-88.c: Likewise.
|
||||
* gcc.dg/vect/vect-91.c: Likewise.
|
||||
* gcc.dg/vect/vect-93.c: Likewise.
|
||||
* gcc.dg/vect/vect-96.c: Likewise.
|
||||
* gcc.dg/vect/no-section-anchors-69.c: Likewise.
|
||||
* gcc.dg/vect/section-anchors-69.c: Likewise.
|
||||
* gcc.dg/vect/pr25413.c: Likewise.
|
||||
* gcc.dg/vect/costmodel/ppc/costmodel-33.c: Likewise.
|
||||
* gcc.dg/vect/costmodel/ppc/costmodel-76b.c: Likewise.
|
||||
* gfortran.dg/vect-2.f90: Likewise.
|
||||
* gfortran.dg/vect-3.f90: Likewise.
|
||||
* gfortran.dg/vect-4.f90: Likewise.
|
||||
* gfortran.dg/vect-5.f90: Likewise.
|
||||
* lib/target-supports.exp (check_effective_target_natural_alignment):
|
||||
Return false for darwin.
|
||||
(check_effective_target_vector_alignment_reachable_for_double): New.
|
||||
|
||||
2007-08-07 Andreas Krebbel <krebbel1@de.ibm.com>
|
||||
|
||||
* gcc.dg/multiword-1.c: New testcase.
|
||||
|
||||
@ -35,5 +35,9 @@ int main (void)
|
||||
return main1 ();
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorization not profitable" 1 "vect" } } */
|
||||
/* Peeling to align the store is used. Overhead of peeling is too high. */
|
||||
/* { dg-final { scan-tree-dump-times "vectorization not profitable" 1 "vect" { target vector_alignment_reachable } } } */
|
||||
|
||||
/* Versioning to align the store is used. Overhead of versioning is not too high. */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target {! vector_alignment_reachable} } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -42,6 +42,10 @@ int main (void)
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorization not profitable" 1 "vect" } } */
|
||||
/* Peeling to align the store is used. Overhead of peeling is too high. */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 0 "vect" { target vector_alignment_reachable } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorization not profitable" 1 "vect" { target { vector_alignment_reachable && {! vect_no_align} } } } } */
|
||||
|
||||
/* Versioning to align the store is used. Overhead of versioning is not too high. */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_no_align || {! vector_alignment_reachable} } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -37,7 +37,7 @@ int main1 ()
|
||||
{
|
||||
int i,j;
|
||||
|
||||
/* 1. unaligned */
|
||||
/* 1. unaligned (known misalignment) */
|
||||
for (i = 0; i < N; i++)
|
||||
{
|
||||
tmp1[2].a.n[1][2][i] = 5;
|
||||
@ -82,7 +82,7 @@ int main1 ()
|
||||
}
|
||||
}
|
||||
|
||||
/* 4. unaligned */
|
||||
/* 4. unaligned (unknown misalignment) */
|
||||
for (i = 0; i < N-4; i++)
|
||||
{
|
||||
for (j = 0; j < N-4; j++)
|
||||
@ -113,5 +113,7 @@ int main (void)
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 4 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { xfail {! vector_alignment_reachable} } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target {! vector_alignment_reachable} } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target {! vector_alignment_reachable} } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -31,8 +31,8 @@ int main (void)
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vector_alignment_reachable } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 0 "vect" { target { ! vector_alignment_reachable } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vector alignment may not be reachable" 1 "vect" { target { ! vector_alignment_reachable } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "not vectorized: unsupported unaligned store" 1 "vect" { target { ! vector_alignment_reachable } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vector_alignment_reachable_for_double } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 0 "vect" { target { ! vector_alignment_reachable_for_double } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vector alignment may not be reachable" 1 "vect" { target { ! vector_alignment_reachable_for_double } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "not vectorized: unsupported unaligned store" 1 "vect" { target { ! vector_alignment_reachable_for_double } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -115,5 +115,6 @@ int main (void)
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
|
||||
/* Alignment forced using versioning until the pass that increases alignment
|
||||
is extended to handle structs. */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 4 "vect" { target vect_int } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 4 "vect" { target {vect_int && vector_alignment_reachable } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 4 "vect" { target {vect_int && {! vector_alignment_reachable} } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -39,5 +39,6 @@ int main (void)
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target vector_alignment_reachable } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target { ! vector_alignment_reachable } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -38,5 +38,6 @@ int main (void)
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target vector_alignment_reachable } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target { ! vector_alignment_reachable } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -55,7 +55,7 @@ int main (void)
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target { vect_no_align || { ! vector_alignment_reachable } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail { vect_no_align || { ! vector_alignment_reachable } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail {vect_no_align || { ! vector_alignment_reachable } } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -65,6 +65,7 @@ int main (void)
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { {! vector_alignment_reachable} && {! vect_no_align} } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -61,6 +61,7 @@ int main (void)
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" { target vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { {! vector_alignment_reachable} && {! vect_no_align} } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -63,5 +63,6 @@ int main (void)
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" {target vector_alignment_reachable } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" {target {! vector_alignment_reachable} } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -5,7 +5,7 @@
|
||||
|
||||
#define N 16
|
||||
|
||||
/* unaligned load. */
|
||||
/* indirect access. */
|
||||
|
||||
int main1 ()
|
||||
{
|
||||
|
||||
@ -50,5 +50,6 @@ int main (void)
|
||||
/* Fails for targets that don't vectorize PLUS (e.g alpha). */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" {target vector_alignment_reachable } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" {target {! vector_alignment_reachable} } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -50,5 +50,6 @@ int main (void)
|
||||
/* Fails for targets that don't vectorize PLUS (e.g alpha). */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" {target vector_alignment_reachable } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" {target {! vector_alignment_reachable} } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -58,7 +58,7 @@ main3 ()
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 3 "vect" { xfail vect_no_int_add } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "accesses have the same alignment." 3 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 3 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 3 "vect" {target vector_alignment_reachable } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 3 "vect" {target {! vector_alignment_reachable} } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -67,12 +67,12 @@ int main (void)
|
||||
|
||||
/* 2 loops vectorized in main1, 2 loops vectorized in main:
|
||||
the first loop in main requires vectorization of conversions,
|
||||
the second loop in main requires vectorization of misaliged load. */
|
||||
the second loop in main requires vectorization of misaligned load. */
|
||||
|
||||
/* main && main1 together: */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 2 "vect" { target powerpc*-*-* i?86-*-* x86_64-*-* } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { target vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 3 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { target { vect_no_align && {! vector_alignment_reachable} } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 3 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } } */
|
||||
|
||||
/* in main1: */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" { target !powerpc*-*-* !i?86-*-* !x86_64-*-* } } } */
|
||||
|
||||
@ -42,7 +42,7 @@ int main (void)
|
||||
For targets that don't support unaligned loads, version for the store. */
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target vect_no_align } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { {! vect_no_align} && vector_alignment_reachable } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target { vect_no_align || {! vector_alignment_reachable} } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
@ -15,8 +15,8 @@ END
|
||||
! support unaligned loads).
|
||||
|
||||
! { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 3 "vect" { xfail vect_no_align } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { target vect_no_align } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 3 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" { target { vect_no_align && {! vector_alignment_reachable} } } } }
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail vect_no_align } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" {target vect_no_align } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 3 "vect" {target { vect_no_align || {! vector_alignment_reachable} } } } }
|
||||
! { dg-final { cleanup-tree-dump "vect" } }
|
||||
|
||||
@ -6,6 +6,13 @@ DIMENSION X(N), Y(N)
|
||||
Y = Y + A * X
|
||||
END
|
||||
|
||||
! fail to vectorize due to failure to compute number of iterations (PR tree-optimization/18527)
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { xfail *-*-* } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 3 "vect" { target vect_no_align } } }
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { target vect_no_align } } }
|
||||
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target { {! vect_no_align} && {! vector_alignment_reachable} } } } }
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target { {! vect_no_align} && {! vector_alignment_reachable} } } } }
|
||||
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } }
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } }
|
||||
|
||||
! { dg-final { cleanup-tree-dump "vect" } }
|
||||
|
||||
@ -10,7 +10,8 @@ Y = Y + A * X
|
||||
END
|
||||
|
||||
! { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail vect_no_align } } }
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail vect_no_align } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } }
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } }
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target {! vector_alignment_reachable} } } }
|
||||
! { dg-final { scan-tree-dump-times "accesses have the same alignment." 1 "vect" } }
|
||||
! { dg-final { cleanup-tree-dump "vect" } }
|
||||
|
||||
@ -36,16 +36,8 @@
|
||||
end
|
||||
|
||||
! { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_no_align } } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_no_align || {! vector_alignment_reachable} } } } }
|
||||
! { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail { vect_no_align } } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target { ilp32 && vect_no_align } } } }
|
||||
|
||||
! We also expect to vectorize one loop for lp64 targets that support
|
||||
! misaligned access:
|
||||
! scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { lp64 && !vect_no_align } }
|
||||
! scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { target { lp64 && !vect_no_align } }
|
||||
! scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { lp64 && !vect_no_align } }
|
||||
! but we currently can't combine logical operators. (Could define
|
||||
! a keyword for "not_vect_no_align" if desired).
|
||||
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 2 "vect" { target { vect_no_align } } } }
|
||||
! { dg-final { scan-tree-dump-times "Alignment of access forced using versioning." 1 "vect" { target {! vector_alignment_reachable} } } }
|
||||
! { dg-final { cleanup-tree-dump "vect" } }
|
||||
|
||||
@ -2110,9 +2110,10 @@ proc check_effective_target_natural_alignment { } {
|
||||
if [info exists et_natural_alignment_saved] {
|
||||
verbose "check_effective_target_natural_alignment: using cached result" 2
|
||||
} else {
|
||||
set et_natural_alignment_saved 0
|
||||
if { [istarget spu-*-*] } {
|
||||
set et_natural_alignment_saved 1
|
||||
# FIXME: 32bit powerpc: guaranteed only if MASK_ALIGN_NATURAL/POWER.
|
||||
set et_natural_alignment_saved 1
|
||||
if { ([istarget *-*-darwin*] && [is-effective-target lp64]) } {
|
||||
set et_natural_alignment_saved 0
|
||||
}
|
||||
}
|
||||
verbose "check_effective_target_natural_alignment: returning $et_natural_alignment_saved" 2
|
||||
@ -2140,6 +2141,26 @@ proc check_effective_target_vector_alignment_reachable { } {
|
||||
return $et_vector_alignment_reachable_saved
|
||||
}
|
||||
|
||||
# Return 1 if vector alignment for soubles is reachable, 0 otherwise.
|
||||
#
|
||||
# This won't change for different subtargets so cache the result.
|
||||
|
||||
proc check_effective_target_vector_alignment_reachable_for_double { } {
|
||||
global et_vector_alignment_reachable_for_double
|
||||
|
||||
if [info exists et_vector_alignment_reachable_for_double_saved] {
|
||||
verbose "check_effective_target_vector_alignment_reachable_for_double: using cached result" 2
|
||||
} else {
|
||||
if { [check_effective_target_vect_aligned_arrays] } {
|
||||
set et_vector_alignment_reachable_for_double_saved 1
|
||||
} else {
|
||||
set et_vector_alignment_reachable_for_double_saved 0
|
||||
}
|
||||
}
|
||||
verbose "check_effective_target_vector_alignment_reachable_for_double: returning $et_vector_alignment_reachable_for_double_saved" 2
|
||||
return $et_vector_alignment_reachable_for_double_saved
|
||||
}
|
||||
|
||||
# Return 1 if the target supports vector conditional operations, 0 otherwise.
|
||||
|
||||
proc check_effective_target_vect_condition { } {
|
||||
|
||||
Loading…
Reference in New Issue
Block a user