4 * Copyright (C) 2012 Eric Biggers
6 * Parts of this file are based on public domain code written by Steve Reid.
8 * wimlib - Library for working with WIM files
10 * This library is free software; you can redistribute it and/or modify it under
11 * the terms of the GNU Lesser General Public License as published by the Free
12 * Software Foundation; either version 2.1 of the License, or (at your option) any
15 * This library is distributed in the hope that it will be useful, but WITHOUT ANY
16 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
17 * PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public License along
20 * with this library; if not, write to the Free Software Foundation, Inc., 59
21 * Temple Place, Suite 330, Boston, MA 02111-1307 USA
27 #include "endianness.h"
30 /* The SHA1 support in wimlib can use an external libcrypto (part of openssl) or
31 * use a built-in SHA1 function. The built-in functions are either based on
32 * Steve Reid's public domain code, or based on Intel's SSSE3 SHA1 code.
35 const u8 empty_file_sha1sum[SHA1_HASH_SIZE] = {
36 0xda, 0x39, 0xa3, 0xee, 0x5e, 0x6b, 0x4b, 0x0d, 0x32, 0x55,
37 0xbf, 0xef, 0x95, 0x60, 0x18, 0x90, 0xaf, 0xd8, 0x07, 0x09,
43 #define sha1_init SHA1_Init
44 #define sha1_update SHA1_Update
45 #define sha1_final SHA1_Final
47 #else /* WITH_LIBCRYPTO */
55 #ifdef ENABLE_SSSE3_SHA1
56 extern void sha1_update_intel(int *hash, const char* input, size_t num_blocks);
58 static inline void sha1_update(SHA_CTX *context, const void *data, size_t len)
60 sha1_update_intel((int*)&context->state, data, len / 64);
61 size_t j = (context->count[0] >> 3) & 63;
62 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
63 context->count[1] += (len >> 29);
67 void ssse3_not_found()
70 "Cannot calculate SHA1 message digest: CPU does not support SSSE3\n"
71 "instructions! Recompile wimlib without the --enable-ssse3-sha1 flag\n"
72 "to use wimlib on this CPU.\n");
77 /* Initialize new context */
78 static void sha1_init(SHA_CTX* context)
80 /* SHA1 initialization constants */
81 context->state[0] = 0x67452301;
82 context->state[1] = 0xEFCDAB89;
83 context->state[2] = 0x98BADCFE;
84 context->state[3] = 0x10325476;
85 context->state[4] = 0xC3D2E1F0;
86 context->count[0] = context->count[1] = 0;
89 #ifndef ENABLE_SSSE3_SHA1
91 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
93 /* blk0() and blk() perform the initial expand. */
94 /* I got the idea of expanding during the round function from SSLeay */
95 /* FIXME: can we do this in an endian-proof way? */
96 #ifdef WORDS_BIGENDIAN
97 #define blk0(i) block->l[i]
99 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
100 |(rol(block->l[i],8)&0x00FF00FF))
102 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
103 ^block->l[(i+2)&15]^block->l[i&15],1))
105 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
106 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
107 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
108 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
109 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
110 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
112 /* Hash a single 512-bit block. This is the core of the algorithm. */
113 static void sha1_transform(u32 state[5], const u8 buffer[64])
123 block = (CHAR64LONG16*)workspace;
124 memcpy(block, buffer, 64);
126 /* Copy context->state[] to working vars */
133 /* 4 rounds of 20 operations each. Loop unrolled. */
134 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);
135 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);
136 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);
137 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);
138 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);
139 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);
140 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);
141 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);
142 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);
143 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);
144 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);
145 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);
146 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);
147 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);
148 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);
149 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);
150 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);
151 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);
152 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);
153 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);
155 /* Add the working vars back into context.state[] */
163 /* Run your data through this. */
164 static void sha1_update(SHA_CTX* context, const u8* data, const size_t len)
168 j = (context->count[0] >> 3) & 63;
169 if ((context->count[0] += len << 3) < (len << 3))
171 context->count[1] += (len >> 29);
172 if ((j + len) > 63) {
174 memcpy(&context->buffer[j], data, i);
175 sha1_transform(context->state, context->buffer);
176 for ( ; i + 63 < len; i += 64)
177 sha1_transform(context->state, data + i);
182 memcpy(&context->buffer[j], &data[i], len - i);
186 /* Add padding and return the message digest. */
187 static void sha1_final(u8 *md, SHA_CTX* context)
192 for (i = 0; i < 8; i++) {
193 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
194 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
196 sha1_update(context, (u8 *)"\200", 1);
197 while ((context->count[0] & 504) != 448) {
198 sha1_update(context, (u8 *)"\0", 1);
200 sha1_update(context, finalcount, 8); /* Should cause a SHA1_Transform() */
201 for (i = 0; i < SHA1_HASH_SIZE; i++) {
202 md[i] = (u8)((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
206 void sha1_buffer(const void *buffer, size_t len, void *md)
210 sha1_update(&ctx, buffer, len);
211 sha1_final(md, &ctx);
214 #endif /* WITH_LIBCRYPTO */
216 static int sha1_stream(FILE *fp, void *md)
218 char buf[BUFFER_SIZE];
223 bytes_read = fread(buf, 1, sizeof(buf), fp);
224 sha1_update(&ctx, buf, bytes_read);
225 if (bytes_read < sizeof(buf)) {
227 return WIMLIB_ERR_READ;
231 sha1_final(md, &ctx);
236 /* Calculates the SHA1 message digest given the name of a file. @md must point
237 * to a buffer of length 20 bytes into which the message digest is written.
239 int sha1sum(const char *filename, void *md)
244 fp = fopen(filename, "rb");
246 ERROR("Cannot open the file `%s' for reading: %m\n", filename);
247 return WIMLIB_ERR_OPEN;
249 ret = sha1_stream(fp, md);