4 typedef signed char sc
;
5 typedef unsigned char uc
;
6 typedef signed short ss
;
7 typedef unsigned short us
;
9 typedef unsigned int ui
;
10 typedef signed long long sll
;
11 typedef unsigned long long ull
;
13 #define FOR_EACH_TYPE(M) \
20 #define TEST_VALUE1(I) ((I) * 5 / 2)
21 #define TEST_VALUE2(I) ((I) * 11 / 5)
23 #define ADD_TEST(TYPE) \
24 void __attribute__((noinline, noclone)) \
25 test_##TYPE (TYPE *restrict a, TYPE *restrict b, \
28 for (int i = 0; i < N; ++i) \
30 TYPE r1 = a[i * step + 0] += 1; \
31 a[i * step + 1] += 2; \
32 a[i * step + 2] += 4; \
33 a[i * step + 3] += 8; \
38 void __attribute__((noinline, noclone)) \
39 ref_##TYPE (TYPE *restrict a, TYPE *restrict b, \
42 for (int i = 0; i < N; ++i) \
44 TYPE r1 = a[i * step + 0] += 1; \
45 a[i * step + 1] += 2; \
46 a[i * step + 2] += 4; \
47 a[i * step + 3] += 8; \
53 #define DO_TEST(TYPE) \
54 _Pragma("GCC novector") \
55 for (int j = -M; j <= M; ++j) \
57 TYPE a1[N * M], a2[N * M], b1[N], b2[N]; \
58 for (int i = 0; i < N * M; ++i) \
59 a1[i] = a2[i] = TEST_VALUE1 (i); \
60 for (int i = 0; i < N; ++i) \
61 b1[i] = b2[i] = TEST_VALUE2 (i); \
62 int offset = (j < 0 ? N * M - 4 : 0); \
63 test_##TYPE (a1 + offset, b1, j); \
64 ref_##TYPE (a2 + offset, b2, j); \
65 if (__builtin_memcmp (a1, a2, sizeof (a1)) != 0) \
67 if (__builtin_memcmp (b1, b2, sizeof (b1)) != 0) \
71 FOR_EACH_TYPE (ADD_TEST
)
76 FOR_EACH_TYPE (DO_TEST
)
80 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* is outside \(-2, 2\)} "vect" { target vect_int } } } */
81 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* is outside \(-3, 3\)} "vect" { target vect_int } } } */
82 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* is outside \(-4, 4\)} "vect" { target vect_int } } } */
83 /* { dg-final { scan-tree-dump {run-time check [^\n]* abs \([^*]*\) >= 4} "vect" { target vect_int } } } */
85 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 2[)]* is outside \(-4, 4\)} "vect" { target vect_int } } } */
86 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 2[)]* is outside \(-6, 6\)} "vect" { target vect_int } } } */
87 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 2[)]* is outside \(-8, 8\)} "vect" { target vect_int } } } */
88 /* { dg-final { scan-tree-dump {run-time check [^\n]* abs \([^*]* \* 2[)]* >= 8} "vect" { target vect_int } } } */
90 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 4[)]* is outside \(-8, 8\)} "vect" { target { vect_int || vect_float } } } } */
91 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 4[)]* is outside \(-12, 12\)} "vect" { target { vect_int || vect_float } } } } */
92 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 4[)]* is outside \(-16, 16\)} "vect" { target { vect_int || vect_float } } } } */
93 /* { dg-final { scan-tree-dump {run-time check [^\n]* abs \([^*]* \* 4[)]* >= 16} "vect" { target { vect_int || vect_float } } } } */
95 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 8[)]* is outside \(-16, 16\)} "vect" { target vect_double } } } */
96 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 8[)]* is outside \(-24, 24\)} "vect" { target vect_double } } } */
97 /* { dg-final { scan-tree-dump {no alias between [^\n]* when [^\n]* step[^ ]* \* 8[)]* is outside \(-32, 32\)} "vect" { target vect_double } } } */
98 /* { dg-final { scan-tree-dump {run-time check [^\n]* abs \([^*]* \* 8[)]* >= 32} "vect" { target vect_double } } } */
100 /* { dg-final { scan-tree-dump-not "using an address-based" "vect" } } */
101 /* { dg-final { scan-tree-dump-not "using an index-based" "vect" } } */