Searched refs:lens (Results 1 - 25 of 46) sorted by relevance

12

/external/python/cpython2/Modules/zlib/
H A Dinftrees.h60 int ZLIB_INTERNAL inflate_table OF((codetype type, unsigned short FAR *lens,
H A Dinftrees.c22 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
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
34 unsigned short FAR *lens;
77 code lengths are lens[0..codes-1]. Each length corresponds to the
89 lens[] are in the range 0..MAXBITS. The caller must assure this.
106 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
110 count[lens[sym]]++;
147 if (lens[sym] != 0) work[offs[lens[sy
[all...]
H A Dinfback.c97 while (sym < 144) state->lens[sym++] = 8;
98 while (sym < 256) state->lens[sym++] = 9;
99 while (sym < 280) state->lens[sym++] = 7;
100 while (sym < 288) state->lens[sym++] = 8;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
108 while (sym < 32) state->lens[sym++] = 5;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
380 state->lens[order[state->have++]] = (unsigned short)BITS(3);
384 state->lens[order[state->have++]] = 0;
388 ret = inflate_table(CODES, state->lens, 1
[all...]
H A Dinflate.h114 unsigned have; /* number of code lengths in lens[] */
116 unsigned short lens[320]; /* temporary storage for code lengths */ member in struct:inflate_state
/external/python/cpython3/Modules/zlib/
H A Dinftrees.h60 int ZLIB_INTERNAL inflate_table OF((codetype type, unsigned short FAR *lens,
H A Dinftrees.c22 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
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
34 unsigned short FAR *lens;
77 code lengths are lens[0..codes-1]. Each length corresponds to the
89 lens[] are in the range 0..MAXBITS. The caller must assure this.
106 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
110 count[lens[sym]]++;
147 if (lens[sym] != 0) work[offs[lens[sy
[all...]
H A Dinfback.c97 while (sym < 144) state->lens[sym++] = 8;
98 while (sym < 256) state->lens[sym++] = 9;
99 while (sym < 280) state->lens[sym++] = 7;
100 while (sym < 288) state->lens[sym++] = 8;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
108 while (sym < 32) state->lens[sym++] = 5;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
380 state->lens[order[state->have++]] = (unsigned short)BITS(3);
384 state->lens[order[state->have++]] = 0;
388 ret = inflate_table(CODES, state->lens, 1
[all...]
/external/syslinux/com32/lib/zlib/
H A Dinftrees.h60 int ZLIB_INTERNAL inflate_table OF((codetype type, unsigned short FAR *lens,
H A Dinfback.c88 while (sym < 144) state->lens[sym++] = 8;
89 while (sym < 256) state->lens[sym++] = 9;
90 while (sym < 280) state->lens[sym++] = 7;
91 while (sym < 288) state->lens[sym++] = 8;
95 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
99 while (sym < 32) state->lens[sym++] = 5;
102 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
371 state->lens[order[state->have++]] = (unsigned short)BITS(3);
375 state->lens[order[state->have++]] = 0;
379 ret = inflate_table(CODES, state->lens, 1
[all...]
H A Dinflate.h114 unsigned have; /* number of code lengths in lens[] */
116 unsigned short lens[320]; /* temporary storage for code lengths */ member in struct:inflate_state
H A Dinftrees.c22 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
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
34 unsigned short FAR *lens;
77 code lengths are lens[0..codes-1]. Each length corresponds to the
89 lens[] are in the range 0..MAXBITS. The caller must assure this.
106 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
110 count[lens[sym]]++;
147 if (lens[sym] != 0) work[offs[lens[sy
[all...]
/external/zlib/src/contrib/infback9/
H A Dinflate9.h42 unsigned have; /* number of code lengths in lens[] */
44 unsigned short lens[320]; /* temporary storage for code lengths */ member in struct:inflate_state
H A Dinftree9.h59 extern int inflate_table9 OF((codetype type, unsigned short FAR *lens,
H A Dinfback9.c63 while (sym < 144) state.lens[sym++] = 8;
64 while (sym < 256) state.lens[sym++] = 9;
65 while (sym < 280) state.lens[sym++] = 7;
66 while (sym < 288) state.lens[sym++] = 8;
70 inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
74 while (sym < 32) state.lens[sym++] = 5;
77 inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
364 state->lens[order[state->have++]] = (unsigned short)BITS(3);
368 state->lens[order[state->have++]] = 0;
372 ret = inflate_table9(CODES, state->lens, 1
[all...]
H A Dinftree9.c22 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
32 int inflate_table9(type, lens, codes, table, bits, work)
34 unsigned short FAR *lens;
79 code lengths are lens[0..codes-1]. Each length corresponds to the
91 lens[] are in the range 0..MAXBITS. The caller must assure this.
108 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
112 count[lens[sym]]++;
141 if (lens[sym] != 0) work[offs[lens[sy
[all...]
/external/zlib/src/
H A Dinftrees.h60 int ZLIB_INTERNAL inflate_table OF((codetype type, unsigned short FAR *lens,
H A Dinftrees.c22 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
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
34 unsigned short FAR *lens;
77 code lengths are lens[0..codes-1]. Each length corresponds to the
89 lens[] are in the range 0..MAXBITS. The caller must assure this.
106 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
110 count[lens[sym]]++;
147 if (lens[sym] != 0) work[offs[lens[sy
[all...]
H A Dinfback.c97 while (sym < 144) state->lens[sym++] = 8;
98 while (sym < 256) state->lens[sym++] = 9;
99 while (sym < 280) state->lens[sym++] = 7;
100 while (sym < 288) state->lens[sym++] = 8;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
108 while (sym < 32) state->lens[sym++] = 5;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
380 state->lens[order[state->have++]] = (unsigned short)BITS(3);
384 state->lens[order[state->have++]] = 0;
388 ret = inflate_table(CODES, state->lens, 1
[all...]
/external/puffin/src/
H A Dhuffman_table.cc52 bool HuffmanTable::InitHuffmanCodes(const Buffer& lens, size_t* max_bits) { argument
58 for (auto len : lens) {
87 for (size_t idx = 0; idx < lens.size(); idx++) {
88 auto len = lens[idx];
109 bool HuffmanTable::BuildHuffmanCodes(const Buffer& lens, argument
112 TEST_AND_RETURN_FALSE(InitHuffmanCodes(lens, max_bits));
116 [&lens](const CodeIndexPair& a, const CodeIndexPair& b) {
117 return lens[a.index] > lens[b.index];
126 auto fill_bits = *max_bits - lens[ci
137 BuildHuffmanReverseCodes(const Buffer& lens, std::vector<uint16_t>* rcodes, size_t* max_bits) argument
321 BuildHuffmanCodeLengths(BitReaderInterface* br, uint8_t* buffer, size_t* length, size_t max_bits, size_t num_codes, Buffer* lens, Error* error) argument
493 BuildHuffmanCodeLengths(const uint8_t* buffer, size_t* length, BitWriterInterface* bw, size_t num_codes, Buffer* lens, Error* error) argument
[all...]
H A Dhuffman_table.h207 // |lens| IN The input array of code lengths.
209 bool InitHuffmanCodes(const Buffer& lens, size_t* max_bits);
212 // |lens| IN The input array of code lengths.
215 bool BuildHuffmanCodes(const Buffer& lens,
220 // |lens| IN The input array of code lengths.
223 bool BuildHuffmanReverseCodes(const Buffer& lens,
238 // |lens| OUT The resulting Huffman code length array.
245 Buffer* lens,
257 // |lens| OUT The Huffman code lengths array.
263 Buffer* lens,
[all...]
/external/valgrind/none/tests/x86/
H A Dbug152818-x86.c79 const int lens[] = { 4, 3, 2, 1, 0, 0, 1, 2, 3, 4}; variable
91 for (idx = 0; idx < sizeof (lens)/sizeof(lens[0]); ++idx)
130 len = lens[idx];
131 df = (idx >= (sizeof(lens)/sizeof(lens[0]))/2);
/external/e2fsprogs/lib/blkid/
H A Ddevname.c405 int lens[2] = { 0, 0 }; local
453 lens[which] = strlen(ptname);
456 if (isdigit(ptname[lens[which] - 1])) {
464 lens[which] = 0; /* mark as checked */
472 if (lens[last] && !strncmp(ptnames[last], ptname, lens[last])) {
488 lens[last] = 0;
495 if (lens[last] && strncmp(ptnames[last], ptname, lens[last])) {
501 lens[las
[all...]
/external/icu/icu4c/source/samples/cal/
H A Dcal.c429 int32_t lens [DAY_COUNT]; local
457 lens[i] = u_strlen(days[i]);
458 width += lens[i];
496 indent(lens[i] + 1, stdout);
506 pad = lens[current] - u_strlen(s);
547 int32_t lens [DAY_COUNT]; local
580 lens[i] = u_strlen(days[i]);
581 width += lens[i];
670 indent(lens[j] + 1, stdout);
677 pad = lens[left_curren
[all...]
/external/bsdiff/
H A Dbsdiff.cc73 ssize_t overlap,Ss,lens; local
160 s=0;Ss=0;lens=0;
166 if(s>Ss) { Ss=s; lens=i+1; };
169 lenf+=lens-overlap;
170 lenb-=lens;
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/bidi/
H A DTestStreaming.java37 public TestCase(String in, int ch, int[] np, int[][] lens, String[] msg) { argument
41 this.portionLens = lens;

Completed in 1280 milliseconds

12