1/* { dg-require-effective-target vect_float } */ 2 3#include <stdarg.h> 4#include "tree-vect.h" 5 6#define N 20 7 8int 9main1 () 10{ 11 int i; 12 float a[N]; 13 float b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57}; 14 float c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; 15 16 for (i = 0; i < N; i++) 17 { 18 a[i] = b[i] * c[i]; 19 } 20 21 /* check results: */ 22 for (i = 0; i <N; i++) 23 { 24 if (a[i] != b[i] * c[i]) 25 abort (); 26 } 27 28 return 0; 29} 30 31int main (void) 32{ 33 check_vect (); 34 35 return main1 (); 36} 37 38/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ 39/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */ 40/* { dg-final { cleanup-tree-dump "vect" } } */ 41