gsat-solver/Part_2/GSATThread.cpp

#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include "GSATThread.hpp"
#include "color.h"

/* --- Public --- */

GSATThread::GSATThread(int argc, char** argv) {
	gsat = std::vector<GSAT*>(NB_THREAD);
	time = std::vector<double>(NB_THREAD);
	threads = std::vector<std::thread>(NB_THREAD);
	for(int i = 0; i < NB_THREAD; i++) {
		gsat[i] = new GSAT();
		gsat[i]->setParameters(argc,argv);
  		gsat[i]->initialize();
  		time[i] = 0;
	}
}

GSATThread::~GSATThread() {
	for(int i = 0; i < NB_THREAD; i++) {
		delete gsat[i];
	}
}

bool GSATThread::solve() {
	return this->solve(0, true);
}

bool GSATThread::solve(int maxIteration) {
	return this->solve(maxIteration, true);
}

bool GSATThread::solve(bool verbose) {
	return this->solve(0, verbose);
}

bool GSATThread::solve(int _maxIteration, bool verbose) {
	threads.clear();
	end = false;
	calcTime = 0;
	maxIteration = _maxIteration;
	//Lance thread
	for(int i = 0; i < NB_THREAD; i++) {
		time[i] = gsat[i]->realTime();
		threads[i] = std::thread(&GSATThread::solverThread, this, i, verbose);
	}
	//Attend resultat
	for(int i = 0; i < NB_THREAD; i++){
		threads[i].join();
	}
	//Resultat
	if(verbose) {
		printf("------------------------------------------------------------------------------------------\n");
		this->printResult();
	}
  	return end;
}

void GSATThread::printResult() {
	if(end) {
		printf(GREEN "s SATISFIABLE\n" RESET);
	} else {
		printf(RED "NOT FOUND\n" RESET);
	}
	//printf("s %s\n",end?"SATISFIABLE":"NOT FOUND");
	if(!end && calcTime == 0) {
		//Si on à pas trouver
		calcTime = gsat[0]->realTime() - time[0];
	}
	printf(YELLOW);
	if(end) {
		printf("c [thread:%2d][iteration:%5d][fill:%d][heuristic:%d]Satisfied clauses (begin: %d)(end:%d)\n",
			result.threadId,
			result.nbIteration,
			result.heuristicFill,
			result.heuristicSolve,
			result.nbSatisfiedClausesFill,
			result.nbSatisfiedClausesSolve);
	}
  	printf("c real time : %.4f seconds\n", calcTime);
  	printf(RESET);
}

/* --- Private --- */

void GSATThread::solverThread(int id, bool verbose) {
	//Resolution
	bool solve = false;
	int cpt = 0;
	while(!end && !solve && (maxIteration == 0 || cpt < maxIteration)){
		solve = gsat[id]->start();
		if(verbose) {
			if(solve) {
				printf(CYAN);
			}
			printf("c [thread:%2d][iteration:%5d][fill:%d][heuristic:%d]Satisfied clauses (begin: %d)(end:%d)\n",
				id,
		   		gsat[id]->getNbIterations(),
		   		gsat[id]->getHeuristicFill(),
		   		gsat[id]->getHeuristicSolve(),
		   		gsat[id]->getNbSatisfiedClausesFill(),
		   		gsat[id]->getNbSatisfiedClausesSolve());
			if(solve) {
				printf(RESET);
			}
		}
		cpt++;
	}
	//Si 1er arreter
	if(!end && solve) {
		end = true;
		calcTime = gsat[id]->realTime() - time[id];
		result.threadId = id;
		result.nbIteration = gsat[id]->getNbIterations();
		result.heuristicFill = gsat[id]->getHeuristicFill();
		result.heuristicSolve = gsat[id]->getHeuristicSolve();
		result.nbSatisfiedClausesFill = gsat[id]->getNbSatisfiedClausesFill();
		result.nbSatisfiedClausesSolve = gsat[id]->getNbSatisfiedClausesSolve();
	}
}