1/* { dg-require-effective-target vect_int } */ 2 3#include <stdarg.h> 4#include "tree-vect.h" 5 6#define N 16 7 8__attribute__ ((noinline)) 9int main1 (int n, int *a) 10{ 11 int i, j, k; 12 int b[N]; 13 14 for (i = 0; i < n; i++) 15 { 16 for (j = 0; j < n; j++) 17 { 18 k = i + n; 19 a[j] = k; 20 } 21 b[i] = k; 22 } 23 24 25 for (j = 0; j < n; j++) 26 if (a[j] != i + n - 1) 27 abort(); 28 29 for (j = 0; j < n; j++) 30 if (b[j] != j + n) 31 abort(); 32 33 return 0; 34} 35 36int main (void) 37{ 38 int a[N+1] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))); 39 40 check_vect (); 41 42 main1 (N, a+1); 43 main1 (0, a+1); 44 main1 (1, a+1); 45 main1 (2, a+1); 46 main1 (N-1, a+1); 47 48 return 0; 49} 50 51/* Fails for targets that don't vectorize PLUS (e.g alpha). */ 52/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ 53/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */ 54/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" {target vector_alignment_reachable } } } */ 55/* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" {target { {! vector_alignment_reachable} && {! vect_hw_misalign} } } } } */ 56/* { dg-final { cleanup-tree-dump "vect" } } */ 57