actually remove includes

src/caesarcrypt.c

@@ -13,8 +13,6 @@
 
 #include <stdio.h>
 #include <stdlib.h>
-#include <string.h>
-#include <stdbool.h>
 
 
 int main()
@@ -28,12 +26,14 @@ int main()
 	char buf[4];
 	fgets(buf, 3, stdin);
 	int choice = strtol(buf, NULL, 10);
-	
-	//char* msg = calloc(128, sizeof(char));
 
 	fputs("Enter your message text: ", stdout);
-	//if (msg) fgets(msg, 128, stdin);
 	char* msg = dyninput_str(INT64_MAX);
+	if (!msg)
+	{
+		puts("ERROR: String input failed! Exiting...");
+		return -1;
+	}
 
 	fputs("Enter your key (shift value): ", stdout);
 	fgets(buf, 4, stdin);

src/crypt.c

@@ -12,6 +12,12 @@
 #include <stdbool.h>
 
 
+/* 
+  *	For built in C mod operator (%) -1 % 26 == -1
+  * For the requirements of this algorithm -1 mod 26 == 25 is required
+  * The below functions accomplish this
+*/
+
 // Which of the two below functions is faster (find out!)
 inline int mod(int a, int b)
 {
@@ -26,6 +32,11 @@ inline int fast_mod(int a, int b)
 }
 
 
+/*
+  *	65 - 90	 = ASCII 'A' - 'Z'
+  *	97 - 122 = ASCII 'a' - 'z'
+*/
+
 inline bool isupper(char c)
 {
 	return c >= 'A' && c <= 'Z';

src/dyninput.c

@@ -15,33 +15,44 @@
 
 char* dyninput_str(int_least64_t maxsize)
 {
-    char* str = malloc(3 * sizeof(char));
-    /*if (!str)
-        puts("Error allocating memory!");
-        return NULL;*/
+	char* str = malloc(3 * sizeof(char));
+	if (!str)
+	{
+		puts("\nError allocating memory!");
+		return NULL;
+	}
 
-    int_least64_t size = 3, i = 0;
-    char c = 0;
+	int_least64_t size = 3, i = 0;
+	char c = 0;
 
-    do
-    {
-        c = getchar();
-        if (i + 2 == size)
-        {
+	do
+	{
+		if (size == maxsize)
+		{
+			printf("Character limit of %lld reached!\n", maxsize);
+			break;
+		}
+
+		c = (char)getchar();
+		if (i + 1 == size)
+		{
             char* tmp = realloc(str, size + 1);
-            if (!tmp)
-            {
-                puts("Error (re)allocating memory!");
-                return NULL;
-            }
-            str = tmp;
-            size++;
-        }
+			if (!tmp)
+			{
+				puts("Error (re)allocating memory!");
+				return NULL;
+			}
+			str = tmp;
+			size++;
+		}
 
-        str[i] = c;
-        i++;
-    } while (c && c != '\n');
-    str[i] = '\0';
+		str[i] = c;
+		i++;
+	} while (c && c != '\n');
+	if (str[i - 1] != '\n') str[i - 1] = '\n';
+	str[i] = '\0';
 
-    return str;
+	// Sanitise stdin
+	while (c != '\n') c = (char)getchar();
+	return str;
 }