Argument parsing!

If it's equal to half then we want to check if it's divisible, since if
it's half then it is NOT prime.

.gitignore

@@ -2,5 +2,8 @@
 build/*
 !build/.keep
 
+# Ignore documentation
+doc/
+
 # Ignore vim temporary files
 *.sw[a-z]

CHANGELOG

@@ -19,3 +19,7 @@ Change Log
 - v0.4: Fixed Algorithm
 	- Fixed algorithm to actually calculate primes.
 	- Added extra C99 optimizations.
+- v0.5: Minor Changes
+	- Use `size_t' instead of `unsigned long long int'.
+	- Minor optimizations to the algorithm.
+	- Added commandline argument parsing.

src/list.c

@@ -4,7 +4,6 @@
 
 /**
  * This is the number of elements by which the list expands.
- * WARNING: Always use doubles for this number (2^X)
  */
 #define BLOCK_SIZE 1024
 
@@ -19,7 +18,7 @@ void initList(List *restrict l) {
 }
 
 void deInitList(List *restrict l) {
-	for(ulli i = 0; i < l->size; ++i) {
+	for(size_t i = 0; i < l->size; ++i) {
 		mpz_clear(l->list[i]);
 	}
 	free(l->list);

src/list.h

@@ -1,23 +1,27 @@
+/**
+ * @file list.h
+ * @author Deathsbreed <deathsbreed@themusicinnoise.net>
+ * @brief Code responsible for List management.
+ * @details Code responsible for the definition and management of the
+ * List object.
+ */
 #pragma once
 #include <gmp.h>
 #include <stdbool.h>
 
-#include "types.h"
-
 /**
  * @brief An infinitely expanding list type.
  */
 typedef struct {
 	mpz_t *list; //!< The list of elements
-	ulli size; //!< How many elements are in the list
+	size_t size; //!< How many elements are in the list
-	ulli end; //!< The last element of the list (in use)
+	size_t end; //!< The last element of the list (in use)
 } List;
 
 /**
  * @brief Initialize a List.
  * @details Initialize the list and its variables, allocating memory
- * to the pointer array inside. Returns true on success and false on
+ * to the pointer array inside.
- * failure.
  * @param[in] l A pointer to a List type to be initialized.
  */
 void initList(List *restrict l);

src/main.c

@@ -2,21 +2,58 @@
 #include <stdlib.h>
 #include <signal.h>
 #include <stdbool.h>
+#include <getopt.h>
 #include <gmp.h>
 
 #include "list.h"
-#include "types.h"
+
+#define VERSION "v0.5"
 
 static bool run;
+
+void printUsage(char *progName);
 void leave();
 
-int main(void) {
+int main(int argc, char *argv[]) {
-	puts("Indivisible v0.4\n");
+	bool f_help = false, f_version = false, f_quiet = false;
+
+	int c;
+	while((c = getopt(argc, argv, "hvq")) != -1) {
+		switch(c) {
+			case 'h':
+				f_help = true;
+				break;
+			case 'v':
+				f_version = true;
+				break;
+			case 'q':
+				f_quiet = true;
+				break;
+			default:
+				printUsage(argv[0]);
+				exit(1);
+		}
+	}
+
+	if(f_help) {
+		printUsage(argv[0]);
+		puts(" -h     print this help information");
+		puts(" -v     print version number of program");
+		puts(" -q     quiet mode");
+		return 0;
+	} else if(f_version) {
+		printf("Indivisible %s\n", VERSION);
+		return 0;
+	}
 
 	// Quit on ^C by setting `run = false'
 	run = true;
 	signal(SIGINT, leave);
 
+	if(f_quiet) {
+		puts("Use Ctrl+C (SIGINT) to exit.");
+	}
+
 	// Primes we've found
 	List primes;
 	initList(&primes);
@@ -28,11 +65,13 @@ int main(void) {
 	// Add 2, a known prime to this list
 	mpz_set_ui(num, 2);
 	addToList(&primes, num);
-	if(mpz_out_str(stdout, 10, num) == 0) {
+	if(!f_quiet) {
-		fprintf(stderr, "Could not print to `stdout'!\n");
+		if(mpz_out_str(stdout, 10, num) == 0) {
-		exit(1);
+			fprintf(stderr, "Could not print to `stdout'!\n");
+			exit(1);
+		}
+		printf("\n");
 	}
-	printf("\n");
 	mpz_add_ui(num, num, 1);
 
 	// Variable for half `num'
@@ -42,9 +81,11 @@ int main(void) {
 	do {
 		// Calculate half of `num'
 		mpz_fdiv_q_ui(halfNum, num, 2);
-		// Loop through found primes
+		/**
-		for(ulli i = 0; i < primes.end; ++i) {
+		 * Loop through primes we've found until we get to half of the number
-			if(mpz_cmp(primes.list[i], halfNum) >= 0) break;
+		 * we're analyzing
+		 */
+		for(size_t i = 0; mpz_cmp(primes.list[i], halfNum) < 0; ++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;
@@ -52,26 +93,33 @@ int main(void) {
 
 		// `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(!f_quiet) {
-			fprintf(stderr, "Could not print to `stdout'!\n");
+			if(mpz_out_str(stdout, 10, num) == 0) {
-			exit(1);
+				fprintf(stderr, "Could not print to `stdout'!\n");
+				exit(1);
+			}
+			printf("\n");
 		}
-		printf("\n");
 
 nextPrime:
 		// Add 2 (skip even numbers since they're all divisible by 2)
 		mpz_add_ui(num, num, 2);
 	} while(run);
 
+	printf("Found %zu primes.\n", primes.end);
+	puts("Clearing memory...");
 	// Clear GMP variables
 	mpz_clear(halfNum);
 	mpz_clear(num);
 	// Deinitialize the list
 	deInitList(&primes);
+
+	puts("Exit successful.");
 	return 0;
 }
 
-void leave() {
+void printUsage(char *progName) {
-	puts("Exiting...\n");
+	printf("%s [-v | -h | -q]\n", progName);
-	run = false;
 }
+
+void leave() { run = false; }

src/types.h

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