Fix valgrind error + first RM

README.md

 # lepl1503-2020-groupe-C1
 
-- 'example-input.txt' : Exemple de fichier du projet.
+##Description
\ No newline at end of file
+
+
+
+##Installation
+
+The use of a Debian based Linux distribution like Ubuntu or Dedora is recommended.<br/>
+To run the tests, you need to install Cunit, valgrind and cppcheck.
+
+Install Cunit:
+
+```bash
+sudo apt-get install libcunit1-dev libcunit1-doc libcunit1
+```
+
+Install Valgrind:
+
+```bash
+sudo apt-get install valgrind
+```
+
+Install Cppcheck:
+
+```bash
+sudo apt-get install cppcheck
+```
+
+##Usage
+
+- To compile the program use:
+
+```bash
+make fact
+```
+
+- To run the program use:
+
+```bash
+./fact [-OPTIONS...] Input_file Output_file
+```
+
+- To run tests use:
+
+```bash
+make test
+```
+
+###Options
+
+- "-N": Determine the amount of threads to use
+- "--verbose" or "-v": Enable debug
+- "--help" or "-h": Print help

functions.c

@@ -108,7 +108,6 @@ void free_queue(queue_t *queue){//Free a queue
     free(queue);
 }
 
-
 /*
  * Constructor for a new Queue empty
  * mode: 0 -> buffer type = dividers_t
@@ -157,7 +156,6 @@ void div_free_queue(div_queue_t *queue){//Free a queue
     free(queue);
 }
 
-
 //Print help for option -h or --help
 void printHelp(){
     printf("Usage: ./prime_divs [OPTION...]\n"
@@ -198,7 +196,6 @@ long long findnextprime(long long prime){
     return i;
 }
 
-
 void euclide(long long number, dividers_t* result, int index, long long last_div){
     if(number == 1){
         return;
@@ -222,11 +219,6 @@ void euclide(long long number, dividers_t* result, int index, long long last_div
     }
 }
 
-
-
-
-
-
 dividers_t prime_divs(long long number){
     dividers_t result;
     result.value = number;
@@ -243,42 +235,6 @@ dividers_t prime_divs(long long number){
     return result;
 }
 
-/*
-//TODO : Remake fonction prime_divs
-dividers_t prime_divs(long long number){
-    dividers_t result;
-
-    result.length = 0;
-    result.value = number;
-
-    for (long long i = 2; i < number; i++) {
-        if(is_prime(i) && is_div(number,i)){
-            result.length++;
-        }
-    }
-
-    //TODO: free each and every dividers
-    result.dividers = malloc(sizeof(long long) * result.length);
-    if(result.dividers == NULL){
-        printf("Malloc error in prime_divs for result.dividers\n");
-        result.length = -1;
-        return result;
-    }
-
-    int count=0;
-    for (long long i = 2; i < number; i++) {
-        if(is_prime(i) && is_div(number,i)){
-            printf("%lld\n",i );
-            result.dividers[count] = i;
-            count++;
-        }
-    }
-
-    return result;
-}
-
-*/
-
 void* produce(){
     FILE* fdIn = fopen(Args.input_file,"r");
     if(fdIn == NULL){
@@ -341,7 +297,7 @@ void* compute(){
         sem_post(&full2);
 
         if (counter == 0){
-            for (int i = Args.nThreads; i >= 0 + finished;i--){
+            for (int i = Args.nThreads - 1; i >= 0 + finished;i--){
                 pthread_cancel(threads[i]);
             }
         }