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.

337 lines
12KB

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