1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
|
/* PR tree-optimization/90662 - strlen of a string in a vla plus offset
not folded
{ dg-do compile }
{ dg-require-effective-target alloca }
{ dg-options "-O2 -Wall -fdump-tree-gimple -fdump-tree-optimized" } */
#include "strlenopt.h"
typedef __INT16_TYPE__ int16_t;
typedef __INT32_TYPE__ int32_t;
#define CONCAT(x, y) x ## y
#define CAT(x, y) CONCAT (x, y)
#define FAILNAME(name, counter) \
CAT (CAT (CAT (call_ ## name ##_on_line_, __LINE__), _), counter)
#define FAIL(name, counter) do { \
extern void FAILNAME (name, counter) (void); \
FAILNAME (name, counter)(); \
} while (0)
/* Macro to emit a call to funcation named
call_in_true_branch_not_eliminated_on_line_NNN()
for each call that's expected to be eliminated. The dg-final
scan-tree-dump-time directive at the bottom of the test verifies
that no such call appears in output. */
#define ELIM(expr) \
if (!(expr)) FAIL (in_true_branch_not_eliminated, __COUNTER__); else (void)0
#define ARGS(...) __VA_ARGS__
void sink (void*, ...);
#define T(Type, expect, init, p) \
do { \
Type vla[n]; \
char *ptr = strcpy ((char*)vla, init); \
ELIM (expect == strlen (p)); \
sink (ptr); \
} while (0)
void test_char_vla_local (int n)
{
T (char, 0, "", vla);
T (char, 0, "\0", vla);
T (char, 1, "1", vla);
T (char, 2, "12", vla);
T (char, 3, "123", vla);
T (char, 2, "123", vla + 1);
T (char, 1, "123", &vla[2]);
T (char, 0, "123", &vla[1] + 2);
T (char, 2, "123", &vla[2] - 1);
T (char, 3, "123", &vla[1] - 1);
T (char, 0, "", ptr);
T (char, 0, "\0", ptr);
T (char, 1, "1", ptr);
T (char, 2, "12", ptr);
T (char, 3, "123", ptr);
T (char, 2, "123", ptr + 1);
T (char, 1, "123", &ptr[2]);
T (char, 0, "123", &ptr[1] + 2);
}
void test_int16_vla_local (int n)
{
T (int16_t, 0, "", (char*)vla);
T (int16_t, 0, "\0", (char*)vla);
T (int16_t, 1, "1", (char*)vla);
T (int16_t, 2, "12", (char*)vla);
T (int16_t, 3, "123", (char*)vla);
T (int16_t, 2, "1234", (char*)(vla + 1));
T (int16_t, 2, "123456", (char*)&vla[2]);
T (int16_t, 1, "123456", (char*)&vla[2] + 1);
T (int16_t, 0, "123456", (char*)&vla[2] + 2);
T (int16_t, 0, "123456", (char*)(&vla[1] + 2));
T (int16_t, 3, "123456", (char*)&vla[2] - 1);
T (int16_t, 4, "123456", (char*)&vla[2] - 2);
T (int16_t, 0, "", ptr);
T (int16_t, 0, "\0", ptr);
T (int16_t, 1, "1", ptr);
T (int16_t, 2, "12", ptr);
T (int16_t, 3, "123", ptr);
T (int16_t, 2, "123", ptr + 1);
T (int16_t, 1, "123", &ptr[2]);
T (int16_t, 0, "123", &ptr[1] + 2);
}
void test_int_vla_local (int n)
{
T (int16_t, 0, "", (char*)vla);
T (int16_t, 0, "\0", (char*)vla);
T (int16_t, 1, "1", (char*)vla);
T (int16_t, 2, "12", (char*)vla);
T (int16_t, 3, "123", (char*)vla);
T (int16_t, 2, "1234", (char*)(vla + 1));
T (int16_t, 2, "123456", (char*)&vla[2]);
T (int16_t, 1, "123456", (char*)&vla[2] + 1);
T (int16_t, 0, "123456", (char*)&vla[2] + 2);
T (int16_t, 0, "123456", (char*)(&vla[1] + 2));
T (int, 0, "", ptr);
T (int, 0, "\0", ptr);
T (int, 1, "1", ptr);
T (int, 2, "12", ptr);
T (int, 3, "123", ptr);
T (int, 2, "123", ptr + 1);
T (int, 1, "123", &ptr[2]);
T (int, 0, "123", &ptr[1] + 2);
}
#undef T
#define T(Type, expect, parr, init, p) \
do { \
Type (*parray)[] = *ppa++; \
char *ptr = strcpy ((char*)parr, init); \
(void)&ptr; \
ELIM (expect == strlen (p)); \
} while (0)
/* Have the function take a pointer to pointers to arrays so that each
test case can use its own pointer to avoid interference between. */
void test_char_array_ptr (char (**ppa)[])
{
T (char, 0, *parray, "", *parray);
T (char, 0, *parray, "", &(*parray)[0]);
T (char, 1, *parray, "1", &(*parray)[0]);
T (char, 0, *parray, "1", &(*parray)[1]);
T (char, 2, *parray, "12", &(*parray)[0]);
T (char, 1, *parray, "12", &(*parray)[1]);
T (char, 0, *parray, "12", &(*parray)[2]);
T (char, 3, *parray, "123", &(*parray)[0]);
T (char, 2, *parray, "123", &(*parray)[1]);
T (char, 1, *parray, "123", &(*parray)[2]);
T (char, 0, *parray, "123", &(*parray)[3]);
T (char, 3, *parray, "123", ptr);
T (char, 2, *parray, "123", &ptr[1]);
T (char, 1, *parray, "123", &ptr[2]);
T (char, 0, *parray, "123", &ptr[3]);
}
void test_int16_array_ptr (int16_t (**ppa)[])
{
T (int16_t, 0, *parray, "", (char*)*parray);
T (int16_t, 0, *parray, "", (char*)&(*parray)[0]);
T (int16_t, 1, *parray, "1", (char*)&(*parray)[0]);
T (int16_t, 0, *parray, "12", (char*)&(*parray)[1]);
T (int16_t, 2, *parray, "12", (char*)&(*parray)[0]);
T (int16_t, 1, *parray, "12", (char*)&(*parray)[0] + 1);
T (int16_t, 2, *parray, "1234", (char*)&(*parray)[1]);
T (int16_t, 1, *parray, "1234", (char*)&(*parray)[1] + 1);
T (int16_t, 0, *parray, "1234", (char*)&(*parray)[2]);
T (int16_t, 6, *parray, "123456", (char*)&(*parray)[0]);
T (int16_t, 5, *parray, "123456", (char*)&(*parray)[0] + 1);
T (int16_t, 0, *parray, "123456", (char*)&(*parray)[0] + 6);
T (int16_t, 4, *parray, "123456", (char*)&(*parray)[1]);
T (int16_t, 3, *parray, "123456", (char*)&(*parray)[1] + 1);
T (int16_t, 0, *parray, "123456", (char*)&(*parray)[1] + 4);
T (int16_t, 2, *parray, "123456", (char*)&(*parray)[2]);
T (int16_t, 1, *parray, "123456", (char*)&(*parray)[2] + 1);
T (int16_t, 0, *parray, "123456", (char*)&(*parray)[2] + 2);
T (int16_t, 0, *parray, "123456", (char*)&(*parray)[3]);
T (int16_t, 3, *parray, "123", (char*)ptr);
T (int16_t, 2, *parray, "123", (char*)&ptr[1]);
T (int16_t, 1, *parray, "123", (char*)&ptr[2]);
T (int16_t, 0, *parray, "123", (char*)&ptr[3]);
}
/* { dg-final { scan-tree-dump-times "strlen" 0 "optimized" } }
{ dg-final { scan-tree-dump-times "not_eliminated" 0 "optimized" } } */
|
