/* Copyright (c) FFLAS-FFPACK
* Written by Clément Pernet <clement.pernet@imag.fr>
* ========LICENCE========
* This file is part of the library FFLAS-FFPACK.
*
* FFLAS-FFPACK 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========
*/
// For the moment, please manually uncomment these defines when your BLAS provide these symbols (waiting to autodect them in a near future)
// #define __FFLASFFPACK_HAVE_LAPACK2_DSYTRF
// #define __FFLASFFPACK_HAVE_LAPACK2_DSYTRF_AA
// #define __FFLASFFPACK_HAVE_LAPACK2_DSYTRF_ROOK
// #define __FFLASFFPACK_HAVE_LAPACK2_DSYTRF_RK
#include "fflas-ffpack/fflas-ffpack-config.h"
#include <iostream>
#include <vector>
#include <givaro/modular.h>
#include "fflas-ffpack/fflas-ffpack.h"
#include "fflas-ffpack/utils/timer.h"
#include "fflas-ffpack/utils/fflas_io.h"
#include "fflas-ffpack/utils/args-parser.h"
using namespace std;
#ifdef __FFLASFFPACK_USE_OPENMP
typedef FFLAS::OMPTimer TTimer;
#else
typedef FFLAS::Timer TTimer;
#endif
#define EFFGFF(n,t,i) ( (double(n)/1000.*double(n)/1000.*double(n)/1000.0) / double(t) * double(i) / 3.)
int main(int argc, char** argv) {
size_t iter = 3;
int q = 1009;
int algo = 1;
size_t n = 2000;
std::string file = "";
size_t NBK = MAX_THREADS;
Argument as[] = {
{ 'q', "-q Q", "Set the field characteristic (-1 for random).", TYPE_INT , &q },
{ 'n', "-n N", "Set the dimension of the matrix.", TYPE_INT , &n },
{ 'i', "-i R", "Set number of repetitions.", TYPE_INT , &iter },
{ 'f', "-f FILE", "Set the input file (empty for random).", TYPE_STR , &file },
{ 'a', "-a Algorithm", "Set the algorithm (0 for default, 1 for Aasen, 2 for rook, 3 for rk.", TYPE_INT , &algo },
END_OF_ARGUMENTS
};
FFLAS::parseArguments(argc,argv,as);
typedef Givaro::Modular<double> Field;
typedef Field::Element Element;
Field F(q);
Field::Element * A;
TTimer chrono;
double *time=new double[iter];
std::vector<int> Piv(n,0);
std::vector<double> Diag(n,0.0);
for (size_t it=0;it <= iter;++it){
if (!file.empty()){
FFLAS::ReadMatrix (file.c_str(),F,n,n,A);
}
else {
A = FFLAS::fflas_new<Element>(n*n);
Field::RandIter G(F);
PAR_BLOCK{ FFLAS::pfrand(F,G,n,n,A,n/NBK); }
}
chrono.clear();
switch(algo) {
case 0:
if (it) chrono.start();
#ifdef __FFLASFFPACK_HAVE_LAPACK2_DSYTRF
LAPACKE_dsytrf(101,'U',n,A,n,&Piv[0]);
#endif
if (it) chrono.stop();
break;
case 1:
if (it) chrono.start();
#ifdef __FFLASFFPACK_HAVE_LAPACK2_DSYTRF_AA
LAPACKE_dsytrf_aa(101,'U',n,A,n,&Piv[0]);
#endif
if (it) chrono.stop();
break;
case 2:
if (it) chrono.start();
#ifdef __FFLASFFPACK_HAVE_LAPACK2_DSYTRF_ROOK
LAPACKE_dsytrf_rook(101,'U',n,A,n,&Piv[0]);
#endif
if (it) chrono.stop();
break;
default:
if (it) chrono.start();
#ifdef __FFLASFFPACK_HAVE_LAPACK2_DSYTRF_RK
LAPACKE_dsytrf_rk(101,'U',n,A,n,&Diag[0],&Piv[0]);
#endif
if (it) chrono.stop();
}
if (it) time[it-1] = chrono.realtime();
FFLAS::fflas_delete( A);
}
std::sort(time, time+iter);
double mediantime = time[iter/2];
delete[] time;
double gfops = EFFGFF(n,mediantime,1);
if (mediantime<0.001){mediantime=0; gfops=0;}
std::cout << "Time: " << mediantime
<< " Gfops: " << gfops;
FFLAS::writeCommandString(std::cout, as) << std::endl;
return 0;
}
/* -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// vim:sts=4:sw=4:ts=4:et:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s