libstdc++-v3/testsuite/util/performance/priority_queue/mem_usage/pop_test.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005, 2006 Free Software Foundation, Inc.
   4 //
   5 // This file is part of the GNU ISO C++ Library.  This library is free
   6 // software; you can redistribute it and/or modify it under the terms
   7 // of the GNU General Public License as published by the Free Software
   8 // Foundation; either version 2, or (at your option) any later
   9 // version.
  10
  11 // This library is distributed in the hope that it will be useful, but
  12 // WITHOUT ANY WARRANTY; without even the implied warranty of
  13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14 // General Public License for more details.
  15
  16 // You should have received a copy of the GNU General Public License
  17 // along with this library; see the file COPYING.  If not, write to
  18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
  19 // MA 02111-1307, USA.
  20
  21 // As a special exception, you may use this file as part of a free
  22 // software library without restriction.  Specifically, if other files
  23 // instantiate templates or use macros or inline functions from this
  24 // file, or you compile this file and link it with other files to
  25 // produce an executable, this file does not by itself cause the
  26 // resulting executable to be covered by the GNU General Public
  27 // License.  This exception does not however invalidate any other
  28 // reasons why the executable file might be covered by the GNU General
  29 // Public License.
  30
  31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  32
  33 // Permission to use, copy, modify, sell, and distribute this software
  34 // is hereby granted without fee, provided that the above copyright
  35 // notice appears in all copies, and that both that copyright notice
  36 // and this permission notice appear in supporting documentation. None
  37 // of the above authors, nor IBM Haifa Research Laboratories, make any
  38 // representation about the suitability of this software for any
  39 // purpose. It is provided "as is" without express or implied
  40 // warranty.
  41
  42 /**
  43  * @file pop_test.hpp
  44  * Contains a generic pop test.
  45  */
  46
  47 #ifndef PB_DS_POP_TEST_HPP
  48 #define PB_DS_POP_TEST_HPP
  49
  50 #include <ext/pb_ds/detail/type_utils.hpp>
  51 #include <performance/mem/mem_track_allocator.hpp>
  52 #include <performance/io/xml_formatter.hpp>
  53 #include <common_type/priority_queue/string_form.hpp>
  54 #include <iterator>
  55
  56 namespace pb_ds
  57 {
  58
  59   namespace test
  60   {
  61
  62 #define PB_DS_CLASS_T_DEC                       \
  63     template<typename It>
  64
  65 #define PB_DS_CLASS_C_DEC                               \
  66     pop_test<                                           \
  67                                                 It>
  68
  69     template<typename It>
  70     class pop_test
  71     {
  72     public:
  73       pop_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
  74
  75       template<typename Cntnr>
  76       void
  77       operator()(pb_ds::detail::type_to_type<Cntnr>);
  78
  79     private:
  80       pop_test(const pop_test& );
  81
  82     private:
  83       const It m_ins_b;
  84
  85       const size_t m_ins_vn;
  86       const size_t m_ins_vs;
  87       const size_t m_ins_vm;
  88     };
  89
  90     PB_DS_CLASS_T_DEC
  91     PB_DS_CLASS_C_DEC::
  92     pop_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
  93       m_ins_b(ins_b),
  94       m_ins_vn(ins_vn),
  95       m_ins_vs(ins_vs),
  96       m_ins_vm(ins_vm)
  97     { }
  98
  99     PB_DS_CLASS_T_DEC
 100     template<typename Cntnr>
 101     void
 102     PB_DS_CLASS_C_DEC::
 103     operator()(pb_ds::detail::type_to_type<Cntnr>)
 104     {
 105       xml_result_set_performance_formatter res_set_fmt(
 106                                                        string_form<Cntnr>::name(),
 107                                                        string_form<Cntnr>::desc());
 108
 109       for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
 110         {
 111           const size_t ins_size = m_ins_vn + size_i*  m_ins_vs;
 112
 113           It ins_it_b = m_ins_b;
 114           It ins_it_e = m_ins_b;
 115           std::advance(ins_it_e, ins_size);
 116
 117           mem_track_allocator<char> alloc;
 118
 119           const size_t init_mem = alloc.get_total();
 120
 121           Cntnr cntnr;
 122
 123           for (It ins_it =    ins_it_b; ins_it != ins_it_e; ++ins_it)
 124             cntnr.push(ins_it->first);
 125
 126           while (cntnr.size() > 1)
 127             cntnr.pop();
 128
 129           const size_t final_mem = alloc.get_total();
 130
 131           assert(final_mem > init_mem);
 132
 133           const size_t delta_mem = final_mem - init_mem;
 134
 135           res_set_fmt.add_res(ins_size, static_cast<double>(delta_mem));
 136         }
 137     }
 138
 139 #undef PB_DS_CLASS_T_DEC
 140
 141 #undef PB_DS_CLASS_C_DEC
 142
 143   } // namespace test
 144
 145 } // namespace pb_ds
 146
 147 #endif // #ifndef PB_DS_POP_TEST_HPP
 148