haskal
/
iodine
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Formatting: no space before parenthesis in function call.

This commit is contained in:
Erik Ekman 2020-07-24 18:51:05 +02:00
parent 13d081f5ed
commit 310aedac8e
3 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/base128.c
View File

@ -57,7 +57,7 @@ inline static void base128_reverse_init(void)
unsigned char c; unsigned char c;
if (!reverse_init) { if (!reverse_init) {
memset (rev128, 0, 256); memset(rev128, 0, 256);
for (i = 0; i < 128; i++) { for (i = 0; i < 128; i++) {
c = cb128[i]; c = cb128[i];
rev128[(int) c] = i; rev128[(int) c] = i;
@ -179,7 +179,7 @@ static int base128_decode(void *buf, size_t *buflen, const char *str,
int iout = 0; /* to-be-filled output byte */ int iout = 0; /* to-be-filled output byte */
int iin = 0; /* next input char to use in decoding */ int iin = 0; /* next input char to use in decoding */
base128_reverse_init (); base128_reverse_init();
/* Note: Don't bother to optimize manually. GCC optimizes /* Note: Don't bother to optimize manually. GCC optimizes
better(!) when using simplistic array indexing. */ better(!) when using simplistic array indexing. */

4
src/base32.c
View File

@ -38,7 +38,7 @@ inline static void base32_reverse_init(void)
unsigned char c; unsigned char c;
if (!reverse_init) { if (!reverse_init) {
memset (rev32, 0, 256); memset(rev32, 0, 256);
for (i = 0; i < 32; i++) { for (i = 0; i < 32; i++) {
c = cb32[i]; c = cb32[i];
rev32[(int) c] = i; rev32[(int) c] = i;
@ -168,7 +168,7 @@ static int base32_decode(void *buf, size_t *buflen, const char *str,
int iout = 0; /* to-be-filled output byte */ int iout = 0; /* to-be-filled output byte */
int iin = 0; /* next input char to use in decoding */ int iin = 0; /* next input char to use in decoding */
base32_reverse_init (); base32_reverse_init();
/* Note: Don't bother to optimize manually. GCC optimizes /* Note: Don't bother to optimize manually. GCC optimizes
better(!) when using simplistic array indexing. */ better(!) when using simplistic array indexing. */

4
src/base64.c
View File

@ -38,7 +38,7 @@ inline static void base64_reverse_init(void)
unsigned char c; unsigned char c;
if (!reverse_init) { if (!reverse_init) {
memset (rev64, 0, 256); memset(rev64, 0, 256);
for (i = 0; i < 64; i++) { for (i = 0; i < 64; i++) {
c = cb64[i]; c = cb64[i];
rev64[(int) c] = i; rev64[(int) c] = i;
@ -126,7 +126,7 @@ static int base64_decode(void *buf, size_t *buflen, const char *str,
int iout = 0; /* to-be-filled output byte */ int iout = 0; /* to-be-filled output byte */
int iin = 0; /* next input char to use in decoding */ int iin = 0; /* next input char to use in decoding */
base64_reverse_init (); base64_reverse_init();
/* Note: Don't bother to optimize manually. GCC optimizes /* Note: Don't bother to optimize manually. GCC optimizes
better(!) when using simplistic array indexing. */ better(!) when using simplistic array indexing. */