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.

309 lines
11KB

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