OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:huff
(Results
1 - 7
of
7
) sorted by null
/external/zlib/src/contrib/infback9/
inftree9.c
48
unsigned
huff
; /* Huffman code */
local
145
filled is at next and has curr index bits. The code being used is
huff
153
of the low root bits of
huff
. This is saved in low to check for when a
194
huff
= 0; /* starting code */
226
/* replicate for those indices with low len bits equal to
huff
*/
231
next[(
huff
>> drop) + fill] = this;
234
/* backwards increment the len-bit code
huff
*/
236
while (
huff
& incr)
239
huff
&= incr - 1;
240
huff
+= incr
[
all
...]
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_inftrees.c
48
unsigned
huff
; /* Huffman code */
local
151
filled is at next and has curr index bits. The code being used is
huff
159
of the low root bits of
huff
. This is saved in low to check for when a
200
huff
= 0; /* starting code */
232
/* replicate for those indices with low len bits equal to
huff
*/
238
next[(
huff
>> drop) + fill] = here;
241
/* backwards increment the len-bit code
huff
*/
243
while (
huff
& incr)
246
huff
&= incr - 1;
247
huff
+= incr
[
all
...]
/external/qemu/distrib/zlib-1.2.8/
inftrees.c
48
unsigned
huff
; /* Huffman code */
local
151
filled is at next and has curr index bits. The code being used is
huff
159
of the low root bits of
huff
. This is saved in low to check for when a
200
huff
= 0; /* starting code */
232
/* replicate for those indices with low len bits equal to
huff
*/
238
next[(
huff
>> drop) + fill] = here;
241
/* backwards increment the len-bit code
huff
*/
243
while (
huff
& incr)
246
huff
&= incr - 1;
247
huff
+= incr
[
all
...]
/external/zlib/src/
inftrees.c
48
unsigned
huff
; /* Huffman code */
local
151
filled is at next and has curr index bits. The code being used is
huff
159
of the low root bits of
huff
. This is saved in low to check for when a
200
huff
= 0; /* starting code */
232
/* replicate for those indices with low len bits equal to
huff
*/
238
next[(
huff
>> drop) + fill] = here;
241
/* backwards increment the len-bit code
huff
*/
243
while (
huff
& incr)
246
huff
&= incr - 1;
247
huff
+= incr
[
all
...]
/external/chromium_org/third_party/zlib/
inftrees.c
48
unsigned
huff
; /* Huffman code */
local
151
filled is at next and has curr index bits. The code being used is
huff
159
of the low root bits of
huff
. This is saved in low to check for when a
200
huff
= 0; /* starting code */
232
/* replicate for those indices with low len bits equal to
huff
*/
238
next[(
huff
>> drop) + fill] = here;
241
/* backwards increment the len-bit code
huff
*/
243
while (
huff
& incr)
246
huff
&= incr - 1;
247
huff
+= incr
[
all
...]
/hardware/intel/img/psb_video/src/
tng_jpegdec.c
723
VAHuffmanTableBufferJPEGBaseline *
huff
= (VAHuffmanTableBufferJPEGBaseline *) obj_buffer->buffer_data;
local
734
table_entries +=
huff
->huffman_table[table_id].num_dc_codes[bit_ind];
741
uint32_t num_codes =
huff
->huffman_table[table_id].num_dc_codes[bit_ind];
769
ctx->symbol_codes[0][table_id][table_ind].symbol =
huff
->huffman_table[table_id].dc_values[table_ind];
779
table_entries +=
huff
->huffman_table[table_id].num_ac_codes[bit_ind];
788
uint32_t num_codes =
huff
->huffman_table[table_id].num_ac_codes[bit_ind];
813
ctx->symbol_codes[1][table_id][table_ind].symbol =
huff
->huffman_table[table_id].ac_values[table_ind];;
[
all
...]
/external/chromium_org/third_party/brotli/src/brotli/dec/
decode.c
282
static const HuffmanCode
huff
[16] = {
local
288
const HuffmanCode* p =
huff
;
[
all
...]
Completed in 121 milliseconds