1/* { dg-require-effective-target vect_int } */ 2/* { dg-do compile } */ 3 4#include <stdarg.h> 5#include "tree-vect.h" 6 7#define N 16 8#define DIFF 242 9 10int main1 (int x, int max_result) 11{ 12 int i; 13 int b[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; 14 int c[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; 15 int diff = 2; 16 int max = x; 17 int min = 10; 18 19 for (i = 0; i < N; i++) { 20 diff += (b[i] - c[i]); 21 } 22 23 for (i = 0; i < N; i++) { 24 max = max < c[i] ? c[i] : max; 25 } 26 27 for (i = 0; i < N; i++) { 28 min = min > c[i] ? c[i] : min; 29 } 30 31 /* check results: */ 32 if (diff != DIFF) 33 abort (); 34 if (max != max_result) 35 abort (); 36 if (min != 0) 37 abort (); 38} 39 40int main (void) 41{ 42 check_vect (); 43 44 main1 (100, 100); 45 main1 (0, 15); 46 return 0; 47} 48 49/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" } } */ 50/* { dg-final { cleanup-tree-dump "vect" } } */ 51