The JUCE cross-platform C++ framework, with DISTRHO/KXStudio specific changes
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

310 lines
11KB

  1. /*
  2. ==============================================================================
  3. This file is part of the JUCE library.
  4. Copyright (c) 2017 - ROLI Ltd.
  5. JUCE is an open source library subject to commercial or open-source
  6. licensing.
  7. By using JUCE, you agree to the terms of both the JUCE 5 End-User License
  8. Agreement and JUCE 5 Privacy Policy (both updated and effective as of the
  9. 27th April 2017).
  10. End User License Agreement: www.juce.com/juce-5-licence
  11. Privacy Policy: www.juce.com/juce-5-privacy-policy
  12. Or: You may also use this code under the terms of the GPL v3 (see
  13. www.gnu.org/licenses).
  14. JUCE IS PROVIDED "AS IS" WITHOUT ANY WARRANTY, AND ALL WARRANTIES, WHETHER
  15. EXPRESSED OR IMPLIED, INCLUDING MERCHANTABILITY AND FITNESS FOR PURPOSE, ARE
  16. DISCLAIMED.
  17. ==============================================================================
  18. */
  19. namespace juce
  20. {
  21. struct MD5Generator
  22. {
  23. void processBlock (const void* data, size_t dataSize) noexcept
  24. {
  25. auto bufferPos = ((count[0] >> 3) & 0x3f);
  26. count[0] += (uint32_t) (dataSize << 3);
  27. if (count[0] < ((uint32_t) dataSize << 3))
  28. count[1]++;
  29. count[1] += (uint32_t) (dataSize >> 29);
  30. auto spaceLeft = (size_t) 64 - (size_t) bufferPos;
  31. size_t i = 0;
  32. if (dataSize >= spaceLeft)
  33. {
  34. memcpy (buffer + bufferPos, data, spaceLeft);
  35. transform (buffer);
  36. for (i = spaceLeft; i + 64 <= dataSize; i += 64)
  37. transform (static_cast<const char*> (data) + i);
  38. bufferPos = 0;
  39. }
  40. memcpy (buffer + bufferPos, static_cast<const char*> (data) + i, dataSize - i);
  41. }
  42. void transform (const void* bufferToTransform) noexcept
  43. {
  44. auto a = state[0];
  45. auto b = state[1];
  46. auto c = state[2];
  47. auto d = state[3];
  48. uint32_t x[16];
  49. copyWithEndiannessConversion (x, bufferToTransform, 64);
  50. enum Constants
  51. {
  52. S11 = 7, S12 = 12, S13 = 17, S14 = 22, S21 = 5, S22 = 9, S23 = 14, S24 = 20,
  53. S31 = 4, S32 = 11, S33 = 16, S34 = 23, S41 = 6, S42 = 10, S43 = 15, S44 = 21
  54. };
  55. FF (a, b, c, d, x[ 0], S11, 0xd76aa478); FF (d, a, b, c, x[ 1], S12, 0xe8c7b756);
  56. FF (c, d, a, b, x[ 2], S13, 0x242070db); FF (b, c, d, a, x[ 3], S14, 0xc1bdceee);
  57. FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); FF (d, a, b, c, x[ 5], S12, 0x4787c62a);
  58. FF (c, d, a, b, x[ 6], S13, 0xa8304613); FF (b, c, d, a, x[ 7], S14, 0xfd469501);
  59. FF (a, b, c, d, x[ 8], S11, 0x698098d8); FF (d, a, b, c, x[ 9], S12, 0x8b44f7af);
  60. FF (c, d, a, b, x[10], S13, 0xffff5bb1); FF (b, c, d, a, x[11], S14, 0x895cd7be);
  61. FF (a, b, c, d, x[12], S11, 0x6b901122); FF (d, a, b, c, x[13], S12, 0xfd987193);
  62. FF (c, d, a, b, x[14], S13, 0xa679438e); FF (b, c, d, a, x[15], S14, 0x49b40821);
  63. GG (a, b, c, d, x[ 1], S21, 0xf61e2562); GG (d, a, b, c, x[ 6], S22, 0xc040b340);
  64. GG (c, d, a, b, x[11], S23, 0x265e5a51); GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa);
  65. GG (a, b, c, d, x[ 5], S21, 0xd62f105d); GG (d, a, b, c, x[10], S22, 0x02441453);
  66. GG (c, d, a, b, x[15], S23, 0xd8a1e681); GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8);
  67. GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); GG (d, a, b, c, x[14], S22, 0xc33707d6);
  68. GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); GG (b, c, d, a, x[ 8], S24, 0x455a14ed);
  69. GG (a, b, c, d, x[13], S21, 0xa9e3e905); GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8);
  70. GG (c, d, a, b, x[ 7], S23, 0x676f02d9); GG (b, c, d, a, x[12], S24, 0x8d2a4c8a);
  71. HH (a, b, c, d, x[ 5], S31, 0xfffa3942); HH (d, a, b, c, x[ 8], S32, 0x8771f681);
  72. HH (c, d, a, b, x[11], S33, 0x6d9d6122); HH (b, c, d, a, x[14], S34, 0xfde5380c);
  73. HH (a, b, c, d, x[ 1], S31, 0xa4beea44); HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9);
  74. HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); HH (b, c, d, a, x[10], S34, 0xbebfbc70);
  75. HH (a, b, c, d, x[13], S31, 0x289b7ec6); HH (d, a, b, c, x[ 0], S32, 0xeaa127fa);
  76. HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); HH (b, c, d, a, x[ 6], S34, 0x04881d05);
  77. HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); HH (d, a, b, c, x[12], S32, 0xe6db99e5);
  78. HH (c, d, a, b, x[15], S33, 0x1fa27cf8); HH (b, c, d, a, x[ 2], S34, 0xc4ac5665);
  79. II (a, b, c, d, x[ 0], S41, 0xf4292244); II (d, a, b, c, x[ 7], S42, 0x432aff97);
  80. II (c, d, a, b, x[14], S43, 0xab9423a7); II (b, c, d, a, x[ 5], S44, 0xfc93a039);
  81. II (a, b, c, d, x[12], S41, 0x655b59c3); II (d, a, b, c, x[ 3], S42, 0x8f0ccc92);
  82. II (c, d, a, b, x[10], S43, 0xffeff47d); II (b, c, d, a, x[ 1], S44, 0x85845dd1);
  83. II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); II (d, a, b, c, x[15], S42, 0xfe2ce6e0);
  84. II (c, d, a, b, x[ 6], S43, 0xa3014314); II (b, c, d, a, x[13], S44, 0x4e0811a1);
  85. II (a, b, c, d, x[ 4], S41, 0xf7537e82); II (d, a, b, c, x[11], S42, 0xbd3af235);
  86. II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); II (b, c, d, a, x[ 9], S44, 0xeb86d391);
  87. state[0] += a;
  88. state[1] += b;
  89. state[2] += c;
  90. state[3] += d;
  91. }
  92. void finish (uint8_t* result) noexcept
  93. {
  94. uint8_t encodedLength[8];
  95. copyWithEndiannessConversion (encodedLength, count, 8);
  96. // Pad out to 56 mod 64.
  97. auto index = (count[0] >> 3) & 0x3f;
  98. auto paddingLength = (index < 56 ? 56 : 120) - index;
  99. uint8_t paddingBuffer[64] = { 0x80 }; // first byte is 0x80, remaining bytes are zero.
  100. processBlock (paddingBuffer, (size_t) paddingLength);
  101. processBlock (encodedLength, 8);
  102. copyWithEndiannessConversion (result, state, 16);
  103. }
  104. private:
  105. uint8_t buffer[64] = {};
  106. uint32_t state[4] = { 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476 };
  107. uint32_t count[2] = {};
  108. static void copyWithEndiannessConversion (void* output, const void* input, size_t numBytes) noexcept
  109. {
  110. #if JUCE_LITTLE_ENDIAN
  111. memcpy (output, input, numBytes);
  112. #else
  113. auto dst = static_cast<uint8_t*> (output);
  114. auto src = static_cast<const uint8_t*> (input);
  115. for (size_t i = 0; i < numBytes; i += 4)
  116. {
  117. dst[i + 0] = src[i + 3];
  118. dst[i + 1] = src[i + 2];
  119. dst[i + 2] = src[i + 1];
  120. dst[i + 3] = src[i + 0];
  121. }
  122. #endif
  123. }
  124. static inline uint32_t rotateLeft (uint32_t x, uint32_t n) noexcept { return (x << n) | (x >> (32 - n)); }
  125. static inline uint32_t F (uint32_t x, uint32_t y, uint32_t z) noexcept { return (x & y) | (~x & z); }
  126. static inline uint32_t G (uint32_t x, uint32_t y, uint32_t z) noexcept { return (x & z) | (y & ~z); }
  127. static inline uint32_t H (uint32_t x, uint32_t y, uint32_t z) noexcept { return x ^ y ^ z; }
  128. static inline uint32_t I (uint32_t x, uint32_t y, uint32_t z) noexcept { return y ^ (x | ~z); }
  129. static void FF (uint32_t& a, uint32_t b, uint32_t c, uint32_t d, uint32_t x, uint32_t s, uint32_t ac) noexcept
  130. {
  131. a = rotateLeft (a + F (b, c, d) + x + ac, s) + b;
  132. }
  133. static void GG (uint32_t& a, uint32_t b, uint32_t c, uint32_t d, uint32_t x, uint32_t s, uint32_t ac) noexcept
  134. {
  135. a = rotateLeft (a + G (b, c, d) + x + ac, s) + b;
  136. }
  137. static void HH (uint32_t& a, uint32_t b, uint32_t c, uint32_t d, uint32_t x, uint32_t s, uint32_t ac) noexcept
  138. {
  139. a = rotateLeft (a + H (b, c, d) + x + ac, s) + b;
  140. }
  141. static void II (uint32_t& a, uint32_t b, uint32_t c, uint32_t d, uint32_t x, uint32_t s, uint32_t ac) noexcept
  142. {
  143. a = rotateLeft (a + I (b, c, d) + x + ac, s) + b;
  144. }
  145. };
  146. //==============================================================================
  147. MD5::MD5() = default;
  148. MD5::~MD5() = default;
  149. MD5::MD5 (const MD5&) = default;
  150. MD5& MD5::operator= (const MD5&) = default;
  151. MD5::MD5 (const void* data, size_t numBytes) noexcept
  152. {
  153. MD5Generator generator;
  154. generator.processBlock (data, numBytes);
  155. generator.finish (result);
  156. }
  157. MD5::MD5 (const MemoryBlock& data) noexcept : MD5 (data.getData(), data.getSize()) {}
  158. MD5::MD5 (CharPointer_UTF8 utf8) noexcept : MD5 (utf8.getAddress(), utf8.getAddress() != nullptr ? utf8.sizeInBytes() - 1 : 0) {}
  159. MD5 MD5::fromUTF32 (StringRef text)
  160. {
  161. MD5 m;
  162. MD5Generator generator;
  163. for (auto t = text.text; t.isNotEmpty();)
  164. {
  165. auto unicodeChar = ByteOrder::swapIfBigEndian ((uint32_t) t.getAndAdvance());
  166. generator.processBlock (&unicodeChar, sizeof (unicodeChar));
  167. }
  168. generator.finish (m.result);
  169. return m;
  170. }
  171. MD5::MD5 (InputStream& input, int64 numBytesToRead)
  172. {
  173. processStream (input, numBytesToRead);
  174. }
  175. MD5::MD5 (const File& file)
  176. {
  177. FileInputStream fin (file);
  178. if (fin.openedOk())
  179. processStream (fin, -1);
  180. }
  181. void MD5::processStream (InputStream& input, int64 numBytesToRead)
  182. {
  183. MD5Generator generator;
  184. if (numBytesToRead < 0)
  185. numBytesToRead = std::numeric_limits<int64>::max();
  186. while (numBytesToRead > 0)
  187. {
  188. uint8_t tempBuffer[512];
  189. auto bytesRead = input.read (tempBuffer, (int) jmin (numBytesToRead, (int64) sizeof (tempBuffer)));
  190. if (bytesRead <= 0)
  191. break;
  192. numBytesToRead -= bytesRead;
  193. generator.processBlock (tempBuffer, (size_t) bytesRead);
  194. }
  195. generator.finish (result);
  196. }
  197. //==============================================================================
  198. MemoryBlock MD5::getRawChecksumData() const
  199. {
  200. return MemoryBlock (result, sizeof (result));
  201. }
  202. String MD5::toHexString() const
  203. {
  204. return String::toHexString (result, sizeof (result), 0);
  205. }
  206. //==============================================================================
  207. bool MD5::operator== (const MD5& other) const noexcept { return memcmp (result, other.result, sizeof (result)) == 0; }
  208. bool MD5::operator!= (const MD5& other) const noexcept { return ! operator== (other); }
  209. //==============================================================================
  210. //==============================================================================
  211. #if JUCE_UNIT_TESTS
  212. class MD5Tests : public UnitTest
  213. {
  214. public:
  215. MD5Tests()
  216. : UnitTest ("MD5", UnitTestCategories::cryptography)
  217. {}
  218. void test (const char* input, const char* expected)
  219. {
  220. {
  221. MD5 hash (input, strlen (input));
  222. expectEquals (hash.toHexString(), String (expected));
  223. }
  224. {
  225. MemoryInputStream m (input, strlen (input), false);
  226. MD5 hash (m);
  227. expectEquals (hash.toHexString(), String (expected));
  228. }
  229. }
  230. void runTest() override
  231. {
  232. beginTest ("MD5");
  233. test ("", "d41d8cd98f00b204e9800998ecf8427e");
  234. test ("The quick brown fox jumps over the lazy dog", "9e107d9d372bb6826bd81d3542a419d6");
  235. test ("The quick brown fox jumps over the lazy dog.", "e4d909c290d0fb1ca068ffaddf22cbd0");
  236. expectEquals (MD5 (CharPointer_UTF8(nullptr)).toHexString(), String ("d41d8cd98f00b204e9800998ecf8427e"));
  237. }
  238. };
  239. static MD5Tests MD5UnitTests;
  240. #endif
  241. } // namespace juce