blob: fcaeb917f02b68b9ab60935f4563e47a8a7758ab (
plain)
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
|
// 2004-10-10 Paolo Carlini <pcarlini@suse.de>
// Copyright (C) 2004-2018 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/>.
// 20.4.1.1 allocator members
#include <ext/pool_allocator.h>
#include <testsuite_hooks.h>
struct small
{
char c[16];
};
struct big
{
char c[64];
};
void*
operator new(size_t n) THROW(std::bad_alloc)
{
static bool first = true;
if (!first)
throw std::bad_alloc();
first = false;
return std::malloc(n);
}
// http://gcc.gnu.org/ml/libstdc++/2004-10/msg00098.html
void test01()
{
using __gnu_cxx::__pool_alloc;
__pool_alloc<big> alloc_big;
alloc_big.allocate(1);
// The constant 20 comes from __pool_alloc_base::_M_refill. See
// also __pool_alloc_base::_M_allocate_chunk.
__pool_alloc<small> alloc_small;
for (unsigned int i = 0; i < 20 * sizeof(big) / sizeof(small) + 1; ++i)
alloc_small.allocate(1);
}
int main()
{
test01();
}
|
