ccache/mdfour.c

201 lines
4.7 KiB
C
Raw Normal View History

2009-11-07 08:09:39 +00:00
/*
2010-04-22 20:47:05 +00:00
* Copyright (C) 1997-1998 Andrew Tridgell
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
2010-08-04 11:09:55 +00:00
* the Free Software Foundation; either version 3 of the License, or
2010-04-22 20:47:05 +00:00
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
2002-03-26 14:46:43 +00:00
#include "ccache.h"
/* NOTE: This code makes no attempt to be fast! */
2002-03-26 14:46:43 +00:00
static struct mdfour *m;
#define MASK32 (0xffffffff)
#define F(X,Y,Z) ((((X)&(Y)) | ((~(X))&(Z))))
#define G(X,Y,Z) ((((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z))))
#define H(X,Y,Z) (((X)^(Y)^(Z)))
#define lshift(x,s) (((((x)<<(s))&MASK32) | (((x)>>(32-(s)))&MASK32)))
#define ROUND1(a,b,c,d,k,s) a = lshift((a + F(b,c,d) + M[k])&MASK32, s)
#define ROUND2(a,b,c,d,k,s) a = lshift((a + G(b,c,d) + M[k] + 0x5A827999)&MASK32,s)
#define ROUND3(a,b,c,d,k,s) a = lshift((a + H(b,c,d) + M[k] + 0x6ED9EBA1)&MASK32,s)
/* this applies md4 to 64 byte chunks */
static void
mdfour64(uint32_t *M)
2002-03-26 14:46:43 +00:00
{
uint32_t AA, BB, CC, DD;
uint32_t A,B,C,D;
2002-03-26 14:46:43 +00:00
2009-11-07 08:09:39 +00:00
A = m->A; B = m->B; C = m->C; D = m->D;
2002-03-26 14:46:43 +00:00
AA = A; BB = B; CC = C; DD = D;
2009-11-07 08:09:39 +00:00
ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7);
2002-03-26 14:46:43 +00:00
ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19);
2009-11-07 08:09:39 +00:00
ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7);
2002-03-26 14:46:43 +00:00
ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19);
2009-11-07 08:09:39 +00:00
ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7);
2002-03-26 14:46:43 +00:00
ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19);
2009-11-07 08:09:39 +00:00
ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7);
ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19);
2002-03-26 14:46:43 +00:00
2009-11-07 08:09:39 +00:00
ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5);
2002-03-26 14:46:43 +00:00
ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13);
2009-11-07 08:09:39 +00:00
ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5);
2002-03-26 14:46:43 +00:00
ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13);
2009-11-07 08:09:39 +00:00
ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5);
2002-03-26 14:46:43 +00:00
ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13);
2009-11-07 08:09:39 +00:00
ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5);
2002-03-26 14:46:43 +00:00
ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13);
2009-11-07 08:09:39 +00:00
ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9);
2002-03-26 14:46:43 +00:00
ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15);
2009-11-07 08:09:39 +00:00
ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9);
2002-03-26 14:46:43 +00:00
ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15);
2009-11-07 08:09:39 +00:00
ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9);
2002-03-26 14:46:43 +00:00
ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15);
2009-11-07 08:09:39 +00:00
ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9);
2002-03-26 14:46:43 +00:00
ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15);
2009-11-07 08:09:39 +00:00
A += AA; B += BB;
2002-03-26 14:46:43 +00:00
C += CC; D += DD;
2009-11-07 08:09:39 +00:00
A &= MASK32; B &= MASK32;
2002-03-26 14:46:43 +00:00
C &= MASK32; D &= MASK32;
m->A = A; m->B = B; m->C = C; m->D = D;
}
static void
copy64(uint32_t *M, const unsigned char *in)
2002-03-26 14:46:43 +00:00
{
int i;
for (i = 0; i < 16; i++)
2002-03-26 14:46:43 +00:00
M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
(in[i*4+1]<<8) | (in[i*4+0]<<0);
}
static void
copy4(unsigned char *out, uint32_t x)
2002-03-26 14:46:43 +00:00
{
out[0] = x&0xFF;
out[1] = (x>>8)&0xFF;
out[2] = (x>>16)&0xFF;
out[3] = (x>>24)&0xFF;
}
void
mdfour_begin(struct mdfour *md)
2002-03-26 14:46:43 +00:00
{
md->A = 0x67452301;
md->B = 0xefcdab89;
md->C = 0x98badcfe;
md->D = 0x10325476;
md->totalN = 0;
md->tail_len = 0;
2010-08-18 19:41:45 +00:00
md->finalized = 0;
2002-03-26 14:46:43 +00:00
}
static
void mdfour_tail(const unsigned char *in, size_t n)
2002-03-26 14:46:43 +00:00
{
unsigned char buf[128] = { 0 };
uint32_t M[16];
uint32_t b;
2002-03-26 14:46:43 +00:00
m->totalN += n;
b = m->totalN * 8;
if (n) memcpy(buf, in, n);
buf[n] = 0x80;
if (n <= 55) {
copy4(buf+56, b);
copy64(M, buf);
mdfour64(M);
} else {
2009-11-07 08:09:39 +00:00
copy4(buf+120, b);
2002-03-26 14:46:43 +00:00
copy64(M, buf);
mdfour64(M);
copy64(M, buf+64);
mdfour64(M);
}
}
void
mdfour_update(struct mdfour *md, const unsigned char *in, size_t n)
2002-03-26 14:46:43 +00:00
{
uint32_t M[16];
2002-03-26 14:46:43 +00:00
#ifdef CCACHE_DEBUG_HASH
if (getenv("CCACHE_DEBUG_HASH")) {
FILE* f = fopen("ccache-debug-hash.bin", "a");
fwrite(in, 1, n, f);
fclose(f);
}
#endif
2002-03-26 14:46:43 +00:00
m = md;
if (in == NULL) {
2010-08-18 19:41:45 +00:00
if (!md->finalized) {
mdfour_tail(md->tail, md->tail_len);
md->finalized = 1;
}
return;
}
if (md->tail_len) {
size_t len = 64 - md->tail_len;
if (len > n) len = n;
memcpy(md->tail+md->tail_len, in, len);
md->tail_len += len;
n -= len;
in += len;
if (md->tail_len == 64) {
copy64(M, md->tail);
mdfour64(M);
m->totalN += 64;
md->tail_len = 0;
}
}
2002-03-26 14:46:43 +00:00
while (n >= 64) {
copy64(M, in);
mdfour64(M);
in += 64;
n -= 64;
m->totalN += 64;
}
if (n) {
memcpy(md->tail, in, n);
md->tail_len = n;
}
2002-03-26 14:46:43 +00:00
}
void
mdfour_result(struct mdfour *md, unsigned char *out)
2002-03-26 14:46:43 +00:00
{
copy4(out, md->A);
copy4(out+4, md->B);
copy4(out+8, md->C);
copy4(out+12, md->D);
2002-03-26 14:46:43 +00:00
}