Commit 3ead2b97 authored by Niels Möller's avatar Niels Möller
Browse files

desdata.c: Include stdio.h.

parent 916d3bb1
2012-09-10 Niels Möller <nisse@lysator.liu.se> 2012-09-10 Niels Möller <nisse@lysator.liu.se>
* desdata.c: Don't declare printf, include <stdio.h> instead. Also
deleted casts of printf return value.
From Tim Rühsen: From Tim Rühsen:
* examples/nettle-benchmark.c (die): Use PRINTF_STYLE attribute. * examples/nettle-benchmark.c (die): Use PRINTF_STYLE attribute.
* pgp-encode.c (pgp_put_rsa_sha1_signature): Deleted unused variable. * pgp-encode.c (pgp_put_rsa_sha1_signature): Deleted unused variable.
......
...@@ -15,6 +15,8 @@ ...@@ -15,6 +15,8 @@
# include "config.h" # include "config.h"
#endif #endif
#include <stdio.h>
#include "desinfo.h" #include "desinfo.h"
#include "desCode.h" #include "desCode.h"
...@@ -62,8 +64,6 @@ int sorder[] = { ...@@ -62,8 +64,6 @@ int sorder[] = {
7, 5, 3, 1, 6, 4, 2, 0, 7, 5, 3, 1, 6, 4, 2, 0,
}; };
int printf(const char *, ...);
int int
main(int argc UNUSED, char **argv UNUSED) main(int argc UNUSED, char **argv UNUSED)
{ {
...@@ -77,7 +77,7 @@ main(int argc UNUSED, char **argv UNUSED) ...@@ -77,7 +77,7 @@ main(int argc UNUSED, char **argv UNUSED)
*/ */
case 'p': case 'p':
(void)printf( printf(
"/* automagically produced - do not fuss with this information */\n\n"); "/* automagically produced - do not fuss with this information */\n\n");
/* store parity information */ /* store parity information */
...@@ -99,9 +99,9 @@ case 'p': ...@@ -99,9 +99,9 @@ case 'p':
/* print it out */ /* print it out */
for ( i = 0; i < 256; i++ ) { for ( i = 0; i < 256; i++ ) {
(void)printf("%d,", b[i]); printf("%d,", b[i]);
if ( (i & 31) == 31 ) if ( (i & 31) == 31 )
(void)printf("\n"); printf("\n");
} }
break; break;
...@@ -112,7 +112,7 @@ case 'p': ...@@ -112,7 +112,7 @@ case 'p':
*/ */
case 'r': case 'r':
(void)printf("/* automagically made - do not fuss with this */\n\n"); printf("/* automagically made - do not fuss with this */\n\n");
/* KL specifies the initial key bit positions */ /* KL specifies the initial key bit positions */
for (i = 0; i < 56; i++) for (i = 0; i < 56; i++)
...@@ -136,11 +136,11 @@ case 'r': ...@@ -136,11 +136,11 @@ case 'r':
m = ksr[KC[korder[j]] - 1]; m = ksr[KC[korder[j]] - 1];
m = (m / 8) * 7 + (m % 8) - 1; m = (m / 8) * 7 + (m % 8) - 1;
m = 55 - m; m = 55 - m;
(void)printf(" %2ld,", (long) m); printf(" %2ld,", (long) m);
if ((j % 12) == 11) if ((j % 12) == 11)
(void)printf("\n"); printf("\n");
} }
(void)printf("\n"); printf("\n");
} }
break; break;
...@@ -151,7 +151,7 @@ case 'r': ...@@ -151,7 +151,7 @@ case 'r':
*/ */
case 'k': case 'k':
(void)printf("/* automagically made - do not fuss with this */\n\n"); printf("/* automagically made - do not fuss with this */\n\n");
for ( i = 0; i <= 7 ; i++ ) { for ( i = 0; i <= 7 ; i++ ) {
s = sorder[i]; s = sorder[i];
...@@ -183,11 +183,11 @@ case 'k': ...@@ -183,11 +183,11 @@ case 'k':
/* rotate right (alg keeps everything rotated by 1) */ /* rotate right (alg keeps everything rotated by 1) */
ROR(m, 1, 31); ROR(m, 1, 31);
/* print it out */ /* print it out */
(void)printf(" 0x%08lx,", (long) m); printf(" 0x%08lx,", (long) m);
if ( ( d & 3 ) == 3 ) if ( ( d & 3 ) == 3 )
(void)printf("\n"); printf("\n");
} }
(void)printf("\n"); printf("\n");
} }
break; break;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment