2 * Copyright (C) 1997-1998 Andrew Tridgell
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 3 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 /* NOTE: This code makes no attempt to be fast! */
23 static struct mdfour *m;
25 #define MASK32 (0xffffffff)
27 #define F(X,Y,Z) ((((X)&(Y)) | ((~(X))&(Z))))
28 #define G(X,Y,Z) ((((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z))))
29 #define H(X,Y,Z) (((X)^(Y)^(Z)))
30 #define lshift(x,s) (((((x)<<(s))&MASK32) | (((x)>>(32-(s)))&MASK32)))
32 #define ROUND1(a,b,c,d,k,s) a = lshift((a + F(b,c,d) + M[k])&MASK32, s)
33 #define ROUND2(a,b,c,d,k,s) a = lshift((a + G(b,c,d) + M[k] + 0x5A827999)&MASK32,s)
34 #define ROUND3(a,b,c,d,k,s) a = lshift((a + H(b,c,d) + M[k] + 0x6ED9EBA1)&MASK32,s)
36 /* this applies md4 to 64 byte chunks */
40 uint32_t AA, BB, CC, DD;
43 A = m->A; B = m->B; C = m->C; D = m->D;
44 AA = A; BB = B; CC = C; DD = D;
46 ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7);
47 ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19);
48 ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7);
49 ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19);
50 ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7);
51 ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19);
52 ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7);
53 ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19);
56 ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5);
57 ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13);
58 ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5);
59 ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13);
60 ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5);
61 ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13);
62 ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5);
63 ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13);
65 ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9);
66 ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15);
67 ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9);
68 ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15);
69 ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9);
70 ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15);
71 ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9);
72 ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15);
77 A &= MASK32; B &= MASK32;
78 C &= MASK32; D &= MASK32;
80 m->A = A; m->B = B; m->C = C; m->D = D;
84 copy64(uint32_t *M, const unsigned char *in)
88 for (i = 0; i < 16; i++)
89 M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
90 (in[i*4+1]<<8) | (in[i*4+0]<<0);
94 copy4(unsigned char *out, uint32_t x)
98 out[2] = (x>>16)&0xFF;
99 out[3] = (x>>24)&0xFF;
103 mdfour_begin(struct mdfour *md)
115 void mdfour_tail(const unsigned char *in, size_t n)
117 unsigned char buf[128] = { 0 };
125 if (n) memcpy(buf, in, n);
142 mdfour_update(struct mdfour *md, const unsigned char *in, size_t n)
146 #ifdef CCACHE_DEBUG_HASH
147 if (getenv("CCACHE_DEBUG_HASH")) {
148 FILE* f = fopen("ccache-debug-hash.bin", "a");
157 if (!md->finalized) {
158 mdfour_tail(md->tail, md->tail_len);
165 size_t len = 64 - md->tail_len;
166 if (len > n) len = n;
167 memcpy(md->tail+md->tail_len, in, len);
171 if (md->tail_len == 64) {
188 memcpy(md->tail, in, n);
194 mdfour_result(struct mdfour *md, unsigned char *out)
199 copy4(out+12, md->D);