String+MD5.swift 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300
  1. //
  2. // String+MD5.swift
  3. // Kingfisher
  4. //
  5. // Created by Wei Wang on 18/09/25.
  6. //
  7. // Copyright (c) 2019 Wei Wang <onevcat@gmail.com>
  8. //
  9. // Permission is hereby granted, free of charge, to any person obtaining a copy
  10. // of this software and associated documentation files (the "Software"), to deal
  11. // in the Software without restriction, including without limitation the rights
  12. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. // copies of the Software, and to permit persons to whom the Software is
  14. // furnished to do so, subject to the following conditions:
  15. //
  16. // The above copyright notice and this permission notice shall be included in
  17. // all copies or substantial portions of the Software.
  18. //
  19. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. // THE SOFTWARE.
  26. import Foundation
  27. import CommonCrypto
  28. extension String: KingfisherCompatibleValue { }
  29. extension KingfisherWrapper where Base == String {
  30. var md5: String {
  31. guard let data = base.data(using: .utf8) else {
  32. return base
  33. }
  34. #if swift(>=5.0)
  35. let message = data.withUnsafeBytes { (bytes: UnsafeRawBufferPointer) in
  36. return [UInt8](bytes)
  37. }
  38. #else
  39. let message = data.withUnsafeBytes { bytes in
  40. return [UInt8](UnsafeBufferPointer(start: bytes, count: data.count))
  41. }
  42. #endif
  43. let MD5Calculator = MD5(message)
  44. let MD5Data = MD5Calculator.calculate()
  45. var MD5String = String()
  46. for c in MD5Data {
  47. MD5String += String(format: "%02x", c)
  48. }
  49. return MD5String
  50. }
  51. var ext: String? {
  52. var ext = ""
  53. if let index = base.lastIndex(of: ".") {
  54. let extRange = base.index(index, offsetBy: 1)..<base.endIndex
  55. ext = String(base[extRange])
  56. }
  57. return ext.count > 0 ? ext : nil
  58. }
  59. }
  60. // array of bytes, little-endian representation
  61. func arrayOfBytes<T>(_ value: T, length: Int? = nil) -> [UInt8] {
  62. let totalBytes = length ?? (MemoryLayout<T>.size * 8)
  63. let valuePointer = UnsafeMutablePointer<T>.allocate(capacity: 1)
  64. valuePointer.pointee = value
  65. let bytes = valuePointer.withMemoryRebound(to: UInt8.self, capacity: totalBytes) { (bytesPointer) -> [UInt8] in
  66. var bytes = [UInt8](repeating: 0, count: totalBytes)
  67. for j in 0..<min(MemoryLayout<T>.size, totalBytes) {
  68. bytes[totalBytes - 1 - j] = (bytesPointer + j).pointee
  69. }
  70. return bytes
  71. }
  72. #if swift(>=4.1)
  73. valuePointer.deinitialize(count: 1)
  74. valuePointer.deallocate()
  75. #else
  76. valuePointer.deinitialize()
  77. valuePointer.deallocate(capacity: 1)
  78. #endif
  79. return bytes
  80. }
  81. extension Int {
  82. // Array of bytes with optional padding (little-endian)
  83. func bytes(_ totalBytes: Int = MemoryLayout<Int>.size) -> [UInt8] {
  84. return arrayOfBytes(self, length: totalBytes)
  85. }
  86. }
  87. extension NSMutableData {
  88. // Convenient way to append bytes
  89. func appendBytes(_ arrayOfBytes: [UInt8]) {
  90. append(arrayOfBytes, length: arrayOfBytes.count)
  91. }
  92. }
  93. protocol HashProtocol {
  94. var message: [UInt8] { get }
  95. // Common part for hash calculation. Prepare header data.
  96. func prepare(_ len: Int) -> [UInt8]
  97. }
  98. extension HashProtocol {
  99. func prepare(_ len: Int) -> [UInt8] {
  100. var tmpMessage = message
  101. // Step 1. Append Padding Bits
  102. tmpMessage.append(0x80) // append one bit (UInt8 with one bit) to message
  103. // append "0" bit until message length in bits ≡ 448 (mod 512)
  104. var msgLength = tmpMessage.count
  105. var counter = 0
  106. while msgLength % len != (len - 8) {
  107. counter += 1
  108. msgLength += 1
  109. }
  110. tmpMessage += [UInt8](repeating: 0, count: counter)
  111. return tmpMessage
  112. }
  113. }
  114. func toUInt32Array(_ slice: ArraySlice<UInt8>) -> [UInt32] {
  115. var result = [UInt32]()
  116. result.reserveCapacity(16)
  117. for idx in stride(from: slice.startIndex, to: slice.endIndex, by: MemoryLayout<UInt32>.size) {
  118. let d0 = UInt32(slice[idx.advanced(by: 3)]) << 24
  119. let d1 = UInt32(slice[idx.advanced(by: 2)]) << 16
  120. let d2 = UInt32(slice[idx.advanced(by: 1)]) << 8
  121. let d3 = UInt32(slice[idx])
  122. let val: UInt32 = d0 | d1 | d2 | d3
  123. result.append(val)
  124. }
  125. return result
  126. }
  127. struct BytesIterator: IteratorProtocol {
  128. let chunkSize: Int
  129. let data: [UInt8]
  130. init(chunkSize: Int, data: [UInt8]) {
  131. self.chunkSize = chunkSize
  132. self.data = data
  133. }
  134. var offset = 0
  135. mutating func next() -> ArraySlice<UInt8>? {
  136. let end = min(chunkSize, data.count - offset)
  137. let result = data[offset..<offset + end]
  138. offset += result.count
  139. return result.count > 0 ? result : nil
  140. }
  141. }
  142. struct BytesSequence: Sequence {
  143. let chunkSize: Int
  144. let data: [UInt8]
  145. func makeIterator() -> BytesIterator {
  146. return BytesIterator(chunkSize: chunkSize, data: data)
  147. }
  148. }
  149. func rotateLeft(_ value: UInt32, bits: UInt32) -> UInt32 {
  150. return ((value << bits) & 0xFFFFFFFF) | (value >> (32 - bits))
  151. }
  152. class MD5: HashProtocol {
  153. static let size = 16 // 128 / 8
  154. let message: [UInt8]
  155. init (_ message: [UInt8]) {
  156. self.message = message
  157. }
  158. // specifies the per-round shift amounts
  159. private let shifts: [UInt32] = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
  160. 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
  161. 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
  162. 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]
  163. // binary integer part of the sines of integers (Radians)
  164. private let sines: [UInt32] = [0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
  165. 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  166. 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  167. 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  168. 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
  169. 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
  170. 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  171. 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  172. 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
  173. 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  174. 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
  175. 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  176. 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
  177. 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  178. 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  179. 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391]
  180. private let hashes: [UInt32] = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]
  181. func calculate() -> [UInt8] {
  182. var tmpMessage = prepare(64)
  183. tmpMessage.reserveCapacity(tmpMessage.count + 4)
  184. // hash values
  185. var hh = hashes
  186. // Step 2. Append Length a 64-bit representation of lengthInBits
  187. let lengthInBits = (message.count * 8)
  188. let lengthBytes = lengthInBits.bytes(64 / 8)
  189. tmpMessage += lengthBytes.reversed()
  190. // Process the message in successive 512-bit chunks:
  191. let chunkSizeBytes = 512 / 8 // 64
  192. for chunk in BytesSequence(chunkSize: chunkSizeBytes, data: tmpMessage) {
  193. // break chunk into sixteen 32-bit words M[j], 0 ≤ j ≤ 15
  194. let M = toUInt32Array(chunk)
  195. assert(M.count == 16, "Invalid array")
  196. // Initialize hash value for this chunk:
  197. var A: UInt32 = hh[0]
  198. var B: UInt32 = hh[1]
  199. var C: UInt32 = hh[2]
  200. var D: UInt32 = hh[3]
  201. var dTemp: UInt32 = 0
  202. // Main loop
  203. for j in 0 ..< sines.count {
  204. var g = 0
  205. var F: UInt32 = 0
  206. switch j {
  207. case 0...15:
  208. F = (B & C) | ((~B) & D)
  209. g = j
  210. break
  211. case 16...31:
  212. F = (D & B) | (~D & C)
  213. g = (5 * j + 1) % 16
  214. break
  215. case 32...47:
  216. F = B ^ C ^ D
  217. g = (3 * j + 5) % 16
  218. break
  219. case 48...63:
  220. F = C ^ (B | (~D))
  221. g = (7 * j) % 16
  222. break
  223. default:
  224. break
  225. }
  226. dTemp = D
  227. D = C
  228. C = B
  229. B = B &+ rotateLeft((A &+ F &+ sines[j] &+ M[g]), bits: shifts[j])
  230. A = dTemp
  231. }
  232. hh[0] = hh[0] &+ A
  233. hh[1] = hh[1] &+ B
  234. hh[2] = hh[2] &+ C
  235. hh[3] = hh[3] &+ D
  236. }
  237. var result = [UInt8]()
  238. result.reserveCapacity(hh.count / 4)
  239. hh.forEach {
  240. let itemLE = $0.littleEndian
  241. let r1 = UInt8(itemLE & 0xff)
  242. let r2 = UInt8((itemLE >> 8) & 0xff)
  243. let r3 = UInt8((itemLE >> 16) & 0xff)
  244. let r4 = UInt8((itemLE >> 24) & 0xff)
  245. result += [r1, r2, r3, r4]
  246. }
  247. return result
  248. }
  249. }