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.

339 lines
12KB

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