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