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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
|
// Copyright (C) 2010 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
//
#include <vector>
#include <deque>
#include <list>
#ifndef _GLIBCXX_DEBUG
# include <debug/vector>
# include <debug/deque>
# include <debug/list>
#endif
#include <testsuite_hooks.h>
namespace __gnu_test
{
template<typename _Tp>
struct CopyableValueType
{
typedef _Tp value_type;
};
template<typename _Tp1, typename _Tp2>
struct CopyableValueType<std::pair<const _Tp1, _Tp2> >
{
typedef std::pair<_Tp1, _Tp2> value_type;
};
template<typename _Tp>
struct generate_unique
{
typedef _Tp value_type;
operator value_type()
{
static value_type _S_;
++_S_;
return _S_;
}
};
template<typename _Tp1, typename _Tp2>
struct generate_unique<std::pair<_Tp1, _Tp2> >
{
typedef _Tp1 first_type;
typedef _Tp2 second_type;
typedef std::pair<_Tp1, _Tp2> pair_type;
operator pair_type()
{
static first_type _S_1;
static second_type _S_2;
++_S_1;
++_S_2;
return pair_type(_S_1, _S_2);
}
};
// Check that invalid range of pointers is detected
template<typename _Tp>
void
check_assign1()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::vector<val_type> vector_type;
generate_unique<val_type> gu;
vector_type v;
for (int i = 0; i != 5; ++i)
v.push_back(gu);
VERIFY(v.size() == 5);
const val_type* first = &v.front() + 1;
const val_type* last = first + 2;
cont_type c1;
c1.assign(first, last);
VERIFY(c1.size() == 2);
cont_type c2;
c2.assign(last, first); // Expected failure
}
// Check that invalid range of debug random iterators is detected
template<typename _Tp>
void
check_assign2()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::vector<val_type> vector_type;
generate_unique<val_type> gu;
vector_type v;
for (int i = 0; i != 5; ++i)
v.push_back(gu);
VERIFY(v.size() == 5);
typename vector_type::iterator first = v.begin() + 1;
typename vector_type::iterator last = first + 2;
cont_type c1;
c1.assign(first, last);
VERIFY(c1.size() == 2);
cont_type c2;
c2.assign(last, first); // Expected failure
}
// Check that invalid range of debug !random debug iterators is detected
template<typename _Tp>
void
check_assign3()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::list<val_type> list_type;
generate_unique<val_type> gu;
list_type l;
for (int i = 0; i != 5; ++i)
l.push_back(gu);
VERIFY(l.size() == 5);
typename list_type::iterator first = l.begin(); ++first;
typename list_type::iterator last = first; ++last; ++last;
cont_type c1;
c1.assign(first, last);
VERIFY(c1.size() == 2);
cont_type c2;
c2.assign(last, first); // Expected failure
}
// Check that invalid range of pointers is detected
template<typename _Tp>
void
check_construct1()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::vector<val_type> vector_type;
generate_unique<val_type> gu;
vector_type v;
for (int i = 0; i != 5; ++i)
v.push_back(gu);
VERIFY(v.size() == 5);
val_type *first = &v.front() + 1;
val_type *last = first + 2;
cont_type c1(first, last);
VERIFY(c1.size() == 2);
cont_type c2(last, first); // Expected failure
}
// Check that invalid range of debug random iterators is detected
template<typename _Tp>
void
check_construct2()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::vector<val_type> vector_type;
generate_unique<val_type> gu;
vector_type v;
for (int i = 0; i != 5; ++i)
v.push_back(gu);
VERIFY(v.size() == 5);
typename vector_type::iterator first = v.begin() + 1;
typename vector_type::iterator last = first + 2;
cont_type c1(first, last);
VERIFY(c1.size() == 2);
cont_type c2(last, first); // Expected failure
}
// Check that invalid range of debug not random iterators is detected
template<typename _Tp>
void
check_construct3()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::list<val_type> list_type;
generate_unique<val_type> gu;
list_type l;
for (int i = 0; i != 5; ++i)
l.push_back(gu);
VERIFY(l.size() == 5);
typename list_type::iterator first = l.begin(); ++first;
typename list_type::iterator last = first; ++last; ++last;
cont_type c1(first, last);
VERIFY(c1.size() == 2);
cont_type c2(last, first); // Expected failure
}
template <typename _Cont>
struct InsertRangeHelper
{
template <typename _It>
static void
Insert(_Cont& cont, _It first, _It last)
{ cont.insert(first, last); }
};
template <typename _Cont>
struct InsertRangeHelperAux
{
template <typename _It>
static void
Insert(_Cont& cont, _It first, _It last)
{ cont.insert(cont.begin(), first, last); }
};
template <typename _Tp1, typename _Tp2>
struct InsertRangeHelper<std::vector<_Tp1, _Tp2> >
: InsertRangeHelperAux<std::vector<_Tp1, _Tp2> >
{ };
template <typename _Tp1, typename _Tp2>
struct InsertRangeHelper<std::deque<_Tp1, _Tp2> >
: InsertRangeHelperAux<std::deque<_Tp1, _Tp2> >
{ };
template <typename _Tp1, typename _Tp2>
struct InsertRangeHelper<std::list<_Tp1, _Tp2> >
: InsertRangeHelperAux<std::list<_Tp1, _Tp2> >
{ };
#ifndef _GLIBCXX_DEBUG
template <typename _Tp1, typename _Tp2>
struct InsertRangeHelper<__gnu_debug::vector<_Tp1, _Tp2> >
: InsertRangeHelperAux<__gnu_debug::vector<_Tp1, _Tp2> >
{ };
template <typename _Tp1, typename _Tp2>
struct InsertRangeHelper<__gnu_debug::deque<_Tp1, _Tp2> >
: InsertRangeHelperAux<__gnu_debug::deque<_Tp1, _Tp2> >
{ };
template <typename _Tp1, typename _Tp2>
struct InsertRangeHelper<__gnu_debug::list<_Tp1, _Tp2> >
: InsertRangeHelperAux<__gnu_debug::list<_Tp1, _Tp2> >
{ };
#endif
template<typename _Tp>
void
check_insert1()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::vector<val_type> vector_type;
generate_unique<val_type> gu;
vector_type v;
for (int i = 0; i != 5; ++i)
v.push_back(gu);
VERIFY(v.size() == 5);
const val_type* first = &v.front() + 1;
const val_type* last = first + 2;
cont_type c1;
InsertRangeHelper<cont_type>::Insert(c1, first, last);
VERIFY(c1.size() == 2);
cont_type c2;
InsertRangeHelper<cont_type>::Insert(c2, last, first); // Expected failure
}
template<typename _Tp>
void
check_insert2()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::vector<val_type> vector_type;
generate_unique<val_type> gu;
vector_type v;
for (int i = 0; i != 5; ++i)
v.push_back(gu);
VERIFY(v.size() == 5);
typename vector_type::iterator first = v.begin() + 1;
typename vector_type::iterator last = first + 2;
cont_type c1;
InsertRangeHelper<cont_type>::Insert(c1, first, last);
VERIFY(c1.size() == 2);
cont_type c2;
InsertRangeHelper<cont_type>::Insert(c2, last, first); // Expected failure
}
template<typename _Tp>
void
check_insert3()
{
bool test __attribute__((unused)) = true;
typedef _Tp cont_type;
typedef typename cont_type::value_type cont_val_type;
typedef typename CopyableValueType<cont_val_type>::value_type val_type;
typedef std::list<val_type> list_type;
generate_unique<val_type> gu;
list_type l;
for (int i = 0; i != 5; ++i)
l.push_back(gu);
VERIFY(l.size() == 5);
typename list_type::iterator first = l.begin(); ++first;
typename list_type::iterator last = first; ++last; ++last;
cont_type c1;
InsertRangeHelper<cont_type>::Insert(c1, first, last);
VERIFY(c1.size() == 2);
cont_type c2;
InsertRangeHelper<cont_type>::Insert(c2, last, first); // Expected failure
}
}
|
