String+MD5.swift 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278
  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. let message = data.withUnsafeBytes { (bytes: UnsafeRawBufferPointer) in
  35. return [UInt8](bytes)
  36. }
  37. let MD5Calculator = MD5(message)
  38. let MD5Data = MD5Calculator.calculate()
  39. var MD5String = String()
  40. for c in MD5Data {
  41. MD5String += String(format: "%02x", c)
  42. }
  43. return MD5String
  44. }
  45. var ext: String? {
  46. var ext = ""
  47. if let index = base.lastIndex(of: ".") {
  48. let extRange = base.index(index, offsetBy: 1)..<base.endIndex
  49. ext = String(base[extRange])
  50. }
  51. guard let firstSeg = ext.split(separator: "@").first else {
  52. return nil
  53. }
  54. return firstSeg.count > 0 ? String(firstSeg) : nil
  55. }
  56. }
  57. // array of bytes, little-endian representation
  58. func arrayOfBytes<T>(_ value: T, length: Int? = nil) -> [UInt8] {
  59. let totalBytes = length ?? (MemoryLayout<T>.size * 8)
  60. let valuePointer = UnsafeMutablePointer<T>.allocate(capacity: 1)
  61. valuePointer.pointee = value
  62. let bytes = valuePointer.withMemoryRebound(to: UInt8.self, capacity: totalBytes) { (bytesPointer) -> [UInt8] in
  63. var bytes = [UInt8](repeating: 0, count: totalBytes)
  64. for j in 0..<min(MemoryLayout<T>.size, totalBytes) {
  65. bytes[totalBytes - 1 - j] = (bytesPointer + j).pointee
  66. }
  67. return bytes
  68. }
  69. valuePointer.deinitialize(count: 1)
  70. valuePointer.deallocate()
  71. return bytes
  72. }
  73. extension Int {
  74. // Array of bytes with optional padding (little-endian)
  75. func bytes(_ totalBytes: Int = MemoryLayout<Int>.size) -> [UInt8] {
  76. return arrayOfBytes(self, length: totalBytes)
  77. }
  78. }
  79. protocol HashProtocol {
  80. var message: [UInt8] { get }
  81. // Common part for hash calculation. Prepare header data.
  82. func prepare(_ len: Int) -> [UInt8]
  83. }
  84. extension HashProtocol {
  85. func prepare(_ len: Int) -> [UInt8] {
  86. var tmpMessage = message
  87. // Step 1. Append Padding Bits
  88. tmpMessage.append(0x80) // append one bit (UInt8 with one bit) to message
  89. // append "0" bit until message length in bits ≡ 448 (mod 512)
  90. var msgLength = tmpMessage.count
  91. var counter = 0
  92. while msgLength % len != (len - 8) {
  93. counter += 1
  94. msgLength += 1
  95. }
  96. tmpMessage += [UInt8](repeating: 0, count: counter)
  97. return tmpMessage
  98. }
  99. }
  100. func toUInt32Array(_ slice: ArraySlice<UInt8>) -> [UInt32] {
  101. var result = [UInt32]()
  102. result.reserveCapacity(16)
  103. for idx in stride(from: slice.startIndex, to: slice.endIndex, by: MemoryLayout<UInt32>.size) {
  104. let d0 = UInt32(slice[idx.advanced(by: 3)]) << 24
  105. let d1 = UInt32(slice[idx.advanced(by: 2)]) << 16
  106. let d2 = UInt32(slice[idx.advanced(by: 1)]) << 8
  107. let d3 = UInt32(slice[idx])
  108. let val: UInt32 = d0 | d1 | d2 | d3
  109. result.append(val)
  110. }
  111. return result
  112. }
  113. struct BytesIterator: IteratorProtocol {
  114. let chunkSize: Int
  115. let data: [UInt8]
  116. init(chunkSize: Int, data: [UInt8]) {
  117. self.chunkSize = chunkSize
  118. self.data = data
  119. }
  120. var offset = 0
  121. mutating func next() -> ArraySlice<UInt8>? {
  122. let end = min(chunkSize, data.count - offset)
  123. let result = data[offset..<offset + end]
  124. offset += result.count
  125. return result.count > 0 ? result : nil
  126. }
  127. }
  128. struct BytesSequence: Sequence {
  129. let chunkSize: Int
  130. let data: [UInt8]
  131. func makeIterator() -> BytesIterator {
  132. return BytesIterator(chunkSize: chunkSize, data: data)
  133. }
  134. }
  135. func rotateLeft(_ value: UInt32, bits: UInt32) -> UInt32 {
  136. return ((value << bits) & 0xFFFFFFFF) | (value >> (32 - bits))
  137. }
  138. class MD5: HashProtocol {
  139. let message: [UInt8]
  140. init (_ message: [UInt8]) {
  141. self.message = message
  142. }
  143. // specifies the per-round shift amounts
  144. private let shifts: [UInt32] = [7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
  145. 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
  146. 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
  147. 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21]
  148. // binary integer part of the sines of integers (Radians)
  149. private let sines: [UInt32] = [0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
  150. 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  151. 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  152. 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  153. 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
  154. 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
  155. 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  156. 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  157. 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
  158. 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  159. 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
  160. 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  161. 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
  162. 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  163. 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  164. 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391]
  165. private let hashes: [UInt32] = [0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]
  166. func calculate() -> [UInt8] {
  167. var tmpMessage = prepare(64)
  168. tmpMessage.reserveCapacity(tmpMessage.count + 4)
  169. // hash values
  170. var hh = hashes
  171. // Step 2. Append Length a 64-bit representation of lengthInBits
  172. let lengthInBits = (message.count * 8)
  173. let lengthBytes = lengthInBits.bytes(64 / 8)
  174. tmpMessage += lengthBytes.reversed()
  175. // Process the message in successive 512-bit chunks:
  176. let chunkSizeBytes = 512 / 8 // 64
  177. for chunk in BytesSequence(chunkSize: chunkSizeBytes, data: tmpMessage) {
  178. // break chunk into sixteen 32-bit words M[j], 0 ≤ j ≤ 15
  179. let M = toUInt32Array(chunk)
  180. assert(M.count == 16, "Invalid array")
  181. // Initialize hash value for this chunk:
  182. var A: UInt32 = hh[0]
  183. var B: UInt32 = hh[1]
  184. var C: UInt32 = hh[2]
  185. var D: UInt32 = hh[3]
  186. var dTemp: UInt32 = 0
  187. // Main loop
  188. for j in 0 ..< sines.count {
  189. var g = 0
  190. var F: UInt32 = 0
  191. switch j {
  192. case 0...15:
  193. F = (B & C) | ((~B) & D)
  194. g = j
  195. case 16...31:
  196. F = (D & B) | (~D & C)
  197. g = (5 * j + 1) % 16
  198. case 32...47:
  199. F = B ^ C ^ D
  200. g = (3 * j + 5) % 16
  201. case 48...63:
  202. F = C ^ (B | (~D))
  203. g = (7 * j) % 16
  204. default:
  205. break
  206. }
  207. dTemp = D
  208. D = C
  209. C = B
  210. B = B &+ rotateLeft((A &+ F &+ sines[j] &+ M[g]), bits: shifts[j])
  211. A = dTemp
  212. }
  213. hh[0] = hh[0] &+ A
  214. hh[1] = hh[1] &+ B
  215. hh[2] = hh[2] &+ C
  216. hh[3] = hh[3] &+ D
  217. }
  218. var result = [UInt8]()
  219. result.reserveCapacity(hh.count / 4)
  220. hh.forEach {
  221. let itemLE = $0.littleEndian
  222. let r1 = UInt8(itemLE & 0xff)
  223. let r2 = UInt8((itemLE >> 8) & 0xff)
  224. let r3 = UInt8((itemLE >> 16) & 0xff)
  225. let r4 = UInt8((itemLE >> 24) & 0xff)
  226. result += [r1, r2, r3, r4]
  227. }
  228. return result
  229. }
  230. }