]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* apps/dgst.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
3 | * All rights reserved. |
4 | * | |
5 | * This package is an SSL implementation written | |
6 | * by Eric Young (eay@cryptsoft.com). | |
7 | * The implementation was written so as to conform with Netscapes SSL. | |
8 | * | |
9 | * This library is free for commercial and non-commercial use as long as | |
10 | * the following conditions are aheared to. The following conditions | |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
13 | * included with this distribution is covered by the same copyright terms | |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
15 | * | |
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
17 | * the code are not to be removed. | |
18 | * If this package is used in a product, Eric Young should be given attribution | |
19 | * as the author of the parts of the library used. | |
20 | * This can be in the form of a textual message at program startup or | |
21 | * in documentation (online or textual) provided with the package. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
26 | * 1. Redistributions of source code must retain the copyright | |
27 | * notice, this list of conditions and the following disclaimer. | |
28 | * 2. Redistributions in binary form must reproduce the above copyright | |
29 | * notice, this list of conditions and the following disclaimer in the | |
30 | * documentation and/or other materials provided with the distribution. | |
31 | * 3. All advertising materials mentioning features or use of this software | |
32 | * must display the following acknowledgement: | |
33 | * "This product includes cryptographic software written by | |
34 | * Eric Young (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
38 | * the apps directory (application code) you must include an acknowledgement: | |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
40 | * | |
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
51 | * SUCH DAMAGE. | |
52 | * | |
53 | * The licence and distribution terms for any publically available version or | |
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
55 | * copied and put under another distribution licence | |
56 | * [including the GNU Public Licence.] | |
57 | */ | |
58 | ||
59 | #include <stdio.h> | |
60 | #include <string.h> | |
61 | #include <stdlib.h> | |
62 | #include "apps.h" | |
63 | #include "bio.h" | |
64 | #include "err.h" | |
65 | #include "evp.h" | |
66 | #include "objects.h" | |
67 | #include "x509.h" | |
68 | #include "pem.h" | |
69 | ||
70 | #undef BUFSIZE | |
71 | #define BUFSIZE 1024*8 | |
72 | ||
73 | #undef PROG | |
74 | #define PROG dgst_main | |
75 | ||
76 | #ifndef NOPROTO | |
77 | void do_fp(unsigned char *buf,BIO *f,int sep); | |
78 | #else | |
79 | void do_fp(); | |
80 | #endif | |
81 | ||
82 | int MAIN(argc,argv) | |
83 | int argc; | |
84 | char **argv; | |
85 | { | |
86 | unsigned char *buf=NULL; | |
87 | int i,err=0; | |
88 | EVP_MD *md=NULL,*m; | |
89 | BIO *in=NULL,*inp; | |
90 | BIO *bmd=NULL; | |
91 | char *name; | |
92 | #define PROG_NAME_SIZE 16 | |
93 | char pname[PROG_NAME_SIZE]; | |
94 | int separator=0; | |
95 | int debug=0; | |
96 | ||
97 | apps_startup(); | |
98 | ||
99 | if ((buf=(unsigned char *)Malloc(BUFSIZE)) == NULL) | |
100 | { | |
101 | BIO_printf(bio_err,"out of memory\n"); | |
102 | goto end; | |
103 | } | |
104 | if (bio_err == NULL) | |
105 | if ((bio_err=BIO_new(BIO_s_file())) != NULL) | |
58964a49 | 106 | BIO_set_fp(bio_err,stderr,BIO_NOCLOSE|BIO_FP_TEXT); |
d02b48c6 RE |
107 | |
108 | /* first check the program name */ | |
109 | program_name(argv[0],pname,PROG_NAME_SIZE); | |
110 | ||
111 | md=EVP_get_digestbyname(pname); | |
112 | ||
113 | argc--; | |
114 | argv++; | |
115 | for (i=0; i<argc; i++) | |
116 | { | |
117 | if ((*argv)[0] != '-') break; | |
118 | if (strcmp(*argv,"-c") == 0) | |
119 | separator=1; | |
120 | else if (strcmp(*argv,"-d") == 0) | |
121 | debug=1; | |
122 | else if ((m=EVP_get_digestbyname(&((*argv)[1]))) != NULL) | |
123 | md=m; | |
124 | else | |
125 | break; | |
126 | argc--; | |
127 | argv++; | |
128 | } | |
129 | ||
130 | if (md == NULL) | |
131 | md=EVP_md5(); | |
132 | ||
133 | if ((argc > 0) && (argv[0][0] == '-')) /* bad option */ | |
134 | { | |
135 | BIO_printf(bio_err,"unknown option '%s'\n",*argv); | |
136 | BIO_printf(bio_err,"options are\n"); | |
137 | BIO_printf(bio_err,"-c to output the digest with separating colons\n"); | |
58964a49 RE |
138 | BIO_printf(bio_err,"-d to output debug info\n"); |
139 | BIO_printf(bio_err,"-%3s to use the %s message digest algorithm (default)\n", | |
d02b48c6 | 140 | LN_md5,LN_md5); |
58964a49 | 141 | BIO_printf(bio_err,"-%3s to use the %s message digest algorithm\n", |
d02b48c6 | 142 | LN_md2,LN_md2); |
58964a49 | 143 | BIO_printf(bio_err,"-%3s to use the %s message digest algorithm\n", |
d02b48c6 | 144 | LN_sha1,LN_sha1); |
58964a49 | 145 | BIO_printf(bio_err,"-%3s to use the %s message digest algorithm\n", |
d02b48c6 | 146 | LN_sha,LN_sha); |
58964a49 | 147 | BIO_printf(bio_err,"-%3s to use the %s message digest algorithm\n", |
d02b48c6 RE |
148 | LN_mdc2,LN_mdc2); |
149 | err=1; | |
150 | goto end; | |
151 | } | |
152 | ||
153 | in=BIO_new(BIO_s_file()); | |
154 | bmd=BIO_new(BIO_f_md()); | |
155 | if (debug) | |
156 | { | |
157 | BIO_set_callback(in,BIO_debug_callback); | |
158 | /* needed for windows 3.1 */ | |
159 | BIO_set_callback_arg(in,bio_err); | |
160 | } | |
161 | ||
162 | if ((in == NULL) || (bmd == NULL)) | |
163 | { | |
164 | ERR_print_errors(bio_err); | |
165 | goto end; | |
166 | } | |
167 | ||
168 | /* we use md as a filter, reading from 'in' */ | |
169 | BIO_set_md(bmd,md); | |
170 | inp=BIO_push(bmd,in); | |
171 | ||
172 | if (argc == 0) | |
173 | { | |
174 | BIO_set_fp(in,stdin,BIO_NOCLOSE); | |
175 | do_fp(buf,inp,separator); | |
176 | } | |
177 | else | |
178 | { | |
179 | name=OBJ_nid2sn(md->type); | |
180 | for (i=0; i<argc; i++) | |
181 | { | |
182 | if (BIO_read_filename(in,argv[i]) <= 0) | |
183 | { | |
184 | perror(argv[i]); | |
185 | err++; | |
186 | continue; | |
187 | } | |
188 | printf("%s(%s)= ",name,argv[i]); | |
189 | do_fp(buf,inp,separator); | |
190 | BIO_reset(bmd); | |
191 | } | |
192 | } | |
193 | end: | |
194 | if (buf != NULL) | |
195 | { | |
196 | memset(buf,0,BUFSIZE); | |
197 | Free(buf); | |
198 | } | |
199 | if (in != NULL) BIO_free(in); | |
200 | if (bmd != NULL) BIO_free(bmd); | |
201 | EXIT(err); | |
202 | } | |
203 | ||
204 | void do_fp(buf,bp,sep) | |
205 | unsigned char *buf; | |
206 | BIO *bp; | |
207 | int sep; | |
208 | { | |
209 | int len; | |
210 | int i; | |
211 | ||
212 | for (;;) | |
213 | { | |
214 | i=BIO_read(bp,(char *)buf,BUFSIZE); | |
215 | if (i <= 0) break; | |
216 | } | |
217 | len=BIO_gets(bp,(char *)buf,BUFSIZE); | |
218 | ||
219 | for (i=0; i<len; i++) | |
220 | { | |
221 | if (sep && (i != 0)) | |
222 | putc(':',stdout); | |
223 | printf("%02x",buf[i]); | |
224 | } | |
225 | printf("\n"); | |
226 | } | |
227 |