md5.hpp 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484
  1. /*
  2. * Copyright (c) 2017-2023 zhllxt
  3. *
  4. * author : zhllxt
  5. * email : 37792738@qq.com
  6. *
  7. * Distributed under the Boost Software License, Version 1.0. (See accompanying
  8. * file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
  9. *
  10. * code come from : boost/uuid/detail/md5.hpp
  11. */
  12. #ifndef __ASIO2_MD5_IMPL_HPP__
  13. #define __ASIO2_MD5_IMPL_HPP__
  14. #if defined(_MSC_VER) && (_MSC_VER >= 1200)
  15. #pragma once
  16. #endif // defined(_MSC_VER) && (_MSC_VER >= 1200)
  17. #include <cstring>
  18. #include <cstdint>
  19. #include <cstddef>
  20. #include <string>
  21. #include <fstream>
  22. #include <asio2/config.hpp>
  23. #include <asio2/base/detail/filesystem.hpp>
  24. #if !defined(ASIO2_HEADER_ONLY) && __has_include(<boost/predef/other/endian.h>)
  25. #include <boost/predef/other/endian.h>
  26. #ifndef ASIO2_ENDIAN_LITTLE_BYTE
  27. #define ASIO2_ENDIAN_LITTLE_BYTE BOOST_ENDIAN_LITTLE_BYTE
  28. #endif
  29. #else
  30. #include <asio2/bho/predef/other/endian.h>
  31. #ifndef ASIO2_ENDIAN_LITTLE_BYTE
  32. #define ASIO2_ENDIAN_LITTLE_BYTE BHO_ENDIAN_LITTLE_BYTE
  33. #endif
  34. #endif
  35. #ifndef ASIO2_DISABLE_AUTO_BOOST_UUID_COMPAT_PRE_1_71_MD5
  36. #ifndef BOOST_UUID_COMPAT_PRE_1_71_MD5
  37. #define BOOST_UUID_COMPAT_PRE_1_71_MD5
  38. #endif // !BOOST_UUID_COMPAT_PRE_1_71_MD5
  39. #endif // !ASIO2_DISABLE_AUTO_BOOST_UUID_COMPAT_PRE_1_71_MD5
  40. namespace asio2
  41. {
  42. class md5
  43. {
  44. public:
  45. md5()
  46. {
  47. MD5_Init(&ctx_);
  48. }
  49. /**
  50. * @construct Construct a MD5 object with a std::string.
  51. */
  52. md5(const std::string & message) : md5()
  53. {
  54. MD5_Update(&ctx_, (const void*)message.data(),
  55. static_cast<unsigned long>(message.length()));
  56. }
  57. /**
  58. * @construct Construct a MD5 object with a char pointer.
  59. */
  60. md5(const char * message) : md5()
  61. {
  62. MD5_Update(&ctx_, (const void*)message,
  63. static_cast<unsigned long>(std::strlen(message)));
  64. }
  65. /**
  66. * @construct Construct a MD5 object with a unsigned char pointer.
  67. */
  68. md5(const void * message, std::size_t size) : md5()
  69. {
  70. MD5_Update(&ctx_, message, static_cast<unsigned long>(size));
  71. }
  72. /**
  73. * @construct Construct a MD5 object from a file path.
  74. */
  75. md5(const std::filesystem::path& filepath) : md5()
  76. {
  77. std::error_code ec{};
  78. std::uintmax_t size = std::filesystem::file_size(filepath, ec);
  79. if (!ec && size > static_cast<std::uintmax_t>(0))
  80. {
  81. std::fstream file(filepath, std::ios::in | std::ios::binary);
  82. if (file)
  83. {
  84. char buffer[1024];
  85. while (size > static_cast<std::uintmax_t>(0))
  86. {
  87. if (size >= static_cast<std::uintmax_t>(1024))
  88. {
  89. if (!file.read(buffer, 1024))
  90. break;
  91. MD5_Update(&ctx_, (const void*)buffer, static_cast<unsigned long>(1024));
  92. size -= 1024;
  93. }
  94. else
  95. {
  96. if (!file.read(buffer, static_cast<std::streamsize>(size)))
  97. break;
  98. MD5_Update(&ctx_, (const void*)buffer, static_cast<unsigned long>(size));
  99. size -= size;
  100. }
  101. }
  102. }
  103. }
  104. }
  105. /* Convert digest to std::string value */
  106. std::string str(bool upper = false)
  107. {
  108. /* Hex numbers. */
  109. char hex_upper[16] = {
  110. '0', '1', '2', '3',
  111. '4', '5', '6', '7',
  112. '8', '9', 'A', 'B',
  113. 'C', 'D', 'E', 'F'
  114. };
  115. char hex_lower[16] = {
  116. '0', '1', '2', '3',
  117. '4', '5', '6', '7',
  118. '8', '9', 'a', 'b',
  119. 'c', 'd', 'e', 'f'
  120. };
  121. std::uint8_t digest[16];
  122. get_digest(digest);
  123. std::string str;
  124. str.reserve(16 << 1);
  125. for (std::size_t i = 0; i < 16; ++i)
  126. {
  127. int t = digest[i];
  128. int a = t / 16;
  129. int b = t % 16;
  130. str.append(1, upper ? hex_upper[a] : hex_lower[a]);
  131. str.append(1, upper ? hex_upper[b] : hex_lower[b]);
  132. }
  133. return str;
  134. }
  135. void process_byte(unsigned char byte)
  136. {
  137. MD5_Update(&ctx_, &byte, 1);
  138. }
  139. void process_bytes(void const* buffer, std::size_t byte_count)
  140. {
  141. MD5_Update(&ctx_, buffer, static_cast<unsigned long>(byte_count));
  142. }
  143. void get_digest(std::uint8_t digest[16])
  144. {
  145. MD5_Final(reinterpret_cast<unsigned char *>(&digest[0]), &ctx_);
  146. }
  147. unsigned char get_version() const
  148. {
  149. // RFC 4122 Section 4.1.3
  150. //return uuid::version_name_based_md5;
  151. return static_cast<unsigned char>(3);
  152. }
  153. private:
  154. /* Any 32-bit or wider unsigned integer data type will do */
  155. typedef uint32_t MD5_u32plus;
  156. typedef struct {
  157. MD5_u32plus lo, hi;
  158. MD5_u32plus a, b, c, d;
  159. unsigned char buffer[64];
  160. MD5_u32plus block[16];
  161. } MD5_CTX;
  162. /*
  163. * The basic MD5 functions.
  164. *
  165. * F and G are optimized compared to their RFC 1321 definitions for
  166. * architectures that lack an AND-NOT instruction, just like in Colin Plumb's
  167. * implementation.
  168. */
  169. inline MD5_u32plus ASIO2_UUID_DETAIL_MD5_F(MD5_u32plus x, MD5_u32plus y, MD5_u32plus z) { return ((z) ^ ((x) & ((y) ^ (z)))); }
  170. inline MD5_u32plus ASIO2_UUID_DETAIL_MD5_G(MD5_u32plus x, MD5_u32plus y, MD5_u32plus z) { return ((y) ^ ((z) & ((x) ^ (y)))); }
  171. inline MD5_u32plus ASIO2_UUID_DETAIL_MD5_H(MD5_u32plus x, MD5_u32plus y, MD5_u32plus z) { return (((x) ^ (y)) ^ (z)); }
  172. inline MD5_u32plus ASIO2_UUID_DETAIL_MD5_H2(MD5_u32plus x, MD5_u32plus y, MD5_u32plus z) { return ((x) ^ ((y) ^ (z))); }
  173. inline MD5_u32plus ASIO2_UUID_DETAIL_MD5_I(MD5_u32plus x, MD5_u32plus y, MD5_u32plus z) { return ((y) ^ ((x) | ~(z))); }
  174. /*
  175. * The MD5 transformation for all four rounds.
  176. */
  177. #define ASIO2_UUID_DETAIL_MD5_STEP(f, a, b, c, d, x, t, s) \
  178. (a) += f((b), (c), (d)) + (x) + (t); \
  179. (a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \
  180. (a) += (b);
  181. /*
  182. * SET reads 4 input bytes in little-endian byte order and stores them in a
  183. * properly aligned word in host byte order.
  184. *
  185. * The check for little-endian architectures that tolerate unaligned memory
  186. * accesses is just an optimization. Nothing will break if it fails to detect
  187. * a suitable architecture.
  188. *
  189. * Unfortunately, this optimization may be a C strict aliasing rules violation
  190. * if the caller's data buffer has effective type that cannot be aliased by
  191. * MD5_u32plus. In practice, this problem may occur if these MD5 routines are
  192. * inlined into a calling function, or with future and dangerously advanced
  193. * link-time optimizations. For the time being, keeping these MD5 routines in
  194. * their own translation unit avoids the problem.
  195. */
  196. #if defined(__i386__) || defined(__x86_64__) || defined(__vax__)
  197. #define ASIO2_UUID_DETAIL_MD5_SET(n) \
  198. (*(MD5_u32plus *)&ptr[(n) * 4])
  199. #define ASIO2_UUID_DETAIL_MD5_GET(n) \
  200. ASIO2_UUID_DETAIL_MD5_SET(n)
  201. #else
  202. #define ASIO2_UUID_DETAIL_MD5_SET(n) \
  203. (ctx->block[(n)] = \
  204. (MD5_u32plus)ptr[(n) * 4] | \
  205. ((MD5_u32plus)ptr[(n) * 4 + 1] << 8) | \
  206. ((MD5_u32plus)ptr[(n) * 4 + 2] << 16) | \
  207. ((MD5_u32plus)ptr[(n) * 4 + 3] << 24))
  208. #define ASIO2_UUID_DETAIL_MD5_GET(n) \
  209. (ctx->block[(n)])
  210. #endif
  211. /*
  212. * This processes one or more 64-byte data blocks, but does NOT update the bit
  213. * counters. There are no alignment requirements.
  214. */
  215. const void *body(MD5_CTX *ctx, const void *data, unsigned long size)
  216. {
  217. const unsigned char *ptr;
  218. MD5_u32plus a, b, c, d;
  219. MD5_u32plus saved_a, saved_b, saved_c, saved_d;
  220. ptr = (const unsigned char *)data;
  221. a = ctx->a;
  222. b = ctx->b;
  223. c = ctx->c;
  224. d = ctx->d;
  225. do {
  226. saved_a = a;
  227. saved_b = b;
  228. saved_c = c;
  229. saved_d = d;
  230. /* Round 1 */
  231. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, a, b, c, d, ASIO2_UUID_DETAIL_MD5_SET(0), 0xd76aa478, 7)
  232. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, d, a, b, c, ASIO2_UUID_DETAIL_MD5_SET(1), 0xe8c7b756, 12)
  233. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, c, d, a, b, ASIO2_UUID_DETAIL_MD5_SET(2), 0x242070db, 17)
  234. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, b, c, d, a, ASIO2_UUID_DETAIL_MD5_SET(3), 0xc1bdceee, 22)
  235. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, a, b, c, d, ASIO2_UUID_DETAIL_MD5_SET(4), 0xf57c0faf, 7)
  236. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, d, a, b, c, ASIO2_UUID_DETAIL_MD5_SET(5), 0x4787c62a, 12)
  237. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, c, d, a, b, ASIO2_UUID_DETAIL_MD5_SET(6), 0xa8304613, 17)
  238. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, b, c, d, a, ASIO2_UUID_DETAIL_MD5_SET(7), 0xfd469501, 22)
  239. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, a, b, c, d, ASIO2_UUID_DETAIL_MD5_SET(8), 0x698098d8, 7)
  240. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, d, a, b, c, ASIO2_UUID_DETAIL_MD5_SET(9), 0x8b44f7af, 12)
  241. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, c, d, a, b, ASIO2_UUID_DETAIL_MD5_SET(10), 0xffff5bb1, 17)
  242. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, b, c, d, a, ASIO2_UUID_DETAIL_MD5_SET(11), 0x895cd7be, 22)
  243. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, a, b, c, d, ASIO2_UUID_DETAIL_MD5_SET(12), 0x6b901122, 7)
  244. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, d, a, b, c, ASIO2_UUID_DETAIL_MD5_SET(13), 0xfd987193, 12)
  245. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, c, d, a, b, ASIO2_UUID_DETAIL_MD5_SET(14), 0xa679438e, 17)
  246. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_F, b, c, d, a, ASIO2_UUID_DETAIL_MD5_SET(15), 0x49b40821, 22)
  247. /* Round 2 */
  248. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(1), 0xf61e2562, 5)
  249. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(6), 0xc040b340, 9)
  250. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(11), 0x265e5a51, 14)
  251. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(0), 0xe9b6c7aa, 20)
  252. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(5), 0xd62f105d, 5)
  253. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(10), 0x02441453, 9)
  254. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(15), 0xd8a1e681, 14)
  255. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(4), 0xe7d3fbc8, 20)
  256. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(9), 0x21e1cde6, 5)
  257. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(14), 0xc33707d6, 9)
  258. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(3), 0xf4d50d87, 14)
  259. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(8), 0x455a14ed, 20)
  260. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(13), 0xa9e3e905, 5)
  261. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(2), 0xfcefa3f8, 9)
  262. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(7), 0x676f02d9, 14)
  263. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_G, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(12), 0x8d2a4c8a, 20)
  264. /* Round 3 */
  265. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(5), 0xfffa3942, 4)
  266. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H2, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(8), 0x8771f681, 11)
  267. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(11), 0x6d9d6122, 16)
  268. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H2, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(14), 0xfde5380c, 23)
  269. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(1), 0xa4beea44, 4)
  270. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H2, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(4), 0x4bdecfa9, 11)
  271. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(7), 0xf6bb4b60, 16)
  272. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H2, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(10), 0xbebfbc70, 23)
  273. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(13), 0x289b7ec6, 4)
  274. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H2, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(0), 0xeaa127fa, 11)
  275. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(3), 0xd4ef3085, 16)
  276. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H2, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(6), 0x04881d05, 23)
  277. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(9), 0xd9d4d039, 4)
  278. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H2, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(12), 0xe6db99e5, 11)
  279. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(15), 0x1fa27cf8, 16)
  280. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_H2, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(2), 0xc4ac5665, 23)
  281. /* Round 4 */
  282. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(0), 0xf4292244, 6)
  283. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(7), 0x432aff97, 10)
  284. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(14), 0xab9423a7, 15)
  285. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(5), 0xfc93a039, 21)
  286. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(12), 0x655b59c3, 6)
  287. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(3), 0x8f0ccc92, 10)
  288. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(10), 0xffeff47d, 15)
  289. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(1), 0x85845dd1, 21)
  290. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(8), 0x6fa87e4f, 6)
  291. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(15), 0xfe2ce6e0, 10)
  292. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(6), 0xa3014314, 15)
  293. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(13), 0x4e0811a1, 21)
  294. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, a, b, c, d, ASIO2_UUID_DETAIL_MD5_GET(4), 0xf7537e82, 6)
  295. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, d, a, b, c, ASIO2_UUID_DETAIL_MD5_GET(11), 0xbd3af235, 10)
  296. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, c, d, a, b, ASIO2_UUID_DETAIL_MD5_GET(2), 0x2ad7d2bb, 15)
  297. ASIO2_UUID_DETAIL_MD5_STEP(ASIO2_UUID_DETAIL_MD5_I, b, c, d, a, ASIO2_UUID_DETAIL_MD5_GET(9), 0xeb86d391, 21)
  298. a += saved_a;
  299. b += saved_b;
  300. c += saved_c;
  301. d += saved_d;
  302. ptr += 64;
  303. } while (size -= 64);
  304. ctx->a = a;
  305. ctx->b = b;
  306. ctx->c = c;
  307. ctx->d = d;
  308. return ptr;
  309. }
  310. void MD5_Init(MD5_CTX *ctx)
  311. {
  312. ctx->a = 0x67452301;
  313. ctx->b = 0xefcdab89;
  314. ctx->c = 0x98badcfe;
  315. ctx->d = 0x10325476;
  316. ctx->lo = 0;
  317. ctx->hi = 0;
  318. }
  319. void MD5_Update(MD5_CTX *ctx, const void *data, unsigned long size)
  320. {
  321. MD5_u32plus saved_lo;
  322. unsigned long used, available;
  323. saved_lo = ctx->lo;
  324. if ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo)
  325. ctx->hi++;
  326. ctx->hi += size >> 29;
  327. used = saved_lo & 0x3f;
  328. if (used) {
  329. available = 64 - used;
  330. if (size < available) {
  331. memcpy(&ctx->buffer[used], data, size);
  332. return;
  333. }
  334. memcpy(&ctx->buffer[used], data, available);
  335. data = (const unsigned char *)data + available;
  336. size -= available;
  337. body(ctx, ctx->buffer, 64);
  338. }
  339. if (size >= 64) {
  340. data = body(ctx, data, size & ~(unsigned long)0x3f);
  341. size &= 0x3f;
  342. }
  343. memcpy(ctx->buffer, data, size);
  344. }
  345. // This must remain consistent no matter the endianness
  346. #define ASIO2_UUID_DETAIL_MD5_OUT(dst, src) \
  347. (dst)[0] = (unsigned char)(src); \
  348. (dst)[1] = (unsigned char)((src) >> 8); \
  349. (dst)[2] = (unsigned char)((src) >> 16); \
  350. (dst)[3] = (unsigned char)((src) >> 24);
  351. //
  352. // A big-endian issue with MD5 results was resolved
  353. // in boost 1.71. If you generated md5 name-based uuids
  354. // with boost 1.66 through 1.70 and stored them, then
  355. // set the following compatibility flag to ensure that
  356. // your hash generation remains consistent.
  357. //
  358. #if defined(BOOST_UUID_COMPAT_PRE_1_71_MD5) || defined(BHO_UUID_COMPAT_PRE_1_71_MD5)
  359. #define ASIO2_UUID_DETAIL_MD5_BYTE_OUT(dst, src) \
  360. ASIO2_UUID_DETAIL_MD5_OUT(dst, src)
  361. #else
  362. //
  363. // We're copying into a byte buffer which is actually
  364. // backed by an unsigned int array, which later on
  365. // is then swabbed one more time by the basic name
  366. // generator. Therefore the logic here is reversed.
  367. // This was done to minimize the impact to existing
  368. // name-based hash generation. The correct fix would
  369. // be to make this and name generation endian-correct
  370. // but that would even break previously generated sha1
  371. // hashes too.
  372. //
  373. #if ASIO2_ENDIAN_LITTLE_BYTE
  374. #define ASIO2_UUID_DETAIL_MD5_BYTE_OUT(dst, src) \
  375. (dst)[0] = (unsigned char)((src) >> 24); \
  376. (dst)[1] = (unsigned char)((src) >> 16); \
  377. (dst)[2] = (unsigned char)((src) >> 8); \
  378. (dst)[3] = (unsigned char)(src);
  379. #else
  380. #define ASIO2_UUID_DETAIL_MD5_BYTE_OUT(dst, src) \
  381. (dst)[0] = (unsigned char)(src); \
  382. (dst)[1] = (unsigned char)((src) >> 8); \
  383. (dst)[2] = (unsigned char)((src) >> 16); \
  384. (dst)[3] = (unsigned char)((src) >> 24);
  385. #endif
  386. #endif // BOOST_UUID_COMPAT_PRE_1_71_MD5
  387. void MD5_Final(unsigned char *result, MD5_CTX *ctx)
  388. {
  389. unsigned long used, available;
  390. used = ctx->lo & 0x3f;
  391. ctx->buffer[used++] = 0x80;
  392. available = 64 - used;
  393. if (available < 8) {
  394. memset(&ctx->buffer[used], 0, available);
  395. body(ctx, ctx->buffer, 64);
  396. used = 0;
  397. available = 64;
  398. }
  399. memset(&ctx->buffer[used], 0, available - 8);
  400. ctx->lo <<= 3;
  401. ASIO2_UUID_DETAIL_MD5_OUT(&ctx->buffer[56], ctx->lo)
  402. ASIO2_UUID_DETAIL_MD5_OUT(&ctx->buffer[60], ctx->hi)
  403. body(ctx, ctx->buffer, 64);
  404. ASIO2_UUID_DETAIL_MD5_BYTE_OUT(&result[0], ctx->a)
  405. ASIO2_UUID_DETAIL_MD5_BYTE_OUT(&result[4], ctx->b)
  406. ASIO2_UUID_DETAIL_MD5_BYTE_OUT(&result[8], ctx->c)
  407. ASIO2_UUID_DETAIL_MD5_BYTE_OUT(&result[12], ctx->d)
  408. memset(ctx, 0, sizeof(*ctx));
  409. }
  410. #undef ASIO2_UUID_DETAIL_MD5_OUT
  411. #undef ASIO2_UUID_DETAIL_MD5_SET
  412. #undef ASIO2_UUID_DETAIL_MD5_GET
  413. #undef ASIO2_UUID_DETAIL_MD5_STEP
  414. #undef ASIO2_UUID_DETAIL_MD5_BYTE_OUT
  415. MD5_CTX ctx_;
  416. };
  417. }
  418. #endif // !__ASIO2_MD5_IMPL_HPP__