1/* { dg-require-effective-target vect_float } */ 2 3#include <stdarg.h> 4#include "tree-vect.h" 5 6#define N 256 7 8void bar (const float *pa, const float *pb, const float *pc) 9{ 10 int i; 11 12 /* check results: */ 13 for (i = 0; i < N; i++) 14 { 15 if (pa[i] != (pb[i] * pc[i])) 16 abort (); 17 } 18 19 return; 20} 21 22/* Unaligned pointer accesses, with unknown alignment. 23 The loop bound is known and divisible by the vectorization factor. 24 Can't prove that the pointers don't alias. 25 vect-51.c is similar to this one with one difference: 26 the loop bound is unknown. 27 vect-44.c is similar to this one with one difference: 28 Aliasing is not a problem. */ 29 30int 31main1 (float *pa, float *pb, float *pc) 32{ 33 int i; 34 35 for (i = 0; i < N; i++) 36 { 37 pa[i] = pb[i] * pc[i]; 38 } 39 40 bar (pa,pb,pc); 41 42 return 0; 43} 44 45int main (void) 46{ 47 int i; 48 float a[N]; 49 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57}; 50 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; 51 52 check_vect (); 53 54 main1 (a,b,c); 55 return 0; 56} 57 58/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } */ 59/* { dg-final { cleanup-tree-dump "vect" } } */ 60