/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/yaffs2/yaffs2/ |
H A D | yaffs_guts.c | 611 * Must be a multiple of 32-bits */ 3505 /* Write chunk bits */ 6246 int bits; local 6353 bits = ShiftsGE(x); 6357 /* bits must be even so that we end up with 32-bit words */ 6358 if(bits & 1) 6359 bits++; 6360 if(bits < 16) 6363 dev->tnodeWidth = bits; 6370 /* Level0 Tnodes are 16 bits o [all...] |
/external/zlib/src/as400/ |
H A D | zlib.inc | 343 D bits 10I 0 Pending bits 347 D bits 10I 0 value # of bits to insert 382 D inflatePrime PR 10I 0 extproc('inflatePrime') Insert bits 384 D bits 10I 0 value Bit count
|
/external/zlib/src/contrib/blast/ |
H A D | blast.c | 44 int bitcnt; /* number of bits in bit buffer */ 46 /* input limit error return state for bits() and decode() */ 58 * Return need bits from the input stream. This always leaves less than 59 * eight bits in the buffer. bits() works properly for need == 0. 64 * significant bit. Therefore bits are dropped from the bottom of the bit 68 local int bits(struct state *s, int need) function 72 /* load at least need bits into val */ 79 val |= (int)(*(s->in)++) << s->bitcnt; /* load eight bits */ 84 /* drop need bits an [all...] |
/external/zlib/src/contrib/dotzlib/DotZLib/ |
H A D | DotZLib.cs | 230 private static int bitSize(uint bits)
argument 232 switch (bits)
|
/external/zlib/src/contrib/infback9/ |
H A D | infback9.c | 56 unsigned sym, bits, low, size; local 69 bits = 9; 70 inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work); 76 bits = 5; 77 inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work); 94 printf("{%u,%u,%d}", lenfix[low].op, lenfix[low].bits, 105 printf("{%u,%u,%d}", distfix[low].op, distfix[low].bits, 120 bits = 0; \ 143 hold += (unsigned long)(*next++) << bits; \ 144 bits 234 unsigned bits; /* bits in bit buffer */ local [all...] |
H A D | inftree9.c | 23 whose indices are 0..2^bits-1. work is a writable array of at least 27 on return points to the next available entry's address. bits is the 28 requested root table index bits, and on return it is the actual root 29 table index bits. It will differ if the request is greater than the 32 int inflate_table9(type, lens, codes, table, bits, work) 37 unsigned FAR *bits; 40 unsigned len; /* a code's length in bits */ 43 unsigned root; /* number of index bits for root table */ 44 unsigned curr; /* number of index bits for current table */ 45 unsigned drop; /* code bits t [all...] |
H A D | inftree9.h | 14 table that indexes more bits of the code. op indicates whether 17 pointer, the low four bits of op is the number of index bits of 18 that table. For a length or distance, the low four bits of op 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 25 unsigned char op; /* operation, extra bits, table bits */ 26 unsigned char bits; /* bit member in struct:__anon34340 [all...] |
/external/zlib/src/contrib/inflate86/ |
H A D | inffas86.c | 50 state->bits < 8 60 - The maximum input bits used by a length/distance pair is 15 bits for the 61 length code, 5 bits for the length extra, 15 bits for the distance code, 62 and 13 bits for the distance extra. This totals 48 bits, or six bytes. 90 /* 88 44 */ unsigned bits; /* ebx rbx local strm->bits */ member in struct:inffast_ar 119 ar.bits [all...] |
/external/zlib/src/contrib/masmx64/ |
H A D | gvmat64.asm | 5 ; gvmat64.asm -- Asm portion of the optimized longest_match for 32 bits x86_64
214 ; this clear high 32 bits of r8, which can be garbage in both r8 and rdx
|
H A D | inffas8664.c | 57 state->bits < 8
67 - The maximum input bits used by a length/distance pair is 15 bits for the
68 length code, 5 bits for the length extra, 15 bits for the distance code,
69 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
95 /* 88 44 */ unsigned bits; /* ebx rbx local strm->bits */
member in struct:inffast_ar 136 ar.bits [all...] |
H A D | inffasx64.asm | 54 mov ebx, [rsp+88] ; /* ebx = bits */
75 mov cl, bl ; /* cl = bits, needs it for shifting */
76 add bl, 32 ; /* bits += 32 */
78 or rdx, rax ; /* hold |= *((uint *)in)++ << bits */
91 ja L_get_length_code ; /* if (32 < bits) */
94 mov cl, bl ; /* cl = bits, needs it for shifting */
95 add bl, 32 ; /* bits += 32 */
97 or rdx, rax ; /* hold |= *((uint *)in)++ << bits */
103 mov cl, ah ; /* cl = this.bits */
104 sub bl, ah ; /* bits [all...] |
/external/zlib/src/contrib/masmx86/ |
H A D | inffas32.asm | 141 bits_state equ (48+4+zlib1222sup) ;/* state->bits */
|
H A D | match686.asm | 1 ; match686.asm -- Asm portion of the optimized longest_match for 32 bits x86
31 ; this file is not optimized for old pentium, but it compatible with all x86 32 bits
|
/external/zlib/src/contrib/pascal/ |
H A D | zlibpas.pas | 123 function deflatePending(var strm: z_stream; var pending: Integer; var bits: Integer): Integer; 124 function deflatePrime(var strm: z_stream; bits, value: Integer): Integer; 133 function inflatePrime(var strm: z_stream; bits, value: Integer): Integer;
|
/external/zlib/src/contrib/puff/ |
H A D | puff.c | 19 * assumes that long's are at least 32 bits. puff.c uses the short data type, 20 * assumed to be 16 bits, for arrays in order to to conserve memory. The code 48 * are 16 bits 91 #define MAXBITS 15 /* maximum bits in a code */ 109 int bitcnt; /* number of bits in bit buffer */ 111 /* input limit error return state for bits() and decode() */ 116 * Return need bits from the input stream. This always leaves less than 117 * eight bits in the buffer. bits() works properly for need == 0. 122 * significant bit. Therefore bits ar 126 local int bits(struct state *s, int need) function [all...] |
/external/zlib/src/ |
H A D | deflate.c | 230 * output size for (length,distance) codes is <= 24 bits. 450 int ZEXPORT deflatePending (strm, pending, bits) 452 int *bits; 458 if (bits != Z_NULL) 459 *bits = strm->state->bi_valid; 464 int ZEXPORT deflatePrime (strm, bits, value) 466 int bits; 478 if (put > bits) 479 put = bits; 484 bits [all...] |
H A D | infback.c | 92 unsigned sym, bits; local 103 bits = 9; 104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work); 110 bits = 5; 111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work); 135 bits = state->bits; \ 146 state->bits = bits; \ 153 bits 262 unsigned bits; /* bits in bit buffer */ local [all...] |
H A D | inffast.c | 46 state->bits < 8 56 - The maximum input bits used by a length/distance pair is 15 bits for the 57 length code, 5 bits for the length extra, 15 bits for the distance code, 58 and 13 bits for the distance extra. This totals 48 bits, or six bytes. 85 unsigned bits; /* local strm->bits */ local 91 unsigned op; /* code bits, operatio [all...] |
H A D | inflate.c | 30 * - Add comments on state->bits assertion in inffast.c 121 state->bits = 0; 166 /* set number of window bits, free window if different */ 230 int ZEXPORT inflatePrime(strm, bits, value) 232 int bits; 239 if (bits < 0) { 241 state->bits = 0; 244 if (bits > 16 || state->bits + bits > 3 271 unsigned sym, bits; local 614 unsigned bits; /* bits in bit buffer */ local [all...] |
H A D | inflate.h | 32 TYPE, /* i: waiting for type bits, including last-flag bit */ 42 LENEXT, /* i: waiting for length extra bits */ 44 DISTEXT, /* i: waiting for distance extra bits */ 99 unsigned bits; /* number of bits in "in" */ member in struct:inflate_state 104 unsigned extra; /* extra bits needed */ 108 unsigned lenbits; /* index bits for lencode */ 109 unsigned distbits; /* index bits for distcode */ 120 int back; /* bits back of last unprocessed length/lit */
|
H A D | inftrees.c | 23 whose indices are 0..2^bits-1. work is a writable array of at least 27 on return points to the next available entry's address. bits is the 28 requested root table index bits, and on return it is the actual root 29 table index bits. It will differ if the request is greater than the 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) 37 unsigned FAR *bits; 40 unsigned len; /* a code's length in bits */ 43 unsigned root; /* number of index bits for root table */ 44 unsigned curr; /* number of index bits for current table */ 45 unsigned drop; /* code bits t [all...] |
H A D | inftrees.h | 14 table that indexes more bits of the code. op indicates whether 17 pointer, the low four bits of op is the number of index bits of 18 that table. For a length or distance, the low four bits of op 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 25 unsigned char op; /* operation, extra bits, table bits */ 26 unsigned char bits; /* bit member in struct:__anon34356 [all...] |
/external/zlib/src/examples/ |
H A D | gun.c | 117 the gzip trailer is stored modulo 2^32, so it's ok if a long is 32 bits and 168 /* throw out what's left in the current bits byte buffer (this is a vestigial 205 int left; /* bits left in rem */ 206 unsigned rem; /* unused bits from input */ 207 int bits; /* current bits per code */ local 209 unsigned mask; /* mask for current bits codes */ 210 int max; /* maximum bits per code for this stream */ 235 strm->msg = (char *)"lzw bits out of range"; 243 bits [all...] |
H A D | zran.c | 32 necessary the first few bits of the compressed data is read from the file. 33 inflate is initialized with those bits and the 32K of uncompressed data, and 70 int bits; /* number of bits (1-7) from byte at in - 1, or 0 */ member in struct:point 92 local struct access *addpoint(struct access *index, int bits, argument 123 next->bits = bits; 209 except for up to seven bits) -- the totout == 0 provides an 277 ret = fseeko(in, here->in - (here->bits ? 1 : 0), SEEK_SET); 280 if (here->bits) { [all...] |