1// Copyright (C) 2004, 2005 Free Software Foundation, Inc.
2//
3// This file is part of the GNU ISO C++ Library.  This library is free
4// software; you can redistribute it and/or modify it under the
5// terms of the GNU General Public License as published by the
6// Free Software Foundation; either version 2, or (at your option)
7// any later version.
8
9// This library is distributed in the hope that it will be useful,
10// but WITHOUT ANY WARRANTY; without even the implied warranty of
11// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
12// GNU General Public License for more details.
13
14// You should have received a copy of the GNU General Public License along
15// with this library; see the file COPYING.  If not, write to the Free
16// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
17// USA.
18
19// As a special exception, you may use this file as part of a free software
20// library without restriction.  Specifically, if other files instantiate
21// templates or use macros or inline functions from this file, or you compile
22// this file and link it with other files to produce an executable, this
23// file does not by itself cause the resulting executable to be covered by
24// the GNU General Public License.  This exception does not however
25// invalidate any other reasons why the executable file might be covered by
26// the GNU General Public License.
27
28/*
29 * The goal with this application is to compare the performance
30 * between different std::allocator implementations. The results are
31 * influenced by the underlying allocator in the "C" library, malloc.
32 */
33
34#include <set>
35#include <sstream>
36
37using namespace std;
38
39typedef int test_type;
40
41// The number of iterations to be performed.
42int iterations = 10000;
43
44// The number of values to insert in the container, 32 will cause 5
45// (re)allocations to be performed (sizes 4, 8, 16, 32 and 64)
46// This means that all allocations are within _MAX_BYTES = 128 as
47// defined in stl_alloc.h for __pool_alloc.  Whether or not this
48// value is relevant in "the real world" or not I don't know and
49// should probably be investigated in more detail.
50int insert_values = 128;
51
52template<typename TestType>
53  struct value_type : public pair<TestType, TestType>
54  {
55    value_type() : pair<TestType, TestType>(0, 0) { }
56
57    inline value_type operator++() { return ++this->first, *this; }
58    inline operator TestType() const { return this->first; }
59  };
60
61template<typename Container>
62  void
63  do_loop()
64  {
65    Container obj;
66    int test_iterations = 0;
67    value_type<test_type> test_value;
68    while (test_iterations < iterations)
69      {
70	for (int j = 0; j < insert_values; ++j)
71	  obj.insert(obj.end(), ++test_value);
72	++test_iterations;
73      }
74  }
75
76template<typename Container>
77  void
78  test_container(Container, bool run_threaded = false)
79  {
80    do_loop<Container>();
81    std::ostringstream comment;
82    if (run_threaded)
83      comment << "4-way threaded iterations: " << iterations*4 << '\t';
84    else
85      comment << "iterations: " << iterations << '\t';
86  }
87
88// http://gcc.gnu.org/ml/libstdc++/2001-05/msg00105.html
89// http://gcc.gnu.org/ml/libstdc++/2003-05/msg00231.html
90int main(void)
91{
92  typedef less<test_type> compare_type;
93  test_container(set<test_type, compare_type>());
94  return 0;
95}
96