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
|
/* PR tree-optimization/92683 - strncmp incorrect result with equal substrings
and nonconst bound
{ dg-do compile }
{ dg-options "-O1 -Wall -fdump-tree-forwprop1" } */
#define SIZE_MAX __SIZE_MAX__
#define S123 "123"
#define S1234 "1234"
typedef __SIZE_TYPE__ size_t;
#ifndef ident
# define ident(n) n
#endif
extern void failure_on_line (int);
/* Verify that the test in 'if (EQL strncmp (S, T, N))' is folded. */
#define T(eql, s, t, n) do { \
max = ident (n); \
if (!(eql __builtin_strncmp (s, t, max))) \
failure_on_line (__LINE__); \
} while (0)
void test_literal (void)
{
size_t max;
T (0 ==, S123, S1234, 0);
T (0 ==, S123, S1234, 1);
T (0 ==, S123, S1234, 2);
T (0 ==, S123, S1234, 3);
T (0 >, S123, S1234, 4);
T (0 >, S123, S1234, 5);
T (0 >, S123, S1234, SIZE_MAX - 2);
T (0 >, S123, S1234, SIZE_MAX - 1);
T (0 >, S123, S1234, SIZE_MAX);
T (0 ==, S123 + 1, S1234, 0);
T (0 <, S123 + 1, S1234, 1);
T (0 <, S123 + 1, S1234, 2);
T (0 <, S123 + 1, S1234, 3);
T (0 <, S123 + 1, S1234, 4);
T (0 <, S123 + 1, S1234, SIZE_MAX - 2);
T (0 <, S123 + 1, S1234, SIZE_MAX - 1);
T (0 <, S123 + 1, S1234, SIZE_MAX);
T (0 ==, S123 + 1, S1234 + 1, 0);
T (0 ==, S123 + 1, S1234 + 1, 1);
T (0 ==, S123 + 1, S1234 + 1, 2);
T (0 >, S123 + 1, S1234 + 1, 3);
T (0 >, S123 + 1, S1234 + 1, SIZE_MAX - 1);
T (0 >, S123 + 1, S1234 + 1, SIZE_MAX);
T (0 ==, S123 + 3, S1234 + 1, 0);
T (0 >, S123 + 3, S1234 + 1, 1);
T (0 >, S123 + 3, S1234 + 1, 2);
T (0 >, S123 + 3, S1234 + 1, 3);
T (0 >, S123 + 3, S1234 + 1, SIZE_MAX - 1);
T (0 >, S123 + 3, S1234 + 1, SIZE_MAX);
int zero = 0;
T (zero ==, S123, S1234, 0);
T (zero ==, S123, S1234, 1);
T (zero ==, S123, S1234, 2);
T (zero ==, S123, S1234, 3);
T (zero >, S123, S1234, 4);
T (zero >, S123, S1234, 5);
T (zero >, S123, S1234, SIZE_MAX - 2);
T (zero >, S123, S1234, SIZE_MAX - 1);
T (zero >, S123, S1234, SIZE_MAX);
T (zero ==, S123 + 1, S1234, 0);
T (zero <, S123 + 1, S1234, 1);
T (zero <, S123 + 1, S1234, 2);
T (zero <, S123 + 1, S1234, 3);
T (zero <, S123 + 1, S1234, 4);
T (zero <, S123 + 1, S1234, SIZE_MAX - 2);
T (zero <, S123 + 1, S1234, SIZE_MAX - 1);
T (zero <, S123 + 1, S1234, SIZE_MAX);
T (zero ==, S123 + 1, S1234 + 1, 0);
T (zero ==, S123 + 1, S1234 + 1, 1);
T (zero ==, S123 + 1, S1234 + 1, 2);
T (zero >, S123 + 1, S1234 + 1, 3);
T (zero >, S123 + 1, S1234 + 1, SIZE_MAX - 1);
T (zero >, S123 + 1, S1234 + 1, SIZE_MAX);
T (zero ==, S123 + 3, S1234 + 1, 0);
T (zero >, S123 + 3, S1234 + 1, 1);
T (zero >, S123 + 3, S1234 + 1, 2);
T (zero >, S123 + 3, S1234 + 1, 3);
T (zero >, S123 + 3, S1234 + 1, SIZE_MAX - 1);
T (zero >, S123 + 3, S1234 + 1, SIZE_MAX);
}
const char s123[] = S123;
const char s1234[] = S1234;
void test_cst_array (void)
{
size_t max;
T (0 ==, s123, s1234, 0);
T (0 ==, s123, s1234, 1);
T (0 ==, s123, s1234, 2);
T (0 ==, s123, s1234, 3);
T (0 >, s123, s1234, 4);
T (0 >, s123, s1234, 5);
T (0 >, s123, s1234, SIZE_MAX - 2);
T (0 >, s123, s1234, SIZE_MAX - 1);
T (0 >, s123, s1234, SIZE_MAX);
T (0 ==, s123 + 1, s1234, 0);
T (0 <, s123 + 1, s1234, 1);
T (0 <, s123 + 1, s1234, 2);
T (0 <, s123 + 1, s1234, 3);
T (0 <, s123 + 1, s1234, 4);
T (0 <, s123 + 1, s1234, SIZE_MAX - 2);
T (0 <, s123 + 1, s1234, SIZE_MAX - 1);
T (0 <, s123 + 1, s1234, SIZE_MAX);
T (0 ==, s123 + 1, s1234 + 1, 0);
T (0 ==, s123 + 1, s1234 + 1, 1);
T (0 ==, s123 + 1, s1234 + 1, 2);
T (0 >, s123 + 1, s1234 + 1, 3);
T (0 >, s123 + 1, s1234 + 1, SIZE_MAX - 1);
T (0 >, s123 + 1, s1234 + 1, SIZE_MAX);
T (0 ==, s123 + 3, s1234 + 1, 0);
T (0 >, s123 + 3, s1234 + 1, 1);
T (0 >, s123 + 3, s1234 + 1, 2);
T (0 >, s123 + 3, s1234 + 1, 3);
T (0 >, s123 + 3, s1234 + 1, SIZE_MAX - 1);
T (0 >, s123 + 3, s1234 + 1, SIZE_MAX);
int zero = 0;
T (zero ==, s123, s1234, 0);
T (zero ==, s123, s1234, 1);
T (zero ==, s123, s1234, 2);
T (zero ==, s123, s1234, 3);
T (zero >, s123, s1234, 4);
T (zero >, s123, s1234, 5);
T (zero >, s123, s1234, SIZE_MAX - 2);
T (zero >, s123, s1234, SIZE_MAX - 1);
T (zero >, s123, s1234, SIZE_MAX);
T (zero ==, s123 + 1, s1234, 0);
T (zero <, s123 + 1, s1234, 1);
T (zero <, s123 + 1, s1234, 2);
T (zero <, s123 + 1, s1234, 3);
T (zero <, s123 + 1, s1234, 4);
T (zero <, s123 + 1, s1234, SIZE_MAX - 2);
T (zero <, s123 + 1, s1234, SIZE_MAX - 1);
T (zero <, s123 + 1, s1234, SIZE_MAX);
T (zero ==, s123 + 1, s1234 + 1, 0);
T (zero ==, s123 + 1, s1234 + 1, 1);
T (zero ==, s123 + 1, s1234 + 1, 2);
T (zero >, s123 + 1, s1234 + 1, 3);
T (zero >, s123 + 1, s1234 + 1, SIZE_MAX - 1);
T (zero >, s123 + 1, s1234 + 1, SIZE_MAX);
T (zero ==, s123 + 3, s1234 + 1, 0);
T (zero >, s123 + 3, s1234 + 1, 1);
T (zero >, s123 + 3, s1234 + 1, 2);
T (zero >, s123 + 3, s1234 + 1, 3);
T (zero >, s123 + 3, s1234 + 1, SIZE_MAX - 1);
T (zero >, s123 + 3, s1234 + 1, SIZE_MAX);
}
/* { dg-final { scan-tree-dump-not "strcmp" "forwprop1" } }
{ dg-final { scan-tree-dump-not "strncmp" "forwprop1" } }
{ dg-final { scan-tree-dump-not "failure_on_line_" "forwprop1" } } */
|
