#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdint.h>

#ifdef IS32BIT
#define ALGS 7
#else
#define ALGS 8
#endif

#define RANGES 4

#ifndef MAX_SIZE
#define MAX_SIZE 32768
#endif

#ifndef UINT32_MAX
#define UINT32_MAX (4294967295U)
#endif

/*
static void Winning_Alg(uint16_t *wins, uint16_t *winner){
	uint16_t b, c;
	for(b=c=0; b<ALGS; b++){
		if(wins[b] > c){
			*winner = b;
			c = wins[b];
		}
	}
}
*/

void Increment_Winners(uint16_t start, uint16_t end, uint16_t **input, uint16_t *output){
	uint16_t a, b;
	uint16_t cur_cycles;
	for(a = start; a<end; a++){
		cur_cycles = UINT16_MAX;
		for(b=0; b<ALGS; b++){
			if(input[a][b] < cur_cycles)
				cur_cycles = input[a][b];
		}
		for(b=0; b<ALGS; b++){
			if(input[a][b] == cur_cycles)
				output[b]++;
		}
	}
}

void Dec_and_Inc(uint16_t *input, uint16_t *output1, uint16_t *output2){
	uint16_t a=UINT16_MAX, b;
	for(b=0; b<ALGS; b++){
		if(input[b] < a)
			a = input[b];
	}
	for(b=0; b<ALGS; b++){
		if(input[b] == a){
			output1[b]--;
			output2[b]++;
		}
	}
}

/*
static void Print_Alg(uint16_t alg){
	if(alg>(ALGS-1)){
		printf("error");
		return;
	}
	uint8_t n1;
#ifdef IS32BIT
	const char *algs[] = {"byte_loop", "loop", "unrolled_loop", "rep_byte", "rep_4byte", "vector_loop", "libcall"};
#else
	const char *algs[] = {"byte_loop", "loop", "unrolled_loop", "rep_byte", "rep_4byte", "rep_8byte", "vector_loop", "libcall"};
#endif
	printf("\t%s", algs[alg]);
	for(n1=strlen(algs[alg]); n1<14; n1++)
		printf(" ");
}
*/


int main(int argc, char **argv){
	FILE *in;
	uint16_t a,b,c=0;
	uint16_t cur_wins = 0;
	uint16_t max_wins = 0;
	//size_t cur_cycles = 0;
	uint16_t winning_starts[RANGES] = {0,0,0,0};
	//uint16_t winning_algs[RANGES] = {0,0,0,0};
	//uint32_t *data[ALGS];
	uint16_t **data;
	//uint32_t *fastest;
	uint16_t read_buffer_size = 64;
	char *read_buffer;
	//uint16_t start_a = 0;
	uint16_t start_b = 0;
	uint16_t start_c = 0;
	uint16_t start_d = 0;
	const uint16_t min_start_a = 0;
	const uint16_t min_start_b = 1;
	const uint16_t min_start_c = 2;
	const uint16_t min_start_d = 3;
	const uint16_t max_end_d = MAX_SIZE;
	//uint8_t alg_a = 0;
	uint16_t winners[RANGES] = {0,0,0,0};
	uint16_t wins[RANGES-1][ALGS];
	uint16_t wins_T[RANGES][ALGS];
	uint16_t wins_B[2][ALGS];
#ifdef IS32BIT
	const char *algs[] = {"byte_loop", "loop", "unrolled_loop", "rep_byte", "rep_4byte", "vector_loop", "libcall"};
#else
	const char *algs[] = {"byte_loop", "loop", "unrolled_loop", "rep_byte", "rep_4byte", "rep_8byte", "vector_loop", "libcall"};
#endif


	//if(argc != 1)
	//	max_end_d = atoi(argv[1]);
	printf("Testing to %u\n", max_end_d);

	data = (uint16_t **)malloc(sizeof(uint16_t *)*max_end_d);
	for(a=0; a<max_end_d; a++){
		data[a] = (uint16_t *)malloc(sizeof(uint16_t)*ALGS);
	}
	//fastest = (uint32_t *)malloc(sizeof(uint32_t)*max_end_d);
	read_buffer = (char *)malloc(read_buffer_size);
	(void)memset( (void *)read_buffer, '\0', read_buffer_size);
	(void)memset((void *)wins, '\0', sizeof(uint16_t)*(RANGES-1)*ALGS);
	(void)memset((void *)wins_T, '\0', sizeof(uint16_t)*RANGES*ALGS);

	for(a=0; a<8; a++){
#ifdef IS32BIT
		if(a == 5)
			continue;
#endif
		(void)sprintf(read_buffer, "results/r%u.txt", a+1);
		in = fopen(read_buffer, "r");
		b = 0;
		(void)memset( (void *)read_buffer, '\0', read_buffer_size);
		while( fgets(read_buffer, read_buffer_size, in) != NULL){
			if(b == max_end_d)
				break;
			if(atoi(read_buffer) > UINT16_MAX)
				data[b][c] = UINT16_MAX;
			else
				data[b][c] = atoi(read_buffer);

			b++;
		}
		fclose(in);
		c++;
	}
	free(read_buffer);

	//calculate wins for each alg of each range on start (NOTE: will be 1 position checked unless mins_start_* changed)
	//except range d where max_end_d - min_start_d are checked
	Increment_Winners(min_start_d, max_end_d, data, wins_T[min_start_d]);
	Increment_Winners(min_start_c, min_start_d, data, wins[min_start_c]);
	Increment_Winners(min_start_b, min_start_c, data, wins[min_start_b]);
	Increment_Winners(min_start_a, min_start_b, data, wins[min_start_a]);

	(void)memcpy((void *)&wins_B[0][0], (const void *)&wins[0][0], sizeof(uint16_t)*ALGS);
	(void)memcpy((void *)&wins_B[1][0], (const void *)&wins[1][0], sizeof(uint16_t)*ALGS);

	//start range d
	for(start_d = min_start_d; start_d<max_end_d; start_d++){
//		printf("%u/MAX_SIZE\n", start_d);
		(void)memcpy((void *)&wins_T[2][0], (const void *)&wins[2][0], sizeof(uint16_t)*ALGS);

		//pick d winning alg up front
		for(b=c=0; b<ALGS; b++){
			if(wins_T[3][b] > c){
				winners[3] = b;
				c = wins_T[3][b];
			}
		}

		//wins_B
		(void)memcpy((void *)&wins[1][0], (const void *)&wins_B[1][0], sizeof(uint16_t)*ALGS);

		//start range c
		for(start_c = min_start_c; start_c<start_d; start_c++){
			(void)memcpy((void *)&wins_T[0][0], (const void *)&wins[0][0], sizeof(uint16_t)*ALGS);
			(void)memcpy((void *)&wins_T[1][0], (const void *)&wins[1][0], sizeof(uint16_t)*ALGS);

			//pick c winning alg
			for(b=c=0; b<ALGS; b++){
				if(wins_T[2][b] > c){
					winners[2] = b;
					c = wins_T[2][b];
				}
			}

			//start range b
			for(start_b = min_start_b; start_b<start_c; start_b++){
				//if(start_b > 64)
				//	break;
				//pick b and a winning algs
				for(a=b=c=0; b<ALGS; b++){
					if(wins_T[0][b] > c){
						winners[0] = b;
						c = wins_T[0][b];
					}
					if(wins_T[1][b] > a){
						winners[1] = b;
						a = wins_T[1][b];
					}
				}
				for(a=cur_wins=0; a<RANGES; a++)
					cur_wins += wins_T[a][winners[a]];

				Dec_and_Inc(data[start_b], wins_T[1], wins_T[0]);

				if(cur_wins < max_wins)
					continue;
				//winning_starts[0] = start_a;
				winning_starts[1] = start_b;
				winning_starts[2] = start_c;
				winning_starts[3] = start_d;
				//for(a=0; a<RANGES; a++)
				//	winning_algs[a] = winners[a];
				//(void)memcpy((void *)winning_algs, (const void *)winners, sizeof(uint16_t)*RANGES);
				max_wins = cur_wins;
			}
			//selectively decremember alg in range c that gained a win
			Dec_and_Inc(data[start_c], wins_T[2], wins[1]);
		}
		//selectively decrement alg that lost a win
		Dec_and_Inc(data[start_d], wins_T[3], wins[2]);
	}

	printf("config with most wins in first %u:\n", max_end_d);
	printf("start\talg/s\n");
	for(a=0; a<RANGES; a++){
		if(a != 3)
			c = winning_starts[a+1];
		else
			c = max_end_d;
		(void)memset((void *)wins_B[0], '\0', sizeof(uint16_t)*ALGS);
		Increment_Winners(winning_starts[a], c, data, wins_B[0]);

                max_wins = 0;
                for(b=0; b<ALGS; b++){
                        if(wins_B[0][b] > max_wins)
                                max_wins = wins_B[0][b];
                }
                printf("%u\t", winning_starts[a]);
                for(b=0; b<ALGS; b++){
                        if(wins_B[0][b] == max_wins)
                                printf("%s(%u) ", algs[b], b);
                }
                printf("\n");
        }

	for(a=0; a<max_end_d; a++)
		free(data[a]);
	free(data);

	return 0;
}