Lines Matching defs:code
38 * structure assignment. You'll need to fix this code if you have
161 unsigned int code;
163 /* Note that huffsize[] and huffcode[] are filled in code-length order,
183 /* Figure C.1: make table of Huffman code length for each symbol */
197 /* We also validate that the counts represent a legal Huffman code tree. */
199 code = 0;
204 huffcode[p++] = code;
205 code++;
207 /* code is now 1 more than the last code used for codelength si; but
208 * it must still fit in si bits, since no code is allowed to be all ones.
210 if (((INT32) code) >= (((INT32) 1) << _si))
212 code <<= 1;
221 /* valoffset[l] = huffval[] index of 1st symbol of code length l,
222 * minus the minimum code of length l
226 dtbl->maxcode[l] = huffcode[p-1]; /* maximum code of length l */
237 * with that code.
245 /* l = current code's length, p = its index in huffcode[] & huffval[]. */
246 /* Generate left-justified code followed by all possible bit sequences */
273 * Out-of-line code for bit fetching (shared with jdphuff.c).
346 * Save the marker code for later use.
396 * Out-of-line code for Huffman code decoding.
406 register INT32 code;
408 /* HUFF_DECODE has determined that the code is at least min_bits */
412 code = GET_BITS(l);
414 /* Collect the rest of the Huffman code one bit at a time. */
417 while (code > htbl->maxcode[l]) {
418 code <<= 1;
420 code |= GET_BITS(1);
435 return htbl->pub->huffval[ (int) (code + htbl->valoffset[l]) ];
