| 1 |
jmc |
1.1 |
/* (C) Copyright 1993,1994 by Carnegie Mellon University |
| 2 |
|
|
* All Rights Reserved. |
| 3 |
|
|
* |
| 4 |
|
|
* Permission to use, copy, modify, distribute, and sell this software |
| 5 |
|
|
* and its documentation for any purpose is hereby granted without |
| 6 |
|
|
* fee, provided that the above copyright notice appear in all copies |
| 7 |
|
|
* and that both that copyright notice and this permission notice |
| 8 |
|
|
* appear in supporting documentation, and that the name of Carnegie |
| 9 |
|
|
* Mellon University not be used in advertising or publicity |
| 10 |
|
|
* pertaining to distribution of the software without specific, |
| 11 |
|
|
* written prior permission. Carnegie Mellon University makes no |
| 12 |
|
|
* representations about the suitability of this software for any |
| 13 |
|
|
* purpose. It is provided "as is" without express or implied |
| 14 |
|
|
* warranty. |
| 15 |
|
|
* |
| 16 |
|
|
* CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO |
| 17 |
|
|
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY |
| 18 |
|
|
* AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE |
| 19 |
|
|
* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
| 20 |
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN |
| 21 |
|
|
* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING |
| 22 |
|
|
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS |
| 23 |
|
|
* SOFTWARE. |
| 24 |
|
|
*/ |
| 25 |
|
|
/* |
| 26 |
|
|
Copyright (c) 1991 Bell Communications Research, Inc. (Bellcore) |
| 27 |
|
|
|
| 28 |
|
|
Permission to use, copy, modify, and distribute this material |
| 29 |
|
|
for any purpose and without fee is hereby granted, provided |
| 30 |
|
|
that the above copyright notice and this permission notice |
| 31 |
|
|
appear in all copies, and that the name of Bellcore not be |
| 32 |
|
|
used in advertising or publicity pertaining to this |
| 33 |
|
|
material without the specific, prior written permission |
| 34 |
|
|
of an authorized representative of Bellcore. BELLCORE |
| 35 |
|
|
MAKES NO REPRESENTATIONS ABOUT THE ACCURACY OR SUITABILITY |
| 36 |
|
|
OF THIS MATERIAL FOR ANY PURPOSE. IT IS PROVIDED "AS IS", |
| 37 |
|
|
WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES. */ |
| 38 |
|
|
#include <stdio.h> |
| 39 |
|
|
#include <string.h> |
| 40 |
|
|
#include <ctype.h> |
| 41 |
|
|
#include "xmalloc.h" |
| 42 |
|
|
#include "md5.h" |
| 43 |
|
|
|
| 44 |
|
|
void output64chunk(int c1, int c2, int c3, int pads, FILE *outfile); |
| 45 |
|
|
static char basis_64[] = |
| 46 |
|
|
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; |
| 47 |
|
|
|
| 48 |
|
|
int to64(FILE *infile, FILE *outfile, long int limit) |
| 49 |
|
|
{ |
| 50 |
|
|
int c1, c2, c3, ct=0, written=0; |
| 51 |
|
|
|
| 52 |
|
|
if (limit && limit < 73) return 1; |
| 53 |
|
|
|
| 54 |
|
|
while ((c1 = getc(infile)) != EOF) { |
| 55 |
|
|
c2 = getc(infile); |
| 56 |
|
|
if (c2 == EOF) { |
| 57 |
|
|
output64chunk(c1, 0, 0, 2, outfile); |
| 58 |
|
|
} else { |
| 59 |
|
|
c3 = getc(infile); |
| 60 |
|
|
if (c3 == EOF) { |
| 61 |
|
|
output64chunk(c1, c2, 0, 1, outfile); |
| 62 |
|
|
} else { |
| 63 |
|
|
output64chunk(c1, c2, c3, 0, outfile); |
| 64 |
|
|
} |
| 65 |
|
|
} |
| 66 |
|
|
ct += 4; |
| 67 |
|
|
if (ct > 71) { |
| 68 |
|
|
putc('\n', outfile); |
| 69 |
|
|
if (limit) { |
| 70 |
|
|
limit -= ct + 1; |
| 71 |
|
|
if (limit < 73) return 1; |
| 72 |
|
|
} |
| 73 |
|
|
written += 73; |
| 74 |
|
|
ct = 0; |
| 75 |
|
|
} |
| 76 |
|
|
} |
| 77 |
|
|
if (ct) { |
| 78 |
|
|
putc('\n', outfile); |
| 79 |
|
|
ct++; |
| 80 |
|
|
} |
| 81 |
|
|
return written + ct; |
| 82 |
|
|
} |
| 83 |
|
|
|
| 84 |
|
|
void output64chunk(int c1, int c2, int c3, int pads, FILE *outfile) |
| 85 |
|
|
{ |
| 86 |
|
|
putc(basis_64[c1>>2], outfile); |
| 87 |
|
|
putc(basis_64[((c1 & 0x3)<< 4) | ((c2 & 0xF0) >> 4)], outfile); |
| 88 |
|
|
if (pads == 2) { |
| 89 |
|
|
putc('=', outfile); |
| 90 |
|
|
putc('=', outfile); |
| 91 |
|
|
} else if (pads) { |
| 92 |
|
|
putc(basis_64[((c2 & 0xF) << 2) | ((c3 & 0xC0) >>6)], outfile); |
| 93 |
|
|
putc('=', outfile); |
| 94 |
|
|
} else { |
| 95 |
|
|
putc(basis_64[((c2 & 0xF) << 2) | ((c3 & 0xC0) >>6)], outfile); |
| 96 |
|
|
putc(basis_64[c3 & 0x3F], outfile); |
| 97 |
|
|
} |
| 98 |
|
|
} |
| 99 |
|
|
|
| 100 |
|
|
char *md5contextTo64(MD5_CTX *context) |
| 101 |
|
|
{ |
| 102 |
|
|
unsigned char digest[18]; |
| 103 |
|
|
char encodedDigest[25]; |
| 104 |
|
|
int i; |
| 105 |
|
|
char *p; |
| 106 |
|
|
|
| 107 |
|
|
MD5Final(digest, context); |
| 108 |
|
|
digest[sizeof(digest)-1] = digest[sizeof(digest)-2] = 0; |
| 109 |
|
|
|
| 110 |
|
|
p = encodedDigest; |
| 111 |
|
|
for (i=0; i < sizeof(digest); i+=3) { |
| 112 |
|
|
*p++ = basis_64[digest[i]>>2]; |
| 113 |
|
|
*p++ = basis_64[((digest[i] & 0x3)<<4) | ((digest[i+1] & 0xF0)>>4)]; |
| 114 |
|
|
*p++ = basis_64[((digest[i+1] & 0xF)<<2) | ((digest[i+2] & 0xC0)>>6)]; |
| 115 |
|
|
*p++ = basis_64[digest[i+2] & 0x3F]; |
| 116 |
|
|
} |
| 117 |
|
|
*p-- = '\0'; |
| 118 |
|
|
*p-- = '='; |
| 119 |
|
|
*p-- = '='; |
| 120 |
|
|
return strsave(encodedDigest); |
| 121 |
|
|
} |
| 122 |
|
|
|
| 123 |
|
|
char *md5digest(FILE *infile, long int *len) |
| 124 |
|
|
{ |
| 125 |
|
|
MD5_CTX context; |
| 126 |
|
|
char buf[1000]; |
| 127 |
|
|
long length = 0; |
| 128 |
|
|
int nbytes; |
| 129 |
|
|
|
| 130 |
|
|
MD5Init(&context); |
| 131 |
|
|
while ((nbytes = fread(buf, 1, sizeof(buf), infile))) { |
| 132 |
|
|
length += nbytes; |
| 133 |
|
|
MD5Update(&context, buf, nbytes); |
| 134 |
|
|
} |
| 135 |
|
|
rewind(infile); |
| 136 |
|
|
if (len) *len = length; |
| 137 |
|
|
return md5contextTo64(&context); |
| 138 |
|
|
} |