#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include "../../include/pari/pari.h"
#include "../currTime.h"

#define cputime	currTime

#define REPEAT_TIMES_CONTROL	(1<<24)

double get_cost_for_log( int len)
{
	return (double)len * sqrt((double)len) ;
}

void init_pari_version(ulong *major, ulong *minor, ulong *patch) 
{
	const ulong mask = (1<<PARI_VERSION_SHIFT) - 1;
	ulong n = PARI_VERSION_CODE;
	*patch = n & mask; n >>= PARI_VERSION_SHIFT;
	*minor = n & mask; n >>= PARI_VERSION_SHIFT;
	*major = n;
}


void test_log_performance()
{
	int  lens[]=
	{
		20,30,40,50,60,70,80,90,100,
		125,158,199,251,316,398,501,630,794,1000,
		1258,1584,1995,2511,3162,3981,5011,6309,7943,10000,
		17782,31622,56234,100000,
	};
	
	double st;
	double time_cost;
		
	int n;				// repeat times
	int prec;			// precision in digital
	int precInBits;		// precison in bits

	GEN x, y, z;
	unsigned long ltop;
	unsigned long long_prec;	// precision in limbs
	ulong major, minor, patch;
	
	int i;
		
	init_pari_version (&major, &minor, &patch);
	printf ("%s\n", PARIVERSION);
	printf ("Version: %d.%d.%d\n", major, minor, patch);

#ifdef pari_version
	printf ("Library version: %s\n", pari_version ());
#endif

	pari_init (20000000, 1000); 

	printf("Test performance of Pari function mplog\n");
	for (i=0;i<sizeof(lens)/sizeof(int);i++)
	{
		int k;
		
		prec=lens[i];
	
		precInBits = (int) ( prec * log(10.0) / log(2.0) + 1.0 );
		long_prec = (precInBits - 1)/BITS_IN_LONG + 3;

		time_cost=get_cost_for_log(prec);
		n= (int)(REPEAT_TIMES_CONTROL/time_cost);
		if ( n<3)
			n=3;		// at least repeat 3 times
		
		x = gsqrt(stoi(3), long_prec); x = addsr (-1, x);
		y = gsqrt(stoi(5), long_prec);

		/* we do not precompute constants, in order to not disadvantage programs
		that do not use precomputed constants */
#if 0
	(void) mplog2(long_prec+1);
	(void)   mppi(long_prec+1);
	(void)mpeuler(long_prec+1);
#endif
		ltop = avma;
		while ( 1)
		{
			st = cputime();	
			for (k=0;k<n;k++)
			{ z = mplog (x);	avma = ltop;}
			
			st=cputime()-st;
			//printf("%d call took %f ms\n",n, st*1000.00);
			if ( st>=1.0)
				break;
			n*=2;
		}
		st= st*1000.00;	//convert to ms
		printf ("%d:", prec);
		printf(" took %f ms (%d eval in %f ms)\n",
			st/n,n,st);
	}
}

int main(int argc, char* argv[])
{
	test_log_performance();
	return 0;
}