/*
 * Copyright (C) 2014 FFLAS-FFPACK
 * Written by :
 *        Brice Boyer (briceboyer) <boyer.brice@gmail.com>
 * This file is Free Software and part of FFLAS-FFPACK.
 *
 * ========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========
 *.
 */

#include "fflas-ffpack/fflas-ffpack-config.h"
#include <typeinfo>
#include <givaro/modular-balanced.h>

#include "fflas-ffpack/utils/timer.h"
#include "fflas-ffpack/fflas/fflas.h"
#include "fflas-ffpack/utils/args-parser.h"

#include "fflas-ffpack/utils/test-utils.h"
#include "assert.h"

using namespace FFLAS;
using FFPACK::RandomMatrix ;
using Givaro::ModularBalanced ;

template<class Field, class RandIter>
bool test_fscal(const Field & F, const typename Field::Element & alpha, size_t m, size_t k, size_t n, bool timing, RandIter& G)
{
	typedef typename Field::Element T ;

	T * A = fflas_new<T>(m*n);
	T * C = fflas_new<T>(m*n);
	T * D = fflas_new<T>(m*n);

	if (timing)	std::cout << ">>>" << std::endl ;

	size_t iter = 3 ;
	Timer tim, tom, tam ;
	tim.clear() ; tom.clear() ;
	if (timing)	F.write(std::cout << "Field ") << std::endl;
	for (size_t b = 0 ; b < iter ; ++b) {
		RandomMatrix(F, m, k, A, n, G);
		RandomMatrix(F, m, k, C, n, G);
		fassign(F,m,k,C,n,D,n);

		tam.clear();tam.start();
		for (size_t i = 0 ; i < m ; ++i)
			for (size_t j = 0 ; j < k ; ++j)
				F.mul(D[i*n+j],A[i*n+j],alpha);
		tam.stop();
		tim += tam ;

		tam.clear();tam.start();
		fscal(F,m,k,alpha,A,n,C,n);
		tam.stop();
		tom += tam ;

#if 1
		for (size_t i =0 ; i < m ; ++i)
			for (size_t j =0 ; j < k ; ++j)
				if (! F.areEqual(C[i*n+j],D[i*n+j])) {
					if (timing)		std::cout  <<  i << ',' << j << " : " <<  C[i*n+j] << "!= (ref)" << D[i*n+j] << std::endl;
					return false ;
				}
#endif
	}
	if (timing)	std::cout << "fscal(___): " << tim.usertime()/(double)iter << 's' << std::endl;
	if (timing)	std::cout << "fscal (AVX): " << tom.usertime()/(double)iter << 's'<<  std::endl;

	if (timing)	std::cout << "<<<" << std::endl;
	fflas_delete( A );
	fflas_delete( C );
	fflas_delete( D );

	return true;
}

template<class Field>
bool test_fscal(const Field & F,  size_t m, size_t k, size_t n, bool timing, uint64_t seed)
{
	typename Field::RandIter G(F,0,seed);
	bool pass = true ;
	typename Field::Element  alpha;
	F.init(alpha);
	F.assign(alpha,F.one);
	pass = pass && test_fscal(F,alpha,m,k,n,timing, G);
	F.assign (alpha,F.mOne);
	pass = pass && test_fscal(F,alpha,m,k,n,timing, G);
	F.assign (alpha,F.zero);
	pass = pass && test_fscal(F,alpha,m,k,n,timing, G);
	G.random(alpha);
	pass = pass && test_fscal(F,alpha,m,k,n,timing, G);
	G.random(alpha);
	pass = pass && test_fscal(F,alpha,m,k,n,timing, G);

	return pass ;
}

template<class Field, class RandIter>
bool test_fscalin(const Field & F, const typename Field::Element & alpha, size_t m, size_t k, size_t n, bool timing, RandIter& G)
{
	typedef typename Field::Element T ;

	T * C = fflas_new<T>(m*n);
	T * D = fflas_new<T>(m*n);

	if (timing)	std::cout << ">>>" << std::endl ;

	size_t iter = 3 ;
	Timer tim, tom, tam ;
	tim.clear() ; tom.clear() ;
	if (timing)	F.write(std::cout << "Field ") << std::endl;
	for (size_t b = 0 ; b < iter ; ++b) {
		RandomMatrix(F, m, k, C, n, G);
		fassign(F,m,k,C,n,D,n);

		tam.clear();tam.start();
		for (size_t i = 0 ; i < m ; ++i)
			for (size_t j = 0 ; j < k ; ++j)
				F.mulin(D[i*n+j],alpha);
		tam.stop();
		tim += tam ;

		tam.clear();tam.start();
		fscalin(F,m,k,alpha,C,n);
		tam.stop();
		tom += tam ;

#if 1
		for (size_t i =0 ; i < m ; ++i)
			for (size_t j =0 ; j < k ; ++j)
				if (! F.areEqual(C[i*n+j],D[i*n+j])) {
					if (timing)			std::cout  <<  i << ',' << j << " : " <<  C[i*n+j] << "!= (ref)" << D[i*n+j] << std::endl;
					return false ;
				}
#endif
	}
	if (timing)	std::cout << "fscalin(___): " << tim.usertime()/(double)iter << 's' << std::endl;
	if (timing)	std::cout << "fscalin (AVX): " << tom.usertime()/(double)iter << 's'<<  std::endl;

	if (timing)	std::cout << "<<<" << std::endl;
	fflas_delete( C );
	fflas_delete( D );

	return true;
}


template<class Field>
bool test_fscalin(const Field & F,  size_t m, size_t k, size_t n, bool timing, uint64_t seed)
{
	typename Field::RandIter G(F,0,seed);
	bool pass = true ;
	typename Field::Element  alpha;
	F.init(alpha);
	F.assign(alpha,F.one);
	pass = pass && test_fscalin(F,alpha,m,k,n,timing, G);
	F.assign (alpha,F.mOne);
	pass = pass && test_fscalin(F,alpha,m,k,n,timing, G);
	F.assign (alpha,F.zero);
	pass = pass && test_fscalin(F,alpha,m,k,n,timing, G);
	G.random(alpha);
	pass = pass && test_fscalin(F,alpha,m,k,n,timing, G);
	G.random(alpha);
	pass = pass && test_fscalin(F,alpha,m,k,n,timing, G);

	return pass ;
}

int main(int ac, char **av) {
	size_t m = 300 ;
	size_t n = 301 ;
	size_t k = 300 ;
	uint64_t p = 7;
	uint64_t seed = getSeed();
	bool timing = false ;

	Argument as[] = {
		{ 'p', "-p P", "Set the field characteristic.", TYPE_INT , &p },
		{ 'n', "-n N", "Set the number of cols in C." , TYPE_INT , &n },
		{ 'm', "-m N", "Set the number of rows in C." , TYPE_INT , &m },
		{ 'k', "-k N", "Set the number of rows in B." , TYPE_INT , &k },
		{ 's', "-s N", "Set the seed."                , TYPE_INT , &seed },
		{ 't', "-timing", "Output timings"            , TYPE_NONE, &timing},
		END_OF_ARGUMENTS
	};


	parseArguments(ac,av,as);

	if (n < k) {
		std::cout << "Usage : m k n ; matrix of size m x k, lda is n" << std::endl;
		return -1 ;
	}

	srand(seed);
	srand48(seed);

	// std::cout << seed << std::endl;

	bool pass  = true ;
	{ /*  fscal  */
		{
			Givaro::Modular<float> F(p) ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::ModularBalanced<float> F(p) ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::Modular<double> F(p) ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::ModularBalanced<double> F(p) ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::Modular<int32_t> F((int32_t)p) ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::ModularBalanced<int32_t> F((int32_t)p) ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::Modular<int64_t> F(p) ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::ModularBalanced<int64_t> F(p) ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
#if 1
		{
			Givaro::ZRing<float> F ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::ZRing<double> F ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::ZRing<int32_t> F;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
		{
			Givaro::ZRing<int64_t> F ;
			pass = pass && test_fscal(F,m,k,n,timing,seed);
		}
#endif
	}
	{ /*  fscalin  */
		{
			Givaro::Modular<float> F(p) ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::ModularBalanced<float> F(p) ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::Modular<double> F(p) ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::ModularBalanced<double> F(p) ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::Modular<int32_t> F((int32_t)p) ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::ModularBalanced<int32_t> F((int32_t)p) ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::Modular<int64_t> F(p) ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::ModularBalanced<int64_t> F(p) ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
#if 1
		{
			Givaro::ZRing<float> F ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::ZRing<double> F ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::ZRing<int32_t> F;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
		{
			Givaro::ZRing<int64_t> F ;
			pass = pass && test_fscalin(F,m,k,n,timing,seed);
		}
#endif
	}

	return (pass?0:1) ;
}
/* -*- mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s


/* -*- 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