mirrors/nnn
1
0
Fork 0
mirror of https://github.com/jarun/nnn.git synced 2024-11-28 05:41:31 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add more phony targets

Browse source
This commit is contained in:
Arun Prakash Jana 2018-04-01 22:51:55 +05:30
parent f2faa2ff12
commit 1653414039
No known key found for this signature in database
GPG key ID: A75979F35C080412
2 changed files with 7 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
Makefile
View file

@ -58,4 +58,4 @@ dist:
clean: clean:
$(RM) -f $(BIN) nnn-$(VERSION).tar.gz $(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

13
nnn.c
View file

@ -331,14 +331,12 @@ crc8init()
uint dividend; uint dividend;
/* Compute the remainder of each possible 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 */ /* Start with the dividend followed by zeros */
remainder = dividend << (WIDTH - 8); remainder = dividend << (WIDTH - 8);
/* Perform modulo-2 division, a bit at a time */ /* 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 */ /* Try to divide the current data bit */
if (remainder & TOPBIT) if (remainder & TOPBIT)
remainder = (remainder << 1) ^ POLYNOMIAL; remainder = (remainder << 1) ^ POLYNOMIAL;
@ -360,8 +358,7 @@ crc8fast(uchar const message[], size_t n)
/* Divide the message by the polynomial, a byte at a time */ /* 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)); data = message[byte] ^ (remainder >> (WIDTH - 8));
remainder = crc8table[data] ^ (remainder << 8); remainder = crc8table[data] ^ (remainder << 8);
} }
@ -908,6 +905,7 @@ getmime(const char *file)
for (i = 0; i < len; ++i) { for (i = 0; i < len; ++i) {
if (regcomp(&regex, assocs[i].regex, REG_NOSUB | REG_EXTENDED | REG_ICASE) != 0) if (regcomp(&regex, assocs[i].regex, REG_NOSUB | REG_EXTENDED | REG_ICASE) != 0)
continue; continue;
if (regexec(&regex, file, 0, NULL, 0) == 0) { if (regexec(&regex, file, 0, NULL, 0) == 0) {
regfree(&regex); regfree(&regex);
return assocs[i].mime; return assocs[i].mime;
@ -932,6 +930,7 @@ setfilter(regex_t *regex, char *filter)
regerror(r, regex, g_buf, len); regerror(r, regex, g_buf, len);
printmsg(g_buf); printmsg(g_buf);
} }
return r; return r;
} }
@ -1330,7 +1329,7 @@ readinput(void)
* Updates out with "dir/name or "/name" * Updates out with "dir/name or "/name"
* Returns the number of bytes copied including the terminating NULL byte * 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) mkpath(char *dir, char *name, char *out, size_t n)
{ {
static size_t len; static size_t len;