Added entry for v0.6

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

@@ -1,3 +1,9 @@
 # Ignore build files
 build/*
 !build/.keep
+
+# Ignore documentation
+doc/
+
+# Ignore vim temporary files
+*.sw[a-z]

.gitlab-ci.yml

@@ -2,12 +2,19 @@ image: gcc
 
 build:
     stage: build
+    # Install dependencies
     before_script:
-        - apt update && apt -y install cmake
+        - apt update && apt -y install cmake libgmp-dev
+    # Build the project
     script:
         - cd build/
         - cmake -DCMAKE_BUILD_TYPE=Release ..
         - make
+    # Find the resulting binary
     artifacts:
         paths:
             - build/indivisible
+    # Cache .o files for faster compiling
+    cache:
+        paths:
+            - "build/CMakeFiles/indivisible.dir/src/*.o"

CHANGELOG

@@ -4,4 +4,26 @@ Change Log
 - v0.1: Initial release
 	- Basic prime calculation.
 	- Uses a growing vector of known primes and gets the modulus of the number divided by these primes.
-	- Uses type `long long` to hold prime numbers.
+	- Uses type `long long' to hold prime numbers.
+- v0.2: Multi-Precision
+	- Switch to C.
+	- Uses GNU Multiple Precision library (GMP) to hold prime numbers, allowing for 'infinite' size.
+	- Add `likely()' and `unlikely()' macros to optimize.
+- v0.2.1: Memory Leak Fixes
+	- Fixed a major memory leak at the end of the program.
+	- Added more optimizers.
+- v0.3: Optimizations
+	- Algorithm skips half the known primes.
+	- Removed `likely()' and `unlikely()' macros due to lack of information.
+	- Improved performance.
+- 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.
+- v0.6: User Control
+	- Allow user to choose base in which the prime numbers are printed.
+	- Give option for primes to be saved to a file upon exit.
+	- Free memory and leave instead of emergency exit.

CMakeLists.txt

@@ -1,23 +1,39 @@
 cmake_minimum_required(VERSION 2.6)
 project(Indivisible)
 
+cmake_policy(SET CMP0012 OLD)
+
 set(TARGET_NAME indivisible)
 
 if(NOT CMAKE_BUILD_TYPE)
 	set(CMAKE_BUILD_TYPE Debug)
 endif()
 
-set(SRCS
+set(CMAKE_MODULE_PATH
-    src/Main.cpp)
+	${CMAKE_MODULE_PATH}
+	${CMAKE_SOURCE_DIR}/cmake/)
 
-set(CMAKE_CXX_FLAGS "-std=c++14 -fno-elide-constructors -pedantic-errors -Wall -Wextra -Werror -Wpedantic -Winit-self -Wmissing-declarations -Wuninitialized -Wfatal-errors")
+find_package(GMP REQUIRED)
-set(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS} -O3")
+
-set(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS} -g -O0")
+include_directories(
-set(CMAKE_CXX_FLAGS_RELWITHDEBINFO "${CMAKE_CXX_FLAGS} -g -O3")
+	${GMP_INCLUDE_DIR})
-set(CMAKE_CXX_FLAGS_MINSIZEREL "${CMAKE_CXX_FLAGS} -Os")
+
+set(SRCS
+	src/main.c
+	src/list.c)
+
+# Define the C flags.
+set(CMAKE_C_FLAGS "-std=gnu99 -Wall -Wextra -Werror -Wfatal-errors -Wmissing-declarations -pedantic-errors")
+set(CMAKE_C_FLAGS_DEBUG "-g -O0")
+set(CMAKE_C_FLAGS_RELEASE "-O3")
+set(CMAKE_C_FLAGS_RELWITHDEBINFO "-g -O3")
+set(CMAKE_C_FLAGS_MINSIZEREL "-Os")
 
 if(NOT CMAKE_BUILD_TYPE MATCHES Debug AND NOT CMAKE_BUILD_TYPE MATCHES RelWithDebInfo)
 	add_definitions(-DNDEBUG)
 endif()
 
 add_executable(${TARGET_NAME} ${SRCS})
+
+target_link_libraries(${TARGET_NAME}
+	${GMP_LIBRARY})

README.md

@@ -2,12 +2,15 @@ Indivisible
 ===========
 [![build status](https://gitlab.com/Deathsbreed/Indivisible/badges/master/build.svg)](https://gitlab.com/Deathsbreed/Indivisible/commits/master)
 
-Indivisible is an optimized prime number generator written in C++.
+Indivisible is an optimized prime number generator written in C.
 
 Building
 --------
-This project uses CMake to build.
+There are multiple dependencies to install before compiling the project:
+- CMake
+- GMP
 
+Once the dependencies are installed you can compile by running the following from the root directory of the project:
 ```bash
 $ cd build/
 $ cmake ..

cmake/FindGMP.cmake

@@ -0,0 +1,24 @@
+# SOURCE: http://stackoverflow.com/questions/29307862/error-linking-gmp-library
+set(GMP_PREFIX "" CACHE PATH "path ")
+
+find_path(GMP_INCLUDE_DIR gmp.h gmpxx.h
+	PATHS ${GMP_PREFIX}/include /usr/include /usr/local/include )
+
+find_library(GMP_LIBRARY NAMES gmp libgmp
+	PATHS ${GMP_PREFIX}/lib /usr/lib /usr/local/lib)
+
+
+if(GMP_INCLUDE_DIR AND GMP_LIBRARY)
+	get_filename_component(GMP_LIBRARY_DIR ${GMP_LIBRARY} PATH)
+	set(GMP_FOUND TRUE)
+endif()
+
+if(GMP_FOUND)
+	if(NOT GMP_FIND_QUIETLY)
+		MESSAGE(STATUS "Found GMP: ${GMP_LIBRARY}")
+	endif()
+else()
+	if(GMP_FIND_REQUIRED)
+		message(FATAL_ERROR "Could not find GMP")
+	endif()
+endif()

src/Main.cpp

@@ -1,38 +0,0 @@
-#include <iostream>
-#include <vector>
-#include <csignal>
-
-static bool run;
-
-void leave(int signum);
-
-int main(void) {
-	std::cout << "Indivisible v0.1\n";
-	run = true;
-
-	signal(SIGINT, leave);
-
-	std::vector<unsigned long long> primes;
-	primes.push_back(2);
-	unsigned long long num = 2;
-
-	while(run) {
-		bool isPrime = true;
-		for(auto i : primes) {
-			if(i > num / 2) break;
-			if(num % i == 0) isPrime = false;
-		}
-		if(isPrime) {
-			primes.push_back(num);
-			std::cout << num << std::endl;
-		}
-		++num;
-	}
-
-	return 0;
-}
-
-void leave(int signum) {
-	std::cout << "Exiting (" << signum << ")\n";
-	run = false;
-}

src/list.c

@@ -0,0 +1,43 @@
+#include "list.h"
+#include <stdlib.h>
+#include <stdio.h>
+
+/**
+ * This is the number of elements by which the list expands.
+ */
+#define BLOCK_SIZE 1024
+
+void initList(List *restrict l) {
+	l->list = malloc(sizeof(mpz_t) * BLOCK_SIZE);
+	if(!l->list) {
+		fprintf(stderr, "Failed to allocate memory to list!\n");
+		exit(1);
+	}
+	l->size = BLOCK_SIZE;
+	l->end = 0;
+}
+
+void deInitList(List *restrict l) {
+	for(size_t 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) {
+		l->size += BLOCK_SIZE;
+		if(l->size == 0) {
+			fprintf(stderr, "`l->size' has overflowed!\n");
+			exit(1);
+		}
+		void *tmp = realloc(l->list, sizeof(mpz_t) * l->size);
+		if(!tmp) {
+			fprintf(stderr, "Failed to allocate more memory to list!\n");
+			exit(1);
+		}
+		l->list = (mpz_t*)tmp;
+	}
+	mpz_init(l->list[l->end]);
+	mpz_set(l->list[l->end++], n);
+}

src/list.h

@@ -0,0 +1,42 @@
+/**
+ * @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>
+
+/**
+ * @brief An infinitely expanding list type.
+ */
+typedef struct {
+	mpz_t *list; //!< The list of elements
+	size_t size; //!< How many elements are in the list
+	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.
+ * @param[in] l A pointer to a List type to be initialized.
+ */
+void initList(List *restrict l);
+
+/**
+ * @brief Deinitialize a List.
+ * @details Release all memory that has been allocated to the list.
+ * @param[in] l A pointer to a List type to be deinitialized.
+ */
+void deInitList(List *restrict l);
+
+/**
+ * @brief Adds a new item to a List type.
+ * @details Add item `n' at the end of a List type.
+ * @param[out] l List to which the variable should be appended.
+ * @param[in] n variable to be appended to the list.
+ */
+void addToList(List *l, mpz_t n);

src/main.c

@@ -0,0 +1,171 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <signal.h>
+#include <stdbool.h>
+#include <unistd.h>
+#include <gmp.h>
+
+#include "list.h"
+
+#define VERSION "v0.6"
+
+static bool run;
+
+void printUsage(char *progName);
+void leave();
+
+int main(int argc, char *argv[]) {
+	bool f_help = false,
+		 f_version = false,
+		 f_quiet = false;
+	int base = 10;
+	char *file = NULL;
+
+	int c;
+	while((c = getopt(argc, argv, "hvqb:f:")) != -1) {
+		switch(c) {
+			case 'h':
+				f_help = true;
+				break;
+			case 'v':
+				f_version = true;
+				break;
+			case 'q':
+				f_quiet = true;
+				break;
+			case 'b':
+				base = atoi(optarg);
+				if(base < 2 || base > 62) {
+					fprintf(stderr,
+							"Invalid base `%d'. Base must be between 2 and 62\n",
+							base);
+					exit(1);
+				}
+				break;
+			case 'f':
+				file = optarg;
+				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");
+		puts(" -b <base>  base in which to print primes between 2 and 62");
+		puts(" -f <file>  file to save primes to");
+		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);
+
+	// The number we're going to be testing for
+	mpz_t num;
+	mpz_init(num);
+
+	// Add 2, a known prime to this list
+	mpz_set_ui(num, 2);
+	addToList(&primes, num);
+	if(!f_quiet) {
+		if(mpz_out_str(stdout, base, num) == 0) {
+			fprintf(stderr, "Could not print to `stdout'!\n");
+			goto releaseMemory;
+		}
+		printf("\n");
+	}
+	mpz_add_ui(num, num, 1);
+
+	// Variable for half `num'
+	mpz_t halfNum;
+	mpz_init(halfNum);
+
+	do {
+		// Calculate half of `num'
+		mpz_fdiv_q_ui(halfNum, num, 2);
+		/**
+		 * Loop through primes we've found until we get to half of the number
+		 * 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;
+		}
+
+		// `num' is a prime so we add it to the list and print it
+		addToList(&primes, num);
+		if(!f_quiet) {
+			if(mpz_out_str(stdout, base, num) == 0) {
+				fprintf(stderr, "Could not print to `stdout'!\n");
+				goto releaseMemory;
+			}
+			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);
+	// Clear GMP variables
+	mpz_clear(halfNum);
+	mpz_clear(num);
+
+	if(file != NULL) {
+		FILE *outFile = fopen(file, "w+");
+		if(outFile == NULL) {
+			fprintf(stderr, "Failed create file `%s'.\n", file);
+			goto releaseMemory;
+		}
+		printf("Writing primes to `%s'...\n", file);
+		puts("0%");
+		for(size_t i = 0; i < primes.end; ++i) {
+			if(mpz_out_str(outFile, base, primes.list[i]) == 0) {
+				fprintf(stderr, "Error occurred while writing to file `%s'.\n", file);
+				goto releaseMemory;
+			}
+			fprintf(outFile, "\n");
+			if(i == primes.end / 4) puts("25%");
+			else if(i == primes.end / 2) puts("50%");
+			else if(i == primes.end * 3 / 4) puts("75%");
+		}
+		if(fclose(outFile) != 0) {
+			fprintf(stderr, "Failed to close file `%s'.\n", file);
+			goto releaseMemory;
+		}
+		puts("100%");
+		puts("Finished writing primes.");
+	}
+
+releaseMemory:
+	puts("Clearing memory...");
+	// Deinitialize the list
+	deInitList(&primes);
+
+	puts("Exit successful.");
+	return 0;
+}
+
+void printUsage(char *progName) {
+	printf("%s [options...]\n", progName);
+}
+
+void leave() { run = false; }