Business-KontoCheck
view release on metacpan or search on metacpan
zlib/contrib/blast/blast.c view on Meta::CPAN
* - The first codeforthe shortestlengthis all ones. Subsequent codes of* the samelengthare simply integer decrements of the previous code. When* moving up alength, a one bit is appended to the code. For a complete* code, thelastcode of the longestlengthwill be all zeros. To support* this ordering, the bits pulled during decoding are inverted to apply the* more"natural"ordering startingwithall zeros and incrementing.*/localintdecode(struct state*s, struct huffman*h){intlen; /* current number of bits in code */intcode; /* len bits being decoded */intfirst; /* first code oflengthlen */intcount; /* number of codes oflengthlen */intindex; /*indexof first code oflengthlen in symbol table */intbitbuf; /* bits from stream */intleft; /* bits left innextor left to process */short*next; /*nextnumber of codes */bitbuf = s->bitbuf;left = s->bitcnt;code = first =index= 0;
zlib/contrib/blast/blast.c view on Meta::CPAN
* allowed and common. For example, a distance of one and alengthof 518* simply copies thelastbyte 518times. A distance of four and alengthof* twelve copies thelastfour bytes threetimes. A simple forward copy* ignoring whether thelengthis greater than the distance or not implements* this correctly.*/localintdecomp(struct state*s){intlit; /* trueifliterals are coded */intdict; /* log2(dictionary size) - 6 */intsymbol; /* decoded symbol, extra bitsfordistance */intlen; /*lengthforcopy */unsigned dist; /* distanceforcopy */intcopy; /* copy counter */unsigned char*from,*to; /* copy pointers */staticintvirgin = 1; /* build tables once */static short litcnt[MAXBITS+1], litsym[256]; /* litcode memory */static short lencnt[MAXBITS+1], lensym[16]; /* lencode memory */static short distcnt[MAXBITS+1], distsym[64]; /* distcode memory */static struct huffman litcode = {litcnt, litsym}; /*lengthcode */static struct huffman lencode = {lencnt, lensym}; /*lengthcode */
zlib/contrib/puff/puff.c view on Meta::CPAN
* moving up alength, a zero bit is appended to the code. For a complete* code, thelastcode of the longestlengthwill be all ones.** - Incomplete codes are handled by this decoder, since they are permitted* in the deflateformat. See theformatnotesforfixed() and dynamic().*/#ifdef SLOWlocalintdecode(struct state*s, const struct huffman*h){intlen; /* current number of bits in code */intcode; /* len bits being decoded */intfirst; /* first code oflengthlen */intcount; /* number of codes oflengthlen */intindex; /*indexof first code oflengthlen in symbol table */code = first =index= 0;for(len = 1; len <= MAXBITS; len++) {code |= bits(s, 1); /* getnextbit */count = h->count[len];if(code - count < first) /*iflengthlen,returnsymbol */returnh->symbol[index+ (code - first)];
zlib/contrib/puff/puff.c view on Meta::CPAN
/** A faster version of decode()forreal applications of this code. It's not* as readable, but it makes puff() twice as fast. And it only makes the code* a few percent larger.*/#else /* !SLOW */localintdecode(struct state*s, const struct huffman*h){intlen; /* current number of bits in code */intcode; /* len bits being decoded */intfirst; /* first code oflengthlen */intcount; /* number of codes oflengthlen */intindex; /*indexof first code oflengthlen in symbol table */intbitbuf; /* bits from stream */intleft; /* bits left innextor left to process */short*next; /*nextnumber of codes */bitbuf = s->bitbuf;left = s->bitcnt;code = first =index= 0;
zlib/contrib/puff/puff.c view on Meta::CPAN
* to represent all of those. Lengths 3..10 and 258 are in fact represented* by just alengthsymbol. Lengths 11..257 are represented as a symbol and* some number of extra bits that are added as an integer to the baselength* of thelengthsymbol. The number of extra bits is determined by the base*lengthsymbol. These are in the static arrays below, lens[]forthe base* lengths and lext[]forthe corresponding number of extra bits.** - The reason that 258 gets its own symbol is that the longestlengthis used* often in highly redundant files. Note that 258 can also be coded as the* base value 227 plus the maximum extra value of 31. While a good deflate* should neverdothis, it is not an error, and should be decoded properly.** - If alengthis decoded, including its extra bitsifany, then it is* followed a distance code. There are up to 30 distance symbols. Again* there are many more possible distances (1..32768), so extra bits are added* to a base value represented by the symbol. The distances 1..4 get their* corresponding number of extra bits are below in the static arrays dist[]* and dext[].** - Literal bytes are simply written to the output. Alength/distance pair is* an instruction to copy previously uncompressed bytes to the output. The* copy is from distance bytes back in the output stream, copyingforlength
zlib/contrib/puff/puff.c view on Meta::CPAN
* ignoring whether thelengthis greater than the distance or not implements* since though their behavior -is-definedforoverlapping arrays, it is*definedtodothe wrong thing in this case.*/localintcodes(struct state*s,const struct huffman*lencode,const struct huffman*distcode){intsymbol; /* decoded symbol */intlen; /*lengthforcopy */unsigned dist; /* distanceforcopy */static const short lens[29] = { /* Size baseforlengthcodes 257..285 */3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258};static const short lext[29] = { /* Extra bitsforlengthcodes 257..285 */0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0};static const short dists[30] = { /* Offset basefordistance codes 0..29 */1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
zlib/contrib/puff/puff.c view on Meta::CPAN
lengths[order[index]] = 0;err = construct(&lencode, lengths, 19);return-4;/*readlength/literal and distance codelengthtables */index= 0;while(index< nlen + ndist) {intsymbol; /* decoded value */intlen; /*lastlengthto repeat */symbol = decode(s,&lencode);if(symbol < 0)returnsymbol; /* invalid symbol */if(symbol < 16) /*lengthin 0..15 */lengths[index++] = symbol;else{ /* repeat instruction */len = 0; /* assume repeating zeros */if(symbol == 16) { /* repeatlastlength3..6times*/
zlib/contrib/puff/puff.c view on Meta::CPAN
* -6: dynamic block code description: repeat more than specified lengths* -7: dynamic block code description: invalid literal/lengthcode lengths* -8: dynamic block code description: invalid distance code lengths* -9: dynamic block code description: missing end-of-block code* -10: invalid literal/lengthor distance code in fixed or dynamic block* -11: distance is too far back in fixed or dynamic block** Format notes:** - Three bits arereadforeachblock to determine the kind of block and* whether or not it is thelastblock. Then the block is decoded and the* process repeatedifit was not thelastblock.** - The leftover bits in thelastbyte of the deflate dataafterthelast* block (ifit was a fixed or dynamic block) are undefined and haveno* expectedvaluesto check.*/intpuff(unsigned char*dest, /* pointer to destination pointer */unsigned long*destlen, /* amount of output space */const unsigned char*source, /* pointer to source data pointer */unsigned long*sourcelen) /* amount of input available */
zlib/doc/algorithm.txt view on Meta::CPAN
other extreme, you could make a new tableforevery bit in the code. In fact,that's essentially a Huffman tree. But then you spend too muchtimetraversing the treewhiledecoding, evenforshort symbols.So the number of bitsforthe first lookup table is a trade of thetimetofill out the table vs. thetimespent looking at the second level and above ofthe table.Here is an example, scaled down:The code being decoded,with10 symbols, from 1 to 6 bits long:A: 0B: 10C: 1100D: 11010E: 11011F: 11100G: 11101H: 11110I: 111110
zlib/doc/rfc1951.txt view on Meta::CPAN
Deutsch Informational [Page 10]RFC 1951 DEFLATE Compressed Data Format Specification May 1996preset dictionary might discard part of the output stream; adistance can refer to that part of the output stream anyway)Note also that the referenced string may overlap the currentposition;forexample,ifthelast2 bytes decoded havevaluesX and Y, a string referencewith<length= 5, distance = 2>adds X,Y,X,Y,X to the output stream.We now specifyeachcompression method in turn.3.2.4. Non-compressed blocks (BTYPE=00)Any bits of input up to thenextbyte boundary are ignored.The rest of the block consists of the following information:
zlib/examples/zran.c view on Meta::CPAN
/* Version History:1.0 29 May 2005 First version1.1 29 Sep 2012 Fix memory reallocation error1.2 14 Oct 2018 Handle gzip streamswithmultiple membersAdd a header file to facilitate usage in applications*/forrandom access of a compressed file. A file containing a zlib or gzipstream is provided on the command line. The compressed stream is decoded inits entirety, and anindexbuiltwithaccess points about every SPAN bytesin the uncompressed output. The compressed file is leftopen, and can thenbereadrandomly, having to decompress on the average SPAN/2 uncompressedbytesbeforegetting to the desired block of data.An access point can be created at the start of any deflate block, by savingthe starting file offset and bit of that block, and the 32K bytes ofuncompressed data that precede that block. Also the uncompressed offset ofthat block is saved to provide a referenceforlocating a desired startingpoint in the uncompressed stream. deflate_index_build() works by
zlib/test/infcover.c view on Meta::CPAN
do{if(*hex>='0'&&*hex<='9')val = (val << 4) +*hex-'0';elseif(*hex>='A'&&*hex<='F')val = (val << 4) +*hex-'A'+ 10;elseif(*hex>='a'&&*hex<='f')val = (val << 4) +*hex-'a'+ 10;elseif(val != 1 && val < 32) /* one digit followed by delimiter */val += 240; /* make it look like two digits */if(val > 255) { /* have two digits */in[next++] = val & 0xff; /* save the decoded byte */val = 1; /* start over */}}while(*hex++); /* go through the loopwiththe terminating null */if(len != NULL)*len=next;re = realloc(in,next);returnre == NULL ? in : re;}/* generic inflate() run, wherehexis the hexadecimal input data, what is the
zlib/zlib.h view on Meta::CPAN
stream. The end-of-block will not be indicateduntilall of the uncompresseddata from that blockhasbeen written to strm->next_out. The number ofunused bits may in general be greater than seven, exceptwhenbit 7 ofdata_type is set, in which case the number of unused bits will be less thaneight. data_type is set as noted here everytimeinflate() returnsforallflush options, and so can be used to determine the amount of currentlyconsumed input in bits.The Z_TREES option behaves as Z_BLOCK does, but it also returnswhentheend ofeachdeflate block header is reached,beforeany actual data in thatblock is decoded. This allows thecallerto determine thelengthof the256 is added to the value of strm->data_typewheninflate() returnsimmediatelyafterreaching the end of the deflate block header.inflate() should normally be calleduntilit returns Z_STREAM_END or anerror. Howeverifall decompression is to be performed in a single step (asingle call of inflate), the parameter flush should be set to Z_FINISH. Inthis case all pending input is processed and all pending output is flushed;avail_out must be large enough to hold all of the uncompressed datafortheoperation to complete. (The size of the uncompressed data may have been
zlib/zlib.h view on Meta::CPAN
such as zip. Those formats provide their own checkvalues. If a customformatis developed using the raw deflateformatforcompressed data, it isrecommended that a check value such as an Adler-32 or a CRC-32 be applied tothe uncompressed data as is done in the zlib, gzip, and zip formats. Formost applications, the zlibformatshould be used as is. Note that commentswindowBits can also be greater than 15foroptional gzip decoding. Add32 to windowBits to enable zlib and gzip decodingwithautomatic headerdetection, or add 16 to decode only the gzipformat(the zlibformatwillreturna Z_DATA_ERROR). If a gzip stream is being decoded, strm->adler is aCRC-32 instead of an Adler-32. Unlike the gunzip utility and gzread() (seebelow), inflate() will*not* automatically decode concatenated gzip members.inflate() willreturnZ_STREAM_END at the end of the gzip member. The statewould need to beresettocontinuedecoding a subsequent gzip member. This*must* be doneifthere is more dataaftera gzip member, in orderforthedecompression to be compliantwiththe gzip standard (RFC 1952).inflateInit2 returns Z_OKifsuccess, Z_MEM_ERRORifthere was not enoughmemory, Z_VERSION_ERRORifthe zlib library version is incompatiblewiththeversion assumed by thecaller, or Z_STREAM_ERRORifthe parameters are
zlib/zlib.h view on Meta::CPAN
*/ZEXTERNintZEXPORT inflateGetHeader OF((z_streamp strm,gz_headerp head));/*inflateGetHeader() requests that gzip header information be stored in theprovided gz_header structure. inflateGetHeader() may be calledafterinflateInit2() or inflateReset(), andbeforethe first call of inflate().As inflate() processes the gzip stream, head->done is zerountilthe headeris completed, at whichtimehead->done is set to one. If a zlib stream isbeing decoded, then head->done is set to -1 to indicate that there will benogzip header information forthcoming. Note that Z_BLOCK or Z_TREES can beused to force inflate() toreturnimmediatelyafterheader processing iscomplete andbeforeany actual data is decompressed.The text,time, xflags, and os fields are filled inwiththe gzip headercontents. hcrc is set to trueifthere is a header CRC. (The header CRCwas validifdone is set to one.) If extra is not Z_NULL, then extra_maxcontains the maximum number of bytes towriteto extra. Once done is true,extra_len contains the actual extra fieldlength, and extra contains theextra field, or that field truncatedifextra_max is less than extra_len.
( run in 0.427 second using v1.01-cache-2.11-cpan-c6e0e5ac2a7 )