/src/ghostpdl/obj/jdmarker.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * jdmarker.c |
3 | | * |
4 | | * Copyright (C) 1991-1998, Thomas G. Lane. |
5 | | * Modified 2009-2019 by Guido Vollbeding. |
6 | | * This file is part of the Independent JPEG Group's software. |
7 | | * For conditions of distribution and use, see the accompanying README file. |
8 | | * |
9 | | * This file contains routines to decode JPEG datastream markers. |
10 | | * Most of the complexity arises from our desire to support input |
11 | | * suspension: if not all of the data for a marker is available, |
12 | | * we must exit back to the application. On resumption, we reprocess |
13 | | * the marker. |
14 | | */ |
15 | | |
16 | | #define JPEG_INTERNALS |
17 | | #include "jinclude.h" |
18 | | #include "jpeglib.h" |
19 | | |
20 | | |
21 | | typedef enum { /* JPEG marker codes */ |
22 | | M_SOF0 = 0xc0, |
23 | | M_SOF1 = 0xc1, |
24 | | M_SOF2 = 0xc2, |
25 | | M_SOF3 = 0xc3, |
26 | | |
27 | | M_SOF5 = 0xc5, |
28 | | M_SOF6 = 0xc6, |
29 | | M_SOF7 = 0xc7, |
30 | | |
31 | | M_JPG = 0xc8, |
32 | | M_SOF9 = 0xc9, |
33 | | M_SOF10 = 0xca, |
34 | | M_SOF11 = 0xcb, |
35 | | |
36 | | M_SOF13 = 0xcd, |
37 | | M_SOF14 = 0xce, |
38 | | M_SOF15 = 0xcf, |
39 | | |
40 | | M_DHT = 0xc4, |
41 | | |
42 | | M_DAC = 0xcc, |
43 | | |
44 | | M_RST0 = 0xd0, |
45 | | M_RST1 = 0xd1, |
46 | | M_RST2 = 0xd2, |
47 | | M_RST3 = 0xd3, |
48 | | M_RST4 = 0xd4, |
49 | | M_RST5 = 0xd5, |
50 | | M_RST6 = 0xd6, |
51 | | M_RST7 = 0xd7, |
52 | | |
53 | | M_SOI = 0xd8, |
54 | | M_EOI = 0xd9, |
55 | | M_SOS = 0xda, |
56 | | M_DQT = 0xdb, |
57 | | M_DNL = 0xdc, |
58 | | M_DRI = 0xdd, |
59 | | M_DHP = 0xde, |
60 | | M_EXP = 0xdf, |
61 | | |
62 | | M_APP0 = 0xe0, |
63 | | M_APP1 = 0xe1, |
64 | | M_APP2 = 0xe2, |
65 | | M_APP3 = 0xe3, |
66 | | M_APP4 = 0xe4, |
67 | | M_APP5 = 0xe5, |
68 | | M_APP6 = 0xe6, |
69 | | M_APP7 = 0xe7, |
70 | | M_APP8 = 0xe8, |
71 | | M_APP9 = 0xe9, |
72 | | M_APP10 = 0xea, |
73 | | M_APP11 = 0xeb, |
74 | | M_APP12 = 0xec, |
75 | | M_APP13 = 0xed, |
76 | | M_APP14 = 0xee, |
77 | | M_APP15 = 0xef, |
78 | | |
79 | | M_JPG0 = 0xf0, |
80 | | M_JPG8 = 0xf8, |
81 | | M_JPG13 = 0xfd, |
82 | | M_COM = 0xfe, |
83 | | |
84 | | M_TEM = 0x01, |
85 | | |
86 | | M_ERROR = 0x100 |
87 | | } JPEG_MARKER; |
88 | | |
89 | | |
90 | | /* Private state */ |
91 | | |
92 | | typedef struct { |
93 | | struct jpeg_marker_reader pub; /* public fields */ |
94 | | |
95 | | /* Application-overridable marker processing methods */ |
96 | | jpeg_marker_parser_method process_COM; |
97 | | jpeg_marker_parser_method process_APPn[16]; |
98 | | |
99 | | /* Limit on marker data length to save for each marker type */ |
100 | | unsigned int length_limit_COM; |
101 | | unsigned int length_limit_APPn[16]; |
102 | | |
103 | | /* Status of COM/APPn marker saving */ |
104 | | jpeg_saved_marker_ptr cur_marker; /* NULL if not processing a marker */ |
105 | | unsigned int bytes_read; /* data bytes read so far in marker */ |
106 | | /* Note: cur_marker is not linked into marker_list until it's all read. */ |
107 | | } my_marker_reader; |
108 | | |
109 | | typedef my_marker_reader * my_marker_ptr; |
110 | | |
111 | | |
112 | | /* |
113 | | * Macros for fetching data from the data source module. |
114 | | * |
115 | | * At all times, cinfo->src->next_input_byte and ->bytes_in_buffer reflect |
116 | | * the current restart point; we update them only when we have reached a |
117 | | * suitable place to restart if a suspension occurs. |
118 | | */ |
119 | | |
120 | | /* Declare and initialize local copies of input pointer/count */ |
121 | | #define INPUT_VARS(cinfo) \ |
122 | 254k | struct jpeg_source_mgr * datasrc = (cinfo)->src; \ |
123 | 254k | const JOCTET * next_input_byte = datasrc->next_input_byte; \ |
124 | 254k | size_t bytes_in_buffer = datasrc->bytes_in_buffer |
125 | | |
126 | | /* Unload the local copies --- do this only at a restart boundary */ |
127 | | #define INPUT_SYNC(cinfo) \ |
128 | 18.7M | ( datasrc->next_input_byte = next_input_byte, \ |
129 | 18.7M | datasrc->bytes_in_buffer = bytes_in_buffer ) |
130 | | |
131 | | /* Reload the local copies --- used only in MAKE_BYTE_AVAIL */ |
132 | | #define INPUT_RELOAD(cinfo) \ |
133 | 0 | ( next_input_byte = datasrc->next_input_byte, \ |
134 | 0 | bytes_in_buffer = datasrc->bytes_in_buffer ) |
135 | | |
136 | | /* Internal macro for INPUT_BYTE and INPUT_2BYTES: make a byte available. |
137 | | * Note we do *not* do INPUT_SYNC before calling fill_input_buffer, |
138 | | * but we must reload the local copies after a successful fill. |
139 | | */ |
140 | | #define MAKE_BYTE_AVAIL(cinfo,action) \ |
141 | 0 | if (bytes_in_buffer == 0) { \ |
142 | 0 | if (! (*datasrc->fill_input_buffer) (cinfo)) \ |
143 | 0 | { action; } \ |
144 | 0 | INPUT_RELOAD(cinfo); \ |
145 | 0 | } |
146 | | |
147 | | /* Read a byte into variable V. |
148 | | * If must suspend, take the specified action (typically "return FALSE"). |
149 | | */ |
150 | | #define INPUT_BYTE(cinfo,V,action) \ |
151 | 24.0M | MAKESTMT( MAKE_BYTE_AVAIL(cinfo,action); \ |
152 | 21.3M | bytes_in_buffer--; \ |
153 | 21.3M | V = GETJOCTET(*next_input_byte++); ) |
154 | | |
155 | | /* As above, but read two bytes interpreted as an unsigned 16-bit integer. |
156 | | * V should be declared unsigned int or perhaps INT32. |
157 | | */ |
158 | | #define INPUT_2BYTES(cinfo,V,action) \ |
159 | 131k | MAKESTMT( MAKE_BYTE_AVAIL(cinfo,action); \ |
160 | 1.46M | bytes_in_buffer--; \ |
161 | 1.46M | V = ((unsigned int) GETJOCTET(*next_input_byte++)) << 8; \ |
162 | 1.46M | MAKE_BYTE_AVAIL(cinfo,action); \ |
163 | 1.46M | bytes_in_buffer--; \ |
164 | 1.46M | V += GETJOCTET(*next_input_byte++); ) |
165 | | |
166 | | |
167 | | /* |
168 | | * Routines to process JPEG markers. |
169 | | * |
170 | | * Entry condition: JPEG marker itself has been read and its code saved |
171 | | * in cinfo->unread_marker; input restart point is just after the marker. |
172 | | * |
173 | | * Exit: if return TRUE, have read and processed any parameters, and have |
174 | | * updated the restart point to point after the parameters. |
175 | | * If return FALSE, was forced to suspend before reaching end of |
176 | | * marker parameters; restart point has not been moved. Same routine |
177 | | * will be called again after application supplies more input data. |
178 | | * |
179 | | * This approach to suspension assumes that all of a marker's parameters |
180 | | * can fit into a single input bufferload. This should hold for "normal" |
181 | | * markers. Some COM/APPn markers might have large parameter segments |
182 | | * that might not fit. If we are simply dropping such a marker, we use |
183 | | * skip_input_data to get past it, and thereby put the problem on the |
184 | | * source manager's shoulders. If we are saving the marker's contents |
185 | | * into memory, we use a slightly different convention: when forced to |
186 | | * suspend, the marker processor updates the restart point to the end of |
187 | | * what it's consumed (ie, the end of the buffer) before returning FALSE. |
188 | | * On resumption, cinfo->unread_marker still contains the marker code, |
189 | | * but the data source will point to the next chunk of marker data. |
190 | | * The marker processor must retain internal state to deal with this. |
191 | | * |
192 | | * Note that we don't bother to avoid duplicate trace messages if a |
193 | | * suspension occurs within marker parameters. Other side effects |
194 | | * require more care. |
195 | | */ |
196 | | |
197 | | |
198 | | LOCAL(boolean) |
199 | | get_soi (j_decompress_ptr cinfo) |
200 | | /* Process an SOI marker */ |
201 | 13.6k | { |
202 | 13.6k | int i; |
203 | | |
204 | 13.6k | TRACEMS(cinfo, 1, JTRC_SOI); |
205 | | |
206 | 13.6k | if (cinfo->marker->saw_SOI) |
207 | 424 | ERREXIT(cinfo, JERR_SOI_DUPLICATE); |
208 | | |
209 | | /* Reset all parameters that are defined to be reset by SOI */ |
210 | | |
211 | 225k | for (i = 0; i < NUM_ARITH_TBLS; i++) { |
212 | 211k | cinfo->arith_dc_L[i] = 0; |
213 | 211k | cinfo->arith_dc_U[i] = 1; |
214 | 211k | cinfo->arith_ac_K[i] = 5; |
215 | 211k | } |
216 | 13.6k | cinfo->restart_interval = 0; |
217 | | |
218 | | /* Set initial assumptions for colorspace etc */ |
219 | | |
220 | 13.6k | cinfo->jpeg_color_space = JCS_UNKNOWN; |
221 | 13.6k | cinfo->color_transform = JCT_NONE; |
222 | 13.6k | cinfo->CCIR601_sampling = FALSE; /* Assume non-CCIR sampling??? */ |
223 | | |
224 | 13.6k | cinfo->saw_JFIF_marker = FALSE; |
225 | 13.6k | cinfo->JFIF_major_version = 1; /* set default JFIF APP0 values */ |
226 | 13.6k | cinfo->JFIF_minor_version = 1; |
227 | 13.6k | cinfo->density_unit = 0; |
228 | 13.6k | cinfo->X_density = 1; |
229 | 13.6k | cinfo->Y_density = 1; |
230 | 13.6k | cinfo->saw_Adobe_marker = FALSE; |
231 | 13.6k | cinfo->Adobe_transform = 0; |
232 | | |
233 | 13.6k | cinfo->marker->saw_SOI = TRUE; |
234 | | |
235 | 13.6k | return TRUE; |
236 | 13.6k | } |
237 | | |
238 | | |
239 | | LOCAL(boolean) |
240 | | get_sof (j_decompress_ptr cinfo, boolean is_baseline, boolean is_prog, |
241 | | boolean is_arith) |
242 | | /* Process a SOFn marker */ |
243 | 10.8k | { |
244 | 10.8k | INT32 length; |
245 | 10.8k | int c, ci, i; |
246 | 10.8k | jpeg_component_info * compptr; |
247 | 10.8k | INPUT_VARS(cinfo); |
248 | | |
249 | 10.8k | cinfo->is_baseline = is_baseline; |
250 | 10.8k | cinfo->progressive_mode = is_prog; |
251 | 10.8k | cinfo->arith_code = is_arith; |
252 | | |
253 | 10.8k | INPUT_2BYTES(cinfo, length, return FALSE); |
254 | | |
255 | 10.8k | INPUT_BYTE(cinfo, cinfo->data_precision, return FALSE); |
256 | 10.8k | INPUT_2BYTES(cinfo, cinfo->image_height, return FALSE); |
257 | 10.8k | INPUT_2BYTES(cinfo, cinfo->image_width, return FALSE); |
258 | 10.8k | INPUT_BYTE(cinfo, cinfo->num_components, return FALSE); |
259 | | |
260 | 10.8k | length -= 8; |
261 | | |
262 | 10.8k | TRACEMS4(cinfo, 1, JTRC_SOF, cinfo->unread_marker, |
263 | 10.8k | (int) cinfo->image_width, (int) cinfo->image_height, |
264 | 10.8k | cinfo->num_components); |
265 | | |
266 | 10.8k | if (cinfo->marker->saw_SOF) |
267 | 25 | ERREXIT(cinfo, JERR_SOF_DUPLICATE); |
268 | | |
269 | | /* We don't support files in which the image height is initially specified */ |
270 | | /* as 0 and is later redefined by DNL. As long as we have to check that, */ |
271 | | /* might as well have a general sanity check. */ |
272 | 10.8k | if (cinfo->image_height <= 0 || cinfo->image_width <= 0 || |
273 | 10.8k | cinfo->num_components <= 0) |
274 | 39 | ERREXIT(cinfo, JERR_EMPTY_IMAGE); |
275 | | |
276 | 10.8k | if (length != (cinfo->num_components * 3)) |
277 | 18 | ERREXIT(cinfo, JERR_BAD_LENGTH); |
278 | | |
279 | 10.8k | if (cinfo->comp_info == NULL) /* do only once, even if suspend */ |
280 | 10.7k | cinfo->comp_info = (jpeg_component_info *) (*cinfo->mem->alloc_small) |
281 | 10.7k | ((j_common_ptr) cinfo, JPOOL_IMAGE, |
282 | 10.7k | cinfo->num_components * SIZEOF(jpeg_component_info)); |
283 | | |
284 | 41.7k | for (ci = 0; ci < cinfo->num_components; ci++) { |
285 | 30.8k | INPUT_BYTE(cinfo, c, return FALSE); |
286 | | /* Check to see whether component id has already been seen */ |
287 | | /* (in violation of the spec, but unfortunately seen in some */ |
288 | | /* files). If so, create "fake" component id equal to the */ |
289 | | /* max id seen so far + 1. */ |
290 | 61.7k | for (i = 0, compptr = cinfo->comp_info; i < ci; i++, compptr++) { |
291 | 30.8k | if (c == compptr->component_id) { |
292 | 9 | compptr = cinfo->comp_info; |
293 | 9 | c = compptr->component_id; |
294 | 9 | compptr++; |
295 | 19 | for (i = 1; i < ci; i++, compptr++) { |
296 | 10 | if (compptr->component_id > c) c = compptr->component_id; |
297 | 10 | } |
298 | 9 | c++; |
299 | 9 | break; |
300 | 9 | } |
301 | 30.8k | } |
302 | 30.8k | compptr->component_id = c; |
303 | 30.8k | compptr->component_index = ci; |
304 | 30.8k | INPUT_BYTE(cinfo, c, return FALSE); |
305 | 30.8k | compptr->h_samp_factor = (c >> 4) & 15; |
306 | 30.8k | compptr->v_samp_factor = (c ) & 15; |
307 | 30.8k | INPUT_BYTE(cinfo, compptr->quant_tbl_no, return FALSE); |
308 | | |
309 | 30.8k | TRACEMS4(cinfo, 1, JTRC_SOF_COMPONENT, |
310 | 30.8k | compptr->component_id, compptr->h_samp_factor, |
311 | 30.8k | compptr->v_samp_factor, compptr->quant_tbl_no); |
312 | 30.8k | } |
313 | | |
314 | 10.8k | cinfo->marker->saw_SOF = TRUE; |
315 | | |
316 | 10.8k | INPUT_SYNC(cinfo); |
317 | 10.8k | return TRUE; |
318 | 10.8k | } |
319 | | |
320 | | |
321 | | LOCAL(boolean) |
322 | | get_sos (j_decompress_ptr cinfo) |
323 | | /* Process a SOS marker */ |
324 | 19.3k | { |
325 | 19.3k | INT32 length; |
326 | 19.3k | int c, ci, i, n; |
327 | 19.3k | jpeg_component_info * compptr; |
328 | 19.3k | INPUT_VARS(cinfo); |
329 | | |
330 | 19.3k | if (! cinfo->marker->saw_SOF) |
331 | 65 | ERREXITS(cinfo, JERR_SOF_BEFORE, "SOS"); |
332 | | |
333 | 19.3k | INPUT_2BYTES(cinfo, length, return FALSE); |
334 | | |
335 | 19.3k | INPUT_BYTE(cinfo, n, return FALSE); /* Number of components */ |
336 | | |
337 | 19.3k | TRACEMS1(cinfo, 1, JTRC_SOS, n); |
338 | | |
339 | 19.3k | if (length != (n * 2 + 6) || n > MAX_COMPS_IN_SCAN || |
340 | 19.3k | (n == 0 && !cinfo->progressive_mode)) |
341 | | /* pseudo SOS marker only allowed in progressive mode */ |
342 | 19 | ERREXIT(cinfo, JERR_BAD_LENGTH); |
343 | | |
344 | 19.3k | cinfo->comps_in_scan = n; |
345 | | |
346 | | /* Collect the component-spec parameters */ |
347 | | |
348 | 58.0k | for (i = 0; i < n; i++) { |
349 | 38.7k | INPUT_BYTE(cinfo, c, return FALSE); |
350 | | |
351 | | /* Detect the case where component id's are not unique, and, if so, */ |
352 | | /* create a fake component id using the same logic as in get_sof. */ |
353 | | /* Note: This also ensures that all of the SOF components are */ |
354 | | /* referenced in the single scan case, which prevents access to */ |
355 | | /* uninitialized memory in later decoding stages. */ |
356 | 68.5k | for (ci = 0; ci < i; ci++) { |
357 | 29.8k | if (c == cinfo->cur_comp_info[ci]->component_id) { |
358 | 0 | c = cinfo->cur_comp_info[0]->component_id; |
359 | 0 | for (ci = 1; ci < i; ci++) { |
360 | 0 | compptr = cinfo->cur_comp_info[ci]; |
361 | 0 | if (compptr->component_id > c) c = compptr->component_id; |
362 | 0 | } |
363 | 0 | c++; |
364 | 0 | break; |
365 | 0 | } |
366 | 29.8k | } |
367 | | |
368 | 75.5k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; |
369 | 75.5k | ci++, compptr++) { |
370 | 75.5k | if (c == compptr->component_id) |
371 | 38.6k | goto id_found; |
372 | 75.5k | } |
373 | | |
374 | 53 | ERREXIT1(cinfo, JERR_BAD_COMPONENT_ID, c); |
375 | | |
376 | 38.6k | id_found: |
377 | | |
378 | 38.6k | cinfo->cur_comp_info[i] = compptr; |
379 | 38.6k | INPUT_BYTE(cinfo, c, return FALSE); |
380 | 38.6k | compptr->dc_tbl_no = (c >> 4) & 15; |
381 | 38.6k | compptr->ac_tbl_no = (c ) & 15; |
382 | | |
383 | 38.6k | TRACEMS3(cinfo, 1, JTRC_SOS_COMPONENT, compptr->component_id, |
384 | 38.6k | compptr->dc_tbl_no, compptr->ac_tbl_no); |
385 | 38.6k | } |
386 | | |
387 | | /* Collect the additional scan parameters Ss, Se, Ah/Al. */ |
388 | 19.2k | INPUT_BYTE(cinfo, c, return FALSE); |
389 | 19.2k | cinfo->Ss = c; |
390 | 19.2k | INPUT_BYTE(cinfo, c, return FALSE); |
391 | 19.2k | cinfo->Se = c; |
392 | 19.2k | INPUT_BYTE(cinfo, c, return FALSE); |
393 | 19.2k | cinfo->Ah = (c >> 4) & 15; |
394 | 19.2k | cinfo->Al = (c ) & 15; |
395 | | |
396 | 19.2k | TRACEMS4(cinfo, 1, JTRC_SOS_PARAMS, cinfo->Ss, cinfo->Se, |
397 | 19.2k | cinfo->Ah, cinfo->Al); |
398 | | |
399 | | /* Prepare to scan data & restart markers */ |
400 | 19.2k | cinfo->marker->next_restart_num = 0; |
401 | | |
402 | | /* Count another (non-pseudo) SOS marker */ |
403 | 19.2k | if (n) cinfo->input_scan_number++; |
404 | | |
405 | 19.2k | INPUT_SYNC(cinfo); |
406 | 19.2k | return TRUE; |
407 | 19.2k | } |
408 | | |
409 | | |
410 | | #ifdef D_ARITH_CODING_SUPPORTED |
411 | | |
412 | | LOCAL(boolean) |
413 | | get_dac (j_decompress_ptr cinfo) |
414 | | /* Process a DAC marker */ |
415 | 15 | { |
416 | 15 | INT32 length; |
417 | 15 | int index, val; |
418 | 15 | INPUT_VARS(cinfo); |
419 | | |
420 | 15 | INPUT_2BYTES(cinfo, length, return FALSE); |
421 | 15 | length -= 2; |
422 | | |
423 | 35 | while (length > 0) { |
424 | 20 | INPUT_BYTE(cinfo, index, return FALSE); |
425 | 20 | INPUT_BYTE(cinfo, val, return FALSE); |
426 | | |
427 | 20 | length -= 2; |
428 | | |
429 | 20 | TRACEMS2(cinfo, 1, JTRC_DAC, index, val); |
430 | | |
431 | 20 | if (index < 0 || index >= (2*NUM_ARITH_TBLS)) |
432 | 15 | ERREXIT1(cinfo, JERR_DAC_INDEX, index); |
433 | | |
434 | 20 | if (index >= NUM_ARITH_TBLS) { /* define AC table */ |
435 | 0 | cinfo->arith_ac_K[index-NUM_ARITH_TBLS] = (UINT8) val; |
436 | 20 | } else { /* define DC table */ |
437 | 20 | cinfo->arith_dc_L[index] = (UINT8) (val & 0x0F); |
438 | 20 | cinfo->arith_dc_U[index] = (UINT8) (val >> 4); |
439 | 20 | if (cinfo->arith_dc_L[index] > cinfo->arith_dc_U[index]) |
440 | 0 | ERREXIT1(cinfo, JERR_DAC_VALUE, val); |
441 | 20 | } |
442 | 20 | } |
443 | | |
444 | 15 | if (length != 0) |
445 | 0 | ERREXIT(cinfo, JERR_BAD_LENGTH); |
446 | | |
447 | 15 | INPUT_SYNC(cinfo); |
448 | 15 | return TRUE; |
449 | 15 | } |
450 | | |
451 | | #else /* ! D_ARITH_CODING_SUPPORTED */ |
452 | | |
453 | | #define get_dac(cinfo) skip_variable(cinfo) |
454 | | |
455 | | #endif /* D_ARITH_CODING_SUPPORTED */ |
456 | | |
457 | | |
458 | | LOCAL(boolean) |
459 | | get_dht (j_decompress_ptr cinfo) |
460 | | /* Process a DHT marker */ |
461 | 27.7k | { |
462 | 27.7k | INT32 length; |
463 | 27.7k | UINT8 bits[17]; |
464 | 27.7k | UINT8 huffval[256]; |
465 | 27.7k | int i, index, count; |
466 | 27.7k | JHUFF_TBL **htblptr; |
467 | 27.7k | INPUT_VARS(cinfo); |
468 | | |
469 | 27.7k | INPUT_2BYTES(cinfo, length, return FALSE); |
470 | 27.7k | length -= 2; |
471 | | |
472 | 72.5k | while (length > 16) { |
473 | 44.9k | INPUT_BYTE(cinfo, index, return FALSE); |
474 | | |
475 | 44.9k | TRACEMS1(cinfo, 1, JTRC_DHT, index); |
476 | | |
477 | 44.9k | bits[0] = 0; |
478 | 44.9k | count = 0; |
479 | 763k | for (i = 1; i <= 16; i++) { |
480 | 718k | INPUT_BYTE(cinfo, bits[i], return FALSE); |
481 | 718k | count += bits[i]; |
482 | 718k | } |
483 | | |
484 | 44.9k | length -= 1 + 16; |
485 | | |
486 | 44.9k | TRACEMS8(cinfo, 2, JTRC_HUFFBITS, |
487 | 44.9k | bits[1], bits[2], bits[3], bits[4], |
488 | 44.9k | bits[5], bits[6], bits[7], bits[8]); |
489 | 44.9k | TRACEMS8(cinfo, 2, JTRC_HUFFBITS, |
490 | 44.9k | bits[9], bits[10], bits[11], bits[12], |
491 | 44.9k | bits[13], bits[14], bits[15], bits[16]); |
492 | | |
493 | | /* Here we just do minimal validation of the counts to avoid walking |
494 | | * off the end of our table space. jdhuff.c will check more carefully. |
495 | | */ |
496 | 44.9k | if (count > 256 || ((INT32) count) > length) |
497 | 373 | ERREXIT(cinfo, JERR_BAD_HUFF_TABLE); |
498 | | |
499 | 2.60M | for (i = 0; i < count; i++) |
500 | 2.56M | INPUT_BYTE(cinfo, huffval[i], return FALSE); |
501 | | |
502 | 44.7k | length -= count; |
503 | | |
504 | 44.7k | if (index & 0x10) { /* AC table definition */ |
505 | 23.8k | index -= 0x10; |
506 | 23.8k | htblptr = &cinfo->ac_huff_tbl_ptrs[index]; |
507 | 23.8k | } else { /* DC table definition */ |
508 | 20.9k | htblptr = &cinfo->dc_huff_tbl_ptrs[index]; |
509 | 20.9k | } |
510 | | |
511 | 44.7k | if (index < 0 || index >= NUM_HUFF_TBLS) |
512 | 108 | ERREXIT1(cinfo, JERR_DHT_INDEX, index); |
513 | | |
514 | 44.7k | if (*htblptr == NULL) |
515 | 39.8k | *htblptr = jpeg_alloc_huff_table((j_common_ptr) cinfo); |
516 | | |
517 | 44.7k | MEMCOPY((*htblptr)->bits, bits, SIZEOF((*htblptr)->bits)); |
518 | 44.7k | if (count > 0) |
519 | 44.2k | MEMCOPY((*htblptr)->huffval, huffval, count * SIZEOF(UINT8)); |
520 | 44.7k | } |
521 | | |
522 | 27.6k | if (length != 0) |
523 | 11 | ERREXIT(cinfo, JERR_BAD_LENGTH); |
524 | | |
525 | 27.6k | INPUT_SYNC(cinfo); |
526 | 27.6k | return TRUE; |
527 | 27.7k | } |
528 | | |
529 | | |
530 | | LOCAL(boolean) |
531 | | get_dqt (j_decompress_ptr cinfo) |
532 | | /* Process a DQT marker */ |
533 | 15.5k | { |
534 | 15.5k | INT32 length, count, i; |
535 | 15.5k | int n, prec; |
536 | 15.5k | unsigned int tmp; |
537 | 15.5k | JQUANT_TBL *quant_ptr; |
538 | 15.5k | const int *natural_order; |
539 | 15.5k | INPUT_VARS(cinfo); |
540 | | |
541 | 15.5k | INPUT_2BYTES(cinfo, length, return FALSE); |
542 | 15.5k | length -= 2; |
543 | | |
544 | 36.4k | while (length > 0) { |
545 | 21.1k | length--; |
546 | 21.1k | INPUT_BYTE(cinfo, n, return FALSE); |
547 | 21.1k | prec = n >> 4; |
548 | 21.1k | n &= 0x0F; |
549 | | |
550 | 21.1k | TRACEMS2(cinfo, 1, JTRC_DQT, n, prec); |
551 | | |
552 | 21.1k | if (n >= NUM_QUANT_TBLS) |
553 | 83 | ERREXIT1(cinfo, JERR_DQT_INDEX, n); |
554 | | |
555 | 21.1k | if (cinfo->quant_tbl_ptrs[n] == NULL) |
556 | 20.8k | cinfo->quant_tbl_ptrs[n] = jpeg_alloc_quant_table((j_common_ptr) cinfo); |
557 | 21.1k | quant_ptr = cinfo->quant_tbl_ptrs[n]; |
558 | | |
559 | 21.1k | if (prec) { |
560 | 56 | if (length < DCTSIZE2 * 2) { |
561 | | /* Initialize full table for safety. */ |
562 | 2.86k | for (i = 0; i < DCTSIZE2; i++) { |
563 | 2.81k | quant_ptr->quantval[i] = 1; |
564 | 2.81k | } |
565 | 44 | count = length >> 1; |
566 | 44 | } else |
567 | 12 | count = DCTSIZE2; |
568 | 21.0k | } else { |
569 | 21.0k | if (length < DCTSIZE2) { |
570 | | /* Initialize full table for safety. */ |
571 | 65 | for (i = 0; i < DCTSIZE2; i++) { |
572 | 64 | quant_ptr->quantval[i] = 1; |
573 | 64 | } |
574 | 1 | count = length; |
575 | 1 | } else |
576 | 21.0k | count = DCTSIZE2; |
577 | 21.0k | } |
578 | | |
579 | 21.1k | switch ((int) count) { |
580 | 0 | case (2*2): natural_order = jpeg_natural_order2; break; |
581 | 0 | case (3*3): natural_order = jpeg_natural_order3; break; |
582 | 0 | case (4*4): natural_order = jpeg_natural_order4; break; |
583 | 0 | case (5*5): natural_order = jpeg_natural_order5; break; |
584 | 0 | case (6*6): natural_order = jpeg_natural_order6; break; |
585 | 0 | case (7*7): natural_order = jpeg_natural_order7; break; |
586 | 21.0k | default: natural_order = jpeg_natural_order; |
587 | 21.1k | } |
588 | | |
589 | 1.35M | for (i = 0; i < count; i++) { |
590 | 1.33M | if (prec) |
591 | 1.33M | INPUT_2BYTES(cinfo, tmp, return FALSE); |
592 | 1.33M | else |
593 | 1.33M | INPUT_BYTE(cinfo, tmp, return FALSE); |
594 | | /* We convert the zigzag-order table to natural array order. */ |
595 | 1.33M | quant_ptr->quantval[natural_order[i]] = (UINT16) tmp; |
596 | 1.33M | } |
597 | | |
598 | 20.9k | if (cinfo->err->trace_level >= 2) { |
599 | 0 | for (i = 0; i < DCTSIZE2; i += 8) { |
600 | 0 | TRACEMS8(cinfo, 2, JTRC_QUANTVALS, |
601 | 0 | quant_ptr->quantval[i], quant_ptr->quantval[i+1], |
602 | 0 | quant_ptr->quantval[i+2], quant_ptr->quantval[i+3], |
603 | 0 | quant_ptr->quantval[i+4], quant_ptr->quantval[i+5], |
604 | 0 | quant_ptr->quantval[i+6], quant_ptr->quantval[i+7]); |
605 | 0 | } |
606 | 0 | } |
607 | | |
608 | 20.9k | length -= count; |
609 | 20.9k | if (prec) length -= count; |
610 | 20.9k | } |
611 | | |
612 | 15.3k | if (length != 0) |
613 | 0 | ERREXIT(cinfo, JERR_BAD_LENGTH); |
614 | | |
615 | 15.3k | INPUT_SYNC(cinfo); |
616 | 15.3k | return TRUE; |
617 | 15.5k | } |
618 | | |
619 | | |
620 | | LOCAL(boolean) |
621 | | get_dri (j_decompress_ptr cinfo) |
622 | | /* Process a DRI marker */ |
623 | 2.03k | { |
624 | 2.03k | INT32 length; |
625 | 2.03k | unsigned int tmp; |
626 | 2.03k | INPUT_VARS(cinfo); |
627 | | |
628 | 2.03k | INPUT_2BYTES(cinfo, length, return FALSE); |
629 | | |
630 | 2.03k | if (length != 4) |
631 | 4 | ERREXIT(cinfo, JERR_BAD_LENGTH); |
632 | | |
633 | 2.03k | INPUT_2BYTES(cinfo, tmp, return FALSE); |
634 | | |
635 | 2.03k | TRACEMS1(cinfo, 1, JTRC_DRI, tmp); |
636 | | |
637 | 2.03k | cinfo->restart_interval = tmp; |
638 | | |
639 | 2.03k | INPUT_SYNC(cinfo); |
640 | 2.03k | return TRUE; |
641 | 2.03k | } |
642 | | |
643 | | |
644 | | LOCAL(boolean) |
645 | | get_lse (j_decompress_ptr cinfo) |
646 | | /* Process an LSE marker */ |
647 | 2 | { |
648 | 2 | INT32 length; |
649 | 2 | unsigned int tmp; |
650 | 2 | int cid; |
651 | 2 | INPUT_VARS(cinfo); |
652 | | |
653 | 2 | if (! cinfo->marker->saw_SOF) |
654 | 0 | ERREXITS(cinfo, JERR_SOF_BEFORE, "LSE"); |
655 | | |
656 | 2 | if (cinfo->num_components < 3) goto bad; |
657 | | |
658 | 2 | INPUT_2BYTES(cinfo, length, return FALSE); |
659 | | |
660 | 2 | if (length != 24) |
661 | 2 | ERREXIT(cinfo, JERR_BAD_LENGTH); |
662 | | |
663 | 2 | INPUT_BYTE(cinfo, tmp, return FALSE); |
664 | 2 | if (tmp != 0x0D) /* ID inverse transform specification */ |
665 | 0 | ERREXIT1(cinfo, JERR_UNKNOWN_MARKER, cinfo->unread_marker); |
666 | 2 | INPUT_2BYTES(cinfo, tmp, return FALSE); |
667 | 2 | if (tmp != MAXJSAMPLE) goto bad; /* MAXTRANS */ |
668 | 2 | INPUT_BYTE(cinfo, tmp, return FALSE); |
669 | 2 | if (tmp != 3) goto bad; /* Nt=3 */ |
670 | 2 | INPUT_BYTE(cinfo, cid, return FALSE); |
671 | 2 | if (cid != cinfo->comp_info[1].component_id) goto bad; |
672 | 2 | INPUT_BYTE(cinfo, cid, return FALSE); |
673 | 2 | if (cid != cinfo->comp_info[0].component_id) goto bad; |
674 | 2 | INPUT_BYTE(cinfo, cid, return FALSE); |
675 | 2 | if (cid != cinfo->comp_info[2].component_id) goto bad; |
676 | 2 | INPUT_BYTE(cinfo, tmp, return FALSE); |
677 | 2 | if (tmp != 0x80) goto bad; /* F1: CENTER1=1, NORM1=0 */ |
678 | 2 | INPUT_2BYTES(cinfo, tmp, return FALSE); |
679 | 2 | if (tmp != 0) goto bad; /* A(1,1)=0 */ |
680 | 2 | INPUT_2BYTES(cinfo, tmp, return FALSE); |
681 | 2 | if (tmp != 0) goto bad; /* A(1,2)=0 */ |
682 | 2 | INPUT_BYTE(cinfo, tmp, return FALSE); |
683 | 2 | if (tmp != 0) goto bad; /* F2: CENTER2=0, NORM2=0 */ |
684 | 2 | INPUT_2BYTES(cinfo, tmp, return FALSE); |
685 | 2 | if (tmp != 1) goto bad; /* A(2,1)=1 */ |
686 | 2 | INPUT_2BYTES(cinfo, tmp, return FALSE); |
687 | 2 | if (tmp != 0) goto bad; /* A(2,2)=0 */ |
688 | 2 | INPUT_BYTE(cinfo, tmp, return FALSE); |
689 | 2 | if (tmp != 0) goto bad; /* F3: CENTER3=0, NORM3=0 */ |
690 | 2 | INPUT_2BYTES(cinfo, tmp, return FALSE); |
691 | 2 | if (tmp != 1) goto bad; /* A(3,1)=1 */ |
692 | 2 | INPUT_2BYTES(cinfo, tmp, return FALSE); |
693 | 2 | if (tmp != 0) { /* A(3,2)=0 */ |
694 | 0 | bad: |
695 | 0 | ERREXIT(cinfo, JERR_CONVERSION_NOTIMPL); |
696 | 0 | } |
697 | | |
698 | | /* OK, valid transform that we can handle. */ |
699 | 2 | cinfo->color_transform = JCT_SUBTRACT_GREEN; |
700 | | |
701 | 2 | INPUT_SYNC(cinfo); |
702 | 2 | return TRUE; |
703 | 2 | } |
704 | | |
705 | | |
706 | | /* |
707 | | * Routines for processing APPn and COM markers. |
708 | | * These are either saved in memory or discarded, per application request. |
709 | | * APP0 and APP14 are specially checked to see if they are |
710 | | * JFIF and Adobe markers, respectively. |
711 | | */ |
712 | | |
713 | 31.3k | #define APP0_DATA_LEN 14 /* Length of interesting data in APP0 */ |
714 | 13.6k | #define APP14_DATA_LEN 12 /* Length of interesting data in APP14 */ |
715 | 28.3k | #define APPN_DATA_LEN 14 /* Must be the largest of the above!! */ |
716 | | |
717 | | |
718 | | LOCAL(void) |
719 | | examine_app0 (j_decompress_ptr cinfo, JOCTET FAR * data, |
720 | | unsigned int datalen, INT32 remaining) |
721 | | /* Examine first few bytes from an APP0. |
722 | | * Take appropriate action if it is a JFIF marker. |
723 | | * datalen is # of bytes at data[], remaining is length of rest of marker data. |
724 | | */ |
725 | 10.5k | { |
726 | 10.5k | INT32 totallen = (INT32) datalen + remaining; |
727 | | |
728 | 10.5k | if (datalen >= APP0_DATA_LEN && |
729 | 10.5k | GETJOCTET(data[0]) == 0x4A && |
730 | 10.5k | GETJOCTET(data[1]) == 0x46 && |
731 | 10.5k | GETJOCTET(data[2]) == 0x49 && |
732 | 10.5k | GETJOCTET(data[3]) == 0x46 && |
733 | 10.5k | GETJOCTET(data[4]) == 0) { |
734 | | /* Found JFIF APP0 marker: save info */ |
735 | 10.3k | cinfo->saw_JFIF_marker = TRUE; |
736 | 10.3k | cinfo->JFIF_major_version = GETJOCTET(data[5]); |
737 | 10.3k | cinfo->JFIF_minor_version = GETJOCTET(data[6]); |
738 | 10.3k | cinfo->density_unit = GETJOCTET(data[7]); |
739 | 10.3k | cinfo->X_density = (GETJOCTET(data[8]) << 8) + GETJOCTET(data[9]); |
740 | 10.3k | cinfo->Y_density = (GETJOCTET(data[10]) << 8) + GETJOCTET(data[11]); |
741 | | /* Check version. |
742 | | * Major version must be 1 or 2, anything else signals an incompatible |
743 | | * change. |
744 | | * (We used to treat this as an error, but now it's a nonfatal warning, |
745 | | * because some bozo at Hijaak couldn't read the spec.) |
746 | | * Minor version should be 0..2, but process anyway if newer. |
747 | | */ |
748 | 10.3k | if (cinfo->JFIF_major_version != 1 && cinfo->JFIF_major_version != 2) |
749 | 6 | WARNMS2(cinfo, JWRN_JFIF_MAJOR, |
750 | 10.3k | cinfo->JFIF_major_version, cinfo->JFIF_minor_version); |
751 | | /* Generate trace messages */ |
752 | 10.3k | TRACEMS5(cinfo, 1, JTRC_JFIF, |
753 | 10.3k | cinfo->JFIF_major_version, cinfo->JFIF_minor_version, |
754 | 10.3k | cinfo->X_density, cinfo->Y_density, cinfo->density_unit); |
755 | | /* Validate thumbnail dimensions and issue appropriate messages */ |
756 | 10.3k | if (GETJOCTET(data[12]) | GETJOCTET(data[13])) |
757 | 62 | TRACEMS2(cinfo, 1, JTRC_JFIF_THUMBNAIL, |
758 | 10.3k | GETJOCTET(data[12]), GETJOCTET(data[13])); |
759 | 10.3k | totallen -= APP0_DATA_LEN; |
760 | 10.3k | if (totallen != |
761 | 10.3k | ((INT32)GETJOCTET(data[12]) * (INT32)GETJOCTET(data[13]) * (INT32) 3)) |
762 | 51 | TRACEMS1(cinfo, 1, JTRC_JFIF_BADTHUMBNAILSIZE, (int) totallen); |
763 | 10.3k | } else if (datalen >= 6 && |
764 | 147 | GETJOCTET(data[0]) == 0x4A && |
765 | 147 | GETJOCTET(data[1]) == 0x46 && |
766 | 147 | GETJOCTET(data[2]) == 0x58 && |
767 | 147 | GETJOCTET(data[3]) == 0x58 && |
768 | 147 | GETJOCTET(data[4]) == 0) { |
769 | | /* Found JFIF "JFXX" extension APP0 marker */ |
770 | | /* The library doesn't actually do anything with these, |
771 | | * but we try to produce a helpful trace message. |
772 | | */ |
773 | 0 | switch (GETJOCTET(data[5])) { |
774 | 0 | case 0x10: |
775 | 0 | TRACEMS1(cinfo, 1, JTRC_THUMB_JPEG, (int) totallen); |
776 | 0 | break; |
777 | 0 | case 0x11: |
778 | 0 | TRACEMS1(cinfo, 1, JTRC_THUMB_PALETTE, (int) totallen); |
779 | 0 | break; |
780 | 0 | case 0x13: |
781 | 0 | TRACEMS1(cinfo, 1, JTRC_THUMB_RGB, (int) totallen); |
782 | 0 | break; |
783 | 0 | default: |
784 | 0 | TRACEMS2(cinfo, 1, JTRC_JFIF_EXTENSION, |
785 | 0 | GETJOCTET(data[5]), (int) totallen); |
786 | 0 | } |
787 | 147 | } else { |
788 | | /* Start of APP0 does not match "JFIF" or "JFXX", or too short */ |
789 | 147 | TRACEMS1(cinfo, 1, JTRC_APP0, (int) totallen); |
790 | 147 | } |
791 | 10.5k | } |
792 | | |
793 | | |
794 | | LOCAL(void) |
795 | | examine_app14 (j_decompress_ptr cinfo, JOCTET FAR * data, |
796 | | unsigned int datalen, INT32 remaining) |
797 | | /* Examine first few bytes from an APP14. |
798 | | * Take appropriate action if it is an Adobe marker. |
799 | | * datalen is # of bytes at data[], remaining is length of rest of marker data. |
800 | | */ |
801 | 6.83k | { |
802 | 6.83k | unsigned int version, flags0, flags1, transform; |
803 | | |
804 | 6.83k | if (datalen >= APP14_DATA_LEN && |
805 | 6.83k | GETJOCTET(data[0]) == 0x41 && |
806 | 6.83k | GETJOCTET(data[1]) == 0x64 && |
807 | 6.83k | GETJOCTET(data[2]) == 0x6F && |
808 | 6.83k | GETJOCTET(data[3]) == 0x62 && |
809 | 6.83k | GETJOCTET(data[4]) == 0x65) { |
810 | | /* Found Adobe APP14 marker */ |
811 | 6.77k | version = (GETJOCTET(data[5]) << 8) + GETJOCTET(data[6]); |
812 | 6.77k | flags0 = (GETJOCTET(data[7]) << 8) + GETJOCTET(data[8]); |
813 | 6.77k | flags1 = (GETJOCTET(data[9]) << 8) + GETJOCTET(data[10]); |
814 | 6.77k | transform = GETJOCTET(data[11]); |
815 | 6.77k | TRACEMS4(cinfo, 1, JTRC_ADOBE, version, flags0, flags1, transform); |
816 | 6.77k | cinfo->saw_Adobe_marker = TRUE; |
817 | 6.77k | cinfo->Adobe_transform = (UINT8) transform; |
818 | 6.77k | } else { |
819 | | /* Start of APP14 does not match "Adobe", or too short */ |
820 | 58 | TRACEMS1(cinfo, 1, JTRC_APP14, (int) (datalen + remaining)); |
821 | 58 | } |
822 | 6.83k | } |
823 | | |
824 | | |
825 | | METHODDEF(boolean) |
826 | | get_interesting_appn (j_decompress_ptr cinfo) |
827 | | /* Process an APP0 or APP14 marker without saving it */ |
828 | 17.3k | { |
829 | 17.3k | INT32 length; |
830 | 17.3k | JOCTET b[APPN_DATA_LEN]; |
831 | 17.3k | unsigned int i, numtoread; |
832 | 17.3k | INPUT_VARS(cinfo); |
833 | | |
834 | 17.3k | INPUT_2BYTES(cinfo, length, return FALSE); |
835 | 17.3k | length -= 2; |
836 | | |
837 | | /* get the interesting part of the marker data */ |
838 | 17.3k | if (length >= APPN_DATA_LEN) |
839 | 11.0k | numtoread = APPN_DATA_LEN; |
840 | 6.28k | else if (length > 0) |
841 | 6.26k | numtoread = (unsigned int) length; |
842 | 20 | else |
843 | 20 | numtoread = 0; |
844 | 247k | for (i = 0; i < numtoread; i++) |
845 | 229k | INPUT_BYTE(cinfo, b[i], return FALSE); |
846 | 17.3k | length -= numtoread; |
847 | | |
848 | | /* process it */ |
849 | 17.3k | switch (cinfo->unread_marker) { |
850 | 10.5k | case M_APP0: |
851 | 10.5k | examine_app0(cinfo, (JOCTET FAR *) b, numtoread, length); |
852 | 10.5k | break; |
853 | 6.83k | case M_APP14: |
854 | 6.83k | examine_app14(cinfo, (JOCTET FAR *) b, numtoread, length); |
855 | 6.83k | break; |
856 | 0 | default: |
857 | | /* can't get here unless jpeg_save_markers chooses wrong processor */ |
858 | 0 | ERREXIT1(cinfo, JERR_UNKNOWN_MARKER, cinfo->unread_marker); |
859 | 17.3k | } |
860 | | |
861 | | /* skip any remaining data -- could be lots */ |
862 | 17.3k | INPUT_SYNC(cinfo); |
863 | 17.3k | if (length > 0) |
864 | 668 | (*cinfo->src->skip_input_data) (cinfo, (long) length); |
865 | | |
866 | 17.3k | return TRUE; |
867 | 17.3k | } |
868 | | |
869 | | |
870 | | #ifdef SAVE_MARKERS_SUPPORTED |
871 | | |
872 | | METHODDEF(boolean) |
873 | | save_marker (j_decompress_ptr cinfo) |
874 | | /* Save an APPn or COM marker into the marker list */ |
875 | 0 | { |
876 | 0 | my_marker_ptr marker = (my_marker_ptr) cinfo->marker; |
877 | 0 | jpeg_saved_marker_ptr cur_marker = marker->cur_marker; |
878 | 0 | unsigned int bytes_read, data_length; |
879 | 0 | JOCTET FAR * data; |
880 | 0 | INT32 length = 0; |
881 | 0 | INPUT_VARS(cinfo); |
882 | |
|
883 | 0 | if (cur_marker == NULL) { |
884 | | /* begin reading a marker */ |
885 | 0 | INPUT_2BYTES(cinfo, length, return FALSE); |
886 | 0 | length -= 2; |
887 | 0 | if (length >= 0) { /* watch out for bogus length word */ |
888 | | /* figure out how much we want to save */ |
889 | 0 | unsigned int limit; |
890 | 0 | if (cinfo->unread_marker == (int) M_COM) |
891 | 0 | limit = marker->length_limit_COM; |
892 | 0 | else |
893 | 0 | limit = marker->length_limit_APPn[cinfo->unread_marker - (int) M_APP0]; |
894 | 0 | if ((unsigned int) length < limit) |
895 | 0 | limit = (unsigned int) length; |
896 | | /* allocate and initialize the marker item */ |
897 | 0 | cur_marker = (jpeg_saved_marker_ptr) |
898 | 0 | (*cinfo->mem->alloc_large) ((j_common_ptr) cinfo, JPOOL_IMAGE, |
899 | 0 | SIZEOF(struct jpeg_marker_struct) + limit); |
900 | 0 | cur_marker->next = NULL; |
901 | 0 | cur_marker->marker = (UINT8) cinfo->unread_marker; |
902 | 0 | cur_marker->original_length = (unsigned int) length; |
903 | 0 | cur_marker->data_length = limit; |
904 | | /* data area is just beyond the jpeg_marker_struct */ |
905 | 0 | data = cur_marker->data = (JOCTET FAR *) (cur_marker + 1); |
906 | 0 | marker->cur_marker = cur_marker; |
907 | 0 | marker->bytes_read = 0; |
908 | 0 | bytes_read = 0; |
909 | 0 | data_length = limit; |
910 | 0 | } else { |
911 | | /* deal with bogus length word */ |
912 | 0 | bytes_read = data_length = 0; |
913 | 0 | data = NULL; |
914 | 0 | } |
915 | 0 | } else { |
916 | | /* resume reading a marker */ |
917 | 0 | bytes_read = marker->bytes_read; |
918 | 0 | data_length = cur_marker->data_length; |
919 | 0 | data = cur_marker->data + bytes_read; |
920 | 0 | } |
921 | | |
922 | 0 | while (bytes_read < data_length) { |
923 | 0 | INPUT_SYNC(cinfo); /* move the restart point to here */ |
924 | 0 | marker->bytes_read = bytes_read; |
925 | | /* If there's not at least one byte in buffer, suspend */ |
926 | 0 | MAKE_BYTE_AVAIL(cinfo, return FALSE); |
927 | | /* Copy bytes with reasonable rapidity */ |
928 | 0 | while (bytes_read < data_length && bytes_in_buffer > 0) { |
929 | 0 | *data++ = *next_input_byte++; |
930 | 0 | bytes_in_buffer--; |
931 | 0 | bytes_read++; |
932 | 0 | } |
933 | 0 | } |
934 | | |
935 | | /* Done reading what we want to read */ |
936 | 0 | if (cur_marker != NULL) { /* will be NULL if bogus length word */ |
937 | | /* Add new marker to end of list */ |
938 | 0 | if (cinfo->marker_list == NULL) { |
939 | 0 | cinfo->marker_list = cur_marker; |
940 | 0 | } else { |
941 | 0 | jpeg_saved_marker_ptr prev = cinfo->marker_list; |
942 | 0 | while (prev->next != NULL) |
943 | 0 | prev = prev->next; |
944 | 0 | prev->next = cur_marker; |
945 | 0 | } |
946 | | /* Reset pointer & calc remaining data length */ |
947 | 0 | data = cur_marker->data; |
948 | 0 | length = cur_marker->original_length - data_length; |
949 | 0 | } |
950 | | /* Reset to initial state for next marker */ |
951 | 0 | marker->cur_marker = NULL; |
952 | | |
953 | | /* Process the marker if interesting; else just make a generic trace msg */ |
954 | 0 | switch (cinfo->unread_marker) { |
955 | 0 | case M_APP0: |
956 | 0 | examine_app0(cinfo, data, data_length, length); |
957 | 0 | break; |
958 | 0 | case M_APP14: |
959 | 0 | examine_app14(cinfo, data, data_length, length); |
960 | 0 | break; |
961 | 0 | default: |
962 | 0 | TRACEMS2(cinfo, 1, JTRC_MISC_MARKER, cinfo->unread_marker, |
963 | 0 | (int) (data_length + length)); |
964 | 0 | } |
965 | | |
966 | | /* skip any remaining data -- could be lots */ |
967 | 0 | INPUT_SYNC(cinfo); /* do before skip_input_data */ |
968 | 0 | if (length > 0) |
969 | 0 | (*cinfo->src->skip_input_data) (cinfo, (long) length); |
970 | |
|
971 | 0 | return TRUE; |
972 | 0 | } |
973 | | |
974 | | #endif /* SAVE_MARKERS_SUPPORTED */ |
975 | | |
976 | | |
977 | | METHODDEF(boolean) |
978 | | skip_variable (j_decompress_ptr cinfo) |
979 | | /* Skip over an unknown or uninteresting variable-length marker */ |
980 | 12.9k | { |
981 | 12.9k | INT32 length; |
982 | 12.9k | INPUT_VARS(cinfo); |
983 | | |
984 | 12.9k | INPUT_2BYTES(cinfo, length, return FALSE); |
985 | 12.9k | length -= 2; |
986 | | |
987 | 12.9k | TRACEMS2(cinfo, 1, JTRC_MISC_MARKER, cinfo->unread_marker, (int) length); |
988 | | |
989 | 12.9k | INPUT_SYNC(cinfo); /* do before skip_input_data */ |
990 | 12.9k | if (length > 0) |
991 | 11.6k | (*cinfo->src->skip_input_data) (cinfo, (long) length); |
992 | | |
993 | 12.9k | return TRUE; |
994 | 12.9k | } |
995 | | |
996 | | |
997 | | /* |
998 | | * Find the next JPEG marker, save it in cinfo->unread_marker. |
999 | | * Returns FALSE if had to suspend before reaching a marker; |
1000 | | * in that case cinfo->unread_marker is unchanged. |
1001 | | * |
1002 | | * Note that the result might not be a valid marker code, |
1003 | | * but it will never be 0 or FF. |
1004 | | */ |
1005 | | |
1006 | | LOCAL(boolean) |
1007 | | next_marker (j_decompress_ptr cinfo) |
1008 | 135k | { |
1009 | 135k | int c; |
1010 | 135k | INPUT_VARS(cinfo); |
1011 | | |
1012 | 225k | for (;;) { |
1013 | 225k | INPUT_BYTE(cinfo, c, return FALSE); |
1014 | | /* Skip any non-FF bytes. |
1015 | | * This may look a bit inefficient, but it will not occur in a valid file. |
1016 | | * We sync after each discarded byte so that a suspending data source |
1017 | | * can discard the byte from its buffer. |
1018 | | */ |
1019 | 18.5M | while (c != 0xFF) { |
1020 | 18.3M | cinfo->marker->discarded_bytes++; |
1021 | 18.3M | INPUT_SYNC(cinfo); |
1022 | 18.3M | INPUT_BYTE(cinfo, c, return FALSE); |
1023 | 18.3M | } |
1024 | | /* This loop swallows any duplicate FF bytes. Extra FFs are legal as |
1025 | | * pad bytes, so don't count them in discarded_bytes. We assume there |
1026 | | * will not be so many consecutive FF bytes as to overflow a suspending |
1027 | | * data source's input buffer. |
1028 | | */ |
1029 | 215k | do { |
1030 | 215k | INPUT_BYTE(cinfo, c, return FALSE); |
1031 | 215k | } while (c == 0xFF); |
1032 | 208k | if (c != 0) |
1033 | 118k | break; /* found a valid marker, exit loop */ |
1034 | | /* Reach here if we found a stuffed-zero data sequence (FF/00). |
1035 | | * Discard it and loop back to try again. |
1036 | | */ |
1037 | 90.3k | cinfo->marker->discarded_bytes += 2; |
1038 | 90.3k | INPUT_SYNC(cinfo); |
1039 | 90.3k | } |
1040 | | |
1041 | 118k | if (cinfo->marker->discarded_bytes != 0) { |
1042 | 18.8k | WARNMS2(cinfo, JWRN_EXTRANEOUS_DATA, cinfo->marker->discarded_bytes, c); |
1043 | 18.8k | cinfo->marker->discarded_bytes = 0; |
1044 | 18.8k | } |
1045 | | |
1046 | 118k | cinfo->unread_marker = c; |
1047 | | |
1048 | 118k | INPUT_SYNC(cinfo); |
1049 | 118k | return TRUE; |
1050 | 135k | } |
1051 | | |
1052 | | |
1053 | | LOCAL(boolean) |
1054 | | first_marker (j_decompress_ptr cinfo) |
1055 | | /* Like next_marker, but used to obtain the initial SOI marker. */ |
1056 | | /* For this marker, we do not allow preceding garbage or fill; otherwise, |
1057 | | * we might well scan an entire input file before realizing it ain't JPEG. |
1058 | | * If an application wants to process non-JFIF files, it must seek to the |
1059 | | * SOI before calling the JPEG library. |
1060 | | */ |
1061 | 13.2k | { |
1062 | 13.2k | int c, c2; |
1063 | 13.2k | INPUT_VARS(cinfo); |
1064 | | |
1065 | 13.2k | INPUT_BYTE(cinfo, c, return FALSE); |
1066 | 13.2k | INPUT_BYTE(cinfo, c2, return FALSE); |
1067 | 13.2k | if (c != 0xFF || c2 != (int) M_SOI) |
1068 | 48 | ERREXIT2(cinfo, JERR_NO_SOI, c, c2); |
1069 | | |
1070 | 13.2k | cinfo->unread_marker = c2; |
1071 | | |
1072 | 13.2k | INPUT_SYNC(cinfo); |
1073 | 13.2k | return TRUE; |
1074 | 13.2k | } |
1075 | | |
1076 | | |
1077 | | /* |
1078 | | * Read markers until SOS or EOI. |
1079 | | * |
1080 | | * Returns same codes as are defined for jpeg_consume_input: |
1081 | | * JPEG_SUSPENDED, JPEG_REACHED_SOS, or JPEG_REACHED_EOI. |
1082 | | * |
1083 | | * Note: This function may return a pseudo SOS marker (with zero |
1084 | | * component number) for treat by input controller's consume_input. |
1085 | | * consume_input itself should filter out (skip) the pseudo marker |
1086 | | * after processing for the caller. |
1087 | | */ |
1088 | | |
1089 | | METHODDEF(int) |
1090 | | read_markers (j_decompress_ptr cinfo) |
1091 | 49.2k | { |
1092 | | /* Outer loop repeats once for each marker. */ |
1093 | 158k | for (;;) { |
1094 | | /* Collect the marker proper, unless we already did. */ |
1095 | | /* NB: first_marker() enforces the requirement that SOI appear first. */ |
1096 | 158k | if (cinfo->unread_marker == 0) { |
1097 | 144k | if (! cinfo->marker->saw_SOI) { |
1098 | 13.2k | if (! first_marker(cinfo)) |
1099 | 1 | return JPEG_SUSPENDED; |
1100 | 131k | } else { |
1101 | 131k | if (! next_marker(cinfo)) |
1102 | 16.6k | return JPEG_SUSPENDED; |
1103 | 131k | } |
1104 | 144k | } |
1105 | | /* At this point cinfo->unread_marker contains the marker code and the |
1106 | | * input point is just past the marker proper, but before any parameters. |
1107 | | * A suspension will cause us to return with this state still true. |
1108 | | */ |
1109 | 141k | switch (cinfo->unread_marker) { |
1110 | 13.6k | case M_SOI: |
1111 | 13.6k | if (! get_soi(cinfo)) |
1112 | 0 | return JPEG_SUSPENDED; |
1113 | 13.6k | break; |
1114 | | |
1115 | 13.6k | case M_SOF0: /* Baseline */ |
1116 | 9.43k | if (! get_sof(cinfo, TRUE, FALSE, FALSE)) |
1117 | 2 | return JPEG_SUSPENDED; |
1118 | 9.43k | break; |
1119 | | |
1120 | 9.43k | case M_SOF1: /* Extended sequential, Huffman */ |
1121 | 3 | if (! get_sof(cinfo, FALSE, FALSE, FALSE)) |
1122 | 0 | return JPEG_SUSPENDED; |
1123 | 3 | break; |
1124 | | |
1125 | 1.41k | case M_SOF2: /* Progressive, Huffman */ |
1126 | 1.41k | if (! get_sof(cinfo, FALSE, TRUE, FALSE)) |
1127 | 0 | return JPEG_SUSPENDED; |
1128 | 1.41k | break; |
1129 | | |
1130 | 1.41k | case M_SOF9: /* Extended sequential, arithmetic */ |
1131 | 1 | if (! get_sof(cinfo, FALSE, FALSE, TRUE)) |
1132 | 0 | return JPEG_SUSPENDED; |
1133 | 1 | break; |
1134 | | |
1135 | 1 | case M_SOF10: /* Progressive, arithmetic */ |
1136 | 1 | if (! get_sof(cinfo, FALSE, TRUE, TRUE)) |
1137 | 0 | return JPEG_SUSPENDED; |
1138 | 1 | break; |
1139 | | |
1140 | | /* Currently unsupported SOFn types */ |
1141 | 8 | case M_SOF3: /* Lossless, Huffman */ |
1142 | 13 | case M_SOF5: /* Differential sequential, Huffman */ |
1143 | 22 | case M_SOF6: /* Differential progressive, Huffman */ |
1144 | 24 | case M_SOF7: /* Differential lossless, Huffman */ |
1145 | 31 | case M_JPG: /* Reserved for JPEG extensions */ |
1146 | 41 | case M_SOF11: /* Lossless, arithmetic */ |
1147 | 46 | case M_SOF13: /* Differential sequential, arithmetic */ |
1148 | 55 | case M_SOF14: /* Differential progressive, arithmetic */ |
1149 | 60 | case M_SOF15: /* Differential lossless, arithmetic */ |
1150 | 60 | ERREXIT1(cinfo, JERR_SOF_UNSUPPORTED, cinfo->unread_marker); |
1151 | 60 | break; |
1152 | | |
1153 | 19.3k | case M_SOS: |
1154 | 19.3k | if (! get_sos(cinfo)) |
1155 | 8 | return JPEG_SUSPENDED; |
1156 | 19.3k | cinfo->unread_marker = 0; /* processed the marker */ |
1157 | 19.3k | return JPEG_REACHED_SOS; |
1158 | | |
1159 | 10.8k | case M_EOI: |
1160 | 10.8k | TRACEMS(cinfo, 1, JTRC_EOI); |
1161 | 10.8k | cinfo->unread_marker = 0; /* processed the marker */ |
1162 | 10.8k | return JPEG_REACHED_EOI; |
1163 | | |
1164 | 15 | case M_DAC: |
1165 | 15 | if (! get_dac(cinfo)) |
1166 | 0 | return JPEG_SUSPENDED; |
1167 | 15 | break; |
1168 | | |
1169 | 27.7k | case M_DHT: |
1170 | 27.7k | if (! get_dht(cinfo)) |
1171 | 163 | return JPEG_SUSPENDED; |
1172 | 27.6k | break; |
1173 | | |
1174 | 27.6k | case M_DQT: |
1175 | 15.5k | if (! get_dqt(cinfo)) |
1176 | 120 | return JPEG_SUSPENDED; |
1177 | 15.4k | break; |
1178 | | |
1179 | 15.4k | case M_DRI: |
1180 | 2.03k | if (! get_dri(cinfo)) |
1181 | 0 | return JPEG_SUSPENDED; |
1182 | 2.03k | break; |
1183 | | |
1184 | 2.03k | case M_JPG8: |
1185 | 2 | if (! get_lse(cinfo)) |
1186 | 0 | return JPEG_SUSPENDED; |
1187 | 2 | break; |
1188 | | |
1189 | 10.5k | case M_APP0: |
1190 | 16.3k | case M_APP1: |
1191 | 16.9k | case M_APP2: |
1192 | 16.9k | case M_APP3: |
1193 | 16.9k | case M_APP4: |
1194 | 16.9k | case M_APP5: |
1195 | 16.9k | case M_APP6: |
1196 | 16.9k | case M_APP7: |
1197 | 16.9k | case M_APP8: |
1198 | 16.9k | case M_APP9: |
1199 | 16.9k | case M_APP10: |
1200 | 17.0k | case M_APP11: |
1201 | 19.9k | case M_APP12: |
1202 | 21.8k | case M_APP13: |
1203 | 28.6k | case M_APP14: |
1204 | 28.6k | case M_APP15: |
1205 | 28.6k | if (! (*((my_marker_ptr) cinfo->marker)->process_APPn[ |
1206 | 28.6k | cinfo->unread_marker - (int) M_APP0]) (cinfo)) |
1207 | 3 | return JPEG_SUSPENDED; |
1208 | 28.6k | break; |
1209 | | |
1210 | 28.6k | case M_COM: |
1211 | 1.54k | if (! (*((my_marker_ptr) cinfo->marker)->process_COM) (cinfo)) |
1212 | 0 | return JPEG_SUSPENDED; |
1213 | 1.54k | break; |
1214 | | |
1215 | 1.54k | case M_RST0: /* these are all parameterless */ |
1216 | 2.00k | case M_RST1: |
1217 | 3.29k | case M_RST2: |
1218 | 4.70k | case M_RST3: |
1219 | 6.11k | case M_RST4: |
1220 | 7.53k | case M_RST5: |
1221 | 8.93k | case M_RST6: |
1222 | 10.3k | case M_RST7: |
1223 | 10.4k | case M_TEM: |
1224 | 10.4k | TRACEMS1(cinfo, 1, JTRC_PARMLESS_MARKER, cinfo->unread_marker); |
1225 | 10.4k | break; |
1226 | | |
1227 | 48 | case M_DNL: /* Ignore DNL ... perhaps the wrong thing */ |
1228 | 48 | if (! skip_variable(cinfo)) |
1229 | 0 | return JPEG_SUSPENDED; |
1230 | 48 | break; |
1231 | | |
1232 | 961 | default: /* must be DHP, EXP, JPGn, or RESn */ |
1233 | | /* For now, we treat the reserved markers as fatal errors since they are |
1234 | | * likely to be used to signal incompatible JPEG Part 3 extensions. |
1235 | | * Once the JPEG 3 version-number marker is well defined, this code |
1236 | | * ought to change! |
1237 | | */ |
1238 | 961 | ERREXIT1(cinfo, JERR_UNKNOWN_MARKER, cinfo->unread_marker); |
1239 | 141k | } |
1240 | | /* Successfully processed marker, so reset state variable */ |
1241 | 109k | cinfo->unread_marker = 0; |
1242 | 109k | } /* end loop */ |
1243 | 49.2k | } |
1244 | | |
1245 | | |
1246 | | /* |
1247 | | * Read a restart marker, which is expected to appear next in the datastream; |
1248 | | * if the marker is not there, take appropriate recovery action. |
1249 | | * Returns FALSE if suspension is required. |
1250 | | * |
1251 | | * This is called by the entropy decoder after it has read an appropriate |
1252 | | * number of MCUs. cinfo->unread_marker may be nonzero if the entropy decoder |
1253 | | * has already read a marker from the data source. Under normal conditions |
1254 | | * cinfo->unread_marker will be reset to 0 before returning; if not reset, |
1255 | | * it holds a marker which the decoder will be unable to read past. |
1256 | | */ |
1257 | | |
1258 | | METHODDEF(boolean) |
1259 | | read_restart_marker (j_decompress_ptr cinfo) |
1260 | 50.1k | { |
1261 | | /* Obtain a marker unless we already did. */ |
1262 | | /* Note that next_marker will complain if it skips any data. */ |
1263 | 50.1k | if (cinfo->unread_marker == 0) { |
1264 | 3.22k | if (! next_marker(cinfo)) |
1265 | 186 | return FALSE; |
1266 | 3.22k | } |
1267 | | |
1268 | 49.9k | if (cinfo->unread_marker == |
1269 | 49.9k | ((int) M_RST0 + cinfo->marker->next_restart_num)) { |
1270 | | /* Normal case --- swallow the marker and let entropy decoder continue */ |
1271 | 44.1k | TRACEMS1(cinfo, 3, JTRC_RST, cinfo->marker->next_restart_num); |
1272 | 44.1k | cinfo->unread_marker = 0; |
1273 | 44.1k | } else { |
1274 | | /* Uh-oh, the restart markers have been messed up. */ |
1275 | | /* Let the data source manager determine how to resync. */ |
1276 | 5.77k | if (! (*cinfo->src->resync_to_restart) (cinfo, |
1277 | 5.77k | cinfo->marker->next_restart_num)) |
1278 | 157 | return FALSE; |
1279 | 5.77k | } |
1280 | | |
1281 | | /* Update next-restart state */ |
1282 | 49.8k | cinfo->marker->next_restart_num = (cinfo->marker->next_restart_num + 1) & 7; |
1283 | | |
1284 | 49.8k | return TRUE; |
1285 | 49.9k | } |
1286 | | |
1287 | | |
1288 | | /* |
1289 | | * This is the default resync_to_restart method for data source managers |
1290 | | * to use if they don't have any better approach. Some data source managers |
1291 | | * may be able to back up, or may have additional knowledge about the data |
1292 | | * which permits a more intelligent recovery strategy; such managers would |
1293 | | * presumably supply their own resync method. |
1294 | | * |
1295 | | * read_restart_marker calls resync_to_restart if it finds a marker other than |
1296 | | * the restart marker it was expecting. (This code is *not* used unless |
1297 | | * a nonzero restart interval has been declared.) cinfo->unread_marker is |
1298 | | * the marker code actually found (might be anything, except 0 or FF). |
1299 | | * The desired restart marker number (0..7) is passed as a parameter. |
1300 | | * This routine is supposed to apply whatever error recovery strategy seems |
1301 | | * appropriate in order to position the input stream to the next data segment. |
1302 | | * Note that cinfo->unread_marker is treated as a marker appearing before |
1303 | | * the current data-source input point; usually it should be reset to zero |
1304 | | * before returning. |
1305 | | * Returns FALSE if suspension is required. |
1306 | | * |
1307 | | * This implementation is substantially constrained by wanting to treat the |
1308 | | * input as a data stream; this means we can't back up. Therefore, we have |
1309 | | * only the following actions to work with: |
1310 | | * 1. Simply discard the marker and let the entropy decoder resume at next |
1311 | | * byte of file. |
1312 | | * 2. Read forward until we find another marker, discarding intervening |
1313 | | * data. (In theory we could look ahead within the current bufferload, |
1314 | | * without having to discard data if we don't find the desired marker. |
1315 | | * This idea is not implemented here, in part because it makes behavior |
1316 | | * dependent on buffer size and chance buffer-boundary positions.) |
1317 | | * 3. Leave the marker unread (by failing to zero cinfo->unread_marker). |
1318 | | * This will cause the entropy decoder to process an empty data segment, |
1319 | | * inserting dummy zeroes, and then we will reprocess the marker. |
1320 | | * |
1321 | | * #2 is appropriate if we think the desired marker lies ahead, while #3 is |
1322 | | * appropriate if the found marker is a future restart marker (indicating |
1323 | | * that we have missed the desired restart marker, probably because it got |
1324 | | * corrupted). |
1325 | | * We apply #2 or #3 if the found marker is a restart marker no more than |
1326 | | * two counts behind or ahead of the expected one. We also apply #2 if the |
1327 | | * found marker is not a legal JPEG marker code (it's certainly bogus data). |
1328 | | * If the found marker is a restart marker more than 2 counts away, we do #1 |
1329 | | * (too much risk that the marker is erroneous; with luck we will be able to |
1330 | | * resync at some future point). |
1331 | | * For any valid non-restart JPEG marker, we apply #3. This keeps us from |
1332 | | * overrunning the end of a scan. An implementation limited to single-scan |
1333 | | * files might find it better to apply #2 for markers other than EOI, since |
1334 | | * any other marker would have to be bogus data in that case. |
1335 | | */ |
1336 | | |
1337 | | GLOBAL(boolean) |
1338 | | jpeg_resync_to_restart (j_decompress_ptr cinfo, int desired) |
1339 | 5.77k | { |
1340 | 5.77k | int marker = cinfo->unread_marker; |
1341 | 5.77k | int action = 1; |
1342 | | |
1343 | | /* Always put up a warning. */ |
1344 | 5.77k | WARNMS2(cinfo, JWRN_MUST_RESYNC, marker, desired); |
1345 | | |
1346 | | /* Outer loop handles repeated decision after scanning forward. */ |
1347 | 6.76k | for (;;) { |
1348 | 6.76k | if (marker < (int) M_SOF0) |
1349 | 1.05k | action = 2; /* invalid marker */ |
1350 | 5.70k | else if (marker < (int) M_RST0 || marker > (int) M_RST7) |
1351 | 4.84k | action = 3; /* valid non-restart marker */ |
1352 | 868 | else { |
1353 | 868 | if (marker == ((int) M_RST0 + ((desired+1) & 7)) || |
1354 | 868 | marker == ((int) M_RST0 + ((desired+2) & 7))) |
1355 | 73 | action = 3; /* one of the next two expected restarts */ |
1356 | 795 | else if (marker == ((int) M_RST0 + ((desired-1) & 7)) || |
1357 | 795 | marker == ((int) M_RST0 + ((desired-2) & 7))) |
1358 | 92 | action = 2; /* a prior restart, so advance */ |
1359 | 703 | else |
1360 | 703 | action = 1; /* desired restart or too far away */ |
1361 | 868 | } |
1362 | 6.76k | TRACEMS2(cinfo, 4, JTRC_RECOVERY_ACTION, marker, action); |
1363 | 6.76k | switch (action) { |
1364 | 703 | case 1: |
1365 | | /* Discard marker and let entropy decoder resume processing. */ |
1366 | 703 | cinfo->unread_marker = 0; |
1367 | 703 | return TRUE; |
1368 | 1.15k | case 2: |
1369 | | /* Scan to the next marker, and repeat the decision loop. */ |
1370 | 1.15k | if (! next_marker(cinfo)) |
1371 | 157 | return FALSE; |
1372 | 993 | marker = cinfo->unread_marker; |
1373 | 993 | break; |
1374 | 4.91k | case 3: |
1375 | | /* Return without advancing past this marker. */ |
1376 | | /* Entropy decoder will be forced to process an empty segment. */ |
1377 | 4.91k | return TRUE; |
1378 | 6.76k | } |
1379 | 6.76k | } /* end loop */ |
1380 | 5.77k | } |
1381 | | |
1382 | | |
1383 | | /* |
1384 | | * Reset marker processing state to begin a fresh datastream. |
1385 | | */ |
1386 | | |
1387 | | METHODDEF(void) |
1388 | | reset_marker_reader (j_decompress_ptr cinfo) |
1389 | 26.6k | { |
1390 | 26.6k | my_marker_ptr marker = (my_marker_ptr) cinfo->marker; |
1391 | | |
1392 | 26.6k | cinfo->comp_info = NULL; /* until allocated by get_sof */ |
1393 | 26.6k | cinfo->input_scan_number = 0; /* no SOS seen yet */ |
1394 | 26.6k | cinfo->unread_marker = 0; /* no pending marker */ |
1395 | 26.6k | marker->pub.saw_SOI = FALSE; /* set internal state too */ |
1396 | 26.6k | marker->pub.saw_SOF = FALSE; |
1397 | 26.6k | marker->pub.discarded_bytes = 0; |
1398 | 26.6k | marker->cur_marker = NULL; |
1399 | 26.6k | } |
1400 | | |
1401 | | |
1402 | | /* |
1403 | | * Initialize the marker reader module. |
1404 | | * This is called only once, when the decompression object is created. |
1405 | | */ |
1406 | | |
1407 | | GLOBAL(void) |
1408 | | jinit_marker_reader (j_decompress_ptr cinfo) |
1409 | 13.3k | { |
1410 | 13.3k | my_marker_ptr marker; |
1411 | 13.3k | int i; |
1412 | | |
1413 | | /* Create subobject in permanent pool */ |
1414 | 13.3k | marker = (my_marker_ptr) (*cinfo->mem->alloc_small) |
1415 | 13.3k | ((j_common_ptr) cinfo, JPOOL_PERMANENT, SIZEOF(my_marker_reader)); |
1416 | 13.3k | cinfo->marker = &marker->pub; |
1417 | | /* Initialize public method pointers */ |
1418 | 13.3k | marker->pub.reset_marker_reader = reset_marker_reader; |
1419 | 13.3k | marker->pub.read_markers = read_markers; |
1420 | 13.3k | marker->pub.read_restart_marker = read_restart_marker; |
1421 | | /* Initialize COM/APPn processing. |
1422 | | * By default, we examine and then discard APP0 and APP14, |
1423 | | * but simply discard COM and all other APPn. |
1424 | | */ |
1425 | 13.3k | marker->process_COM = skip_variable; |
1426 | 13.3k | marker->length_limit_COM = 0; |
1427 | 227k | for (i = 0; i < 16; i++) { |
1428 | 213k | marker->process_APPn[i] = skip_variable; |
1429 | 213k | marker->length_limit_APPn[i] = 0; |
1430 | 213k | } |
1431 | 13.3k | marker->process_APPn[0] = get_interesting_appn; |
1432 | 13.3k | marker->process_APPn[14] = get_interesting_appn; |
1433 | | /* Reset marker processing state */ |
1434 | 13.3k | reset_marker_reader(cinfo); |
1435 | 13.3k | } |
1436 | | |
1437 | | |
1438 | | /* |
1439 | | * Control saving of COM and APPn markers into marker_list. |
1440 | | */ |
1441 | | |
1442 | | #ifdef SAVE_MARKERS_SUPPORTED |
1443 | | |
1444 | | GLOBAL(void) |
1445 | | jpeg_save_markers (j_decompress_ptr cinfo, int marker_code, |
1446 | | unsigned int length_limit) |
1447 | 0 | { |
1448 | 0 | my_marker_ptr marker = (my_marker_ptr) cinfo->marker; |
1449 | 0 | long maxlength; |
1450 | 0 | jpeg_marker_parser_method processor; |
1451 | | |
1452 | | /* Length limit mustn't be larger than what we can allocate |
1453 | | * (should only be a concern in a 16-bit environment). |
1454 | | */ |
1455 | 0 | maxlength = cinfo->mem->max_alloc_chunk - SIZEOF(struct jpeg_marker_struct); |
1456 | 0 | if (((long) length_limit) > maxlength) |
1457 | 0 | length_limit = (unsigned int) maxlength; |
1458 | | |
1459 | | /* Choose processor routine to use. |
1460 | | * APP0/APP14 have special requirements. |
1461 | | */ |
1462 | 0 | if (length_limit) { |
1463 | 0 | processor = save_marker; |
1464 | | /* If saving APP0/APP14, save at least enough for our internal use. */ |
1465 | 0 | if (marker_code == (int) M_APP0 && length_limit < APP0_DATA_LEN) |
1466 | 0 | length_limit = APP0_DATA_LEN; |
1467 | 0 | else if (marker_code == (int) M_APP14 && length_limit < APP14_DATA_LEN) |
1468 | 0 | length_limit = APP14_DATA_LEN; |
1469 | 0 | } else { |
1470 | 0 | processor = skip_variable; |
1471 | | /* If discarding APP0/APP14, use our regular on-the-fly processor. */ |
1472 | 0 | if (marker_code == (int) M_APP0 || marker_code == (int) M_APP14) |
1473 | 0 | processor = get_interesting_appn; |
1474 | 0 | } |
1475 | |
|
1476 | 0 | if (marker_code == (int) M_COM) { |
1477 | 0 | marker->process_COM = processor; |
1478 | 0 | marker->length_limit_COM = length_limit; |
1479 | 0 | } else if (marker_code >= (int) M_APP0 && marker_code <= (int) M_APP15) { |
1480 | 0 | marker->process_APPn[marker_code - (int) M_APP0] = processor; |
1481 | 0 | marker->length_limit_APPn[marker_code - (int) M_APP0] = length_limit; |
1482 | 0 | } else |
1483 | 0 | ERREXIT1(cinfo, JERR_UNKNOWN_MARKER, marker_code); |
1484 | 0 | } |
1485 | | |
1486 | | #endif /* SAVE_MARKERS_SUPPORTED */ |
1487 | | |
1488 | | |
1489 | | /* |
1490 | | * Install a special processing method for COM or APPn markers. |
1491 | | */ |
1492 | | |
1493 | | GLOBAL(void) |
1494 | | jpeg_set_marker_processor (j_decompress_ptr cinfo, int marker_code, |
1495 | | jpeg_marker_parser_method routine) |
1496 | 0 | { |
1497 | 0 | my_marker_ptr marker = (my_marker_ptr) cinfo->marker; |
1498 | |
|
1499 | 0 | if (marker_code == (int) M_COM) |
1500 | 0 | marker->process_COM = routine; |
1501 | 0 | else if (marker_code >= (int) M_APP0 && marker_code <= (int) M_APP15) |
1502 | 0 | marker->process_APPn[marker_code - (int) M_APP0] = routine; |
1503 | 0 | else |
1504 | 0 | ERREXIT1(cinfo, JERR_UNKNOWN_MARKER, marker_code); |
1505 | 0 | } |