| /external/jpeg/ |
| jchuff.h | 47 JPP((j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[]));
|
| jdhuff.h | 177 #define HUFF_DECODE(result,state,htbl,failaction,slowlabel) \
187 if ((nb = htbl->look_nbits[look]) != 0) { \
189 result = htbl->look_sym[look]; \
193 if ((result=jpeg_huff_decode(&state,get_buffer,bits_left,htbl,nb)) < 0) \
202 register int bits_left, d_derived_tbl * htbl, int min_bits));
|
| jdhuff.c | 153 JHUFF_TBL *htbl; local
162 * paralleling the order of the symbols themselves in htbl->huffval[].
168 htbl =
170 if (htbl == NULL)
179 dtbl->pub = htbl; /* fill in back link */
185 i = (int) htbl->bits[l];
218 if (htbl->bits[l]) {
223 p += htbl->bits[l];
242 for (i = 1; i <= (int) htbl->bits[l]; i++, p++) {
248 dtbl->look_sym[lookbits] = htbl->huffval[p]
[all...] |
| jcmarker.c | 187 JHUFF_TBL * htbl; local
191 htbl = cinfo->ac_huff_tbl_ptrs[index];
194 htbl = cinfo->dc_huff_tbl_ptrs[index];
197 if (htbl == NULL)
200 if (! htbl->sent_table) {
205 length += htbl->bits[i];
211 emit_byte(cinfo, htbl->bits[i]);
214 emit_byte(cinfo, htbl->huffval[i]);
216 htbl->sent_table = TRUE;
|
| jcapimin.c | 123 JHUFF_TBL * htbl; local
131 if ((htbl = cinfo->dc_huff_tbl_ptrs[i]) != NULL)
132 htbl->sent_table = suppress;
133 if ((htbl = cinfo->ac_huff_tbl_ptrs[i]) != NULL)
134 htbl->sent_table = suppress;
|
| jchuff.c | 182 JHUFF_TBL *htbl; local
190 * paralleling the order of the symbols themselves in htbl->huffval[].
196 htbl =
198 if (htbl == NULL)
212 i = (int) htbl->bits[l];
258 i = htbl->huffval[p];
677 * Generate the best Huffman code table for the given counts, fill htbl.
705 jpeg_gen_optimal_table (j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[])
820 MEMCOPY(htbl->bits, bits, SIZEOF(htbl->bits))
[all...] |
| /external/pdfium/core/src/fxcodec/libjpeg/ |
| jchuff.h | 47 JPP((j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[]));
|
| jdhuff.h | 176 #define HUFF_DECODE(result,state,htbl,failaction,slowlabel) \
186 if ((nb = htbl->look_nbits[look]) != 0) { \
188 result = htbl->look_sym[look]; \
192 if ((result=jpeg_huff_decode(&state,get_buffer,bits_left,htbl,nb)) < 0) \
201 register int bits_left, d_derived_tbl * htbl, int min_bits));
|
| fpdfapi_jdhuff.c | 156 JHUFF_TBL *htbl;
local
165 * paralleling the order of the symbols themselves in htbl->huffval[].
171 htbl =
173 if (htbl == NULL)
182 dtbl->pub = htbl; /* fill in back link */
188 i = (int) htbl->bits[l];
221 if (htbl->bits[l]) {
226 p += htbl->bits[l];
245 for (i = 1; i <= (int) htbl->bits[l]; i++, p++) {
251 dtbl->look_sym[lookbits] = htbl->huffval[p];
[all...] |
| fpdfapi_jcmarker.c | 188 JHUFF_TBL * htbl;
local
192 htbl = cinfo->ac_huff_tbl_ptrs[index];
195 htbl = cinfo->dc_huff_tbl_ptrs[index];
198 if (htbl == NULL)
201 if (! htbl->sent_table) {
206 length += htbl->bits[i];
212 emit_byte(cinfo, htbl->bits[i]);
215 emit_byte(cinfo, htbl->huffval[i]);
217 htbl->sent_table = TRUE;
|
| fpdfapi_jcapimin.c | 124 JHUFF_TBL * htbl;
local
132 if ((htbl = cinfo->dc_huff_tbl_ptrs[i]) != NULL)
133 htbl->sent_table = suppress;
134 if ((htbl = cinfo->ac_huff_tbl_ptrs[i]) != NULL)
135 htbl->sent_table = suppress;
|
| fpdfapi_jchuff.c | 186 JHUFF_TBL *htbl;
local
194 * paralleling the order of the symbols themselves in htbl->huffval[].
200 htbl =
202 if (htbl == NULL)
216 i = (int) htbl->bits[l];
262 i = htbl->huffval[p];
681 * Generate the best Huffman code table for the given counts, fill htbl.
709 jpeg_gen_optimal_table (j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[])
824 MEMCOPY(htbl->bits, bits, SIZEOF(htbl->bits));
[all...] |
| /external/qemu/distrib/jpeg-6b/ |
| jchuff.h | 47 JPP((j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[]));
|
| jdhuff.h | 177 #define HUFF_DECODE(result,state,htbl,failaction,slowlabel) \
187 if ((nb = htbl->look_nbits[look]) != 0) { \
189 result = htbl->look_sym[look]; \
193 if ((result=jpeg_huff_decode(&state,get_buffer,bits_left,htbl,nb)) < 0) \
202 register int bits_left, d_derived_tbl * htbl, int min_bits));
|
| jdhuff.c | 153 JHUFF_TBL *htbl; local
162 * paralleling the order of the symbols themselves in htbl->huffval[].
168 htbl =
170 if (htbl == NULL)
179 dtbl->pub = htbl; /* fill in back link */
185 i = (int) htbl->bits[l];
218 if (htbl->bits[l]) {
223 p += htbl->bits[l];
242 for (i = 1; i <= (int) htbl->bits[l]; i++, p++) {
248 dtbl->look_sym[lookbits] = htbl->huffval[p]
[all...] |
| jcmarker.c | 187 JHUFF_TBL * htbl; local
191 htbl = cinfo->ac_huff_tbl_ptrs[index];
194 htbl = cinfo->dc_huff_tbl_ptrs[index];
197 if (htbl == NULL)
200 if (! htbl->sent_table) {
205 length += htbl->bits[i];
211 emit_byte(cinfo, htbl->bits[i]);
214 emit_byte(cinfo, htbl->huffval[i]);
216 htbl->sent_table = TRUE;
|
| jcapimin.c | 123 JHUFF_TBL * htbl; local
131 if ((htbl = cinfo->dc_huff_tbl_ptrs[i]) != NULL)
132 htbl->sent_table = suppress;
133 if ((htbl = cinfo->ac_huff_tbl_ptrs[i]) != NULL)
134 htbl->sent_table = suppress;
|
| jchuff.c | 182 JHUFF_TBL *htbl; local
190 * paralleling the order of the symbols themselves in htbl->huffval[].
196 htbl =
198 if (htbl == NULL)
212 i = (int) htbl->bits[l];
258 i = htbl->huffval[p];
677 * Generate the best Huffman code table for the given counts, fill htbl.
705 jpeg_gen_optimal_table (j_compress_ptr cinfo, JHUFF_TBL * htbl, long freq[])
820 MEMCOPY(htbl->bits, bits, SIZEOF(htbl->bits))
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | |
| org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar | |
