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
|
// Copyright (C) 2004, 2005, 2009 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/>.
/*
* The goal with this application is to compare the performance
* between different std::allocator implementations. The results are
* influenced by the underlying allocator in the "C" library, malloc.
*/
#include <set>
#include <sstream>
using namespace std;
typedef int test_type;
// This can take extremely long on simulators, timing out the test.
// { dg-options "-DITERATIONS=10" { target simulator } }
#ifndef ITERATIONS
#define ITERATIONS 10000
#endif
// The number of iterations to be performed.
int iterations = ITERATIONS;
// The number of values to insert in the container, 32 will cause 5
// (re)allocations to be performed (sizes 4, 8, 16, 32 and 64)
// This means that all allocations are within _MAX_BYTES = 128 as
// defined in stl_alloc.h for __pool_alloc. Whether or not this
// value is relevant in "the real world" or not I don't know and
// should probably be investigated in more detail.
int insert_values = 128;
template<typename TestType>
struct value_type : public pair<TestType, TestType>
{
value_type() : pair<TestType, TestType>(0, 0) { }
inline value_type operator++() { return ++this->first, *this; }
inline operator TestType() const { return this->first; }
};
template<typename Container>
void
do_loop()
{
Container obj;
int test_iterations = 0;
value_type<test_type> test_value;
while (test_iterations < iterations)
{
for (int j = 0; j < insert_values; ++j)
obj.insert(obj.end(), ++test_value);
++test_iterations;
}
}
template<typename Container>
void
test_container(Container, bool run_threaded = false)
{
do_loop<Container>();
std::ostringstream comment;
if (run_threaded)
comment << "4-way threaded iterations: " << iterations*4 << '\t';
else
comment << "iterations: " << iterations << '\t';
}
// http://gcc.gnu.org/ml/libstdc++/2001-05/msg00105.html
// http://gcc.gnu.org/ml/libstdc++/2003-05/msg00231.html
int main(void)
{
typedef less<test_type> compare_type;
test_container(set<test_type, compare_type>());
return 0;
}
|
