Add a vect_masked_store target selector
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-cselim-1.c
blobe6ad865303c42c9d5958cb6e7eac6a766752902b
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 50
8 typedef struct {
9 short a;
10 short b;
11 } data;
13 data in1[N], in2[N], out[N];
14 short result[N*2] = {7,-7,9,-6,11,-5,13,-4,15,-3,17,-2,19,-1,21,0,23,1,25,2,27,3,29,4,31,5,33,6,35,7,37,8,39,9,41,10,43,11,45,12,47,13,49,14,51,15,53,16,55,17,57,18,59,19,61,20,63,21,65,22,67,23,69,24,71,25,73,26,75,27,77,28,79,29,81,30,83,31,85,32,87,33,89,34,91,35,93,36,95,37,97,38,99,39,101,40,103,41,105,42};
15 short out1[N], out2[N];
17 __attribute__ ((noinline)) void
18 foo ()
20 int i;
21 short c, d;
23 /* Vectorizable with conditional store sinking. */
24 for (i = 0; i < N; i++)
26 c = in1[i].b;
27 d = in2[i].b;
29 if (c >= d)
31 out[i].b = c;
32 out[i].a = d + 5;
34 else
36 out[i].b = d - 12;
37 out[i].a = c + d;
41 /* Only vectorizable with masked stores. */
42 for (i = 0; i < N; i++)
44 c = in1[i].b;
45 d = in2[i].b;
47 if (c >= d)
49 out1[i] = c;
51 else
53 out2[i] = c + d;
58 int
59 main (void)
61 int i;
63 check_vect ();
65 for (i = 0; i < N; i++)
67 in1[i].a = i;
68 in1[i].b = i + 2;
69 in2[i].a = 5;
70 in2[i].b = i + 5;
71 __asm__ volatile ("");
74 foo ();
76 for (i = 0; i < N; i++)
78 if (out[i].a != result[2*i] || out[i].b != result[2*i+1])
79 abort ();
82 return 0;
85 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { ! vect_masked_store } xfail { { vect_no_align && { ! vect_hw_misalign } } || { ! vect_strided2 } } } } } */
86 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" { target { vect_masked_store } } } } */