1*bf2c3715SXin Li //=====================================================
2*bf2c3715SXin Li // File : bench.hh
3*bf2c3715SXin Li // Author : L. Plagne <[email protected])>
4*bf2c3715SXin Li // Copyright (C) EDF R&D, lun sep 30 14:23:16 CEST 2002
5*bf2c3715SXin Li //=====================================================
6*bf2c3715SXin Li //
7*bf2c3715SXin Li // This program is free software; you can redistribute it and/or
8*bf2c3715SXin Li // modify it under the terms of the GNU General Public License
9*bf2c3715SXin Li // as published by the Free Software Foundation; either version 2
10*bf2c3715SXin Li // of the License, or (at your option) any later version.
11*bf2c3715SXin Li //
12*bf2c3715SXin Li // This program is distributed in the hope that it will be useful,
13*bf2c3715SXin Li // but WITHOUT ANY WARRANTY; without even the implied warranty of
14*bf2c3715SXin Li // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15*bf2c3715SXin Li // GNU General Public License for more details.
16*bf2c3715SXin Li // You should have received a copy of the GNU General Public License
17*bf2c3715SXin Li // along with this program; if not, write to the Free Software
18*bf2c3715SXin Li // Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
19*bf2c3715SXin Li //
20*bf2c3715SXin Li #ifndef BENCH_HH
21*bf2c3715SXin Li #define BENCH_HH
22*bf2c3715SXin Li
23*bf2c3715SXin Li #include "btl.hh"
24*bf2c3715SXin Li #include "bench_parameter.hh"
25*bf2c3715SXin Li #include <iostream>
26*bf2c3715SXin Li #include "utilities.h"
27*bf2c3715SXin Li #include "size_lin_log.hh"
28*bf2c3715SXin Li #include "xy_file.hh"
29*bf2c3715SXin Li #include <vector>
30*bf2c3715SXin Li #include <string>
31*bf2c3715SXin Li #include "timers/portable_perf_analyzer.hh"
32*bf2c3715SXin Li // #include "timers/mixed_perf_analyzer.hh"
33*bf2c3715SXin Li // #include "timers/x86_perf_analyzer.hh"
34*bf2c3715SXin Li // #include "timers/STL_perf_analyzer.hh"
35*bf2c3715SXin Li #ifdef HAVE_MKL
36*bf2c3715SXin Li extern "C" void cblas_saxpy(const int, const float, const float*, const int, float *, const int);
37*bf2c3715SXin Li #endif
38*bf2c3715SXin Li using namespace std;
39*bf2c3715SXin Li
40*bf2c3715SXin Li template <template<class> class Perf_Analyzer, class Action>
bench(int size_min,int size_max,int nb_point)41*bf2c3715SXin Li BTL_DONT_INLINE void bench( int size_min, int size_max, int nb_point )
42*bf2c3715SXin Li {
43*bf2c3715SXin Li if (BtlConfig::skipAction(Action::name()))
44*bf2c3715SXin Li return;
45*bf2c3715SXin Li
46*bf2c3715SXin Li string filename="bench_"+Action::name()+".dat";
47*bf2c3715SXin Li
48*bf2c3715SXin Li INFOS("starting " <<filename);
49*bf2c3715SXin Li
50*bf2c3715SXin Li // utilities
51*bf2c3715SXin Li
52*bf2c3715SXin Li std::vector<double> tab_mflops(nb_point);
53*bf2c3715SXin Li std::vector<int> tab_sizes(nb_point);
54*bf2c3715SXin Li
55*bf2c3715SXin Li // matrices and vector size calculations
56*bf2c3715SXin Li size_lin_log(nb_point,size_min,size_max,tab_sizes);
57*bf2c3715SXin Li
58*bf2c3715SXin Li std::vector<int> oldSizes;
59*bf2c3715SXin Li std::vector<double> oldFlops;
60*bf2c3715SXin Li bool hasOldResults = read_xy_file(filename, oldSizes, oldFlops, true);
61*bf2c3715SXin Li int oldi = oldSizes.size() - 1;
62*bf2c3715SXin Li
63*bf2c3715SXin Li // loop on matrix size
64*bf2c3715SXin Li Perf_Analyzer<Action> perf_action;
65*bf2c3715SXin Li for (int i=nb_point-1;i>=0;i--)
66*bf2c3715SXin Li {
67*bf2c3715SXin Li //INFOS("size=" <<tab_sizes[i]<<" ("<<nb_point-i<<"/"<<nb_point<<")");
68*bf2c3715SXin Li std::cout << " " << "size = " << tab_sizes[i] << " " << std::flush;
69*bf2c3715SXin Li
70*bf2c3715SXin Li BTL_DISABLE_SSE_EXCEPTIONS();
71*bf2c3715SXin Li #ifdef HAVE_MKL
72*bf2c3715SXin Li {
73*bf2c3715SXin Li float dummy;
74*bf2c3715SXin Li cblas_saxpy(1,0,&dummy,1,&dummy,1);
75*bf2c3715SXin Li }
76*bf2c3715SXin Li #endif
77*bf2c3715SXin Li
78*bf2c3715SXin Li tab_mflops[i] = perf_action.eval_mflops(tab_sizes[i]);
79*bf2c3715SXin Li std::cout << tab_mflops[i];
80*bf2c3715SXin Li
81*bf2c3715SXin Li if (hasOldResults)
82*bf2c3715SXin Li {
83*bf2c3715SXin Li while (oldi>=0 && oldSizes[oldi]>tab_sizes[i])
84*bf2c3715SXin Li --oldi;
85*bf2c3715SXin Li if (oldi>=0 && oldSizes[oldi]==tab_sizes[i])
86*bf2c3715SXin Li {
87*bf2c3715SXin Li if (oldFlops[oldi]<tab_mflops[i])
88*bf2c3715SXin Li std::cout << "\t > ";
89*bf2c3715SXin Li else
90*bf2c3715SXin Li std::cout << "\t < ";
91*bf2c3715SXin Li std::cout << oldFlops[oldi];
92*bf2c3715SXin Li }
93*bf2c3715SXin Li --oldi;
94*bf2c3715SXin Li }
95*bf2c3715SXin Li std::cout << " MFlops (" << nb_point-i << "/" << nb_point << ")" << std::endl;
96*bf2c3715SXin Li }
97*bf2c3715SXin Li
98*bf2c3715SXin Li if (!BtlConfig::Instance.overwriteResults)
99*bf2c3715SXin Li {
100*bf2c3715SXin Li if (hasOldResults)
101*bf2c3715SXin Li {
102*bf2c3715SXin Li // merge the two data
103*bf2c3715SXin Li std::vector<int> newSizes;
104*bf2c3715SXin Li std::vector<double> newFlops;
105*bf2c3715SXin Li unsigned int i=0;
106*bf2c3715SXin Li unsigned int j=0;
107*bf2c3715SXin Li while (i<tab_sizes.size() && j<oldSizes.size())
108*bf2c3715SXin Li {
109*bf2c3715SXin Li if (tab_sizes[i] == oldSizes[j])
110*bf2c3715SXin Li {
111*bf2c3715SXin Li newSizes.push_back(tab_sizes[i]);
112*bf2c3715SXin Li newFlops.push_back(std::max(tab_mflops[i], oldFlops[j]));
113*bf2c3715SXin Li ++i;
114*bf2c3715SXin Li ++j;
115*bf2c3715SXin Li }
116*bf2c3715SXin Li else if (tab_sizes[i] < oldSizes[j])
117*bf2c3715SXin Li {
118*bf2c3715SXin Li newSizes.push_back(tab_sizes[i]);
119*bf2c3715SXin Li newFlops.push_back(tab_mflops[i]);
120*bf2c3715SXin Li ++i;
121*bf2c3715SXin Li }
122*bf2c3715SXin Li else
123*bf2c3715SXin Li {
124*bf2c3715SXin Li newSizes.push_back(oldSizes[j]);
125*bf2c3715SXin Li newFlops.push_back(oldFlops[j]);
126*bf2c3715SXin Li ++j;
127*bf2c3715SXin Li }
128*bf2c3715SXin Li }
129*bf2c3715SXin Li while (i<tab_sizes.size())
130*bf2c3715SXin Li {
131*bf2c3715SXin Li newSizes.push_back(tab_sizes[i]);
132*bf2c3715SXin Li newFlops.push_back(tab_mflops[i]);
133*bf2c3715SXin Li ++i;
134*bf2c3715SXin Li }
135*bf2c3715SXin Li while (j<oldSizes.size())
136*bf2c3715SXin Li {
137*bf2c3715SXin Li newSizes.push_back(oldSizes[j]);
138*bf2c3715SXin Li newFlops.push_back(oldFlops[j]);
139*bf2c3715SXin Li ++j;
140*bf2c3715SXin Li }
141*bf2c3715SXin Li tab_mflops = newFlops;
142*bf2c3715SXin Li tab_sizes = newSizes;
143*bf2c3715SXin Li }
144*bf2c3715SXin Li }
145*bf2c3715SXin Li
146*bf2c3715SXin Li // dump the result in a file :
147*bf2c3715SXin Li dump_xy_file(tab_sizes,tab_mflops,filename);
148*bf2c3715SXin Li
149*bf2c3715SXin Li }
150*bf2c3715SXin Li
151*bf2c3715SXin Li // default Perf Analyzer
152*bf2c3715SXin Li
153*bf2c3715SXin Li template <class Action>
bench(int size_min,int size_max,int nb_point)154*bf2c3715SXin Li BTL_DONT_INLINE void bench( int size_min, int size_max, int nb_point ){
155*bf2c3715SXin Li
156*bf2c3715SXin Li // if the rdtsc is not available :
157*bf2c3715SXin Li bench<Portable_Perf_Analyzer,Action>(size_min,size_max,nb_point);
158*bf2c3715SXin Li // if the rdtsc is available :
159*bf2c3715SXin Li // bench<Mixed_Perf_Analyzer,Action>(size_min,size_max,nb_point);
160*bf2c3715SXin Li
161*bf2c3715SXin Li
162*bf2c3715SXin Li // Only for small problem size. Otherwise it will be too long
163*bf2c3715SXin Li // bench<X86_Perf_Analyzer,Action>(size_min,size_max,nb_point);
164*bf2c3715SXin Li // bench<STL_Perf_Analyzer,Action>(size_min,size_max,nb_point);
165*bf2c3715SXin Li
166*bf2c3715SXin Li }
167*bf2c3715SXin Li
168*bf2c3715SXin Li #endif
169