Makefile |  2 +-
 nnn.c    | 13 ++++++-------

diff --git a/Makefile b/Makefile
index 7b97a90408fb87c191a5aec4039706722e80321c..95994c913d102e0ecc5d9ea01afee0b0a34dac07 100644
--- a/Makefile
+++ b/Makefile
@@ -58,4 +58,4 @@
 clean:
 	$(RM) -f $(BIN) nnn-$(VERSION).tar.gz
 
-.PHONY: all debug install uninstall strip dist clean
+.PHONY: $(BIN) $(SRC) all debug install uninstall strip dist clean
diff --git a/nnn.c b/nnn.c
index f05788585c0800ba7e2117044eda0f654aa5e8a9..8fb57b3cb2458aa20f192ef1e239a57e3f34fb34 100644
--- a/nnn.c
+++ b/nnn.c
@@ -331,14 +331,12 @@ 	uchar remainder, bit;
 	uint dividend;
 
 	/* Compute the remainder of each possible dividend  */
-	for (dividend = 0; dividend < CRC8_TABLE_LEN; ++dividend)
-	{
+	for (dividend = 0; dividend < CRC8_TABLE_LEN; ++dividend) {
 		/* Start with the dividend followed by zeros */
 		remainder = dividend << (WIDTH - 8);
 
 		/* Perform modulo-2 division, a bit at a time */
-		for (bit = 8; bit > 0; --bit)
-		{
+		for (bit = 8; bit > 0; --bit) {
 			/* Try to divide the current data bit */
 			if (remainder & TOPBIT)
 				remainder = (remainder << 1) ^ POLYNOMIAL;
@@ -360,8 +358,7 @@     size_t byte;
 
 
     /* Divide the message by the polynomial, a byte at a time */
-    for (byte = 0; byte < n; ++byte)
-    {
+    for (byte = 0; byte < n; ++byte) {
         data = message[byte] ^ (remainder >> (WIDTH - 8));
         remainder = crc8table[data] ^ (remainder << 8);
     }
@@ -908,6 +905,7 @@
 	for (i = 0; i < len; ++i) {
 		if (regcomp(&regex, assocs[i].regex, REG_NOSUB | REG_EXTENDED | REG_ICASE) != 0)
 			continue;
+
 		if (regexec(&regex, file, 0, NULL, 0) == 0) {
 			regfree(&regex);
 			return assocs[i].mime;
@@ -932,6 +930,7 @@ 			len = NAME_MAX;
 		regerror(r, regex, g_buf, len);
 		printmsg(g_buf);
 	}
+
 	return r;
 }
 
@@ -1330,7 +1329,7 @@ /*
  * Updates out with "dir/name or "/name"
  * Returns the number of bytes copied including the terminating NULL byte
  */
-size_t
+static size_t
 mkpath(char *dir, char *name, char *out, size_t n)
 {
 	static size_t len;