1 /* { dg-additional-options "-Wno-shift-overflow" } */
2 /* { dg-require-effective-target vect_shift } */
3 /* { dg-require-effective-target vect_int } */
4 /* Check the standard integer types for left and right shifts to see if the
5 compiler replaced a scalar instruction with a vector instruction whether the
6 correct value is generated. */
12 #include "tree-vect.h"
15 #define ALIGN __attribute__((__aligned__(__BIGGEST_ALIGNMENT__)))
19 #define NOINLINE __attribute__((__noinline__))
23 #define TRACE_FUNC(PREFIX, NAME) printf (#PREFIX #NAME "\n")
24 #define TRACE_DONE() printf ("done!\n")
25 #define TRACE_ABORT(I,E,G) \
27 printf ("Element %d, expected 0x%lx, got 0x%lx\n", \
28 I, (long)(E), (long)(G)); \
33 #define TRACE_FUNC(PREFIX, A)
35 #define TRACE_ABORT(I,E,G) abort ()
38 #define NAME(A,B) A ## B
40 #define VECT_TESTS(PREFIX, TYPE, N) \
41 /* Restrict the optimizer from optimizing the setup loops. */ \
42 volatile TYPE NAME (PREFIX, zero) = 0; \
44 TYPE NAME (PREFIX, a)[N] ALIGN; \
45 TYPE NAME (PREFIX, b)[N] ALIGN; \
46 TYPE NAME (PREFIX, c)[N] ALIGN; \
47 TYPE NAME (PREFIX, d)[N] ALIGN; \
49 static void NOINLINE \
50 NAME (PREFIX, lshift_2) (void) \
54 TRACE_FUNC (PREFIX, lshift_2); \
55 for (i = 0; i < N; i++) \
56 NAME (PREFIX, a)[i] = NAME (PREFIX, b)[i] << 2; \
59 static void NOINLINE \
60 NAME (PREFIX, lshift_var) (int shift) \
64 TRACE_FUNC (PREFIX, lshift_var); \
65 for (i = 0; i < N; i++) \
66 NAME (PREFIX, a)[i] = NAME (PREFIX, b)[i] << shift; \
69 static void NOINLINE \
70 NAME (PREFIX, lshift_vect) (void) \
74 TRACE_FUNC (PREFIX, lshift_vect); \
75 for (i = 0; i < N; i++) \
76 NAME (PREFIX, a)[i] = NAME (PREFIX, b)[i] << NAME (PREFIX, c)[i]; \
79 static void NOINLINE \
80 NAME (PREFIX, rshift_2) (void) \
84 TRACE_FUNC (PREFIX, rshift_2); \
85 for (i = 0; i < N; i++) \
86 NAME (PREFIX, a)[i] = NAME (PREFIX, b)[i] >> 2; \
89 static void NOINLINE \
90 NAME (PREFIX, rshift_var) (int shift) \
94 TRACE_FUNC (PREFIX, rshift_var); \
95 for (i = 0; i < N; i++) \
96 NAME (PREFIX, a)[i] = NAME (PREFIX, b)[i] >> shift; \
99 static void NOINLINE \
100 NAME (PREFIX, rshift_vect) (void) \
104 TRACE_FUNC (PREFIX, rshift_vect); \
105 for (i = 0; i < N; i++) \
106 NAME (PREFIX, a)[i] = NAME (PREFIX, b)[i] >> NAME (PREFIX, c)[i]; \
109 static void NOINLINE \
110 NAME (PREFIX, check) (void) \
114 TRACE_FUNC (PREFIX, check); \
115 for (i = 0; i < N; i++) \
116 if (NAME (PREFIX, a)[i] != NAME (PREFIX, d)[i]) \
117 TRACE_ABORT (i, NAME (PREFIX, d)[i], NAME (PREFIX, a)[i]); \
120 static void NOINLINE \
121 NAME (PREFIX, tests) (void) \
125 TRACE_FUNC (PREFIX, tests); \
126 for (i = 0; i < N; i++) \
128 NAME (PREFIX, b)[i] = (i + NAME (PREFIX, zero)); \
129 NAME (PREFIX, c)[i] = 2; \
130 NAME (PREFIX, d)[i] = (i + NAME (PREFIX, zero)) << 2; \
133 NAME (PREFIX, lshift_2) (); \
134 NAME (PREFIX, check) (); \
136 NAME (PREFIX, lshift_var) (2); \
137 NAME (PREFIX, check) (); \
139 NAME (PREFIX, lshift_vect) (); \
140 NAME (PREFIX, check) (); \
142 for (i = 0; i < N; i++) \
144 NAME (PREFIX, b)[i] = ((i + NAME (PREFIX, zero)) << 4) \
145 | (((TYPE)0x80) << ((sizeof (TYPE) * 8) - 8)); \
146 NAME (PREFIX, c)[i] = 2; \
147 NAME (PREFIX, d)[i] = (TYPE)((NAME (PREFIX, b)[i] \
148 + NAME (PREFIX, zero)) >> 2); \
151 NAME (PREFIX, rshift_2) (); \
152 NAME (PREFIX, check) (); \
154 NAME (PREFIX, rshift_var) (2); \
155 NAME (PREFIX, check) (); \
157 NAME (PREFIX, rshift_vect) (); \
158 NAME (PREFIX, check) (); \
161 VECT_TESTS (uc_
, unsigned char, 128)
162 VECT_TESTS (us_
, unsigned short, 256)
163 VECT_TESTS (ui_
, unsigned int, 256)
164 VECT_TESTS (ul_
, unsigned long, 256)
166 VECT_TESTS (sc_
, signed char, 128)
167 VECT_TESTS (ss_
, short, 256)
168 VECT_TESTS (si_
, int, 256)
169 VECT_TESTS (sl_
, long, 256)