4 * Parts of this file are based on public domain code written by Steve Reid.
8 * Copyright (C) 2012 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 Lesser General Public License as published by the Free
14 * Software Foundation; either version 2.1 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 Lesser General Public License for more
22 * You should have received a copy of the GNU Lesser 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 empty_file_sha1sum[SHA1_HASH_SIZE] = {
38 0xda, 0x39, 0xa3, 0xee, 0x5e, 0x6b, 0x4b, 0x0d, 0x32, 0x55,
39 0xbf, 0xef, 0x95, 0x60, 0x18, 0x90, 0xaf, 0xd8, 0x07, 0x09,
45 #define sha1_init SHA1_Init
46 #define sha1_update SHA1_Update
47 #define sha1_final SHA1_Final
49 #else /* WITH_LIBCRYPTO */
57 #ifdef ENABLE_SSSE3_SHA1
58 extern void sha1_update_intel(int *hash, const char* input, size_t num_blocks);
60 static inline void sha1_update(SHA_CTX *context, const void *data, size_t len)
62 sha1_update_intel((int*)&context->state, data, len / 64);
63 size_t j = (context->count[0] >> 3) & 63;
64 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
65 context->count[1] += (len >> 29);
69 void ssse3_not_found()
72 "Cannot calculate SHA1 message digest: CPU does not support SSSE3\n"
73 "instructions! Recompile wimlib without the --enable-ssse3-sha1 flag\n"
74 "to use wimlib on this CPU.\n");
79 /* Initialize new context */
80 static void sha1_init(SHA_CTX* context)
82 /* SHA1 initialization constants */
83 context->state[0] = 0x67452301;
84 context->state[1] = 0xEFCDAB89;
85 context->state[2] = 0x98BADCFE;
86 context->state[3] = 0x10325476;
87 context->state[4] = 0xC3D2E1F0;
88 context->count[0] = context->count[1] = 0;
91 #ifndef ENABLE_SSSE3_SHA1
93 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
95 /* blk0() and blk() perform the initial expand. */
96 /* I got the idea of expanding during the round function from SSLeay */
97 /* FIXME: can we do this in an endian-proof way? */
98 #ifdef WORDS_BIGENDIAN
99 #define blk0(i) block->l[i]
101 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
102 |(rol(block->l[i],8)&0x00FF00FF))
104 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
105 ^block->l[(i+2)&15]^block->l[i&15],1))
107 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
108 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
109 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
110 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
111 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
112 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
114 /* Hash a single 512-bit block. This is the core of the algorithm. */
115 static void sha1_transform(u32 state[5], const u8 buffer[64])
125 block = (CHAR64LONG16*)workspace;
126 memcpy(block, buffer, 64);
128 /* Copy context->state[] to working vars */
135 /* 4 rounds of 20 operations each. Loop unrolled. */
136 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);
137 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);
138 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);
139 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);
140 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);
141 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);
142 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);
143 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);
144 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);
145 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);
146 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);
147 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);
148 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);
149 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);
150 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);
151 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);
152 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);
153 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);
154 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);
155 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);
157 /* Add the working vars back into context.state[] */
165 /* Run your data through this. */
166 static void sha1_update(SHA_CTX* context, const u8* data, const size_t len)
170 j = (context->count[0] >> 3) & 63;
171 if ((context->count[0] += len << 3) < (len << 3))
173 context->count[1] += (len >> 29);
174 if ((j + len) > 63) {
176 memcpy(&context->buffer[j], data, i);
177 sha1_transform(context->state, context->buffer);
178 for ( ; i + 63 < len; i += 64)
179 sha1_transform(context->state, data + i);
184 memcpy(&context->buffer[j], &data[i], len - i);
188 /* Add padding and return the message digest. */
189 static void sha1_final(u8 *md, SHA_CTX* context)
194 for (i = 0; i < 8; i++) {
195 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
196 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
198 sha1_update(context, (u8 *)"\200", 1);
199 while ((context->count[0] & 504) != 448) {
200 sha1_update(context, (u8 *)"\0", 1);
202 sha1_update(context, finalcount, 8); /* Should cause a SHA1_Transform() */
203 for (i = 0; i < SHA1_HASH_SIZE; i++) {
204 md[i] = (u8)((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
208 void sha1_buffer(const void *buffer, size_t len, void *md)
212 sha1_update(&ctx, buffer, len);
213 sha1_final(md, &ctx);
216 #endif /* WITH_LIBCRYPTO */
218 static int sha1_stream(FILE *fp, void *md)
220 char buf[BUFFER_SIZE];
225 bytes_read = fread(buf, 1, sizeof(buf), fp);
226 sha1_update(&ctx, buf, bytes_read);
227 if (bytes_read < sizeof(buf)) {
229 return WIMLIB_ERR_READ;
233 sha1_final(md, &ctx);
238 /* Calculates the SHA1 message digest given the name of a file. @md must point
239 * to a buffer of length 20 bytes into which the message digest is written.
241 int sha1sum(const char *filename, void *md)
246 fp = fopen(filename, "rb");
248 ERROR_WITH_ERRNO("Cannot open the file `%s' for reading",
250 return WIMLIB_ERR_OPEN;
252 ret = sha1_stream(fp, md);
254 ERROR_WITH_ERRNO("Error calculating SHA1 message digest of "