OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:huff
(Results
1 - 3
of
3
) sorted by null
/external/qemu/distrib/zlib-1.2.3/
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
201
huff
= 0; /* starting code */
232
/* replicate for those indices with low len bits equal to
huff
*/
238
next[(
huff
>> drop) + fill] = this;
241
/* backwards increment the len-bit code
huff
*/
243
while (
huff
& incr)
246
huff
&= incr - 1;
247
huff
+= incr
[
all
...]
/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/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
...]
Completed in 226 milliseconds