/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
/external/zlib/src/as400/ |
H A D | zlib.inc | 268 D errnum 10I 0 Error code 430 D err 10I 0 value Error code 441 D arg 10I 0 value Error code
|
/external/zlib/src/contrib/blast/ |
H A D | blast.c | 33 #define MAXBITS 13 /* maximum code length */ 93 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of 94 * each length, which for a canonical code are stepped through in order. 105 * Decode a code from the stream s using huffman table h. Return the symbol or 107 * an empty code, or if the code is incomplete and an invalid code is received, 115 * build the code value reversed from what is in the stream in order to 118 * - The first code for the shortest length is all ones. Subsequent codes of 119 * the same length are simply integer decrements of the previous code 128 int code; /* len bits being decoded */ local [all...] |
/external/zlib/src/contrib/delphi/ |
H A D | ZLib.pas | 265 {function zlibCheck(code: Integer): Integer; 267 Result := code; 268 if code < 0 then 272 function CCheck(code: Integer): Integer; 274 Result := code; 275 if code < 0 then 279 function DCheck(code: Integer): Integer; 281 Result := code; 282 if code < 0 then
|
/external/zlib/src/contrib/infback9/ |
H A D | infback9.c | 48 Build and output length and distance decoding tables for fixed code 57 code *next, *lenfix, *distfix; 59 code fixed[544]; 90 printf(" static const code lenfix[%u] = {", size); 101 printf("\n static const code distfix[%u] = {", size); 240 code const FAR *lencode; /* starting table for length/literal codes */ 241 code const FAR *distcode; /* starting table for distance codes */ 244 code here; /* current decoding table entry */ 245 code last; /* parent table entry */ 247 int ret; /* return code */ [all...] |
H A D | inffix9.h | 10 static const code lenfix[512] = { 99 static const code distfix[32] = {
|
H A D | inflate9.h | 16 LEN, /* i: waiting for length/lit code */ 39 unsigned ncode; /* number of code length code lengths */ 40 unsigned nlen; /* number of length code lengths */ 41 unsigned ndist; /* number of distance code lengths */ 42 unsigned have; /* number of code lengths in lens[] */ 43 code FAR *next; /* next available space in codes[] */ 44 unsigned short lens[320]; /* temporary storage for code lengths */ 45 unsigned short work[288]; /* work area for code table building */ 46 code code [all...] |
H A D | inftree9.c | 21 Build a set of tables to decode the provided canonical Huffman code. 22 The code lengths are lens[0..codes-1]. The result starts at *table, 24 lens shorts, which is used as a work area. type is the type of code 26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table 30 longest code or if it is less than the shortest code. 36 code FAR * FAR *table; 40 unsigned len; /* a code's length in bits */ 41 unsigned sym; /* index of code symbols */ 42 unsigned min, max; /* minimum and maximum code length [all...] |
H A D | inftree9.h | 12 information needed to do the operation requested by the code that 14 table that indexes more bits of the code. op indicates whether 16 distance, an end-of-block, or an invalid code. For a table 19 is the number of extra bits to get after the code. bits is 20 the number of bits in this code or part of the code to drop off 26 unsigned char bits; /* bits in this part of the code */ 27 unsigned short val; /* offset in table or code value */ 28 } code; typedef in typeref:struct:__anon34340 35 01000000 - invalid code [all...] |
/external/zlib/src/contrib/inflate86/ |
H A D | inffas86.c | 13 * bytes. I've tested the AMD64 code on a Fedora Core 1 + the x86_64 updates 21 * the moment. I have successfully compiled and tested this code with gcc2.96, 24 * enabled. I will attempt to merge the MMX code into this version. Newer 55 TYPE -- reached end of block code, inflate() to interpret next block 61 length code, 5 bits for the length extra, 15 bits for the distance code, 87 /* 64 32 */ code const FAR *lcode; /* ebp rbp local strm->lencode */ 88 /* 72 36 */ code const FAR *dcode; /* r11 local strm->distcode */ 1127 strm->msg = "invalid literal/length code"; 1129 strm->msg = "invalid distance code"; [all...] |
/external/zlib/src/contrib/masmx64/ |
H A D | gvmat64.asm | 13 ; and by taking inspiration on asm686 with masm, optimised assembly code
59 .code
115 ; in the deflate_state structure since the asm code was first written
133 ; in zlib in the deflate_state structure since the asm code was first written
422 ;;; starting the compare loop. So what this code does is skip over 0-3
545 db 0dh,0ah,"asm686 with masm, optimised assembly code from Brian Raiter, written 1998, converted to amd 64 by Gilles Vollant 2005",0dh,0ah,0
|
H A D | inffas8664.c | 18 * bytes. I've tested the AMD64 code on a Fedora Core 1 + the x86_64 updates
26 * the moment. I have successfully compiled and tested this code with gcc2.96,
29 * enabled. I will attempt to merge the MMX code into this version. Newer
62 TYPE -- reached end of block code, inflate() to interpret next block
68 length code, 5 bits for the length extra, 15 bits for the distance code,
92 /* 64 32 */ code const FAR *lcode; /* ebp rbp local strm->lencode */
93 /* 72 36 */ code const FAR *dcode; /* r11 local strm->distcode */
155 strm->msg = "invalid literal/length code";
157 strm->msg = "invalid distance code";
[all...] |
H A D | inffasx64.asm | 22 .code
|
/external/zlib/src/contrib/masmx86/ |
H A D | inffas32.asm | 3 ; * inffas32.asm is derivated from inffas86.c, with translation of assembly code
13 ; * the moment. I have successfully compiled and tested this code with gcc2.96,
16 ; * enabled. I will attempt to merge the MMX code into this version. Newer
85 db 'invalid literal/length code'
90 db 'invalid distance code'
|
H A D | match686.asm | 28 ; with autoselect (with cpu detection code)
75 ; in zlib in the deflate_state structure since the asm code was first written
361 ;;; starting the compare loop. So what this code does is skip over 0-3
458 db 0dh,0ah,"asm686 with masm, optimised assembly code from Brian Raiter, written 1998",0dh,0ah
|
/external/zlib/src/contrib/pascal/ |
H A D | example.pas | 29 * stresses the compression code better, sorry...
|
/external/zlib/src/contrib/puff/ |
H A D | puff.c | 9 * side benefit, this code might actually be useful when small code is more 18 * is less than 2K bytes. This code is compatible with 16-bit int's and 20 * assumed to be 16 bits, for arrays in order to to conserve memory. The code 25 * code is meant to supplement RFC 1951, which formally describes the deflate 56 * 1.4 31 Mar 2002 - Simplify construct() code set check 61 * 1.7 3 Mar 2003 - Added test code for distribution 67 * - Add option in TEST code for puff to write the data 68 * - Add option in TEST code to skip input bytes 69 * - Allow TEST code t 238 int code; /* len bits being decoded */ local 266 int code; /* len bits being decoded */ local [all...] |
/external/zlib/src/ |
H A D | deflate.h | 20 the crc code when it is not needed. For shared libraries, gzip encoding 31 /* number of length codes, not counting the special END_BLOCK code */ 37 /* number of Literal or Length codes, including the END_BLOCK code */ 64 /* Data structure describing a single value and its code string. */ 68 ush code; /* bit string */ member in union:ct_data_s::__anon34350 77 #define Code fc.code 85 int max_code; /* largest code with non zero frequency */ 232 * example a binary file with poorly compressible code followed by 242 /* Buffer for distances. To simplify the code, d_buf and l_buf have 287 /* In order to simplify the code, particularl [all...] |
H A D | infback.c | 7 This code is largely copied from inflate.c. Normally either infback.o or 74 fixed code decoding. Normally this returns fixed tables from inffixed.h. 77 thereafter. This reduces the size of the code by about 2K bytes, in 87 static code *lenfix, *distfix; 88 static code fixed[544]; 93 static code *next; 265 code here; /* current decoding table entry */ 266 code last; /* parent table entry */ 268 int ret; /* return code */ 269 static const unsigned short order[19] = /* permutation of code length [all...] |
H A D | inffast.c | 51 TYPE -- reached end of block code, inflate() to interpret next block 57 length code, 5 bits for the length extra, 15 bits for the distance code, 86 code const FAR *lcode; /* local strm->lencode */ 87 code const FAR *dcode; /* local strm->distcode */ 90 code here; /* retrieved table entry */ 91 unsigned op; /* code bits, operation, extra bits, or */ 283 else if ((op & 64) == 0) { /* 2nd level distance code */ 288 strm->msg = (char *)"invalid distance code"; 293 else if ((op & 64) == 0) { /* 2nd level length code */ [all...] |
H A D | inffixed.h | 10 static const code lenfix[512] = { 87 static const code distfix[32] = {
|
H A D | inflate.c | 10 * - First version -- complete rewrite of inflate to simplify code, avoid 13 * improve code readability and style over the previous zlib inflate code 253 fixed code decoding. Normally this returns fixed tables from inffixed.h. 256 thereafter. This reduces the size of the code by about 2K bytes, in 266 static code *lenfix, *distfix; 267 static code fixed[544]; 272 static code *next; 341 printf(" static const code lenfix[%u] = {", size); 352 printf("\n static const code distfi [all...] |
H A D | inflate.h | 13 the crc code when it is not needed. For shared libraries, gzip decoding 38 LENLENS, /* i: waiting for code length code lengths */ 39 CODELENS, /* i: waiting for length/lit and distance code lengths */ 41 LEN, /* i: waiting for length/lit/eob code */ 43 DIST, /* i: waiting for distance code */ 103 /* for table and code decoding */ 105 /* fixed and dynamic code tables */ 106 code const FAR *lencode; /* starting table for length/literal codes */ 107 code cons [all...] |
/external/zlib/src/examples/ |
H A D | enough.c | 1 /* enough.c -- determine the maximum size of inflate's Huffman code tables over 19 Clean up code indentation 24 maximum code length in bits to determine the maximum table size for zilb's 29 in the same code for the counting, as do permutations of the assignments of 32 We build a code from shorter to longer lengths, determining how many symbols 34 be coded, what the last code length used was, and how many bit patterns of 35 that length remain unused. Then we add one to the code length and double the 36 number of unused patterns to graduate to the next code length. We then 37 assign all portions of the remaining symbols to that code length that 38 preserve the properties of a correct and eventually complete code 174 local int *code; /* number of symbols assigned to each bit length */ variable [all...] |
H A D | gun.c | 207 int bits; /* current bits per code */ 208 unsigned code; /* code, table traversal index */ local 210 int max; /* maximum bits per code for this stream */ 213 unsigned temp; /* current code */ 214 unsigned prev; /* previous code */ 215 unsigned final; /* last character written for previous code */ 247 /* set up: get first 9-bit code, which is the first decompressed byte, but 248 don't create a table entry until the next code */ 251 final = prev = (unsigned)last; /* low 8 bits of code */ [all...] |