#include "os.h"
#include <9pm/mp.h>
#include <9pm/libsec.h>
/*
* rfc1321 requires that I include this. The code is new. The constants
* all come from the rfc (hence the copyright). We trade a table for the
* macros in rfc. The total size is a lot less. -- presotto
*
* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
* rights reserved.
*
* License to copy and use this software is granted provided that it
* is identified as the "RSA Data Security, Inc. MD5 Message-Digest
* Algorithm" in all material mentioning or referencing this software
* or this function.
*
* License is also granted to make and use derivative works provided
* that such works are identified as "derived from the RSA Data
* Security, Inc. MD5 Message-Digest Algorithm" in all material
* mentioning or referencing the derived work.
*
* RSA Data Security, Inc. makes no representations concerning either
* the merchantability of this software or the suitability of this
* software forany particular purpose. It is provided "as is"
* without express or implied warranty of any kind.
* These notices must be retained in any copies of any part of this
* documentation and/or software.
*/
/*
* Rotate ammounts used in the algorithm
*/
enum
{
S11= 7,
S12= 12,
S13= 17,
S14= 22,
S21= 5,
S22= 9,
S23= 14,
S24= 20,
S31= 4,
S32= 11,
S33= 16,
S34= 23,
S41= 6,
S42= 10,
S43= 15,
S44= 21,
};
typedef struct MD5Table MD5Table;
struct MD5Table
{
u32int sin; /* integer part of 4294967296 times abs(sin(i)) */
uchar x; /* index into data block */
uchar rot; /* amount to rotate left by */
};
static MD5Table tab[] =
{
/* round 1 */
/*[0]*/ { 0xd76aa478, 0, S11},
{ 0xe8c7b756, 1, S12},
{ 0x242070db, 2, S13},
{ 0xc1bdceee, 3, S14},
{ 0xf57c0faf, 4, S11},
{ 0x4787c62a, 5, S12},
{ 0xa8304613, 6, S13},
{ 0xfd469501, 7, S14},
{ 0x698098d8, 8, S11},
{ 0x8b44f7af, 9, S12},
{ 0xffff5bb1, 10, S13},
{ 0x895cd7be, 11, S14},
{ 0x6b901122, 12, S11},
{ 0xfd987193, 13, S12},
{ 0xa679438e, 14, S13},
{ 0x49b40821, 15, S14},
/* round 2 */
/*[16]*/{ 0xf61e2562, 1, S21},
{ 0xc040b340, 6, S22},
{ 0x265e5a51, 11, S23},
{ 0xe9b6c7aa, 0, S24},
{ 0xd62f105d, 5, S21},
{ 0x2441453, 10, S22},
{ 0xd8a1e681, 15, S23},
{ 0xe7d3fbc8, 4, S24},
{ 0x21e1cde6, 9, S21},
{ 0xc33707d6, 14, S22},
{ 0xf4d50d87, 3, S23},
{ 0x455a14ed, 8, S24},
{ 0xa9e3e905, 13, S21},
{ 0xfcefa3f8, 2, S22},
{ 0x676f02d9, 7, S23},
{ 0x8d2a4c8a, 12, S24},
/* round 3 */
/*[32]*/{ 0xfffa3942, 5, S31},
{ 0x8771f681, 8, S32},
{ 0x6d9d6122, 11, S33},
{ 0xfde5380c, 14, S34},
{ 0xa4beea44, 1, S31},
{ 0x4bdecfa9, 4, S32},
{ 0xf6bb4b60, 7, S33},
{ 0xbebfbc70, 10, S34},
{ 0x289b7ec6, 13, S31},
{ 0xeaa127fa, 0, S32},
{ 0xd4ef3085, 3, S33},
{ 0x4881d05, 6, S34},
{ 0xd9d4d039, 9, S31},
{ 0xe6db99e5, 12, S32},
{ 0x1fa27cf8, 15, S33},
{ 0xc4ac5665, 2, S34},
/* round 4 */
/*[48]*/{ 0xf4292244, 0, S41},
{ 0x432aff97, 7, S42},
{ 0xab9423a7, 14, S43},
{ 0xfc93a039, 5, S44},
{ 0x655b59c3, 12, S41},
{ 0x8f0ccc92, 3, S42},
{ 0xffeff47d, 10, S43},
{ 0x85845dd1, 1, S44},
{ 0x6fa87e4f, 8, S41},
{ 0xfe2ce6e0, 15, S42},
{ 0xa3014314, 6, S43},
{ 0x4e0811a1, 13, S44},
{ 0xf7537e82, 4, S41},
{ 0xbd3af235, 11, S42},
{ 0x2ad7d2bb, 2, S43},
{ 0xeb86d391, 9, S44},
};
static void encode(uchar*, u32int*, ulong);
static void decode(u32int*, uchar*, ulong);
static void
md5block(uchar *p, ulong len, MD5state *s)
{
int i;
u32int a, b, c, d, tmp;
MD5Table *t;
uchar *end;
u32int x[16];
for(end = p+len; p < end; p += 64){
a = s->state[0];
b = s->state[1];
c = s->state[2];
d = s->state[3];
decode(x, p, 64);
for(i = 0; i < 64; i++){
t = tab + i;
switch(i>>4){
case 0:
a += (b & c) | (~b & d);
break;
case 1:
a += (b & d) | (c & ~d);
break;
case 2:
a += b ^ c ^ d;
break;
case 3:
a += c ^ (b | ~d);
break;
}
a += x[t->x] + t->sin;
a = (a << t->rot) | (a >> (32 - t->rot));
a += b;
/* rotate variables */
tmp = d;
d = c;
c = b;
b = a;
a = tmp;
}
s->state[0] += a;
s->state[1] += b;
s->state[2] += c;
s->state[3] += d;
s->len += 64;
}
}
MD5state*
md5(uchar *p, ulong len, uchar *digest, MD5state *s)
{
u32int x[16];
uchar buf[128];
int i;
uchar *e;
if(s == nil){
s = malloc(sizeof(*s));
if(s == nil)
return nil;
memset(s, 0, sizeof(*s));
s->malloced = 1;
}
if(s->seeded == 0){
/* seed the state, these constants would look nicer big-endian */
s->state[0] = 0x67452301;
s->state[1] = 0xefcdab89;
s->state[2] = 0x98badcfe;
s->state[3] = 0x10325476;
s->seeded = 1;
}
/* fill out the partial 64 byte block from previous calls */
if(s->blen){
i = 64 - s->blen;
if(len < i)
i = len;
memmove(s->buf + s->blen, p, i);
len -= i;
s->blen += i;
p += i;
if(s->blen == 64){
md5block(s->buf, s->blen, s);
s->blen = 0;
}
}
/* do 64 byte blocks */
i = len & ~0x3f;
if(i){
md5block(p, i, s);
len -= i;
p += i;
}
/* save the left overs if not last call */
if(digest == 0){
if(len){
memmove(s->buf, p, len);
s->blen += len;
}
return s;
}
/*
* this is the last time through, pad what's left with 0x80,
* 0's, and the input count to create a multiple of 64 bytes
*/
if(s->blen){
p = s->buf;
len = s->blen;
} else {
memmove(buf, p, len);
p = buf;
}
s->len += len;
e = p + len;
if(len < 56)
i = 56 - len;
else
i = 120 - len;
memset(e, 0, i);
*e = 0x80;
len += i;
/* append the count */
x[0] = s->len<<3;
x[1] = s->len>>29;
encode(p+len, x, 8);
/* digest the last part */
md5block(p, len+8, s);
/* return result and free state */
encode(digest, s->state, MD5dlen);
if(s->malloced == 1)
free(s);
return nil;
}
/*
* encodes input (u32int) into output (uchar). Assumes len is
* a multiple of 4.
*/
static void
encode(uchar *output, u32int *input, ulong len)
{
u32int x;
uchar *e;
for(e = output + len; output < e;) {
x = *input++;
*output++ = x;
*output++ = x >> 8;
*output++ = x >> 16;
*output++ = x >> 24;
}
}
/*
* decodes input (uchar) into output (u32int). Assumes len is
* a multiple of 4.
*/
static void
decode(u32int *output, uchar *input, ulong len)
{
uchar *e;
for(e = input+len; input < e; input += 4)
*output++ = input[0] | (input[1] << 8) |
(input[2] << 16) | (input[3] << 24);
}
syntax highlighted by Code2HTML, v. 0.9.1