1 /* { dg-require-effective-target vect_int } */
17 unsigned char ub[N*2] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
18 unsigned char uc[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
21 main1 (unsigned char x, unsigned char max_result, unsigned char min_result, s *arr)
24 unsigned char udiff = 2;
25 unsigned char umax = x;
26 unsigned char umin = x;
27 unsigned char ua1[N*2];
31 for (i = 0; i < N; i++) {
32 udiff += (unsigned char)(ub[i] - uc[i]);
34 ua1[2*i+1] = ub[2*i+1];
37 out[i].d = pIn->d - 1;
38 out[i].b = pIn->b - 4;
39 out[i].c = pIn->c - 8;
40 out[i].a = pIn->a - 3;
45 for (i = 0; i < N; i++) {
46 if (ua1[2*i] != ub[2*i]
47 || ua1[2*i+1] != ub[2*i+1]
48 || out[i].a != arr[i].a - 3
49 || out[i].b != arr[i].b - 4
50 || out[i].c != arr[i].c - 8
51 || out[i].d != arr[i].d - 1)
65 for (i = 0; i < N; i++)
68 arr[i].b = i * 2 + 10;
76 main1 (100, 100, 1, arr);
77 main1 (0, 15, 0, arr);
81 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
82 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" { xfail vect_no_align } } } */
83 /* { dg-final { cleanup-tree-dump "vect" } } */