167 lines
4.8 KiB
JavaScript
167 lines
4.8 KiB
JavaScript
/* crc32.js (C) 2014-present SheetJS -- http://sheetjs.com */
|
|
/* vim: set ts=2: */
|
|
/*exported CRC32 */
|
|
var CRC32;
|
|
(function (factory) {
|
|
/*jshint ignore:start */
|
|
/*eslint-disable */
|
|
if(typeof DO_NOT_EXPORT_CRC === 'undefined') {
|
|
if('object' === typeof exports) {
|
|
factory(exports);
|
|
} else if ('function' === typeof define && define.amd) {
|
|
define(function () {
|
|
var module = {};
|
|
factory(module);
|
|
return module;
|
|
});
|
|
} else {
|
|
factory(CRC32 = {});
|
|
}
|
|
} else {
|
|
factory(CRC32 = {});
|
|
}
|
|
/*eslint-enable */
|
|
/*jshint ignore:end */
|
|
}(function(CRC32) {
|
|
CRC32.version = '1.2.0';
|
|
/* see perf/crc32table.js */
|
|
/*global Int32Array */
|
|
function signed_crc_table() {
|
|
var c = 0, table = new Array(256);
|
|
|
|
for(var n =0; n != 256; ++n){
|
|
c = n;
|
|
c = ((c&1) ? (-2097792136 ^ (c >>> 1)) : (c >>> 1));
|
|
c = ((c&1) ? (-2097792136 ^ (c >>> 1)) : (c >>> 1));
|
|
c = ((c&1) ? (-2097792136 ^ (c >>> 1)) : (c >>> 1));
|
|
c = ((c&1) ? (-2097792136 ^ (c >>> 1)) : (c >>> 1));
|
|
c = ((c&1) ? (-2097792136 ^ (c >>> 1)) : (c >>> 1));
|
|
c = ((c&1) ? (-2097792136 ^ (c >>> 1)) : (c >>> 1));
|
|
c = ((c&1) ? (-2097792136 ^ (c >>> 1)) : (c >>> 1));
|
|
c = ((c&1) ? (-2097792136 ^ (c >>> 1)) : (c >>> 1));
|
|
table[n] = c;
|
|
}
|
|
|
|
return typeof Int32Array !== 'undefined' ? new Int32Array(table) : table;
|
|
}
|
|
|
|
var T = signed_crc_table();
|
|
function slice_by_16_tables(T) {
|
|
var c = 0, v = 0, n = 0, table = typeof Int32Array !== 'undefined' ? new Int32Array(4096) : new Array(4096) ;
|
|
|
|
for(n = 0; n != 256; ++n) table[n] = T[n];
|
|
for(n = 0; n != 256; ++n) {
|
|
v = T[n];
|
|
for(c = 256 + n; c < 4096; c += 256) v = table[c] = (v >>> 8) ^ T[v & 0xFF];
|
|
}
|
|
var out = [];
|
|
for(n = 1; n != 16; ++n) out[n - 1] = typeof Int32Array !== 'undefined' ? table.subarray(n * 256, n * 256 + 256) : table.slice(n * 256, n * 256 + 256);
|
|
return out;
|
|
}
|
|
var TT = slice_by_16_tables(T);
|
|
var T1 = TT[0], T2 = TT[1], T3 = TT[2], T4 = TT[3], T5 = TT[4];
|
|
var T6 = TT[5], T7 = TT[6], T8 = TT[7], T9 = TT[8], Ta = TT[9];
|
|
var Tb = TT[10], Tc = TT[11], Td = TT[12], Te = TT[13], Tf = TT[14];
|
|
function crc32_bstr(bstr, seed) {
|
|
if(bstr.length > 10000) return crc32_bstr_16(bstr, seed);
|
|
var C = seed ^ -1, L = bstr.length - 1;
|
|
for(var i = 0; i < L;) {
|
|
C = (C>>>8) ^ T[(C^bstr.charCodeAt(i++))&0xFF];
|
|
C = (C>>>8) ^ T[(C^bstr.charCodeAt(i++))&0xFF];
|
|
}
|
|
if(i === L) C = (C>>>8) ^ T[(C ^ bstr.charCodeAt(i))&0xFF];
|
|
return C ^ -1;
|
|
}
|
|
function crc32_bstr_16(bstr, seed) {
|
|
var C = seed ^ -1, L = bstr.length - 15;
|
|
for(var i = 0; i < L;) C =
|
|
Tf[bstr.charCodeAt(i++) ^ (C & 255)] ^
|
|
Te[bstr.charCodeAt(i++) ^ ((C >> 8) & 255)] ^
|
|
Td[bstr.charCodeAt(i++) ^ ((C >> 16) & 255)] ^
|
|
Tc[bstr.charCodeAt(i++) ^ (C >>> 24)] ^
|
|
Tb[bstr.charCodeAt(i++)] ^
|
|
Ta[bstr.charCodeAt(i++)] ^
|
|
T9[bstr.charCodeAt(i++)] ^
|
|
T8[bstr.charCodeAt(i++)] ^
|
|
T7[bstr.charCodeAt(i++)] ^
|
|
T6[bstr.charCodeAt(i++)] ^
|
|
T5[bstr.charCodeAt(i++)] ^
|
|
T4[bstr.charCodeAt(i++)] ^
|
|
T3[bstr.charCodeAt(i++)] ^
|
|
T2[bstr.charCodeAt(i++)] ^
|
|
T1[bstr.charCodeAt(i++)] ^
|
|
T[bstr.charCodeAt(i++)];
|
|
L += 15;
|
|
while(i < L) C = (C>>>8) ^ T[(C^bstr.charCodeAt(i++))&0xFF];
|
|
return C ^ -1;
|
|
}
|
|
|
|
function crc32_buf(buf, seed) {
|
|
if(buf.length > 2000) return crc32_buf_16(buf, seed);
|
|
var C = seed ^ -1, L = buf.length - 3;
|
|
for(var i = 0; i < L;) {
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
}
|
|
while(i < L+3) C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
return C ^ -1;
|
|
}
|
|
function crc32_buf_16(buf, seed) {
|
|
var C = seed ^ -1, L = buf.length - 15;
|
|
for(var i = 0; i < L;) C =
|
|
Tf[buf[i++] ^ (C & 255)] ^
|
|
Te[buf[i++] ^ ((C >> 8) & 255)] ^
|
|
Td[buf[i++] ^ ((C >> 16) & 255)] ^
|
|
Tc[buf[i++] ^ (C >>> 24)] ^
|
|
Tb[buf[i++]] ^
|
|
Ta[buf[i++]] ^
|
|
T9[buf[i++]] ^
|
|
T8[buf[i++]] ^
|
|
T7[buf[i++]] ^
|
|
T6[buf[i++]] ^
|
|
T5[buf[i++]] ^
|
|
T4[buf[i++]] ^
|
|
T3[buf[i++]] ^
|
|
T2[buf[i++]] ^
|
|
T1[buf[i++]] ^
|
|
T[buf[i++]];
|
|
L += 15;
|
|
while(i < L) C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
return C ^ -1;
|
|
}
|
|
|
|
|
|
function crc32_str(str, seed) {
|
|
var C = seed ^ -1;
|
|
for(var i = 0, L = str.length, c = 0, d = 0; i < L;) {
|
|
c = str.charCodeAt(i++);
|
|
if(c < 0x80) {
|
|
C = (C>>>8) ^ T[(C ^ c)&0xFF];
|
|
} else if(c < 0x800) {
|
|
C = (C>>>8) ^ T[(C ^ (192|((c>>6)&31)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|(c&63)))&0xFF];
|
|
} else if(c >= 0xD800 && c < 0xE000) {
|
|
c = (c&1023)+64; d = str.charCodeAt(i++)&1023;
|
|
C = (C>>>8) ^ T[(C ^ (240|((c>>8)&7)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|((c>>2)&63)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|((d>>6)&15)|((c&3)<<4)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|(d&63)))&0xFF];
|
|
} else {
|
|
C = (C>>>8) ^ T[(C ^ (224|((c>>12)&15)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|((c>>6)&63)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|(c&63)))&0xFF];
|
|
}
|
|
}
|
|
return C ^ -1;
|
|
}
|
|
CRC32.table = T;
|
|
// $FlowIgnore
|
|
CRC32.bstr = crc32_bstr;
|
|
// $FlowIgnore
|
|
CRC32.buf = crc32_buf;
|
|
// $FlowIgnore
|
|
CRC32.str = crc32_str;
|
|
}));
|