Very Popular
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559import adler32 from "./adler32.ts";import { crc32 } from "./crc32.ts";import inflate_fast from "./inffast.ts";import inflate_table from "./inftrees.ts";import type ZStream from "./zstream.ts";
const CODES = 0;const LENS = 1;const DISTS = 2;
/* Public constants ==========================================================*//* ===========================================================================*/
/* Allowed flush values; see deflate() and inflate() below for details *///const Z_NO_FLUSH = 0;//const Z_PARTIAL_FLUSH = 1;//const Z_SYNC_FLUSH = 2;//const Z_FULL_FLUSH = 3;const Z_FINISH = 4;const Z_BLOCK = 5;const Z_TREES = 6;
/* Return codes for the compression/decompression functions. Negative values * are errors, positive values are used for special but normal events. */const Z_OK = 0;const Z_STREAM_END = 1;const Z_NEED_DICT = 2;//const Z_ERRNO = -1;const Z_STREAM_ERROR = -2;const Z_DATA_ERROR = -3;const Z_MEM_ERROR = -4;const Z_BUF_ERROR = -5;//const Z_VERSION_ERROR = -6;
/* The deflate compression method */const Z_DEFLATED = 8;
/* STATES ====================================================================*//* ===========================================================================*/
const HEAD = 1; /* i: waiting for magic header */const FLAGS = 2; /* i: waiting for method and flags (gzip) */const TIME = 3; /* i: waiting for modification time (gzip) */const OS = 4; /* i: waiting for extra flags and operating system (gzip) */const EXLEN = 5; /* i: waiting for extra length (gzip) */const EXTRA = 6; /* i: waiting for extra bytes (gzip) */const NAME = 7; /* i: waiting for end of file name (gzip) */const COMMENT = 8; /* i: waiting for end of comment (gzip) */const HCRC = 9; /* i: waiting for header crc (gzip) */const DICTID = 10; /* i: waiting for dictionary check value */const DICT = 11; /* waiting for inflateSetDictionary() call */const TYPE = 12; /* i: waiting for type bits, including last-flag bit */const TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */const STORED = 14; /* i: waiting for stored size (length and complement) */const COPY_ = 15; /* i/o: same as COPY below, but only first time in */const COPY = 16; /* i/o: waiting for input or output to copy stored block */const TABLE = 17; /* i: waiting for dynamic block table lengths */const LENLENS = 18; /* i: waiting for code length code lengths */const CODELENS = 19; /* i: waiting for length/lit and distance code lengths */const LEN_ = 20; /* i: same as LEN below, but only first time in */const LEN = 21; /* i: waiting for length/lit/eob code */const LENEXT = 22; /* i: waiting for length extra bits */const DIST = 23; /* i: waiting for distance code */const DISTEXT = 24; /* i: waiting for distance extra bits */const MATCH = 25; /* o: waiting for output space to copy string */const LIT = 26; /* o: waiting for output space to write literal */const CHECK = 27; /* i: waiting for 32-bit check value */const LENGTH = 28; /* i: waiting for 32-bit length (gzip) */const DONE = 29; /* finished check, done -- remain here until reset */const BAD = 30; /* got a data error -- remain here until reset */const MEM = 31; /* got an inflate() memory error -- remain here until reset */const SYNC = 32; /* looking for synchronization bytes to restart inflate() */
/* ===========================================================================*/
const ENOUGH_LENS = 852;const ENOUGH_DISTS = 592;//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
const MAX_WBITS = 15;/* 32K LZ77 window */const DEF_WBITS = MAX_WBITS;
function zswap32(q: number) { return (((q >>> 24) & 0xff) + ((q >>> 8) & 0xff00) + ((q & 0xff00) << 8) + ((q & 0xff) << 24));}
export class InflateState { mode = 0; /* current inflate mode */ last = false; /* true if processing last block */ wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ havedict = false; /* true if dictionary provided */ flags = 0; /* gzip header method and flags (0 if zlib) */ dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ check = 0; /* protected copy of check value */ total = 0; /* protected copy of output count */ // TODO: may be {} head = null; /* where to save gzip header information */
/* sliding window */ wbits = 0; /* log base 2 of requested window size */ wsize = 0; /* window size or zero if not using window */ whave = 0; /* valid bytes in the window */ wnext = 0; /* window write index */ window = null; /* allocated sliding window, if needed */
/* bit accumulator */ hold = 0; /* input bit accumulator */ bits = 0; /* number of bits in "in" */
/* for string and stored block copying */ length = 0; /* literal or length of data to copy */ offset = 0; /* distance back to copy string from */
/* for table and code decoding */ extra = 0; /* extra bits needed */
/* fixed and dynamic code tables */ lencode = null; /* starting table for length/literal codes */ distcode = null; /* starting table for distance codes */ lenbits = 0; /* index bits for lencode */ distbits = 0; /* index bits for distcode */
/* dynamic table building */ ncode = 0; /* number of code length code lengths */ nlen = 0; /* number of length code lengths */ ndist = 0; /* number of distance code lengths */ have = 0; /* number of code lengths in lens[] */ next = null; /* next available space in codes[] */
lens = new Uint16Array(320); /* temporary storage for code lengths */ work = new Uint16Array(288); /* work area for code table building */
/* because we don't have pointers in js, we use lencode and distcode directly as buffers so we don't need codes */ //codes = new Uint32Array(ENOUGH); /* space for code tables */ lendyn = null; /* dynamic table for length/literal codes (JS specific) */ distdyn = null; /* dynamic table for distance codes (JS specific) */ sane = 0; /* if false, allow invalid distance too far */ back = 0; /* bits back of last unprocessed length/lit */ was = 0; /* initial length of match */}
export function inflateResetKeep(strm: ZStream) { let state;
if (!strm || !strm.state) return Z_STREAM_ERROR; state = strm.state; strm.total_in = strm.total_out = state.total = 0; strm.msg = ""; /*Z_NULL*/ if (state.wrap) { /* to support ill-conceived Java test suite */ strm.adler = state.wrap & 1; } state.mode = HEAD; state.last = 0; state.havedict = 0; state.dmax = 32768; state.head = null /*Z_NULL*/; state.hold = 0; state.bits = 0; //state.lencode = state.distcode = state.next = state.codes; state.lencode = state.lendyn = new Uint32Array(ENOUGH_LENS); state.distcode = state.distdyn = new Uint32Array(ENOUGH_DISTS);
state.sane = 1; state.back = -1; //Tracev((stderr, "inflate: reset\n")); return Z_OK;}
export function inflateReset(strm: ZStream) { let state;
if (!strm || !strm.state) return Z_STREAM_ERROR; state = strm.state; state.wsize = 0; state.whave = 0; state.wnext = 0; return inflateResetKeep(strm);}
export function inflateReset2(strm: any, windowBits: any) { let wrap; let state;
/* get the state */ if (!strm || !strm.state) return Z_STREAM_ERROR; state = strm.state;
/* extract wrap request from windowBits parameter */ if (windowBits < 0) { wrap = 0; windowBits = -windowBits; } else { wrap = (windowBits >> 4) + 1; if (windowBits < 48) { windowBits &= 15; } }
/* set number of window bits, free window if different */ if (windowBits && (windowBits < 8 || windowBits > 15)) { return Z_STREAM_ERROR; } if (state.window !== null && state.wbits !== windowBits) { state.window = null; }
/* update state and reset the rest of it */ state.wrap = wrap; state.wbits = windowBits; return inflateReset(strm);}
export function inflateInit2(strm: ZStream, windowBits: any) { let ret; let state;
if (!strm) return Z_STREAM_ERROR; //strm.msg = Z_NULL; /* in case we return an error */
state = new InflateState();
//if (state === Z_NULL) return Z_MEM_ERROR; //Tracev((stderr, "inflate: allocated\n")); strm.state = state; state.window = null /*Z_NULL*/; ret = inflateReset2(strm, windowBits); if (ret !== Z_OK) { strm.state = null /*Z_NULL*/; } return ret;}
export function inflateInit(strm: ZStream) { return inflateInit2(strm, DEF_WBITS);}
/* Return state with length and distance decoding tables and index sizes set to fixed code decoding. Normally this returns fixed tables from inffixed.h. If BUILDFIXED is defined, then instead this routine builds the tables the first time it's called, and returns those tables the first time and thereafter. This reduces the size of the code by about 2K bytes, in exchange for a little execution time. However, BUILDFIXED should not be used for threaded applications, since the rewriting of the tables and virgin may not be thread-safe. */let virgin = true;
let lenfix: any, distfix: any; // We have no pointers in JS, so keep tables separate
function fixedtables(state: any) { /* build fixed huffman tables if first call (may not be thread safe) */ if (virgin) { let sym;
lenfix = new Uint32Array(512); distfix = new Uint32Array(32);
/* literal/length table */ sym = 0; while (sym < 144) state.lens[sym++] = 8; while (sym < 256) state.lens[sym++] = 9; while (sym < 280) state.lens[sym++] = 7; while (sym < 288) state.lens[sym++] = 8;
inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });
/* distance table */ sym = 0; while (sym < 32) state.lens[sym++] = 5;
inflate_table( DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 }, );
/* do this just once */ virgin = false; }
state.lencode = lenfix; state.lenbits = 9; state.distcode = distfix; state.distbits = 5;}
/* Update the window with the last wsize (normally 32K) bytes written before returning. If window does not exist yet, create it. This is only called when a window is already in use, or when output has been written during this inflate call, but the end of the deflate stream has not been reached yet. It is also called to create a window for dictionary data when a dictionary is loaded.
Providing output buffers larger than 32K to inflate() should provide a speed advantage, since only the last 32K of output is copied to the sliding window upon return from inflate(), and since all distances after the first 32K of output will fall in the output data, making match copies simpler and faster. The advantage may be dependent on the size of the processor's data caches. */function updatewindow(strm: ZStream, src: any, end: any, copy: any) { let dist; let state = strm.state;
/* if it hasn't been done already, allocate space for the window */ if (state.window === null) { state.wsize = 1 << state.wbits; state.wnext = 0; state.whave = 0;
state.window = new Uint8Array(state.wsize); }
/* copy state->wsize or less output bytes into the circular window */ if (copy >= state.wsize) { state.window.set(src.subarray(end - state.wsize, end), 0); state.wnext = 0; state.whave = state.wsize; } else { dist = state.wsize - state.wnext; if (dist > copy) { dist = copy; } //zmemcpy(state->window + state->wnext, end - copy, dist); state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext); copy -= dist; if (copy) { //zmemcpy(state->window, end - copy, copy); state.window.set(src.subarray(end - copy, end), 0); state.wnext = copy; state.whave = state.wsize; } else { state.wnext += dist; if (state.wnext === state.wsize) state.wnext = 0; if (state.whave < state.wsize) state.whave += dist; } } return 0;}
export function inflate(strm: ZStream, flush: any) { let state; let input: Uint8Array, output: Uint8Array; // input/output buffers let next; /* next input INDEX */ let put; /* next output INDEX */ let have, left; /* available input and output */ let hold; /* bit buffer */ let bits; /* bits in bit buffer */ let _in, _out; /* save starting available input and output */ let copy; /* number of stored or match bytes to copy */ let from; /* where to copy match bytes from */ let from_source; let here = 0; /* current decoding table entry */ let here_bits, here_op, here_val; // paked "here" denormalized (JS specific) //let last; /* parent table entry */ let last_bits, last_op, last_val; // paked "last" denormalized (JS specific) let len; /* length to copy for repeats, bits to drop */ let ret; /* return code */ let hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */ let opts;
let n; // temporary let for NEED_BITS
let order = /* permutation of code lengths */ [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
if ( !strm || !strm.state || !strm.output || (!strm.input && strm.avail_in !== 0) ) { return Z_STREAM_ERROR; }
state = strm.state; if (state.mode === TYPE) state.mode = TYPEDO; /* skip check */
//--- LOAD() --- put = strm.next_out; output = strm.output; left = strm.avail_out; next = strm.next_in; input = strm.input as Uint8Array; have = strm.avail_in; hold = state.hold; bits = state.bits; //---
_in = have; _out = left; ret = Z_OK;
inf_leave: // goto emulation for (;;) { switch (state.mode) { case HEAD: if (state.wrap === 0) { state.mode = TYPEDO; break; } //=== NEEDBITS(16); while (bits < 16) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ state.check = 0 /*crc32(0L, Z_NULL, 0)*/; //=== CRC2(state.check, hold); hbuf[0] = hold & 0xff; hbuf[1] = (hold >>> 8) & 0xff; state.check = crc32(state.check, hbuf, 2, 0); //===//
//=== INITBITS(); hold = 0; bits = 0; //===// state.mode = FLAGS; break; } state.flags = 0; /* expect zlib header */ if (state.head) { state.head.done = false; } if ( !(state.wrap & 1) || /* check if zlib header allowed */ (((hold & 0xff) /*BITS(8)*/ << 8) + (hold >> 8)) % 31 ) { strm.msg = "incorrect header check"; state.mode = BAD; break; } if ((hold & 0x0f) /*BITS(4)*/ !== Z_DEFLATED) { strm.msg = "unknown compression method"; state.mode = BAD; break; } //--- DROPBITS(4) ---// hold >>>= 4; bits -= 4; //---// len = (hold & 0x0f) /*BITS(4)*/ + 8; if (state.wbits === 0) { state.wbits = len; } else if (len > state.wbits) { strm.msg = "invalid window size"; state.mode = BAD; break; } state.dmax = 1 << len; //Tracev((stderr, "inflate: zlib header ok\n")); strm.adler = state.check = 1 /*adler32(0L, Z_NULL, 0)*/; state.mode = hold & 0x200 ? DICTID : TYPE; //=== INITBITS(); hold = 0; bits = 0; //===// break; case FLAGS: //=== NEEDBITS(16); */ while (bits < 16) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// state.flags = hold; if ((state.flags & 0xff) !== Z_DEFLATED) { strm.msg = "unknown compression method"; state.mode = BAD; break; } if (state.flags & 0xe000) { strm.msg = "unknown header flags set"; state.mode = BAD; break; } if (state.head) { state.head.text = ((hold >> 8) & 1); } if (state.flags & 0x0200) { //=== CRC2(state.check, hold); hbuf[0] = hold & 0xff; hbuf[1] = (hold >>> 8) & 0xff; state.check = crc32(state.check, hbuf, 2, 0); //===// } //=== INITBITS(); hold = 0; bits = 0; //===// state.mode = TIME; /* falls through */ case TIME: //=== NEEDBITS(32); */ while (bits < 32) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// if (state.head) { state.head.time = hold; } if (state.flags & 0x0200) { //=== CRC4(state.check, hold) hbuf[0] = hold & 0xff; hbuf[1] = (hold >>> 8) & 0xff; hbuf[2] = (hold >>> 16) & 0xff; hbuf[3] = (hold >>> 24) & 0xff; state.check = crc32(state.check, hbuf, 4, 0); //=== } //=== INITBITS(); hold = 0; bits = 0; //===// state.mode = OS; /* falls through */ case OS: //=== NEEDBITS(16); */ while (bits < 16) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// if (state.head) { state.head.xflags = (hold & 0xff); state.head.os = (hold >> 8); } if (state.flags & 0x0200) { //=== CRC2(state.check, hold); hbuf[0] = hold & 0xff; hbuf[1] = (hold >>> 8) & 0xff; state.check = crc32(state.check, hbuf, 2, 0); //===// } //=== INITBITS(); hold = 0; bits = 0; //===// state.mode = EXLEN; /* falls through */ case EXLEN: if (state.flags & 0x0400) { //=== NEEDBITS(16); */ while (bits < 16) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// state.length = hold; if (state.head) { state.head.extra_len = hold; } if (state.flags & 0x0200) { //=== CRC2(state.check, hold); hbuf[0] = hold & 0xff; hbuf[1] = (hold >>> 8) & 0xff; state.check = crc32(state.check, hbuf, 2, 0); //===// } //=== INITBITS(); hold = 0; bits = 0; //===// } else if (state.head) { state.head.extra = null /*Z_NULL*/; } state.mode = EXTRA; /* falls through */ case EXTRA: if (state.flags & 0x0400) { copy = state.length; if (copy > have) copy = have; if (copy) { if (state.head) { len = state.head.extra_len - state.length; if (!state.head.extra) { // Use untyped array for more convenient processing later state.head.extra = new Array(state.head.extra_len); } // extra field is limited to 65536 bytes // - no need for additional size check /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ state.head.extra.set(input.subarray(next, next + copy), len); //zmemcpy(state.head.extra + len, next, // len + copy > state.head.extra_max ? // state.head.extra_max - len : copy); } if (state.flags & 0x0200) { state.check = crc32(state.check, input, copy, next); } have -= copy; next += copy; state.length -= copy; } if (state.length) break inf_leave; } state.length = 0; state.mode = NAME; /* falls through */ case NAME: if (state.flags & 0x0800) { if (have === 0) break inf_leave; copy = 0; do { // TODO: 2 or 1 bytes? len = input[next + copy++]; /* use constant limit because in js we should not preallocate memory */ if ( state.head && len && (state.length < 65536 /*state.head.name_max*/) ) { state.head.name += String.fromCharCode(len); } } while (len && copy < have);
if (state.flags & 0x0200) { state.check = crc32(state.check, input, copy, next); } have -= copy; next += copy; if (len) break inf_leave; } else if (state.head) { state.head.name = null; } state.length = 0; state.mode = COMMENT; /* falls through */ case COMMENT: if (state.flags & 0x1000) { if (have === 0) break inf_leave; copy = 0; do { len = input[next + copy++]; /* use constant limit because in js we should not preallocate memory */ if ( state.head && len && (state.length < 65536 /*state.head.comm_max*/) ) { state.head.comment += String.fromCharCode(len); } } while (len && copy < have); if (state.flags & 0x0200) { state.check = crc32(state.check, input, copy, next); } have -= copy; next += copy; if (len) break inf_leave; } else if (state.head) { state.head.comment = null; } state.mode = HCRC; /* falls through */ case HCRC: if (state.flags & 0x0200) { //=== NEEDBITS(16); */ while (bits < 16) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// if (hold !== (state.check & 0xffff)) { strm.msg = "header crc mismatch"; state.mode = BAD; break; } //=== INITBITS(); hold = 0; bits = 0; //===// } if (state.head) { state.head.hcrc = ((state.flags >> 9) & 1); state.head.done = true; } strm.adler = state.check = 0; state.mode = TYPE; break; case DICTID: //=== NEEDBITS(32); */ while (bits < 32) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// strm.adler = state.check = zswap32(hold); //=== INITBITS(); hold = 0; bits = 0; //===// state.mode = DICT; /* falls through */ case DICT: if (state.havedict === 0) { //--- RESTORE() --- strm.next_out = put; strm.avail_out = left; strm.next_in = next; strm.avail_in = have; state.hold = hold; state.bits = bits; //--- return Z_NEED_DICT; } strm.adler = state.check = 1 /*adler32(0L, Z_NULL, 0)*/; state.mode = TYPE; /* falls through */ case TYPE: if (flush === Z_BLOCK || flush === Z_TREES) break inf_leave; /* falls through */ case TYPEDO: if (state.last) { //--- BYTEBITS() ---// hold >>>= bits & 7; bits -= bits & 7; //---// state.mode = CHECK; break; } //=== NEEDBITS(3); */ while (bits < 3) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// state.last = (hold & 0x01) /*BITS(1)*/; //--- DROPBITS(1) ---// hold >>>= 1; bits -= 1; //---//
switch ((hold & 0x03) /*BITS(2)*/) { case 0:/* stored block */ //Tracev((stderr, "inflate: stored block%s\n", // state.last ? " (last)" : "")); state.mode = STORED; break; case 1:/* fixed block */ fixedtables(state); //Tracev((stderr, "inflate: fixed codes block%s\n", // state.last ? " (last)" : "")); state.mode = LEN_; /* decode codes */ if (flush === Z_TREES) { //--- DROPBITS(2) ---// hold >>>= 2; bits -= 2; //---// break inf_leave; } break; case 2:/* dynamic block */ //Tracev((stderr, "inflate: dynamic codes block%s\n", // state.last ? " (last)" : "")); state.mode = TABLE; break; case 3: strm.msg = "invalid block type"; state.mode = BAD; } //--- DROPBITS(2) ---// hold >>>= 2; bits -= 2; //---// break; case STORED: //--- BYTEBITS() ---// /* go to byte boundary */ hold >>>= bits & 7; bits -= bits & 7; //---// //=== NEEDBITS(32); */ while (bits < 32) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { strm.msg = "invalid stored block lengths"; state.mode = BAD; break; } state.length = hold & 0xffff; //Tracev((stderr, "inflate: stored length %u\n", // state.length)); //=== INITBITS(); hold = 0; bits = 0; //===// state.mode = COPY_; if (flush === Z_TREES) break inf_leave; /* falls through */ case COPY_: state.mode = COPY; /* falls through */ case COPY: copy = state.length; if (copy) { if (copy > have) copy = have; if (copy > left) copy = left; if (copy === 0) break inf_leave; //--- zmemcpy(put, next, copy); --- output.set(input.subarray(next, next + copy), put); //---// have -= copy; next += copy; left -= copy; put += copy; state.length -= copy; break; } //Tracev((stderr, "inflate: stored end\n")); state.mode = TYPE; break; case TABLE: //=== NEEDBITS(14); */ while (bits < 14) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// state.nlen = (hold & 0x1f) /*BITS(5)*/ + 257; //--- DROPBITS(5) ---// hold >>>= 5; bits -= 5; //---// state.ndist = (hold & 0x1f) /*BITS(5)*/ + 1; //--- DROPBITS(5) ---// hold >>>= 5; bits -= 5; //---// state.ncode = (hold & 0x0f) /*BITS(4)*/ + 4; //--- DROPBITS(4) ---// hold >>>= 4; bits -= 4; //---// //#ifndef PKZIP_BUG_WORKAROUND if (state.nlen > 286 || state.ndist > 30) { strm.msg = "too many length or distance symbols"; state.mode = BAD; break; } //#endif //Tracev((stderr, "inflate: table sizes ok\n")); state.have = 0; state.mode = LENLENS; /* falls through */ case LENLENS: while (state.have < state.ncode) { //=== NEEDBITS(3); while (bits < 3) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// state.lens[order[state.have++]] = (hold & 0x07); //BITS(3); //--- DROPBITS(3) ---// hold >>>= 3; bits -= 3; //---// } while (state.have < 19) { state.lens[order[state.have++]] = 0; } // We have separate tables & no pointers. 2 commented lines below not needed. //state.next = state.codes; //state.lencode = state.next; // Switch to use dynamic table state.lencode = state.lendyn; state.lenbits = 7;
opts = { bits: state.lenbits }; ret = inflate_table( CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts, ); state.lenbits = opts.bits;
if (ret) { strm.msg = "invalid code lengths set"; state.mode = BAD; break; } //Tracev((stderr, "inflate: code lengths ok\n")); state.have = 0; state.mode = CODELENS; /* falls through */ case CODELENS: while (state.have < state.nlen + state.ndist) { for (;;) { here = state .lencode[ hold & ((1 << state.lenbits) - 1) ]; /*BITS(state.lenbits)*/ here_bits = here >>> 24; here_op = (here >>> 16) & 0xff; here_val = here & 0xffff;
if ((here_bits) <= bits) break; //--- PULLBYTE() ---// if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; //---// } if (here_val < 16) { //--- DROPBITS(here.bits) ---// hold >>>= here_bits; bits -= here_bits; //---// state.lens[state.have++] = here_val; } else { if (here_val === 16) { //=== NEEDBITS(here.bits + 2); n = here_bits + 2; while (bits < n) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// //--- DROPBITS(here.bits) ---// hold >>>= here_bits; bits -= here_bits; //---// if (state.have === 0) { strm.msg = "invalid bit length repeat"; state.mode = BAD; break; } len = state.lens[state.have - 1]; copy = 3 + (hold & 0x03); //BITS(2); //--- DROPBITS(2) ---// hold >>>= 2; bits -= 2; //---// } else if (here_val === 17) { //=== NEEDBITS(here.bits + 3); n = here_bits + 3; while (bits < n) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// //--- DROPBITS(here.bits) ---// hold >>>= here_bits; bits -= here_bits; //---// len = 0; copy = 3 + (hold & 0x07); //BITS(3); //--- DROPBITS(3) ---// hold >>>= 3; bits -= 3; //---// } else { //=== NEEDBITS(here.bits + 7); n = here_bits + 7; while (bits < n) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// //--- DROPBITS(here.bits) ---// hold >>>= here_bits; bits -= here_bits; //---// len = 0; copy = 11 + (hold & 0x7f); //BITS(7); //--- DROPBITS(7) ---// hold >>>= 7; bits -= 7; //---// } if (state.have + copy > state.nlen + state.ndist) { strm.msg = "invalid bit length repeat"; state.mode = BAD; break; } while (copy--) { state.lens[state.have++] = len; } } }
/* handle error breaks in while */ if (state.mode === BAD) break;
/* check for end-of-block code (better have one) */ if (state.lens[256] === 0) { strm.msg = "invalid code -- missing end-of-block"; state.mode = BAD; break; }
/* build code tables -- note: do not change the lenbits or distbits values here (9 and 6) without reading the comments in inftrees.h concerning the ENOUGH constants, which depend on those values */ state.lenbits = 9;
opts = { bits: state.lenbits }; ret = inflate_table( LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts, ); // We have separate tables & no pointers. 2 commented lines below not needed. // state.next_index = opts.table_index; state.lenbits = opts.bits; // state.lencode = state.next;
if (ret) { strm.msg = "invalid literal/lengths set"; state.mode = BAD; break; }
state.distbits = 6; //state.distcode.copy(state.codes); // Switch to use dynamic table state.distcode = state.distdyn; opts = { bits: state.distbits }; ret = inflate_table( DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts, ); // We have separate tables & no pointers. 2 commented lines below not needed. // state.next_index = opts.table_index; state.distbits = opts.bits; // state.distcode = state.next;
if (ret) { strm.msg = "invalid distances set"; state.mode = BAD; break; } //Tracev((stderr, 'inflate: codes ok\n')); state.mode = LEN_; if (flush === Z_TREES) break inf_leave; /* falls through */ case LEN_: state.mode = LEN; /* falls through */ case LEN: if (have >= 6 && left >= 258) { //--- RESTORE() --- strm.next_out = put; strm.avail_out = left; strm.next_in = next; strm.avail_in = have; state.hold = hold; state.bits = bits; //--- inflate_fast(strm, _out); //--- LOAD() --- put = strm.next_out; output = strm.output; left = strm.avail_out; next = strm.next_in; input = strm.input as Uint8Array; have = strm.avail_in; hold = state.hold; bits = state.bits; //---
if (state.mode === TYPE) { state.back = -1; } break; } state.back = 0; for (;;) { here = state .lencode[ hold & ((1 << state.lenbits) - 1) ]; /*BITS(state.lenbits)*/ here_bits = here >>> 24; here_op = (here >>> 16) & 0xff; here_val = here & 0xffff;
if (here_bits <= bits) break; //--- PULLBYTE() ---// if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; //---// } if (here_op && (here_op & 0xf0) === 0) { last_bits = here_bits; last_op = here_op; last_val = here_val; for (;;) { here = state.lencode[ last_val + ((hold & ((1 << (last_bits + last_op)) - 1)) /*BITS(last.bits + last.op)*/ >> last_bits) ]; here_bits = here >>> 24; here_op = (here >>> 16) & 0xff; here_val = here & 0xffff;
if ((last_bits + here_bits) <= bits) break; //--- PULLBYTE() ---// if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; //---// } //--- DROPBITS(last.bits) ---// hold >>>= last_bits; bits -= last_bits; //---// state.back += last_bits; } //--- DROPBITS(here.bits) ---// hold >>>= here_bits; bits -= here_bits; //---// state.back += here_bits; state.length = here_val; if (here_op === 0) { //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? // "inflate: literal '%c'\n" : // "inflate: literal 0x%02x\n", here.val)); state.mode = LIT; break; } if (here_op & 32) { //Tracevv((stderr, "inflate: end of block\n")); state.back = -1; state.mode = TYPE; break; } if (here_op & 64) { strm.msg = "invalid literal/length code"; state.mode = BAD; break; } state.extra = here_op & 15; state.mode = LENEXT; /* falls through */ case LENEXT: if (state.extra) { //=== NEEDBITS(state.extra); n = state.extra; while (bits < n) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// state.length += hold & ((1 << state.extra) - 1) /*BITS(state.extra)*/; //--- DROPBITS(state.extra) ---// hold >>>= state.extra; bits -= state.extra; //---// state.back += state.extra; } //Tracevv((stderr, "inflate: length %u\n", state.length)); state.was = state.length; state.mode = DIST; /* falls through */ case DIST: for (;;) { here = state .distcode[ hold & ((1 << state.distbits) - 1) ]; /*BITS(state.distbits)*/ here_bits = here >>> 24; here_op = (here >>> 16) & 0xff; here_val = here & 0xffff;
if ((here_bits) <= bits) break; //--- PULLBYTE() ---// if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; //---// } if ((here_op & 0xf0) === 0) { last_bits = here_bits; last_op = here_op; last_val = here_val; for (;;) { here = state.distcode[ last_val + ((hold & ((1 << (last_bits + last_op)) - 1)) /*BITS(last.bits + last.op)*/ >> last_bits) ]; here_bits = here >>> 24; here_op = (here >>> 16) & 0xff; here_val = here & 0xffff;
if ((last_bits + here_bits) <= bits) break; //--- PULLBYTE() ---// if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; //---// } //--- DROPBITS(last.bits) ---// hold >>>= last_bits; bits -= last_bits; //---// state.back += last_bits; } //--- DROPBITS(here.bits) ---// hold >>>= here_bits; bits -= here_bits; //---// state.back += here_bits; if (here_op & 64) { strm.msg = "invalid distance code"; state.mode = BAD; break; } state.offset = here_val; state.extra = (here_op) & 15; state.mode = DISTEXT; /* falls through */ case DISTEXT: if (state.extra) { //=== NEEDBITS(state.extra); n = state.extra; while (bits < n) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// state.offset += hold & ((1 << state.extra) - 1) /*BITS(state.extra)*/; //--- DROPBITS(state.extra) ---// hold >>>= state.extra; bits -= state.extra; //---// state.back += state.extra; } //#ifdef INFLATE_STRICT if (state.offset > state.dmax) { strm.msg = "invalid distance too far back"; state.mode = BAD; break; } //#endif //Tracevv((stderr, "inflate: distance %u\n", state.offset)); state.mode = MATCH; /* falls through */ case MATCH: if (left === 0) break inf_leave; copy = _out - left; if (state.offset > copy) { /* copy from window */ copy = state.offset - copy; if (copy > state.whave) { if (state.sane) { strm.msg = "invalid distance too far back"; state.mode = BAD; break; } // (!) This block is disabled in zlib defaults, // don't enable it for binary compatibility //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR // Trace((stderr, "inflate.c too far\n")); // copy -= state.whave; // if (copy > state.length) { copy = state.length; } // if (copy > left) { copy = left; } // left -= copy; // state.length -= copy; // do { // output[put++] = 0; // } while (--copy); // if (state.length === 0) { state.mode = LEN; } // break; //#endif } if (copy > state.wnext) { copy -= state.wnext; from = state.wsize - copy; } else { from = state.wnext - copy; } if (copy > state.length) copy = state.length; from_source = state.window; } else { /* copy from output */ from_source = output; from = put - state.offset; copy = state.length; } if (copy > left) copy = left; left -= copy; state.length -= copy; do { output[put++] = from_source[from++]; } while (--copy); if (state.length === 0) state.mode = LEN; break; case LIT: if (left === 0) break inf_leave; output[put++] = state.length; left--; state.mode = LEN; break; case CHECK: if (state.wrap) { //=== NEEDBITS(32); while (bits < 32) { if (have === 0) break inf_leave; have--; // Use '|' instead of '+' to make sure that result is signed hold |= input[next++] << bits; bits += 8; } //===// _out -= left; strm.total_out += _out; state.total += _out; if (_out) { strm.adler = state.check = /*UPDATE(state.check, put - _out, _out);*/ (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out)); } _out = left; // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too if ((state.flags ? hold : zswap32(hold)) !== state.check) { strm.msg = "incorrect data check"; state.mode = BAD; break; } //=== INITBITS(); hold = 0; bits = 0; //===// //Tracev((stderr, "inflate: check matches trailer\n")); } state.mode = LENGTH; /* falls through */ case LENGTH: if (state.wrap && state.flags) { //=== NEEDBITS(32); while (bits < 32) { if (have === 0) break inf_leave; have--; hold += input[next++] << bits; bits += 8; } //===// if (hold !== (state.total & 0xffffffff)) { strm.msg = "incorrect length check"; state.mode = BAD; break; } //=== INITBITS(); hold = 0; bits = 0; //===// //Tracev((stderr, "inflate: length matches trailer\n")); } state.mode = DONE; /* falls through */ case DONE: ret = Z_STREAM_END; break inf_leave; case BAD: ret = Z_DATA_ERROR; break inf_leave; case MEM: return Z_MEM_ERROR; case SYNC: /* falls through */ default: return Z_STREAM_ERROR; } }
// inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave"
/* Return from inflate(), updating the total counts and the check value. If there was no progress during the inflate() call, return a buffer error. Call updatewindow() to create and/or update the window state. Note: a memory error from inflate() is non-recoverable. */
//--- RESTORE() --- strm.next_out = put; strm.avail_out = left; strm.next_in = next; strm.avail_in = have; state.hold = hold; state.bits = bits; //---
if ( state.wsize || (_out !== strm.avail_out && state.mode < BAD && (state.mode < CHECK || flush !== Z_FINISH)) ) { if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) { state.mode = MEM; return Z_MEM_ERROR; } } _in -= strm.avail_in; _out -= strm.avail_out; strm.total_in += _in; strm.total_out += _out; state.total += _out; if (state.wrap && _out) { strm.adler = state .check = /*UPDATE(state.check, strm.next_out - _out, _out);*/ (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out)); } strm.data_type = state.bits + (state.last ? 64 : 0) + (state.mode === TYPE ? 128 : 0) + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) { ret = Z_BUF_ERROR; } return ret;}
export function inflateEnd(strm: ZStream) { if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) { return Z_STREAM_ERROR; }
let state = strm.state; if (state.window) { state.window = null; } strm.state = null; return Z_OK;}
export function inflateGetHeader(strm: ZStream, head: any) { let state;
/* check state */ if (!strm || !strm.state) return Z_STREAM_ERROR; state = strm.state; if ((state.wrap & 2) === 0) return Z_STREAM_ERROR;
/* save header structure */ state.head = head; head.done = false; return Z_OK;}
export function inflateSetDictionary(strm: ZStream, dictionary: any) { let dictLength = dictionary.length;
let state; let dictid; let ret;
/* check state */ if ( !strm /* == Z_NULL */ || !strm.state /* == Z_NULL */ ) { return Z_STREAM_ERROR; } state = strm.state;
if (state.wrap !== 0 && state.mode !== DICT) { return Z_STREAM_ERROR; }
/* check for correct dictionary identifier */ if (state.mode === DICT) { dictid = 1; /* adler32(0, null, 0)*/ /* dictid = adler32(dictid, dictionary, dictLength); */ dictid = adler32(dictid, dictionary, dictLength, 0); if (dictid !== state.check) { return Z_DATA_ERROR; } } /* copy dictionary to window using updatewindow(), which will amend the existing dictionary if appropriate */ ret = updatewindow(strm, dictionary, dictLength, dictLength); if (ret) { state.mode = MEM; return Z_MEM_ERROR; } state.havedict = 1; // Tracev((stderr, "inflate: dictionary set\n")); return Z_OK;}