4 * Parts of this file are based on public domain code written by Steve Reid.
8 * Copyright (C) 2012, 2013 Eric Biggers
10 * This file is part of wimlib, a library for working with WIM files.
12 * wimlib is free software; you can redistribute it and/or modify it under the
13 * terms of the GNU General Public License as published by the Free
14 * Software Foundation; either version 3 of the License, or (at your option)
17 * wimlib is distributed in the hope that it will be useful, but WITHOUT ANY
18 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
19 * A PARTICULAR PURPOSE. See the GNU General Public License for more
22 * You should have received a copy of the GNU General Public License
23 * along with wimlib; if not, see http://www.gnu.org/licenses/.
29 #include "endianness.h"
32 /* The SHA1 support in wimlib can use an external libcrypto (part of openssl) or
33 * use a built-in SHA1 function. The built-in functions are either based on
34 * Steve Reid's public domain code, or based on Intel's SSSE3 SHA1 code.
37 const u8 zero_hash[SHA1_HASH_SIZE] = {
45 #ifndef WITH_LIBCRYPTO
47 /* Initialize new context */
48 void sha1_init(SHA_CTX* context)
50 /* SHA1 initialization constants */
51 context->state[0] = 0x67452301;
52 context->state[1] = 0xEFCDAB89;
53 context->state[2] = 0x98BADCFE;
54 context->state[3] = 0x10325476;
55 context->state[4] = 0xC3D2E1F0;
56 context->count[0] = context->count[1] = 0;
59 #ifdef ENABLE_SSSE3_SHA1
60 extern void sha1_update_intel(int *hash, const char* input, size_t num_blocks);
62 void sha1_update(SHA_CTX *context, const u8 data[], size_t len)
64 sha1_update_intel((int*)&context->state, data, len / 64);
65 size_t j = (context->count[0] >> 3) & 63;
66 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
67 context->count[1] += (len >> 29);
70 void ssse3_not_found()
73 "Cannot calculate SHA1 message digest: CPU does not support SSSE3\n"
74 "instructions! Recompile wimlib without the --enable-ssse3-sha1 flag\n"
75 "to use wimlib on this CPU.\n");
78 #else /* ENABLE_SSSE3_SHA1 */
80 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
82 /* blk0() and blk() perform the initial expand. */
83 /* I got the idea of expanding during the round function from SSLeay */
84 /* FIXME: can we do this in an endian-proof way? */
85 #ifdef WORDS_BIGENDIAN
86 #define blk0(i) block->l[i]
88 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
89 |(rol(block->l[i],8)&0x00FF00FF))
91 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
92 ^block->l[(i+2)&15]^block->l[i&15],1))
94 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
95 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
96 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
97 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
98 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
99 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
101 /* Hash a single 512-bit block. This is the core of the algorithm. */
102 static void sha1_transform(u32 state[5], const u8 buffer[64])
112 block = (CHAR64LONG16*)workspace;
113 memcpy(block, buffer, 64);
115 /* Copy context->state[] to working vars */
122 /* 4 rounds of 20 operations each. Loop unrolled. */
123 R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
124 R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
125 R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
126 R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
127 R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
128 R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
129 R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
130 R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
131 R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
132 R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
133 R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
134 R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
135 R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
136 R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
137 R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
138 R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
139 R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
140 R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
141 R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
142 R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
144 /* Add the working vars back into context.state[] */
152 void sha1_update(SHA_CTX* context, const u8 data[], const size_t len)
156 j = (context->count[0] >> 3) & 63;
157 if ((context->count[0] += len << 3) < (len << 3))
159 context->count[1] += (len >> 29);
160 if ((j + len) > 63) {
162 memcpy(&context->buffer[j], data, i);
163 sha1_transform(context->state, context->buffer);
164 for ( ; i + 63 < len; i += 64)
165 sha1_transform(context->state, data + i);
170 memcpy(&context->buffer[j], &data[i], len - i);
173 #endif /* !ENABLE_SSSE3_SHA1 */
175 /* Add padding and return the message digest. */
176 void sha1_final(u8 md[SHA1_HASH_SIZE], SHA_CTX* context)
181 for (i = 0; i < 8; i++) {
182 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
183 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
185 sha1_update(context, (u8 *)"\200", 1);
186 while ((context->count[0] & 504) != 448) {
187 sha1_update(context, (u8 *)"\0", 1);
189 sha1_update(context, finalcount, 8); /* Should cause a sha1_transform() */
190 for (i = 0; i < SHA1_HASH_SIZE; i++) {
191 md[i] = (u8)((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
195 void sha1_buffer(const u8 buffer[], size_t len, u8 md[SHA1_HASH_SIZE])
199 sha1_update(&ctx, buffer, len);
200 sha1_final(md, &ctx);
203 #endif /* !WITH_LIBCRYPTO */
205 static int sha1_stream(FILE *fp, u8 md[SHA1_HASH_SIZE])
207 char buf[BUFFER_SIZE];
212 bytes_read = fread(buf, 1, sizeof(buf), fp);
213 sha1_update(&ctx, buf, bytes_read);
214 if (bytes_read < sizeof(buf)) {
216 return WIMLIB_ERR_READ;
220 sha1_final(md, &ctx);
225 /* Calculates the SHA1 message digest of a file. @md must point to a buffer of
226 * length 20 bytes into which the message digest is written. */
228 sha1sum(const mbchar *filename, u8 md[SHA1_HASH_SIZE])
233 fp = fopen(filename, "rb");
235 ERROR_WITH_ERRNO("Cannot open the file `%s' for reading",
237 return WIMLIB_ERR_OPEN;
239 ret = sha1_stream(fp, md);
241 ERROR_WITH_ERRNO("Error calculating SHA1 message digest of "