Better explanation of error.

src/list.c

@@ -21,19 +21,21 @@ void initList(List *l) {
 }
 
 void deInitList(List *l) {
+	for(ulli i = 0; i < l->size; ++i) {
+		mpz_clear(l->list[i]);
+	}
 	free(l->list);
 }
 
 void addToList(List *l, mpz_t n) {
-	if(l->end == l->size) {
+	if(unlikely(l->end == l->size)) {
 		l->size += BLOCK_SIZE;
 		if(unlikely(l->size == 0)) {
-			fprintf(stderr,
+			fprintf(stderr, "`l->size' has overflowed!\n");
-					"size has reached limit of `long long int' type!\n");
 			exit(1);
 		}
 		void *tmp = realloc(l->list, sizeof(mpz_t) * l->size);
-		if(!tmp) {
+		if(unlikely(!tmp)) {
 			fprintf(stderr, "Failed to allocate more memory to list!\n");
 			exit(1);
 		}

src/list.h

@@ -2,13 +2,15 @@
 #include <gmp.h>
 #include <stdbool.h>
 
+#include "types.h"
+
 /**
  * @brief An infinitely expanding list type.
  */
 typedef struct {
 	mpz_t *list; //!< The list of elements
-	unsigned long long int size; //!< How many elements are in the list
+	ulli size; //!< How many elements are in the list
-	unsigned long long int end; //!< The last element of the list (in use)
+	ulli end; //!< The last element of the list (in use)
 } List;
 
 /**

src/main.c

@@ -5,6 +5,8 @@
 #include <gmp.h>
 
 #include "list.h"
+#include "types.h"
+#include "optimizers.h"
 
 static bool run;
 void leave();
@@ -36,14 +38,15 @@ int main(void) {
 
 	do {
 		// Loop through found primes
-		for(unsigned long long int i = 0; i < primes.size; ++i) {
+		for(ulli i = 0; i < primes.size; ++i) {
 			// If `num' is divisible by a prime then go to the next number
-			if(mpz_divisible_p(num, primes.list[i]) != 0) goto nextPrime;
+			if(mpz_divisible_p(num, primes.list[i]) != 0)
+				goto nextPrime;
 		}
 
 		// `num' is a prime so we add it to the list and print it
 		addToList(&primes, num);
-		if(mpz_out_str(stdout, 10, num) == 0) {
+		if(unlikely(mpz_out_str(stdout, 10, num) == 0)) {
 			fprintf(stderr, "Could not print to `stdout'!\n");
 			exit(1);
 		}
@@ -52,8 +55,9 @@ int main(void) {
 nextPrime:
 		// Add 2 (skip even numbers since they're all divisible by 2)
 		mpz_add_ui(num, num, 2);
-	} while(run);
+	} while(likely(run));
 
+	mpz_clear(num);
 	// Deinitialize the list
 	deInitList(&primes);
 	return 0;

src/types.h

@@ -0,0 +1,2 @@
+#pragma once
+typedef unsigned long long int ulli;