openMSX
utils/sha1.cc
Go to the documentation of this file.
1 /*
2 Based on:
3 100% free public domain implementation of the SHA-1 algorithm
4 by Dominik Reichl <Dominik.Reichl@tiscali.de>
5 
6 Refactored in C++ style as part of openMSX
7 by Maarten ter Huurne and Wouter Vermaelen.
8 
9 === Test Vectors (from FIPS PUB 180-1) ===
10 
11 "abc"
12 A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
13 
14 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
15 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
16 
17 A million repetitions of "a"
18 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
19 */
20 
21 #include "sha1.hh"
22 #include "MSXException.hh"
23 #include "endian.hh"
24 #include "likely.hh"
25 #include <cassert>
26 #include <cstring>
27 #ifdef __SSE2__
28 #include <emmintrin.h> // SSE2
29 #endif
30 
31 using std::string;
32 
33 namespace openmsx {
34 
35 // Rotate x bits to the left
36 inline static uint32_t rol32(uint32_t value, int bits)
37 {
38  return (value << bits) | (value >> (32 - bits));
39 }
40 
42 private:
43  uint32_t data[16];
44 
45  uint32_t next0(int i)
46  {
47  data[i] = Endian::readB32(&data[i]);
48  return data[i];
49  }
50  uint32_t next(int i)
51  {
52  return data[i & 15] = rol32(
53  data[(i + 13) & 15] ^ data[(i + 8) & 15] ^
54  data[(i + 2) & 15] ^ data[ i & 15]
55  , 1);
56  }
57 
58 public:
59  explicit WorkspaceBlock(const uint8_t buffer[64]);
60 
61  // SHA-1 rounds
62  void r0(uint32_t v, uint32_t& w, uint32_t x, uint32_t y, uint32_t& z, int i)
63  {
64  z += ((w & (x ^ y)) ^ y) + next0(i) + 0x5A827999 + rol32(v, 5);
65  w = rol32(w, 30);
66  }
67  void r1(uint32_t v, uint32_t& w, uint32_t x, uint32_t y, uint32_t& z, int i)
68  {
69  z += ((w & (x ^ y)) ^ y) + next(i) + 0x5A827999 + rol32(v, 5);
70  w = rol32(w, 30);
71  }
72  void r2(uint32_t v, uint32_t& w, uint32_t x, uint32_t y, uint32_t& z, int i)
73  {
74  z += (w ^ x ^ y) + next(i) + 0x6ED9EBA1 + rol32(v, 5);
75  w = rol32(w, 30);
76  }
77  void r3(uint32_t v, uint32_t& w, uint32_t x, uint32_t y, uint32_t& z, int i)
78  {
79  z += (((w | x) & y) | (w & x)) + next(i) + 0x8F1BBCDC + rol32(v, 5);
80  w = rol32(w, 30);
81  }
82  void r4(uint32_t v, uint32_t& w, uint32_t x, uint32_t y, uint32_t& z, int i)
83  {
84  z += (w ^ x ^ y) + next(i) + 0xCA62C1D6 + rol32(v, 5);
85  w = rol32(w, 30);
86  }
87 };
88 
89 WorkspaceBlock::WorkspaceBlock(const uint8_t buffer[64])
90 {
91  memcpy(data, buffer, sizeof(data));
92 }
93 
94 
95 // class Sha1Sum
96 
98 {
99  clear();
100 }
101 
103 {
104  if (hex.size() != 40) {
105  throw MSXException("Invalid sha1, should be exactly 40 digits long: ", hex);
106  }
107  parse40(hex.data());
108 }
109 
110 #ifdef __SSE2__
111 // emulate some missing unsigned-8-bit comparison functions
112 static inline __m128i _mm_cmpge_epu8(__m128i a, __m128i b)
113 {
114  return _mm_cmpeq_epi8(_mm_max_epu8(a, b), a);
115 }
116 
117 static inline __m128i _mm_cmple_epu8(__m128i a, __m128i b)
118 {
119  return _mm_cmpge_epu8(b, a);
120 }
121 
122 // load 64-bit (possibly unaligned) and swap bytes
123 static inline uint64_t loadSwap64(const char* s)
124 {
125  return Endian::bswap64(*reinterpret_cast<const uint64_t*>(s));
126 }
127 
128 #else
129 
130 static inline unsigned hex(char x, const char* str)
131 {
132  if (('0' <= x) && (x <= '9')) return x - '0';
133  if (('a' <= x) && (x <= 'f')) return x - 'a' + 10;
134  if (('A' <= x) && (x <= 'F')) return x - 'A' + 10;
135  throw MSXException("Invalid sha1, digits should be 0-9, a-f: ",
136  string_view(str, 40));
137 }
138 #endif
139 
140 void Sha1Sum::parse40(const char* str)
141 {
142 #ifdef __SSE2__
143  // SSE2 version
144 
145  // load characters
146  __m128i s0 = _mm_set_epi64x(loadSwap64(str + 8), loadSwap64(str + 0));
147  __m128i s1 = _mm_set_epi64x(loadSwap64(str + 24), loadSwap64(str + 16));
148  __m128i s2 = _mm_set_epi64x('0' * 0x0101010101010101, loadSwap64(str + 32));
149 
150  // chars - '0'
151  __m128i cc0 = _mm_set1_epi8(char(-'0'));
152  __m128i s0_0 = _mm_add_epi8(s0, cc0);
153  __m128i s1_0 = _mm_add_epi8(s1, cc0);
154  __m128i s2_0 = _mm_add_epi8(s2, cc0);
155 
156  // (chars | 32) - 'a' (convert uppercase 'A'-'F' into lower case)
157  __m128i c32 = _mm_set1_epi8(32);
158  __m128i cca = _mm_set1_epi8(char(-'a'));
159  __m128i s0_a = _mm_add_epi8(_mm_or_si128(s0, c32), cca);
160  __m128i s1_a = _mm_add_epi8(_mm_or_si128(s1, c32), cca);
161  __m128i s2_a = _mm_add_epi8(_mm_or_si128(s2, c32), cca);
162 
163  // was in range '0'-'9'?
164  __m128i c9 = _mm_set1_epi8(9);
165  __m128i c0_0 = _mm_cmple_epu8(s0_0, c9);
166  __m128i c1_0 = _mm_cmple_epu8(s1_0, c9);
167  __m128i c2_0 = _mm_cmple_epu8(s2_0, c9);
168 
169  // was in range 'a'-'f'?
170  __m128i c5 = _mm_set1_epi8(5);
171  __m128i c0_a = _mm_cmple_epu8(s0_a, c5);
172  __m128i c1_a = _mm_cmple_epu8(s1_a, c5);
173  __m128i c2_a = _mm_cmple_epu8(s2_a, c5);
174 
175  // either '0'-'9' or 'a'-f' must be in range for all chars
176  __m128i ok0 = _mm_or_si128(c0_0, c0_a);
177  __m128i ok1 = _mm_or_si128(c1_0, c1_a);
178  __m128i ok2 = _mm_or_si128(c2_0, c2_a);
179  __m128i ok = _mm_and_si128(_mm_and_si128(ok0, ok1), ok2);
180  if (unlikely(_mm_movemask_epi8(ok) != 0xffff)) {
181  throw MSXException("Invalid sha1, digits should be 0-9, a-f: ",
182  string_view(str, 40));
183  }
184 
185  // '0'-'9' to numeric value (or zero)
186  __m128i d0_0 = _mm_and_si128(s0_0, c0_0);
187  __m128i d1_0 = _mm_and_si128(s1_0, c1_0);
188  __m128i d2_0 = _mm_and_si128(s2_0, c2_0);
189 
190  // 'a'-'f' to numeric value (or zero)
191  __m128i c10 = _mm_set1_epi8(10);
192  __m128i d0_a = _mm_and_si128(_mm_add_epi8(s0_a, c10), c0_a);
193  __m128i d1_a = _mm_and_si128(_mm_add_epi8(s1_a, c10), c1_a);
194  __m128i d2_a = _mm_and_si128(_mm_add_epi8(s2_a, c10), c2_a);
195 
196  // combine 0-9 / 10-15 into 0-15
197  __m128i d0 = _mm_or_si128(d0_0, d0_a);
198  __m128i d1 = _mm_or_si128(d1_0, d1_a);
199  __m128i d2 = _mm_or_si128(d2_0, d2_a);
200 
201  // compact bytes to nibbles
202  __m128i c00ff = _mm_set1_epi16(0x00ff);
203  __m128i e0 = _mm_and_si128(_mm_or_si128(d0, _mm_srli_epi16(d0, 4)), c00ff);
204  __m128i e1 = _mm_and_si128(_mm_or_si128(d1, _mm_srli_epi16(d1, 4)), c00ff);
205  __m128i e2 = _mm_and_si128(_mm_or_si128(d2, _mm_srli_epi16(d2, 4)), c00ff);
206  __m128i f0 = _mm_packus_epi16(e0, e0);
207  __m128i f1 = _mm_packus_epi16(e1, e1);
208  __m128i f2 = _mm_packus_epi16(e2, e2);
209 
210  // store result
211  _mm_storeu_si128(reinterpret_cast<__m128i*>(a), _mm_unpacklo_epi64(f0, f1));
212  a[4] = _mm_cvtsi128_si32(f2);
213 #else
214  // equivalent c++ version
215  const char* p = str;
216  for (auto& ai : a) {
217  unsigned t = 0;
218  for (int j = 0; j < 8; ++j) {
219  t <<= 4;
220  t |= hex(*p++, str);
221  }
222  ai = t;
223  }
224 #endif
225 }
226 
227 static inline char digit(unsigned x)
228 {
229  return (x < 10) ? (x + '0') : (x - 10 + 'a');
230 }
231 std::string Sha1Sum::toString() const
232 {
233  char buf[40];
234  char* p = buf;
235  for (const auto& ai : a) {
236  for (int j = 28; j >= 0; j -= 4) {
237  *p++ = digit((ai >> j) & 0xf);
238  }
239  }
240  return string(buf, 40);
241 }
242 
243 bool Sha1Sum::empty() const
244 {
245  for (const auto& ai : a) {
246  if (ai != 0) return false;
247  }
248  return true;
249 }
251 {
252  for (auto& ai : a) ai = 0;
253 }
254 
255 
256 // class SHA1
257 
259 {
260  // SHA1 initialization constants
261  m_state.a[0] = 0x67452301;
262  m_state.a[1] = 0xEFCDAB89;
263  m_state.a[2] = 0x98BADCFE;
264  m_state.a[3] = 0x10325476;
265  m_state.a[4] = 0xC3D2E1F0;
266 
267  m_count = 0;
268  m_finalized = false;
269 }
270 
271 void SHA1::transform(const uint8_t buffer[64])
272 {
273  WorkspaceBlock block(buffer);
274 
275  // Copy m_state[] to working vars
276  uint32_t a = m_state.a[0];
277  uint32_t b = m_state.a[1];
278  uint32_t c = m_state.a[2];
279  uint32_t d = m_state.a[3];
280  uint32_t e = m_state.a[4];
281 
282  // 4 rounds of 20 operations each. Loop unrolled
283  block.r0(a,b,c,d,e, 0); block.r0(e,a,b,c,d, 1); block.r0(d,e,a,b,c, 2);
284  block.r0(c,d,e,a,b, 3); block.r0(b,c,d,e,a, 4); block.r0(a,b,c,d,e, 5);
285  block.r0(e,a,b,c,d, 6); block.r0(d,e,a,b,c, 7); block.r0(c,d,e,a,b, 8);
286  block.r0(b,c,d,e,a, 9); block.r0(a,b,c,d,e,10); block.r0(e,a,b,c,d,11);
287  block.r0(d,e,a,b,c,12); block.r0(c,d,e,a,b,13); block.r0(b,c,d,e,a,14);
288  block.r0(a,b,c,d,e,15); block.r1(e,a,b,c,d,16); block.r1(d,e,a,b,c,17);
289  block.r1(c,d,e,a,b,18); block.r1(b,c,d,e,a,19); block.r2(a,b,c,d,e,20);
290  block.r2(e,a,b,c,d,21); block.r2(d,e,a,b,c,22); block.r2(c,d,e,a,b,23);
291  block.r2(b,c,d,e,a,24); block.r2(a,b,c,d,e,25); block.r2(e,a,b,c,d,26);
292  block.r2(d,e,a,b,c,27); block.r2(c,d,e,a,b,28); block.r2(b,c,d,e,a,29);
293  block.r2(a,b,c,d,e,30); block.r2(e,a,b,c,d,31); block.r2(d,e,a,b,c,32);
294  block.r2(c,d,e,a,b,33); block.r2(b,c,d,e,a,34); block.r2(a,b,c,d,e,35);
295  block.r2(e,a,b,c,d,36); block.r2(d,e,a,b,c,37); block.r2(c,d,e,a,b,38);
296  block.r2(b,c,d,e,a,39); block.r3(a,b,c,d,e,40); block.r3(e,a,b,c,d,41);
297  block.r3(d,e,a,b,c,42); block.r3(c,d,e,a,b,43); block.r3(b,c,d,e,a,44);
298  block.r3(a,b,c,d,e,45); block.r3(e,a,b,c,d,46); block.r3(d,e,a,b,c,47);
299  block.r3(c,d,e,a,b,48); block.r3(b,c,d,e,a,49); block.r3(a,b,c,d,e,50);
300  block.r3(e,a,b,c,d,51); block.r3(d,e,a,b,c,52); block.r3(c,d,e,a,b,53);
301  block.r3(b,c,d,e,a,54); block.r3(a,b,c,d,e,55); block.r3(e,a,b,c,d,56);
302  block.r3(d,e,a,b,c,57); block.r3(c,d,e,a,b,58); block.r3(b,c,d,e,a,59);
303  block.r4(a,b,c,d,e,60); block.r4(e,a,b,c,d,61); block.r4(d,e,a,b,c,62);
304  block.r4(c,d,e,a,b,63); block.r4(b,c,d,e,a,64); block.r4(a,b,c,d,e,65);
305  block.r4(e,a,b,c,d,66); block.r4(d,e,a,b,c,67); block.r4(c,d,e,a,b,68);
306  block.r4(b,c,d,e,a,69); block.r4(a,b,c,d,e,70); block.r4(e,a,b,c,d,71);
307  block.r4(d,e,a,b,c,72); block.r4(c,d,e,a,b,73); block.r4(b,c,d,e,a,74);
308  block.r4(a,b,c,d,e,75); block.r4(e,a,b,c,d,76); block.r4(d,e,a,b,c,77);
309  block.r4(c,d,e,a,b,78); block.r4(b,c,d,e,a,79);
310 
311  // Add the working vars back into m_state[]
312  m_state.a[0] += a;
313  m_state.a[1] += b;
314  m_state.a[2] += c;
315  m_state.a[3] += d;
316  m_state.a[4] += e;
317 }
318 
319 // Use this function to hash in binary data and strings
320 void SHA1::update(const uint8_t* data, size_t len)
321 {
322  assert(!m_finalized);
323  uint32_t j = (m_count >> 3) & 63;
324 
325  m_count += uint64_t(len) << 3;
326 
327  size_t i;
328  if ((j + len) > 63) {
329  memcpy(&m_buffer[j], data, (i = 64 - j));
330  transform(m_buffer);
331  for (; i + 63 < len; i += 64) {
332  transform(&data[i]);
333  }
334  j = 0;
335  } else {
336  i = 0;
337  }
338  memcpy(&m_buffer[j], &data[i], len - i);
339 }
340 
341 void SHA1::finalize()
342 {
343  assert(!m_finalized);
344  uint8_t finalcount[8] = { 0, 0, 0, 0, 0, 0, 0, 0 };
345  for (int i = 0; i < 8; i++) {
346  finalcount[i] = uint8_t(m_count >> ((7 - i) * 8));
347  }
348 
349  update(reinterpret_cast<const uint8_t*>("\200"), 1);
350  while ((m_count & 504) != 448) {
351  update(reinterpret_cast<const uint8_t*>("\0"), 1);
352  }
353  update(finalcount, 8); // cause a transform()
354  m_finalized = true;
355 }
356 
358 {
359  if (!m_finalized) finalize();
360  return m_state;
361 }
362 
363 Sha1Sum SHA1::calc(const uint8_t* data, size_t len)
364 {
365  SHA1 sha1;
366  sha1.update(data, len);
367  return sha1.digest();
368 }
369 
370 } // namespace openmsx
const char * data() const
Definition: string_view.hh:65
void update(const uint8_t *data, size_t len)
Incrementally calculate the hash value.
Definition: utils/sha1.cc:320
void r0(uint32_t v, uint32_t &w, uint32_t x, uint32_t y, uint32_t &z, int i)
Definition: utils/sha1.cc:62
#define unlikely(x)
Definition: likely.hh:15
void r4(uint32_t v, uint32_t &w, uint32_t x, uint32_t y, uint32_t &z, int i)
Definition: utils/sha1.cc:82
WorkspaceBlock(const uint8_t buffer[64])
Definition: utils/sha1.cc:89
static Sha1Sum calc(const uint8_t *data, size_t len)
Easier to use interface, if you can pass all data in one go.
Definition: utils/sha1.cc:363
void r2(uint32_t v, uint32_t &w, uint32_t x, uint32_t y, uint32_t &z, int i)
Definition: utils/sha1.cc:72
bool empty() const
Definition: utils/sha1.cc:243
This class represents the result of a sha1 calculation (a 160-bit value).
Definition: sha1.hh:19
Sha1Sum digest()
Get the final hash.
Definition: utils/sha1.cc:357
Thanks to enen for testing this on a real cartridge:
Definition: Autofire.cc:5
Helper class to perform a sha1 calculation.
Definition: sha1.hh:78
std::string toString() const
Definition: utils/sha1.cc:231
This class implements a (close approximation) of the std::string_view class.
Definition: string_view.hh:15
void parse40(const char *str)
Parse from a 40-character long buffer.
Definition: utils/sha1.cc:140
void r3(uint32_t v, uint32_t &w, uint32_t x, uint32_t y, uint32_t &z, int i)
Definition: utils/sha1.cc:77
size_type size() const
Definition: string_view.hh:52
void r1(uint32_t v, uint32_t &w, uint32_t x, uint32_t y, uint32_t &z, int i)
Definition: utils/sha1.cc:67