#include "smg_rsa.h"
#include "mpi.h"

#include <stdlib.h>
#include <unistd.h>
#include <time.h>

void err(char *msg)
{
  fprintf(stderr, "%s\n", msg);
  exit(1);
}

void time_entropy_source(int nruns, int noctets) {
	unsigned char buffer[noctets];
	int read, i;
	struct timespec tstart, tend;
	long int diff;

	clock_gettime(CLOCK_MONOTONIC, &tstart);
	for (i=0; i<nruns; i++) {
		read = get_random_octets(noctets,buffer);
		if (read != noctets)
			err("Failed reading from entropy source!");
	}
	clock_gettime(CLOCK_MONOTONIC, &tend);

	diff = tend.tv_sec-tstart.tv_sec;
	double kbps = (nruns*noctets) / (diff*1000.0);
	printf("ENTROPY source timing: %d kB in %ld seconds, at an average speed of %f kB/s over %d runs of %d octets each\n", nruns*noctets, diff, kbps, nruns, noctets);
}

void test_is_composite(int nruns, char *hex_number, int expected) {
	int i;
	int output;
	int count_ok = 0;
	int source = open_entropy_source(ENTROPY_SOURCE);
	MPI p = mpi_alloc(0);

	mpi_fromstr(p, hex_number);
	printf("TEST is_composite on MPI(hex) ");
	mpi_print(stdout, p, 1);
	for (i=0; i < nruns; i++) {
		printf(".");
		fflush(stdout);
		output = is_composite(p, M_R_ITERATIONS, source);
		if (output == expected)
			count_ok = count_ok + 1;
	}
	printf("done, with %d out of %d correct runs for expected=%d: %s\n", count_ok, nruns, expected, count_ok==nruns? "PASS":"FAIL");
	mpi_free(p);
	close(source);
}

int main(int ac, char **av)
{
	int nruns;
	int id;

	if (ac<2) {
		printf("Usage: %s number_of_runs [testID]\n", av[0]);
		return -1;
	}
	nruns = atoi(av[1]);

	if (ac < 3)
		id = 0;
	else
		id = atoi(av[2]);

	if (id == 0 || id == 1) {
		printf("Timing entropy source...\n");
		time_entropy_source(nruns,4096);
	}

	if (id == 0 || id == 2) {

		/* a few primes (decimal): 65537, 116447, 411949103, 20943302231 */
		test_is_composite(nruns, "0x10001", 0);
		test_is_composite(nruns, "0x1C6DF", 0);
		test_is_composite(nruns, "0x188DD82F", 0);
		test_is_composite(nruns, "0x4E0516E57", 0);
		/* a few mersenne primes (decimal): 2^13 - 1 = 8191, 2^17 - 1 = 131071, 2^31 - 1 = 2147483647 */
		test_is_composite(nruns, "0x1FFF", 0);
		test_is_composite(nruns, "0x1FFFF", 0);
		test_is_composite(nruns, "0x7FFFFFFF", 0);
		/* a few carmichael numbers, in decimal: 561, 60977817398996785 */
		test_is_composite(nruns, "0x231", 1);
		test_is_composite(nruns, "0xD8A300793EEF31", 1);
		/* an even number */
		test_is_composite(nruns, "0x15A9E672864B1E", 1);
		/* a phuctor-found non-prime public exponent: 170141183460469231731687303715884105731 */
		test_is_composite(nruns, "0x80000000000000000000000000000003", 1);
	}

	if (id > 2)
		printf("Current test ids: 0 for all, 1 for entropy source test only, 2 for is_composite test only.");

  return 0;
}