/usr/include/linbox/benchmark-utils.C is in liblinbox-dev 1.4.2-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 | /* Copyright (C) 2013 LinBox
* Written by Brice Boyer (briceboyer) <boyer.brice@gmail.com>
*
*
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*/
/*!@internal
* @file benchmarks/benchmark-utils.C
* @ingroup benchmarks
* @brief utils
*/
#ifndef __LINBOX_benchmarks_benchmark_utils_C
#define __LINBOX_benchmarks_benchmark_utils_C
#include "linbox/linbox-config.h"
#include "benchmark-utils.h"
//
// Terminal progression
//
namespace LinBox {
void showAdvanceLinear(size_t curr, size_t min, size_t max)
{
std::cout << std::setprecision(4) << "\033[2K" << "\033[30D" << min <<std::flush;
std::cout << '<' << curr << '<' << max << " (" << std::flush;
std::cout << double(curr-min)/double(max-min)*100 << "%)" << std::flush;
}
void showFinish(size_t curr, size_t all)
{
std::cout << "\033[2K" << "\033[30D" << "finished : " << curr << std::flush;
std::cout << '/' << all-1 << std::flush << std::endl;
}
void showSkip(size_t curr, size_t all)
{
std::cout << "\033[2K" << "\033[30D" << "skipped : " << curr << std::flush;
std::cout << '/' << all-1 << std::flush << std::endl;
}
showProgression::showProgression (size_t tot) :
_cur_(0)
,_tot_(tot)
{}
//! show an inter has finished
void showProgression::FinishIter()
{
++_cur_ ;
showFinish(_cur_,_tot_);
}
//! show an inter has been skipped.
void showProgression::SkipIter()
{
++_cur_ ;
showSkip(_cur_,_tot_);
}
} // LinBox
//
// MFLOPS helper
//
namespace LinBox {
double computeMFLOPS(const double & tim, const double mflo, const size_t rpt)
{
linbox_check(rpt);
// linbox_check(tim != 0.);
if (tim == 0.) return NAN ;
return (double) ((mflo*(double)rpt)/tim);
}
dvector_t &
insertTime(dvector_t & tim3, const double & tps)
{
linbox_check(tim3.size() == 3);
if (tim3[0] > tps) {
tim3[2] = tim3[1] ;
tim3[1] = tim3[0] ;
tim3[0] = tps ;
}
else if (tim3[1] > tps) {
tim3[2] = tim3[1] ;
tim3[1] = tps ;
}
else if (tim3[2] > tps) {
tim3[2] = tps ;
}
return tim3 ;
}
double computeMFLOPS(const dvector_t & tim, const double mflo, Tag::TimeSelect ts )
{
linbox_check(tim.size());
switch (ts) {
case (Tag::TimeSelect::average) :
{
double tps = 0 ;
for (size_t i = 0 ; i < tim.size() ; ++i)
tps += tim[i] ;
return computeMFLOPS(tps,mflo,(size_t)tim.size());
}
case (Tag::TimeSelect::bestThree) :
{
if (tim.size() <4)
return computeMFLOPS(tim,mflo,Tag::TimeSelect::average);
dvector_t tps (3);
double t1,t2 ;
if (tim[0]<tim[1]) {
t1 = tim[0];
t2 = tim[1];
}
else {
t1 = tim[1];
t2 = tim[0];
}
if (tim[3] < t1) {
tps[0] = tim[3] ;
tps[1] = t1 ;
tps[2] = t2 ;
}
else if (tim[2] < t1) {
tps[0] = t1 ;
tps[1] = tim[3] ;
tps[2] = t2 ;
}
else {
tps[0] = t1 ;
tps[1] = t2;
tps[2] = tim[3] ;
}
for (size_t i = 3 ; i < tim.size() ; ++i)
insertTime(tps,tim[i]);
return computeMFLOPS(tim,mflo,Tag::TimeSelect::average);
}
case (Tag::TimeSelect::bestOne) :
{
double t1 = tim[0] ;
for (size_t i = 1 ; i < tim.size() ; ++i)
if (tim[i] < t1)
t1 = tim[i] ;
return computeMFLOPS(t1,mflo,1);
}
case (Tag::TimeSelect::median) :
{
if (tim.size() == 1)
return computeMFLOPS(tim[0],mflo,1) ;
dvector_t tps (tim);
std::sort(tps.begin(),tps.end());
size_t mid = (size_t)tps.size()/2 ;
double t1 ;
if (isOdd((uint64_t)tps.size()))
t1 = tps[mid] ;
else
t1 = (tps[mid-1]+tps[mid])/2;
return computeMFLOPS(t1,mflo,1);
}
case (Tag::TimeSelect::medmean) :
{
if (tim.size() < 3)
return computeMFLOPS(tim,mflo,Tag::TimeSelect::median); ;
size_t q1 = (size_t)((double)tim.size()/(double)4) ;
size_t q3 = (size_t)tim.size()-q1 ;
dvector_t tps (tim);
std::sort(tps.begin(),tps.end());
dvector_t tps2 (tim.begin()+q1,tim.begin()+q3);
return computeMFLOPS(tps2,mflo,Tag::TimeSelect::average);
}
default :
{
throw("not among tags");
}
} // switch(ts)
}
}
//
// String processing
//
namespace LinBox {
bool isDigit (const std::string & s)
{
std::istringstream ss(s);
double d = 0.0;
ss >> d ; // try to read.
ss >> std::ws; // suppress whitespace
return (!ss.fail() && ss.eof()) ;
}
bool fortifiedString(const std::string & s)
{
if (isDigit(s))
return true ;
linbox_check(!s.empty());
return s.front() == '\"' && s.back() == '\"' ;
}
std::string unfortifyString(const std::string &s)
{
std::string t = s ;
if (fortifiedString(s)) {
t.erase(t.begin());
t.pop_back();
}
return t;
}
std::string fortifyString(const std::string & s)
{
if (fortifiedString(s))
return s ;
string r = "\"" ;
return r + s + "\"";
}
char randomAlNum()
{
int c = rand()%62 ;
c += 48 ; // c entre 48 et 109
if (c < 58) {
return (char) c;
}
else {
c += 7 ;
if (c < 91) {
return (char)c ;
}
else {
c += 6 ;
return (char)c;
}
}
}
std::string randomAlNum(const size_t & m)
{
std::string r = "" ;
for (size_t i = 0 ; i < m ; ++i)
r += randomAlNum();
return r ;
}
}// LinBox
//
// Machine information
//
namespace LinBox {
//! get ISO time and date
std::string getDateTime(const std::string & sep)
{
std::time_t rawtime;
std::tm* timeinfo;
char buffer [80];
std::time(&rawtime);
timeinfo = std::gmtime(&rawtime);
std::string fmt ;
std::string date = "%Y-%m-%d" ;
std::string time = "%H:%M:%S" ;
std::string tz = "GMT" ;
fmt = date + sep + time + sep + tz ;
std::strftime(buffer,80,fmt.c_str(),timeinfo);
std::string mytime(buffer);
return mytime;
}
//! get some machine information (not cpu yet)
smatrix_t getMachineInformation()
{
smatrix_t Machine(2);
Machine[0].resize(5);
Machine[1].resize(5);
struct utsname unameData;
uname(&unameData);
Machine[0][0] = "sysname";
Machine[1][0] = unameData.sysname;
Machine[0][1] = "nodename";
Machine[1][1] = unameData.nodename;
Machine[0][2] = "release";
Machine[1][2] = unameData.release;
Machine[0][3] = "version";
Machine[1][3] = unameData.version;
Machine[0][4] = "machine";
Machine[1][4] = unameData.machine;
// Machine[0][5] = "RAM (kb)";
// system("cat /proc/meminfo | grep MemTotal | awk '{print $2}'");
// Machine[0][6] = "CPU name";
// system("/proc/cpuinfo | grep 'model name' | awk '{$1=$2=$3=""; print $0}'");
// Machine[0][7] = "CPU nb";
// system("/proc/cpuinfo | grep 'model name' | wc -l");
// Machine[0][8] = "CPU Ghz";
// cpuid ?
return Machine ;
}
}
#endif // __LINBOX_benchmarks_benchmark_utils_C
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s
|