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
|
// Copyright (C) 2003 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 2, 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 COPYING. If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.
// As a special exception, you may use this file as part of a free software
// library without restriction. Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the GNU General Public License. This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the GNU General Public License.
#include <complex>
#include <testsuite_performance.h>
// based on libstdc++/5730, use --fast-math
int main()
{
using namespace std;
using namespace __gnu_cxx_test;
time_counter time;
resource_counter resource;
const int iterations = 2000;
typedef complex<double> complex_type;
complex_type u[2048];
for (int i = 0; i < 2048; ++i)
u[i] = 1.0;
start_counters(time, resource);
for (int i = 0; i < iterations; ++i)
{
complex_type * p = u;
for (int j = 0; j < 2048; ++j)
{
double u2 = norm(*p);
double t = u2 * 0.1;
*p *= complex_type(cos(t), sin(t));
++p;
}
}
stop_counters(time, resource);
report_performance(__FILE__, "norm", time, resource);
clear_counters(time, resource);
start_counters(time, resource);
for (int i = 0; i < iterations; ++i)
{
complex_type * p = u;
for (int j = 0; j < 2048; ++j)
{
// Shouldn't be slower than the above.
double ur = real(*p);
double ui = imag(*p);
double u2 = ur * ur + ui * ui;
double t = u2 * 0.1;
*p *= complex_type(cos(t), sin(t));
++p;
}
}
stop_counters(time, resource);
report_performance(__FILE__, "", time, resource);
return 0;
}
|
