#include <stdio.h>
#include <stdlib.h>
#include <givaro/givtimer.h>
#include <givaro/givrandom.h>
#include <givaro/modular.h>
#ifndef GIVMIN
#define GIVMIN(a,b) (((a)<(b))?(a):(b))
#endif
typedef Domain::Element Modulo;
#ifndef NB
#define NB 1000000
#endif
#ifndef TAILLE
#define TAILLE 256
#endif
int main(int argc, char ** argv)
{
long P (32749);
int offset = 0;
if (argc > ++offset) P = atoi( argv[ offset ] );
Domain GFq((Domain::Residu_t)P);
std::cout << "."<< std::flush;
Modulo * z1 = new Modulo[TAILLE], * z2 = new Modulo[TAILLE], * z23 = new Modulo[TAILLE], * z3 = new Modulo[TAILLE];
std::cout << "."<< std::flush;
for(int i=0; i<TAILLE; ++i){
GFq.
random(generator,z1[i]) ;
GFq.
nonzerorandom(generator,z2[i]) ;
GFq.random(generator,z23[i]) ;
}
std::cout << "."<< std::flush;
std::cout << "Init et Tableaux des modulo " << P << " :\n" << inver << std::endl << std::flush;
double coef = (double)NB*TAILLE / 1e6;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.
mul(z3[i], z1[i], z2[i]);
std::cout << NB <<
" * " << TAILLE <<
" Mul: " << coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.
add(z3[i], z1[i], z2[i]);
std::cout << NB <<
" * " << TAILLE <<
" Add: " << coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.
axpyin(z3[i], z1[i], z2[i]);
std::cout << NB <<
" * " << TAILLE <<
" MulAdd IN place: " << 2*coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.
axpy(z3[i], z1[i], z2[i], z23[i]);
std::cout << NB <<
" * " << TAILLE <<
" MulAdd: " << 2*coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.
sub(z3[i], z1[i], z2[i]);
std::cout << NB <<
" * " << TAILLE <<
" Sub: " << coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
#if 0
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.
div(z3[i], z1[i], z2[i]);
std::cout << NB <<
" * " << TAILLE <<
" Div: " << coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
#endif
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
std::cout << NB <<
" * " << TAILLE <<
" Neg: " << (coef / tim.
usertime())
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for(int i=0; i<TAILLE; ++i){
GFq.random(generator,z1[i]) ;
GFq.nonzerorandom(generator,z2[i]) ;
GFq.random(generator,z23[i]) ;
}
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.add(z3[i], z1[i], z2[i]);
std::cout << NB <<
" * " << TAILLE <<
" Add: " << coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.sub(z3[i], z1[i], z2[i]);
std::cout << NB <<
" * " << TAILLE <<
" Sub: " << coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.axpyin(z3[i], z1[i], z2[i]);
std::cout << NB <<
" * " << TAILLE <<
" MulAdd IN place: " << 2*coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.axpy(z3[i], z1[i], z2[i], z23[i]);
std::cout << NB <<
" * " << TAILLE <<
" MulAdd: " << 2*coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
for (int k=0; k<NB; ++k) for(int i=0; i<TAILLE; ++i)
GFq.neg(z3[i], z1[i]);
std::cout << NB <<
" * " << TAILLE <<
" Neg: " << coef / tim.
usertime()
<< "Mop/s\n" << tim << ", ex: " << z3[0] << std::endl << std::flush;
return 0;
}