1// Chris Coyier's MD5 Library 2var MD5 = function (string) { 3 4 function RotateLeft(lValue, iShiftBits) { 5 return (lValue<<iShiftBits) | (lValue>>>(32-iShiftBits)); 6 } 7 8 function AddUnsigned(lX,lY) { 9 var lX4,lY4,lX8,lY8,lResult; 10 lX8 = (lX & 0x80000000); 11 lY8 = (lY & 0x80000000); 12 lX4 = (lX & 0x40000000); 13 lY4 = (lY & 0x40000000); 14 lResult = (lX & 0x3FFFFFFF)+(lY & 0x3FFFFFFF); 15 if (lX4 & lY4) { 16 return (lResult ^ 0x80000000 ^ lX8 ^ lY8); 17 } 18 if (lX4 | lY4) { 19 if (lResult & 0x40000000) { 20 return (lResult ^ 0xC0000000 ^ lX8 ^ lY8); 21 } else { 22 return (lResult ^ 0x40000000 ^ lX8 ^ lY8); 23 } 24 } else { 25 return (lResult ^ lX8 ^ lY8); 26 } 27 } 28 29 function F(x,y,z) { return (x & y) | ((~x) & z); } 30 function G(x,y,z) { return (x & z) | (y & (~z)); } 31 function H(x,y,z) { return (x ^ y ^ z); } 32 function I(x,y,z) { return (y ^ (x | (~z))); } 33 34 function FF(a,b,c,d,x,s,ac) { 35 a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac)); 36 return AddUnsigned(RotateLeft(a, s), b); 37 }; 38 39 function GG(a,b,c,d,x,s,ac) { 40 a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac)); 41 return AddUnsigned(RotateLeft(a, s), b); 42 }; 43 44 function HH(a,b,c,d,x,s,ac) { 45 a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac)); 46 return AddUnsigned(RotateLeft(a, s), b); 47 }; 48 49 function II(a,b,c,d,x,s,ac) { 50 a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac)); 51 return AddUnsigned(RotateLeft(a, s), b); 52 }; 53 54 function ConvertToWordArray(string) { 55 var lWordCount; 56 var lMessageLength = string.length; 57 var lNumberOfWords_temp1=lMessageLength + 8; 58 var lNumberOfWords_temp2=(lNumberOfWords_temp1-(lNumberOfWords_temp1 % 64))/64; 59 var lNumberOfWords = (lNumberOfWords_temp2+1)*16; 60 var lWordArray=Array(lNumberOfWords-1); 61 var lBytePosition = 0; 62 var lByteCount = 0; 63 while ( lByteCount < lMessageLength ) { 64 lWordCount = (lByteCount-(lByteCount % 4))/4; 65 lBytePosition = (lByteCount % 4)*8; 66 lWordArray[lWordCount] = (lWordArray[lWordCount] | (string.charCodeAt(lByteCount)<<lBytePosition)); 67 lByteCount++; 68 } 69 lWordCount = (lByteCount-(lByteCount % 4))/4; 70 lBytePosition = (lByteCount % 4)*8; 71 lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80<<lBytePosition); 72 lWordArray[lNumberOfWords-2] = lMessageLength<<3; 73 lWordArray[lNumberOfWords-1] = lMessageLength>>>29; 74 return lWordArray; 75 }; 76 77 function WordToHex(lValue) { 78 var WordToHexValue="",WordToHexValue_temp="",lByte,lCount; 79 for (lCount = 0;lCount<=3;lCount++) { 80 lByte = (lValue>>>(lCount*8)) & 255; 81 WordToHexValue_temp = "0" + lByte.toString(16); 82 WordToHexValue = WordToHexValue + WordToHexValue_temp.substr(WordToHexValue_temp.length-2,2); 83 } 84 return WordToHexValue; 85 }; 86 87 function Utf8Encode(string) { 88 string = string.replace(/\r\n/g,"\n"); 89 var utftext = ""; 90 91 for (var n = 0; n < string.length; n++) { 92 93 var c = string.charCodeAt(n); 94 95 if (c < 128) { 96 utftext += String.fromCharCode(c); 97 } 98 else if((c > 127) && (c < 2048)) { 99 utftext += String.fromCharCode((c >> 6) | 192); 100 utftext += String.fromCharCode((c & 63) | 128); 101 } 102 else { 103 utftext += String.fromCharCode((c >> 12) | 224); 104 utftext += String.fromCharCode(((c >> 6) & 63) | 128); 105 utftext += String.fromCharCode((c & 63) | 128); 106 } 107 108 } 109 110 return utftext; 111 }; 112 113 var x=Array(); 114 var k,AA,BB,CC,DD,a,b,c,d; 115 var S11=7, S12=12, S13=17, S14=22; 116 var S21=5, S22=9 , S23=14, S24=20; 117 var S31=4, S32=11, S33=16, S34=23; 118 var S41=6, S42=10, S43=15, S44=21; 119 120 string = Utf8Encode(string); 121 122 x = ConvertToWordArray(string); 123
124 a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476; 125 126 for (k=0;k<x.length;k+=16) { 127 AA=a; BB=b; CC=c; DD=d; 128 a=FF(a,b,c,d,x[k+0], S11,0xD76AA478); 129 d=FF(d,a,b,c,x[k+1], S12,0xE8C7B756); 130 c=FF(c,d,a,b,x[k+2], S13,0x242070DB); 131 b=FF(b,c,d,a,x[k+3], S14,0xC1BDCEEE); 132 a=FF(a,b,c,d,x[k+4], S11,0xF57C0FAF); 133 d=FF(d,a,b,c,x[k+5], S12,0x4787C62A); 134 c=FF(c,d,a,b,x[k+6], S13,0xA8304613); 135 b=FF(b,c,d,a,x[k+7], S14,0xFD469501); 136 a=FF(a,b,c,d,x[k+8], S11,0x698098D8); 137 d=FF(d,a,b,c,x[k+9], S12,0x8B44F7AF); 138 c=FF(c,d,a,b,x[k+10],S13,0xFFFF5BB1); 139 b=FF(b,c,d,a,x[k+11],S14,0x895CD7BE); 140 a=FF(a,b,c,d,x[k+12],S11,0x6B901122); 141 d=FF(d,a,b,c,x[k+13],S12,0xFD987193); 142 c=FF(c,d,a,b,x[k+14],S13,0xA679438E); 143 b=FF(b,c,d,a,x[k+15],S14,0x49B40821); 144 a=GG(a,b,c,d,x[k+1], S21,0xF61E2562); 145 d=GG(d,a,b,c,x[k+6], S22,0xC040B340); 146 c=GG(c,d,a,b,x[k+11],S23,0x265E5A51); 147 b=GG(b,c,d,a,x[k+0], S24,0xE9B6C7AA); 148 a=GG(a,b,c,d,x[k+5], S21,0xD62F105D); 149 d=GG(d,a,b,c,x[k+10],S22,0x2441453); 150 c=GG(c,d,a,b,x[k+15],S23,0xD8A1E681); 151 b=GG(b,c,d,a,x[k+4], S24,0xE7D3FBC8); 152 a=GG(a,b,c,d,x[k+9], S21,0x21E1CDE6); 153 d=GG(d,a,b,c,x[k+14],S22,0xC33707D6); 154 c=GG(c,d,a,b,x[k+3], S23,0xF4D50D87); 155 b=GG(b,c,d,a,x[k+8], S24,0x455A14ED); 156 a=GG(a,b,c,d,x[k+13],S21,0xA9E3E905); 157 d=GG(d,a,b,c,x[k+2], S22,0xFCEFA3F8); 158 c=GG(c,d,a,b,x[k+7], S23,0x676F02D9); 159 b=GG(b,c,d,a,x[k+12],S24,0x8D2A4C8A); 160 a=HH(a,b,c,d,x[k+5], S31,0xFFFA3942); 161 d=HH(d,a,b,c,x[k+8], S32,0x8771F681); 162 c=HH(c,d,a,b,x[k+11],S33,0x6D9D6122); 163 b=HH(b,c,d,a,x[k+14],S34,0xFDE5380C); 164 a=HH(a,b,c,d,x[k+1], S31,0xA4BEEA44); 165 d=HH(d,a,b,c,x[k+4], S32,0x4BDECFA9); 166 c=HH(c,d,a,b,x[k+7], S33,0xF6BB4B60); 167 b=HH(b,c,d,a,x[k+10],S34,0xBEBFBC70); 168 a=HH(a,b,c,d,x[k+13],S31,0x289B7EC6); 169 d=HH(d,a,b,c,x[k+0], S32,0xEAA127FA); 170 c=HH(c,d,a,b,x[k+3], S33,0xD4EF3085); 171 b=HH(b,c,d,a,x[k+6], S34,0x4881D05); 172 a=HH(a,b,c,d,x[k+9], S31,0xD9D4D039); 173 d=HH(d,a,b,c,x[k+12],S32,0xE6DB99E5); 174 c=HH(c,d,a,b,x[k+15],S33,0x1FA27CF8); 175 b=HH(b,c,d,a,x[k+2], S34,0xC4AC5665); 176 a=II(a,b,c,d,x[k+0], S41,0xF4292244); 177 d=II(d,a,b,c,x[k+7], S42,0x432AFF97); 178 c=II(c,d,a,b,x[k+14],S43,0xAB9423A7); 179 b=II(b,c,d,a,x[k+5], S44,0xFC93A039); 180 a=II(a,b,c,d,x[k+12],S41,0x655B59C3); 181 d=II(d,a,b,c,x[k+3], S42,0x8F0CCC92); 182 c=II(c,d,a,b,x[k+10],S43,0xFFEFF47D); 183 b=II(b,c,d,a,x[k+1], S44,0x85845DD1); 184 a=II(a,b,c,d,x[k+8], S41,0x6FA87E4F); 185 d=II(d,a,b,c,x[k+15],S42,0xFE2CE6E0); 186 c=II(c,d,a,b,x[k+6], S43,0xA3014314); 187 b=II(b,c,d,a,x[k+13],S44,0x4E0811A1); 188 a=II(a,b,c,d,x[k+4], S41,0xF7537E82); 189 d=II(d,a,b,c,x[k+11],S42,0xBD3AF235); 190 c=II(c,d,a,b,x[k+2], S43,0x2AD7D2BB); 191 b=II(b,c,d,a,x[k+9], S44,0xEB86D391); 192 a=AddUnsigned(a,AA); 193 b=AddUnsigned(b,BB); 194 c=AddUnsigned(c,CC); 195 d=AddUnsigned(d,DD); 196 } 197 198 var temp = WordToHex(a)+WordToHex(b)+WordToHex(c)+WordToHex(d); 199 200 return temp.toLowerCase(); 201}; 202
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.