HomeSort by: relevance | last modified time | path
    Searched defs:huff (Results 1 - 12 of 12) sorted by relevancy

  /src/common/dist/zlib/contrib/infback9/
inftree9.c 43 unsigned huff; /* Huffman code */ local
140 filled is at next and has curr index bits. The code being used is huff
148 of the low root bits of huff. This is saved in low to check for when a
189 huff = 0; /* starting code */
221 /* replicate for those indices with low len bits equal to huff */
226 next[(huff >> drop) + fill] = this;
229 /* backwards increment the len-bit code huff */
231 while (huff & incr)
234 huff &= incr - 1;
235 huff += incr
    [all...]
  /src/common/dist/zlib/
inftrees.c 45 unsigned huff; /* Huffman code */ local
148 filled is at next and has curr index bits. The code being used is huff
156 of the low root bits of huff. This is saved in low to check for when a
195 huff = 0; /* starting code */
227 /* replicate for those indices with low len bits equal to huff */
233 next[(huff >> drop) + fill] = here;
236 /* backwards increment the len-bit code huff */
238 while (huff & incr)
241 huff &= incr - 1;
242 huff += incr
    [all...]
  /src/external/cddl/osnet/dist/uts/common/zmod/
inftrees.c 50 unsigned huff; /* Huffman code */ local
153 filled is at next and has curr index bits. The code being used is huff
161 of the low root bits of huff. This is saved in low to check for when a
203 huff = 0; /* starting code */
234 /* replicate for those indices with low len bits equal to huff */
240 next[(huff >> drop) + fill] = this;
243 /* backwards increment the len-bit code huff */
245 while (huff & incr)
248 huff &= incr - 1;
249 huff += incr
    [all...]
  /src/external/gpl3/binutils/dist/zlib/contrib/infback9/
inftree9.c 43 unsigned huff; /* Huffman code */ local
140 filled is at next and has curr index bits. The code being used is huff
148 of the low root bits of huff. This is saved in low to check for when a
189 huff = 0; /* starting code */
221 /* replicate for those indices with low len bits equal to huff */
226 next[(huff >> drop) + fill] = this;
229 /* backwards increment the len-bit code huff */
231 while (huff & incr)
234 huff &= incr - 1;
235 huff += incr
    [all...]
  /src/external/gpl3/binutils/dist/zlib/
inftrees.c 43 unsigned huff; /* Huffman code */ local
146 filled is at next and has curr index bits. The code being used is huff
154 of the low root bits of huff. This is saved in low to check for when a
193 huff = 0; /* starting code */
225 /* replicate for those indices with low len bits equal to huff */
231 next[(huff >> drop) + fill] = here;
234 /* backwards increment the len-bit code huff */
236 while (huff & incr)
239 huff &= incr - 1;
240 huff += incr
    [all...]
  /src/external/gpl3/binutils.old/dist/zlib/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...]
  /src/external/gpl3/binutils.old/dist/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
198 huff = 0; /* starting code */
230 /* replicate for those indices with low len bits equal to huff */
236 next[(huff >> drop) + fill] = here;
239 /* backwards increment the len-bit code huff */
241 while (huff & incr)
244 huff &= incr - 1;
245 huff += incr
    [all...]
  /src/external/gpl3/gdb/dist/zlib/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...]
  /src/external/gpl3/gdb/dist/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
198 huff = 0; /* starting code */
230 /* replicate for those indices with low len bits equal to huff */
236 next[(huff >> drop) + fill] = here;
239 /* backwards increment the len-bit code huff */
241 while (huff & incr)
244 huff &= incr - 1;
245 huff += incr
    [all...]
  /src/external/gpl3/gdb.old/dist/zlib/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...]
  /src/external/gpl3/gdb.old/dist/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
198 huff = 0; /* starting code */
230 /* replicate for those indices with low len bits equal to huff */
236 next[(huff >> drop) + fill] = here;
239 /* backwards increment the len-bit code huff */
241 while (huff & incr)
244 huff &= incr - 1;
245 huff += incr
    [all...]
  /src/crypto/external/bsd/netpgp/dist/src/netpgpverify/
zlib.c 776 unsigned huff; /* Huffman code */ local
879 filled is at next and has curr index bits. The code being used is huff
887 of the low root bits of huff. This is saved in low to check for when a
929 huff = 0; /* starting code */
960 /* replicate for those indices with low len bits equal to huff */
966 next[(huff >> drop) + fill] = this;
969 /* backwards increment the len-bit code huff */
971 while (huff & incr)
974 huff &= incr - 1;
975 huff += incr
    [all...]

Completed in 35 milliseconds