1/* { dg-do compile { target { powerpc*-*-* && lp64 } } } */ 2/* { dg-skip-if "" { powerpc*-*-darwin* } { "*" } { "" } } */ 3/* { dg-require-effective-target powerpc_vsx_ok } */ 4/* { dg-skip-if "do not override -mcpu" { powerpc*-*-* } { "-mcpu=*" } { "-mcpu=power7" } } */ 5/* { dg-options "-mcpu=power7 -O2 -ftree-vectorize -fno-vect-cost-model -fdump-tree-vect-details" } */ 6 7/* Taken from vect/vect-95.c. */ 8#include <stdlib.h> 9#include <stdarg.h> 10 11#define N 256 12 13__attribute__ ((noinline)) 14void bar (float *pd, float *pa, float *pb, float *pc) 15{ 16 int i; 17 18 /* check results: */ 19 for (i = 0; i < N; i++) 20 { 21 if (pa[i] != (pb[i] * pc[i])) 22 abort (); 23 if (pd[i] != 5.0) 24 abort (); 25 } 26 27 return; 28} 29 30 31__attribute__ ((noinline)) int 32main1 (int n, float * __restrict__ pd, float * __restrict__ pa, float * __restrict__ pb, float * __restrict__ pc) 33{ 34 int i; 35 36 for (i = 0; i < n; i++) 37 { 38 pa[i] = pb[i] * pc[i]; 39 pd[i] = 5.0; 40 } 41 42 bar (pd,pa,pb,pc); 43 44 return 0; 45} 46 47int main (void) 48{ 49 int i; 50 float a[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); 51 float d[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); 52 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57}; 53 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; 54 55 main1 (N,&d[1],a,b,c); 56 main1 (N-2,&d[1],a,b,c); 57 58 return 0; 59} 60 61/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ 62/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" {xfail { {! vect_hw_misalign } || powerpc*-*-* } } } } */ 63/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 0 "vect" } } */ 64/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 4 "vect" {xfail { {! vect_hw_misalign } || powerpc*-*-* } } } } */ 65/* { dg-final { cleanup-tree-dump "vect" } } */ 66