1// Copyright (C) 2003 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#include <locale>
29#include <testsuite_performance.h>
30
31int main()
32{
33  using namespace std;
34  using namespace __gnu_test;
35
36  time_counter time;
37  resource_counter resource;
38  char bufin[] = "This was an attempt to bypass string construction just for test.";
39  char bufout[sizeof(bufin)];
40
41  locale loc;
42  const ctype<char>& ct = use_facet<ctype<char> >(loc);
43
44  // narrow
45  start_counters(time, resource);
46  for (long i = 0; i < 1000000000; ++i)
47    ct.narrow(i % 128, '*');
48  stop_counters(time, resource);
49  report_performance(__FILE__, "narrow", time, resource);
50  clear_counters(time, resource);
51
52  // narrow array
53  start_counters(time, resource);
54  for (long i = 0; i < 100000000; ++i)
55    ct.narrow(bufin, bufin+sizeof(bufin), '*', bufout);
56  stop_counters(time, resource);
57  report_performance(__FILE__, "narrow_array", time, resource);
58  clear_counters(time, resource);
59
60  // widen
61  start_counters(time, resource);
62  for (long i = 0; i < 1000000000; ++i)
63    ct.widen(i % 128);
64  stop_counters(time, resource);
65  report_performance(__FILE__, "widen", time, resource);
66  clear_counters(time, resource);
67
68  // widen array
69  start_counters(time, resource);
70  for (long i = 0; i < 100000000; ++i)
71    ct.widen(bufin, bufin+sizeof(bufin), bufout);
72  stop_counters(time, resource);
73  report_performance(__FILE__, "widen_array", time, resource);
74
75  return 0;
76}
77