github.com/nektos/act@v0.2.63/pkg/runner/testdata/actions/node16/node_modules/uuid/dist/esm-browser/md5.js (about) 1 /* 2 * Browser-compatible JavaScript MD5 3 * 4 * Modification of JavaScript MD5 5 * https://github.com/blueimp/JavaScript-MD5 6 * 7 * Copyright 2011, Sebastian Tschan 8 * https://blueimp.net 9 * 10 * Licensed under the MIT license: 11 * https://opensource.org/licenses/MIT 12 * 13 * Based on 14 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message 15 * Digest Algorithm, as defined in RFC 1321. 16 * Version 2.2 Copyright (C) Paul Johnston 1999 - 2009 17 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet 18 * Distributed under the BSD License 19 * See http://pajhome.org.uk/crypt/md5 for more info. 20 */ 21 function md5(bytes) { 22 if (typeof bytes === 'string') { 23 var msg = unescape(encodeURIComponent(bytes)); // UTF8 escape 24 25 bytes = new Uint8Array(msg.length); 26 27 for (var i = 0; i < msg.length; ++i) { 28 bytes[i] = msg.charCodeAt(i); 29 } 30 } 31 32 return md5ToHexEncodedArray(wordsToMd5(bytesToWords(bytes), bytes.length * 8)); 33 } 34 /* 35 * Convert an array of little-endian words to an array of bytes 36 */ 37 38 39 function md5ToHexEncodedArray(input) { 40 var output = []; 41 var length32 = input.length * 32; 42 var hexTab = '0123456789abcdef'; 43 44 for (var i = 0; i < length32; i += 8) { 45 var x = input[i >> 5] >>> i % 32 & 0xff; 46 var hex = parseInt(hexTab.charAt(x >>> 4 & 0x0f) + hexTab.charAt(x & 0x0f), 16); 47 output.push(hex); 48 } 49 50 return output; 51 } 52 /** 53 * Calculate output length with padding and bit length 54 */ 55 56 57 function getOutputLength(inputLength8) { 58 return (inputLength8 + 64 >>> 9 << 4) + 14 + 1; 59 } 60 /* 61 * Calculate the MD5 of an array of little-endian words, and a bit length. 62 */ 63 64 65 function wordsToMd5(x, len) { 66 /* append padding */ 67 x[len >> 5] |= 0x80 << len % 32; 68 x[getOutputLength(len) - 1] = len; 69 var a = 1732584193; 70 var b = -271733879; 71 var c = -1732584194; 72 var d = 271733878; 73 74 for (var i = 0; i < x.length; i += 16) { 75 var olda = a; 76 var oldb = b; 77 var oldc = c; 78 var oldd = d; 79 a = md5ff(a, b, c, d, x[i], 7, -680876936); 80 d = md5ff(d, a, b, c, x[i + 1], 12, -389564586); 81 c = md5ff(c, d, a, b, x[i + 2], 17, 606105819); 82 b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330); 83 a = md5ff(a, b, c, d, x[i + 4], 7, -176418897); 84 d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426); 85 c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341); 86 b = md5ff(b, c, d, a, x[i + 7], 22, -45705983); 87 a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416); 88 d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417); 89 c = md5ff(c, d, a, b, x[i + 10], 17, -42063); 90 b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162); 91 a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682); 92 d = md5ff(d, a, b, c, x[i + 13], 12, -40341101); 93 c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290); 94 b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329); 95 a = md5gg(a, b, c, d, x[i + 1], 5, -165796510); 96 d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632); 97 c = md5gg(c, d, a, b, x[i + 11], 14, 643717713); 98 b = md5gg(b, c, d, a, x[i], 20, -373897302); 99 a = md5gg(a, b, c, d, x[i + 5], 5, -701558691); 100 d = md5gg(d, a, b, c, x[i + 10], 9, 38016083); 101 c = md5gg(c, d, a, b, x[i + 15], 14, -660478335); 102 b = md5gg(b, c, d, a, x[i + 4], 20, -405537848); 103 a = md5gg(a, b, c, d, x[i + 9], 5, 568446438); 104 d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690); 105 c = md5gg(c, d, a, b, x[i + 3], 14, -187363961); 106 b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501); 107 a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467); 108 d = md5gg(d, a, b, c, x[i + 2], 9, -51403784); 109 c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473); 110 b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734); 111 a = md5hh(a, b, c, d, x[i + 5], 4, -378558); 112 d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463); 113 c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562); 114 b = md5hh(b, c, d, a, x[i + 14], 23, -35309556); 115 a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060); 116 d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353); 117 c = md5hh(c, d, a, b, x[i + 7], 16, -155497632); 118 b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640); 119 a = md5hh(a, b, c, d, x[i + 13], 4, 681279174); 120 d = md5hh(d, a, b, c, x[i], 11, -358537222); 121 c = md5hh(c, d, a, b, x[i + 3], 16, -722521979); 122 b = md5hh(b, c, d, a, x[i + 6], 23, 76029189); 123 a = md5hh(a, b, c, d, x[i + 9], 4, -640364487); 124 d = md5hh(d, a, b, c, x[i + 12], 11, -421815835); 125 c = md5hh(c, d, a, b, x[i + 15], 16, 530742520); 126 b = md5hh(b, c, d, a, x[i + 2], 23, -995338651); 127 a = md5ii(a, b, c, d, x[i], 6, -198630844); 128 d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415); 129 c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905); 130 b = md5ii(b, c, d, a, x[i + 5], 21, -57434055); 131 a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571); 132 d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606); 133 c = md5ii(c, d, a, b, x[i + 10], 15, -1051523); 134 b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799); 135 a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359); 136 d = md5ii(d, a, b, c, x[i + 15], 10, -30611744); 137 c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380); 138 b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649); 139 a = md5ii(a, b, c, d, x[i + 4], 6, -145523070); 140 d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379); 141 c = md5ii(c, d, a, b, x[i + 2], 15, 718787259); 142 b = md5ii(b, c, d, a, x[i + 9], 21, -343485551); 143 a = safeAdd(a, olda); 144 b = safeAdd(b, oldb); 145 c = safeAdd(c, oldc); 146 d = safeAdd(d, oldd); 147 } 148 149 return [a, b, c, d]; 150 } 151 /* 152 * Convert an array bytes to an array of little-endian words 153 * Characters >255 have their high-byte silently ignored. 154 */ 155 156 157 function bytesToWords(input) { 158 if (input.length === 0) { 159 return []; 160 } 161 162 var length8 = input.length * 8; 163 var output = new Uint32Array(getOutputLength(length8)); 164 165 for (var i = 0; i < length8; i += 8) { 166 output[i >> 5] |= (input[i / 8] & 0xff) << i % 32; 167 } 168 169 return output; 170 } 171 /* 172 * Add integers, wrapping at 2^32. This uses 16-bit operations internally 173 * to work around bugs in some JS interpreters. 174 */ 175 176 177 function safeAdd(x, y) { 178 var lsw = (x & 0xffff) + (y & 0xffff); 179 var msw = (x >> 16) + (y >> 16) + (lsw >> 16); 180 return msw << 16 | lsw & 0xffff; 181 } 182 /* 183 * Bitwise rotate a 32-bit number to the left. 184 */ 185 186 187 function bitRotateLeft(num, cnt) { 188 return num << cnt | num >>> 32 - cnt; 189 } 190 /* 191 * These functions implement the four basic operations the algorithm uses. 192 */ 193 194 195 function md5cmn(q, a, b, x, s, t) { 196 return safeAdd(bitRotateLeft(safeAdd(safeAdd(a, q), safeAdd(x, t)), s), b); 197 } 198 199 function md5ff(a, b, c, d, x, s, t) { 200 return md5cmn(b & c | ~b & d, a, b, x, s, t); 201 } 202 203 function md5gg(a, b, c, d, x, s, t) { 204 return md5cmn(b & d | c & ~d, a, b, x, s, t); 205 } 206 207 function md5hh(a, b, c, d, x, s, t) { 208 return md5cmn(b ^ c ^ d, a, b, x, s, t); 209 } 210 211 function md5ii(a, b, c, d, x, s, t) { 212 return md5cmn(c ^ (b | ~d), a, b, x, s, t); 213 } 214 215 export default md5;