#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 1024
#endif

uint8_t ties[MAX_SIZE];

void SET_ONE(const uint16_t pos, const uint8_t bit){
        uint8_t cur = ties[pos];
        uint8_t b0 = (bit == 0) ? 1   : (((cur<<7) & 128) >= 128);
        uint8_t b1 = (bit == 1) ? 2   : (((cur<<6) & 128) >= 128)<<1;
        uint8_t b2 = (bit == 2) ? 4   : (((cur<<5) & 128) >= 128)<<2;
        uint8_t b3 = (bit == 3) ? 8   : (((cur<<4) & 128) >= 128)<<3;
        uint8_t b4 = (bit == 4) ? 16  : (((cur<<3) & 128) >= 128)<<4;
        uint8_t b5 = (bit == 5) ? 32  : (((cur<<2) & 128) >= 128)<<5;
        uint8_t b6 = (bit == 6) ? 64  : (((cur<<1) & 128) >= 128)<<6;
        uint8_t b7 = (bit == 7) ? 128 : (((cur) & 128)  >= 128)<<7;

        ties[pos] = b0+b1+b2+b3+b4+b5+b6+b7;
}

uint8_t IS_SET(const uint16_t pos, const uint8_t bit){
        uint8_t cur = ties[pos];
        cur <<= (7-bit);
        cur &= 128;

        if(cur >= 128)
                return 1;
        else
                return 0;
}


void Increment_Winners(uint16_t start, const uint16_t end, uint16_t *output){
	uint8_t a;
	while(start<end){
		for(a=0; a<ALGS; a++){
			if(IS_SET(start, a))
				output[a]++;
		}
		start++;
	}
}

void Print_with_spaces(const char *alg, const uint16_t length){
	uint16_t a = strlen(alg);
	printf("%s", alg);
	while(a<length){
		printf(" ");
		a++;
	}
}

int main(int argc, char **argv){
	FILE *in;
	uint16_t a,b,c=0,d=0;
	uint16_t cur_wins = 0;
	uint16_t max_wins = 0;
	uint16_t winning_starts[RANGES] = {0,0,0,0};
	uint16_t **data;
	uint16_t read_buffer_size = 16;
	char *read_buffer;
	uint16_t start_b = 0;
	uint16_t start_c = 0;
	uint16_t start_d = 0;
	//uint16_t forced_d_start = 0;
	//uint16_t presumed_d = 0;
	//const uint16_t forced_a_switch = 512;
	const uint16_t forced_b_switch = 512;
	const uint16_t forced_c_switch = 1024;
	const uint16_t forced_d_switch = 2560;
	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;
	uint16_t winners[RANGES] = {0,0,0,0};
	//uint8_t winner_a=0, winner_b=0, winner_c=0, winner_d=0;
	uint16_t wins[RANGES-1][ALGS];
	uint16_t wins_T[RANGES][ALGS];
	uint16_t wins_B[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);
	}

	read_buffer = (char *)malloc(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;
		while( fgets(read_buffer, read_buffer_size, in) != NULL){
			if(b == max_end_d)
				break;
			if(atoi(read_buffer) < UINT16_MAX)
				data[b][c] = atoi(read_buffer);
			else
				data[b][c] = UINT16_MAX;
			b++;
		}
		fclose(in);
		c++;
	}
	free(read_buffer);
	for(a = min_start_a; a<max_end_d; a++){
		c = UINT16_MAX;
		for(b=0; b<ALGS; b++){
			if(data[a][b] < c)
				c = data[a][b];
		}
		for(b=0; b<ALGS; b++){
			if(data[a][b] == c)
				SET_ONE(a, b);
		}
		//free(data[a]);
	}


/*
	(void)memset((void *)wins_B, '\0', sizeof(uint16_t)*ALGS);

	//find best overall alg
	for(a = min_start_a; a<max_end_d; a++){
		for(b=0; b<ALGS; b++){
			if(IS_SET(a, b)){
				wins_B[b]++;
			}
		}
	}

	c = 0;
	for(b=0; b<ALGS; b++){
		if(wins_B[b] > c){
			c = wins_B[b];
			presumed_d = b;
		}
	}
	//d is best

	//subtract from beginning untill no longer best
	c = 0;
	//for(a = min_start_a; a<max_end_d; a++){
	for(a = max_end_d-1; a>min_start_d; a--){
		for(b=0; b<ALGS; b++){
			if(IS_SET(a, b)){
				wins_B[b]--;
			}
		}
		for(b=0; b<ALGS; b++){
			if(wins_B[presumed_d] < wins_B[b])
				c = 1;
		}
		if(c){
			forced_d_start = a;
			break;
		}
	}
forced_d_start = 2048;
	printf("forced_a_switch: %u\n", forced_a_switch);
	printf("forced_d_start: %u\n", forced_d_start);
	printf("presumed_d: %u\n", presumed_d);
*/
	//let's assume min_starts might be changed to be safe
	for(a = min_start_a; a<max_end_d; a++)
		free(data[a]);
	free(data);

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

	(void)memcpy((void *)wins_B, (const void *)wins[min_start_a], sizeof(uint16_t)*ALGS);


	//start range d
//winners[min_start_d] = presumed_d;
//	for(start_d = forced_d_start; start_d<max_end_d; start_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], (const void *)wins[2], sizeof(uint16_t)*ALGS);
		//pick d winning alg up front
		//c = wins_T[min_start_d][0];
		//winners[min_start_d] = presumed_d;
		//if(start_d < forced_d_switch){
		//if(start_d > forced_d_switch){
		//	winners[min_start_d] = presumed_d;
		//	goto set;
		//}

		if(start_d > forced_d_switch)
			break;

		for(b=0; b<ALGS; b++){
			if(wins_T[3][b] > c){
				c = wins_T[3][b];
				d = b;
			}
		}
			//winner_d = d;

		winners[3] = d;

		//}
		//	winners[min_start_d] = presumed_d;
			//presumed_
		(void)memcpy((void *)wins[1], (const void *)wins_B, sizeof(uint16_t)*ALGS);
		//start range c
		for(start_c = min_start_c; start_c<start_d; start_c++){
			if(start_c > forced_c_switch)
				break;
			(void)memcpy((void *)wins_T, (const void *)wins, sizeof(uint16_t)*ALGS*2);
			//c = wins_T[min_start_c][0];
			for(b=0; b<ALGS; b++){
				if(wins_T[2][b] > c){
					c = wins_T[2][b];
					d = b;
				}
			}
			winners[2] = d;
			//start range b
			for(start_b = min_start_b; start_b<start_c; start_b++){
				if(start_b > forced_b_switch)
					break;
				//pick b and a winning algs
				for(a=b=c=0; b<ALGS; b++){
					if(wins_T[0][b] > c){
						d = b;
						c = wins_T[0][b];
						//winner_b = b;
					}
					if(wins_T[1][b] < a)
						continue;
					winners[1] = b;
					a = wins_T[1][b];
					//winner_a = b;
				}
				winners[0] = d;
				//cur_wins = wins_T[0][winner_a] + wins_T[1][winner_b] + wins_T[2][winner_c] + wins_T[3][winner_d];
				for(a=cur_wins=0; a<RANGES; a++)
					cur_wins += wins_T[a][winners[a]];
				//cur_wins = 0;
				for(b=0; b<ALGS; b++){
					//if(b<RANGES)
					//	cur_wins += wins_T[b][winners[b]];
					if(IS_SET(start_b, b)){
						wins_T[1][b]--;
					//if(IS_SET(start_b, b))
						wins_T[0][b]++;
					}
				}

				if(cur_wins < max_wins)
					continue;
				winning_starts[1] = start_b;
				winning_starts[2] = start_c;
				winning_starts[3] = start_d;
				max_wins = cur_wins;
			}
			//selectively decremember alg in range c that gained a win
			for(b=0; b<ALGS; b++){
				if(IS_SET(start_c, b)){
					wins_T[2][b]--;
				//if(IS_SET(start_c, b))
					wins[1][b]++;
				}
			}
		}
		//selectively decrement alg that lost a win
		for(b=0; b<ALGS; b++){
			if(IS_SET(start_d, b)){
				wins_T[3][b]--;
			//if(IS_SET(start_d, b))
				wins[2][b]++;
			}
		}
	}

	(void)memset((void *)wins_B, '\0', sizeof(uint16_t)*ALGS);
	printf("\nTotal wins for all data (ties count as win)\n");
	Increment_Winners(min_start_a, max_end_d, wins_B);

	for(a=d=0; a<ALGS; a++){
		printf("\t");
		Print_with_spaces(algs[a], 15);
		printf("%u\n", wins_B[a]);
		d += wins_B[a];
	}
	printf("\ntotal: %u\n\n", d);
	printf("Config with most wins/ties:\n");
	printf("\tstart\twins\talg/s\n");
	d = 0;
	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', sizeof(uint16_t)*ALGS);
		Increment_Winners(winning_starts[a], c, wins_B);

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

		//printf("%u\t", max_wins);
		d+= max_wins;
                for(b=0; b<ALGS; b++){
                        if(wins_B[b] == max_wins)
                                printf("%s(%u) ", algs[b], b);
                }
                printf("\n");
        }
	printf("\ntotal: %u\n", d);

	return 0;
}