PageRenderTime 83ms CodeModel.GetById 19ms RepoModel.GetById 0ms app.codeStats 0ms

/src/FreeImage/Source/LibJPEG/libjpeg.txt

https://bitbucket.org/cabalistic/ogredeps/
Plain Text | 3085 lines | 2576 code | 509 blank | 0 comment | 0 complexity | 38da6f995510b093dc35a44e292db67a MD5 | raw file
Possible License(s): LGPL-3.0, BSD-3-Clause, CPL-1.0, Unlicense, GPL-2.0, GPL-3.0, LGPL-2.0, MPL-2.0-no-copyleft-exception, BSD-2-Clause, LGPL-2.1
  1. USING THE IJG JPEG LIBRARY
  2. Copyright (C) 1994-2011, Thomas G. Lane, Guido Vollbeding.
  3. This file is part of the Independent JPEG Group's software.
  4. For conditions of distribution and use, see the accompanying README file.
  5. This file describes how to use the IJG JPEG library within an application
  6. program. Read it if you want to write a program that uses the library.
  7. The file example.c provides heavily commented skeleton code for calling the
  8. JPEG library. Also see jpeglib.h (the include file to be used by application
  9. programs) for full details about data structures and function parameter lists.
  10. The library source code, of course, is the ultimate reference.
  11. Note that there have been *major* changes from the application interface
  12. presented by IJG version 4 and earlier versions. The old design had several
  13. inherent limitations, and it had accumulated a lot of cruft as we added
  14. features while trying to minimize application-interface changes. We have
  15. sacrificed backward compatibility in the version 5 rewrite, but we think the
  16. improvements justify this.
  17. TABLE OF CONTENTS
  18. -----------------
  19. Overview:
  20. Functions provided by the library
  21. Outline of typical usage
  22. Basic library usage:
  23. Data formats
  24. Compression details
  25. Decompression details
  26. Mechanics of usage: include files, linking, etc
  27. Advanced features:
  28. Compression parameter selection
  29. Decompression parameter selection
  30. Special color spaces
  31. Error handling
  32. Compressed data handling (source and destination managers)
  33. I/O suspension
  34. Progressive JPEG support
  35. Buffered-image mode
  36. Abbreviated datastreams and multiple images
  37. Special markers
  38. Raw (downsampled) image data
  39. Really raw data: DCT coefficients
  40. Progress monitoring
  41. Memory management
  42. Memory usage
  43. Library compile-time options
  44. Portability considerations
  45. Notes for MS-DOS implementors
  46. You should read at least the overview and basic usage sections before trying
  47. to program with the library. The sections on advanced features can be read
  48. if and when you need them.
  49. OVERVIEW
  50. ========
  51. Functions provided by the library
  52. ---------------------------------
  53. The IJG JPEG library provides C code to read and write JPEG-compressed image
  54. files. The surrounding application program receives or supplies image data a
  55. scanline at a time, using a straightforward uncompressed image format. All
  56. details of color conversion and other preprocessing/postprocessing can be
  57. handled by the library.
  58. The library includes a substantial amount of code that is not covered by the
  59. JPEG standard but is necessary for typical applications of JPEG. These
  60. functions preprocess the image before JPEG compression or postprocess it after
  61. decompression. They include colorspace conversion, downsampling/upsampling,
  62. and color quantization. The application indirectly selects use of this code
  63. by specifying the format in which it wishes to supply or receive image data.
  64. For example, if colormapped output is requested, then the decompression
  65. library automatically invokes color quantization.
  66. A wide range of quality vs. speed tradeoffs are possible in JPEG processing,
  67. and even more so in decompression postprocessing. The decompression library
  68. provides multiple implementations that cover most of the useful tradeoffs,
  69. ranging from very-high-quality down to fast-preview operation. On the
  70. compression side we have generally not provided low-quality choices, since
  71. compression is normally less time-critical. It should be understood that the
  72. low-quality modes may not meet the JPEG standard's accuracy requirements;
  73. nonetheless, they are useful for viewers.
  74. A word about functions *not* provided by the library. We handle a subset of
  75. the ISO JPEG standard; most baseline, extended-sequential, and progressive
  76. JPEG processes are supported. (Our subset includes all features now in common
  77. use.) Unsupported ISO options include:
  78. * Hierarchical storage
  79. * Lossless JPEG
  80. * DNL marker
  81. * Nonintegral subsampling ratios
  82. We support both 8- and 12-bit data precision, but this is a compile-time
  83. choice rather than a run-time choice; hence it is difficult to use both
  84. precisions in a single application.
  85. By itself, the library handles only interchange JPEG datastreams --- in
  86. particular the widely used JFIF file format. The library can be used by
  87. surrounding code to process interchange or abbreviated JPEG datastreams that
  88. are embedded in more complex file formats. (For example, this library is
  89. used by the free LIBTIFF library to support JPEG compression in TIFF.)
  90. Outline of typical usage
  91. ------------------------
  92. The rough outline of a JPEG compression operation is:
  93. Allocate and initialize a JPEG compression object
  94. Specify the destination for the compressed data (eg, a file)
  95. Set parameters for compression, including image size & colorspace
  96. jpeg_start_compress(...);
  97. while (scan lines remain to be written)
  98. jpeg_write_scanlines(...);
  99. jpeg_finish_compress(...);
  100. Release the JPEG compression object
  101. A JPEG compression object holds parameters and working state for the JPEG
  102. library. We make creation/destruction of the object separate from starting
  103. or finishing compression of an image; the same object can be re-used for a
  104. series of image compression operations. This makes it easy to re-use the
  105. same parameter settings for a sequence of images. Re-use of a JPEG object
  106. also has important implications for processing abbreviated JPEG datastreams,
  107. as discussed later.
  108. The image data to be compressed is supplied to jpeg_write_scanlines() from
  109. in-memory buffers. If the application is doing file-to-file compression,
  110. reading image data from the source file is the application's responsibility.
  111. The library emits compressed data by calling a "data destination manager",
  112. which typically will write the data into a file; but the application can
  113. provide its own destination manager to do something else.
  114. Similarly, the rough outline of a JPEG decompression operation is:
  115. Allocate and initialize a JPEG decompression object
  116. Specify the source of the compressed data (eg, a file)
  117. Call jpeg_read_header() to obtain image info
  118. Set parameters for decompression
  119. jpeg_start_decompress(...);
  120. while (scan lines remain to be read)
  121. jpeg_read_scanlines(...);
  122. jpeg_finish_decompress(...);
  123. Release the JPEG decompression object
  124. This is comparable to the compression outline except that reading the
  125. datastream header is a separate step. This is helpful because information
  126. about the image's size, colorspace, etc is available when the application
  127. selects decompression parameters. For example, the application can choose an
  128. output scaling ratio that will fit the image into the available screen size.
  129. The decompression library obtains compressed data by calling a data source
  130. manager, which typically will read the data from a file; but other behaviors
  131. can be obtained with a custom source manager. Decompressed data is delivered
  132. into in-memory buffers passed to jpeg_read_scanlines().
  133. It is possible to abort an incomplete compression or decompression operation
  134. by calling jpeg_abort(); or, if you do not need to retain the JPEG object,
  135. simply release it by calling jpeg_destroy().
  136. JPEG compression and decompression objects are two separate struct types.
  137. However, they share some common fields, and certain routines such as
  138. jpeg_destroy() can work on either type of object.
  139. The JPEG library has no static variables: all state is in the compression
  140. or decompression object. Therefore it is possible to process multiple
  141. compression and decompression operations concurrently, using multiple JPEG
  142. objects.
  143. Both compression and decompression can be done in an incremental memory-to-
  144. memory fashion, if suitable source/destination managers are used. See the
  145. section on "I/O suspension" for more details.
  146. BASIC LIBRARY USAGE
  147. ===================
  148. Data formats
  149. ------------
  150. Before diving into procedural details, it is helpful to understand the
  151. image data format that the JPEG library expects or returns.
  152. The standard input image format is a rectangular array of pixels, with each
  153. pixel having the same number of "component" or "sample" values (color
  154. channels). You must specify how many components there are and the colorspace
  155. interpretation of the components. Most applications will use RGB data
  156. (three components per pixel) or grayscale data (one component per pixel).
  157. PLEASE NOTE THAT RGB DATA IS THREE SAMPLES PER PIXEL, GRAYSCALE ONLY ONE.
  158. A remarkable number of people manage to miss this, only to find that their
  159. programs don't work with grayscale JPEG files.
  160. There is no provision for colormapped input. JPEG files are always full-color
  161. or full grayscale (or sometimes another colorspace such as CMYK). You can
  162. feed in a colormapped image by expanding it to full-color format. However
  163. JPEG often doesn't work very well with source data that has been colormapped,
  164. because of dithering noise. This is discussed in more detail in the JPEG FAQ
  165. and the other references mentioned in the README file.
  166. Pixels are stored by scanlines, with each scanline running from left to
  167. right. The component values for each pixel are adjacent in the row; for
  168. example, R,G,B,R,G,B,R,G,B,... for 24-bit RGB color. Each scanline is an
  169. array of data type JSAMPLE --- which is typically "unsigned char", unless
  170. you've changed jmorecfg.h. (You can also change the RGB pixel layout, say
  171. to B,G,R order, by modifying jmorecfg.h. But see the restrictions listed in
  172. that file before doing so.)
  173. A 2-D array of pixels is formed by making a list of pointers to the starts of
  174. scanlines; so the scanlines need not be physically adjacent in memory. Even
  175. if you process just one scanline at a time, you must make a one-element
  176. pointer array to conform to this structure. Pointers to JSAMPLE rows are of
  177. type JSAMPROW, and the pointer to the pointer array is of type JSAMPARRAY.
  178. The library accepts or supplies one or more complete scanlines per call.
  179. It is not possible to process part of a row at a time. Scanlines are always
  180. processed top-to-bottom. You can process an entire image in one call if you
  181. have it all in memory, but usually it's simplest to process one scanline at
  182. a time.
  183. For best results, source data values should have the precision specified by
  184. BITS_IN_JSAMPLE (normally 8 bits). For instance, if you choose to compress
  185. data that's only 6 bits/channel, you should left-justify each value in a
  186. byte before passing it to the compressor. If you need to compress data
  187. that has more than 8 bits/channel, compile with BITS_IN_JSAMPLE = 12.
  188. (See "Library compile-time options", later.)
  189. The data format returned by the decompressor is the same in all details,
  190. except that colormapped output is supported. (Again, a JPEG file is never
  191. colormapped. But you can ask the decompressor to perform on-the-fly color
  192. quantization to deliver colormapped output.) If you request colormapped
  193. output then the returned data array contains a single JSAMPLE per pixel;
  194. its value is an index into a color map. The color map is represented as
  195. a 2-D JSAMPARRAY in which each row holds the values of one color component,
  196. that is, colormap[i][j] is the value of the i'th color component for pixel
  197. value (map index) j. Note that since the colormap indexes are stored in
  198. JSAMPLEs, the maximum number of colors is limited by the size of JSAMPLE
  199. (ie, at most 256 colors for an 8-bit JPEG library).
  200. Compression details
  201. -------------------
  202. Here we revisit the JPEG compression outline given in the overview.
  203. 1. Allocate and initialize a JPEG compression object.
  204. A JPEG compression object is a "struct jpeg_compress_struct". (It also has
  205. a bunch of subsidiary structures which are allocated via malloc(), but the
  206. application doesn't control those directly.) This struct can be just a local
  207. variable in the calling routine, if a single routine is going to execute the
  208. whole JPEG compression sequence. Otherwise it can be static or allocated
  209. from malloc().
  210. You will also need a structure representing a JPEG error handler. The part
  211. of this that the library cares about is a "struct jpeg_error_mgr". If you
  212. are providing your own error handler, you'll typically want to embed the
  213. jpeg_error_mgr struct in a larger structure; this is discussed later under
  214. "Error handling". For now we'll assume you are just using the default error
  215. handler. The default error handler will print JPEG error/warning messages
  216. on stderr, and it will call exit() if a fatal error occurs.
  217. You must initialize the error handler structure, store a pointer to it into
  218. the JPEG object's "err" field, and then call jpeg_create_compress() to
  219. initialize the rest of the JPEG object.
  220. Typical code for this step, if you are using the default error handler, is
  221. struct jpeg_compress_struct cinfo;
  222. struct jpeg_error_mgr jerr;
  223. ...
  224. cinfo.err = jpeg_std_error(&jerr);
  225. jpeg_create_compress(&cinfo);
  226. jpeg_create_compress allocates a small amount of memory, so it could fail
  227. if you are out of memory. In that case it will exit via the error handler;
  228. that's why the error handler must be initialized first.
  229. 2. Specify the destination for the compressed data (eg, a file).
  230. As previously mentioned, the JPEG library delivers compressed data to a
  231. "data destination" module. The library includes one data destination
  232. module which knows how to write to a stdio stream. You can use your own
  233. destination module if you want to do something else, as discussed later.
  234. If you use the standard destination module, you must open the target stdio
  235. stream beforehand. Typical code for this step looks like:
  236. FILE * outfile;
  237. ...
  238. if ((outfile = fopen(filename, "wb")) == NULL) {
  239. fprintf(stderr, "can't open %s\n", filename);
  240. exit(1);
  241. }
  242. jpeg_stdio_dest(&cinfo, outfile);
  243. where the last line invokes the standard destination module.
  244. WARNING: it is critical that the binary compressed data be delivered to the
  245. output file unchanged. On non-Unix systems the stdio library may perform
  246. newline translation or otherwise corrupt binary data. To suppress this
  247. behavior, you may need to use a "b" option to fopen (as shown above), or use
  248. setmode() or another routine to put the stdio stream in binary mode. See
  249. cjpeg.c and djpeg.c for code that has been found to work on many systems.
  250. You can select the data destination after setting other parameters (step 3),
  251. if that's more convenient. You may not change the destination between
  252. calling jpeg_start_compress() and jpeg_finish_compress().
  253. 3. Set parameters for compression, including image size & colorspace.
  254. You must supply information about the source image by setting the following
  255. fields in the JPEG object (cinfo structure):
  256. image_width Width of image, in pixels
  257. image_height Height of image, in pixels
  258. input_components Number of color channels (samples per pixel)
  259. in_color_space Color space of source image
  260. The image dimensions are, hopefully, obvious. JPEG supports image dimensions
  261. of 1 to 64K pixels in either direction. The input color space is typically
  262. RGB or grayscale, and input_components is 3 or 1 accordingly. (See "Special
  263. color spaces", later, for more info.) The in_color_space field must be
  264. assigned one of the J_COLOR_SPACE enum constants, typically JCS_RGB or
  265. JCS_GRAYSCALE.
  266. JPEG has a large number of compression parameters that determine how the
  267. image is encoded. Most applications don't need or want to know about all
  268. these parameters. You can set all the parameters to reasonable defaults by
  269. calling jpeg_set_defaults(); then, if there are particular values you want
  270. to change, you can do so after that. The "Compression parameter selection"
  271. section tells about all the parameters.
  272. You must set in_color_space correctly before calling jpeg_set_defaults(),
  273. because the defaults depend on the source image colorspace. However the
  274. other three source image parameters need not be valid until you call
  275. jpeg_start_compress(). There's no harm in calling jpeg_set_defaults() more
  276. than once, if that happens to be convenient.
  277. Typical code for a 24-bit RGB source image is
  278. cinfo.image_width = Width; /* image width and height, in pixels */
  279. cinfo.image_height = Height;
  280. cinfo.input_components = 3; /* # of color components per pixel */
  281. cinfo.in_color_space = JCS_RGB; /* colorspace of input image */
  282. jpeg_set_defaults(&cinfo);
  283. /* Make optional parameter settings here */
  284. 4. jpeg_start_compress(...);
  285. After you have established the data destination and set all the necessary
  286. source image info and other parameters, call jpeg_start_compress() to begin
  287. a compression cycle. This will initialize internal state, allocate working
  288. storage, and emit the first few bytes of the JPEG datastream header.
  289. Typical code:
  290. jpeg_start_compress(&cinfo, TRUE);
  291. The "TRUE" parameter ensures that a complete JPEG interchange datastream
  292. will be written. This is appropriate in most cases. If you think you might
  293. want to use an abbreviated datastream, read the section on abbreviated
  294. datastreams, below.
  295. Once you have called jpeg_start_compress(), you may not alter any JPEG
  296. parameters or other fields of the JPEG object until you have completed
  297. the compression cycle.
  298. 5. while (scan lines remain to be written)
  299. jpeg_write_scanlines(...);
  300. Now write all the required image data by calling jpeg_write_scanlines()
  301. one or more times. You can pass one or more scanlines in each call, up
  302. to the total image height. In most applications it is convenient to pass
  303. just one or a few scanlines at a time. The expected format for the passed
  304. data is discussed under "Data formats", above.
  305. Image data should be written in top-to-bottom scanline order. The JPEG spec
  306. contains some weasel wording about how top and bottom are application-defined
  307. terms (a curious interpretation of the English language...) but if you want
  308. your files to be compatible with everyone else's, you WILL use top-to-bottom
  309. order. If the source data must be read in bottom-to-top order, you can use
  310. the JPEG library's virtual array mechanism to invert the data efficiently.
  311. Examples of this can be found in the sample application cjpeg.
  312. The library maintains a count of the number of scanlines written so far
  313. in the next_scanline field of the JPEG object. Usually you can just use
  314. this variable as the loop counter, so that the loop test looks like
  315. "while (cinfo.next_scanline < cinfo.image_height)".
  316. Code for this step depends heavily on the way that you store the source data.
  317. example.c shows the following code for the case of a full-size 2-D source
  318. array containing 3-byte RGB pixels:
  319. JSAMPROW row_pointer[1]; /* pointer to a single row */
  320. int row_stride; /* physical row width in buffer */
  321. row_stride = image_width * 3; /* JSAMPLEs per row in image_buffer */
  322. while (cinfo.next_scanline < cinfo.image_height) {
  323. row_pointer[0] = & image_buffer[cinfo.next_scanline * row_stride];
  324. jpeg_write_scanlines(&cinfo, row_pointer, 1);
  325. }
  326. jpeg_write_scanlines() returns the number of scanlines actually written.
  327. This will normally be equal to the number passed in, so you can usually
  328. ignore the return value. It is different in just two cases:
  329. * If you try to write more scanlines than the declared image height,
  330. the additional scanlines are ignored.
  331. * If you use a suspending data destination manager, output buffer overrun
  332. will cause the compressor to return before accepting all the passed lines.
  333. This feature is discussed under "I/O suspension", below. The normal
  334. stdio destination manager will NOT cause this to happen.
  335. In any case, the return value is the same as the change in the value of
  336. next_scanline.
  337. 6. jpeg_finish_compress(...);
  338. After all the image data has been written, call jpeg_finish_compress() to
  339. complete the compression cycle. This step is ESSENTIAL to ensure that the
  340. last bufferload of data is written to the data destination.
  341. jpeg_finish_compress() also releases working memory associated with the JPEG
  342. object.
  343. Typical code:
  344. jpeg_finish_compress(&cinfo);
  345. If using the stdio destination manager, don't forget to close the output
  346. stdio stream (if necessary) afterwards.
  347. If you have requested a multi-pass operating mode, such as Huffman code
  348. optimization, jpeg_finish_compress() will perform the additional passes using
  349. data buffered by the first pass. In this case jpeg_finish_compress() may take
  350. quite a while to complete. With the default compression parameters, this will
  351. not happen.
  352. It is an error to call jpeg_finish_compress() before writing the necessary
  353. total number of scanlines. If you wish to abort compression, call
  354. jpeg_abort() as discussed below.
  355. After completing a compression cycle, you may dispose of the JPEG object
  356. as discussed next, or you may use it to compress another image. In that case
  357. return to step 2, 3, or 4 as appropriate. If you do not change the
  358. destination manager, the new datastream will be written to the same target.
  359. If you do not change any JPEG parameters, the new datastream will be written
  360. with the same parameters as before. Note that you can change the input image
  361. dimensions freely between cycles, but if you change the input colorspace, you
  362. should call jpeg_set_defaults() to adjust for the new colorspace; and then
  363. you'll need to repeat all of step 3.
  364. 7. Release the JPEG compression object.
  365. When you are done with a JPEG compression object, destroy it by calling
  366. jpeg_destroy_compress(). This will free all subsidiary memory (regardless of
  367. the previous state of the object). Or you can call jpeg_destroy(), which
  368. works for either compression or decompression objects --- this may be more
  369. convenient if you are sharing code between compression and decompression
  370. cases. (Actually, these routines are equivalent except for the declared type
  371. of the passed pointer. To avoid gripes from ANSI C compilers, jpeg_destroy()
  372. should be passed a j_common_ptr.)
  373. If you allocated the jpeg_compress_struct structure from malloc(), freeing
  374. it is your responsibility --- jpeg_destroy() won't. Ditto for the error
  375. handler structure.
  376. Typical code:
  377. jpeg_destroy_compress(&cinfo);
  378. 8. Aborting.
  379. If you decide to abort a compression cycle before finishing, you can clean up
  380. in either of two ways:
  381. * If you don't need the JPEG object any more, just call
  382. jpeg_destroy_compress() or jpeg_destroy() to release memory. This is
  383. legitimate at any point after calling jpeg_create_compress() --- in fact,
  384. it's safe even if jpeg_create_compress() fails.
  385. * If you want to re-use the JPEG object, call jpeg_abort_compress(), or call
  386. jpeg_abort() which works on both compression and decompression objects.
  387. This will return the object to an idle state, releasing any working memory.
  388. jpeg_abort() is allowed at any time after successful object creation.
  389. Note that cleaning up the data destination, if required, is your
  390. responsibility; neither of these routines will call term_destination().
  391. (See "Compressed data handling", below, for more about that.)
  392. jpeg_destroy() and jpeg_abort() are the only safe calls to make on a JPEG
  393. object that has reported an error by calling error_exit (see "Error handling"
  394. for more info). The internal state of such an object is likely to be out of
  395. whack. Either of these two routines will return the object to a known state.
  396. Decompression details
  397. ---------------------
  398. Here we revisit the JPEG decompression outline given in the overview.
  399. 1. Allocate and initialize a JPEG decompression object.
  400. This is just like initialization for compression, as discussed above,
  401. except that the object is a "struct jpeg_decompress_struct" and you
  402. call jpeg_create_decompress(). Error handling is exactly the same.
  403. Typical code:
  404. struct jpeg_decompress_struct cinfo;
  405. struct jpeg_error_mgr jerr;
  406. ...
  407. cinfo.err = jpeg_std_error(&jerr);
  408. jpeg_create_decompress(&cinfo);
  409. (Both here and in the IJG code, we usually use variable name "cinfo" for
  410. both compression and decompression objects.)
  411. 2. Specify the source of the compressed data (eg, a file).
  412. As previously mentioned, the JPEG library reads compressed data from a "data
  413. source" module. The library includes one data source module which knows how
  414. to read from a stdio stream. You can use your own source module if you want
  415. to do something else, as discussed later.
  416. If you use the standard source module, you must open the source stdio stream
  417. beforehand. Typical code for this step looks like:
  418. FILE * infile;
  419. ...
  420. if ((infile = fopen(filename, "rb")) == NULL) {
  421. fprintf(stderr, "can't open %s\n", filename);
  422. exit(1);
  423. }
  424. jpeg_stdio_src(&cinfo, infile);
  425. where the last line invokes the standard source module.
  426. WARNING: it is critical that the binary compressed data be read unchanged.
  427. On non-Unix systems the stdio library may perform newline translation or
  428. otherwise corrupt binary data. To suppress this behavior, you may need to use
  429. a "b" option to fopen (as shown above), or use setmode() or another routine to
  430. put the stdio stream in binary mode. See cjpeg.c and djpeg.c for code that
  431. has been found to work on many systems.
  432. You may not change the data source between calling jpeg_read_header() and
  433. jpeg_finish_decompress(). If you wish to read a series of JPEG images from
  434. a single source file, you should repeat the jpeg_read_header() to
  435. jpeg_finish_decompress() sequence without reinitializing either the JPEG
  436. object or the data source module; this prevents buffered input data from
  437. being discarded.
  438. 3. Call jpeg_read_header() to obtain image info.
  439. Typical code for this step is just
  440. jpeg_read_header(&cinfo, TRUE);
  441. This will read the source datastream header markers, up to the beginning
  442. of the compressed data proper. On return, the image dimensions and other
  443. info have been stored in the JPEG object. The application may wish to
  444. consult this information before selecting decompression parameters.
  445. More complex code is necessary if
  446. * A suspending data source is used --- in that case jpeg_read_header()
  447. may return before it has read all the header data. See "I/O suspension",
  448. below. The normal stdio source manager will NOT cause this to happen.
  449. * Abbreviated JPEG files are to be processed --- see the section on
  450. abbreviated datastreams. Standard applications that deal only in
  451. interchange JPEG files need not be concerned with this case either.
  452. It is permissible to stop at this point if you just wanted to find out the
  453. image dimensions and other header info for a JPEG file. In that case,
  454. call jpeg_destroy() when you are done with the JPEG object, or call
  455. jpeg_abort() to return it to an idle state before selecting a new data
  456. source and reading another header.
  457. 4. Set parameters for decompression.
  458. jpeg_read_header() sets appropriate default decompression parameters based on
  459. the properties of the image (in particular, its colorspace). However, you
  460. may well want to alter these defaults before beginning the decompression.
  461. For example, the default is to produce full color output from a color file.
  462. If you want colormapped output you must ask for it. Other options allow the
  463. returned image to be scaled and allow various speed/quality tradeoffs to be
  464. selected. "Decompression parameter selection", below, gives details.
  465. If the defaults are appropriate, nothing need be done at this step.
  466. Note that all default values are set by each call to jpeg_read_header().
  467. If you reuse a decompression object, you cannot expect your parameter
  468. settings to be preserved across cycles, as you can for compression.
  469. You must set desired parameter values each time.
  470. 5. jpeg_start_decompress(...);
  471. Once the parameter values are satisfactory, call jpeg_start_decompress() to
  472. begin decompression. This will initialize internal state, allocate working
  473. memory, and prepare for returning data.
  474. Typical code is just
  475. jpeg_start_decompress(&cinfo);
  476. If you have requested a multi-pass operating mode, such as 2-pass color
  477. quantization, jpeg_start_decompress() will do everything needed before data
  478. output can begin. In this case jpeg_start_decompress() may take quite a while
  479. to complete. With a single-scan (non progressive) JPEG file and default
  480. decompression parameters, this will not happen; jpeg_start_decompress() will
  481. return quickly.
  482. After this call, the final output image dimensions, including any requested
  483. scaling, are available in the JPEG object; so is the selected colormap, if
  484. colormapped output has been requested. Useful fields include
  485. output_width image width and height, as scaled
  486. output_height
  487. out_color_components # of color components in out_color_space
  488. output_components # of color components returned per pixel
  489. colormap the selected colormap, if any
  490. actual_number_of_colors number of entries in colormap
  491. output_components is 1 (a colormap index) when quantizing colors; otherwise it
  492. equals out_color_components. It is the number of JSAMPLE values that will be
  493. emitted per pixel in the output arrays.
  494. Typically you will need to allocate data buffers to hold the incoming image.
  495. You will need output_width * output_components JSAMPLEs per scanline in your
  496. output buffer, and a total of output_height scanlines will be returned.
  497. Note: if you are using the JPEG library's internal memory manager to allocate
  498. data buffers (as djpeg does), then the manager's protocol requires that you
  499. request large buffers *before* calling jpeg_start_decompress(). This is a
  500. little tricky since the output_XXX fields are not normally valid then. You
  501. can make them valid by calling jpeg_calc_output_dimensions() after setting the
  502. relevant parameters (scaling, output color space, and quantization flag).
  503. 6. while (scan lines remain to be read)
  504. jpeg_read_scanlines(...);
  505. Now you can read the decompressed image data by calling jpeg_read_scanlines()
  506. one or more times. At each call, you pass in the maximum number of scanlines
  507. to be read (ie, the height of your working buffer); jpeg_read_scanlines()
  508. will return up to that many lines. The return value is the number of lines
  509. actually read. The format of the returned data is discussed under "Data
  510. formats", above. Don't forget that grayscale and color JPEGs will return
  511. different data formats!
  512. Image data is returned in top-to-bottom scanline order. If you must write
  513. out the image in bottom-to-top order, you can use the JPEG library's virtual
  514. array mechanism to invert the data efficiently. Examples of this can be
  515. found in the sample application djpeg.
  516. The library maintains a count of the number of scanlines returned so far
  517. in the output_scanline field of the JPEG object. Usually you can just use
  518. this variable as the loop counter, so that the loop test looks like
  519. "while (cinfo.output_scanline < cinfo.output_height)". (Note that the test
  520. should NOT be against image_height, unless you never use scaling. The
  521. image_height field is the height of the original unscaled image.)
  522. The return value always equals the change in the value of output_scanline.
  523. If you don't use a suspending data source, it is safe to assume that
  524. jpeg_read_scanlines() reads at least one scanline per call, until the
  525. bottom of the image has been reached.
  526. If you use a buffer larger than one scanline, it is NOT safe to assume that
  527. jpeg_read_scanlines() fills it. (The current implementation returns only a
  528. few scanlines per call, no matter how large a buffer you pass.) So you must
  529. always provide a loop that calls jpeg_read_scanlines() repeatedly until the
  530. whole image has been read.
  531. 7. jpeg_finish_decompress(...);
  532. After all the image data has been read, call jpeg_finish_decompress() to
  533. complete the decompression cycle. This causes working memory associated
  534. with the JPEG object to be released.
  535. Typical code:
  536. jpeg_finish_decompress(&cinfo);
  537. If using the stdio source manager, don't forget to close the source stdio
  538. stream if necessary.
  539. It is an error to call jpeg_finish_decompress() before reading the correct
  540. total number of scanlines. If you wish to abort decompression, call
  541. jpeg_abort() as discussed below.
  542. After completing a decompression cycle, you may dispose of the JPEG object as
  543. discussed next, or you may use it to decompress another image. In that case
  544. return to step 2 or 3 as appropriate. If you do not change the source
  545. manager, the next image will be read from the same source.
  546. 8. Release the JPEG decompression object.
  547. When you are done with a JPEG decompression object, destroy it by calling
  548. jpeg_destroy_decompress() or jpeg_destroy(). The previous discussion of
  549. destroying compression objects applies here too.
  550. Typical code:
  551. jpeg_destroy_decompress(&cinfo);
  552. 9. Aborting.
  553. You can abort a decompression cycle by calling jpeg_destroy_decompress() or
  554. jpeg_destroy() if you don't need the JPEG object any more, or
  555. jpeg_abort_decompress() or jpeg_abort() if you want to reuse the object.
  556. The previous discussion of aborting compression cycles applies here too.
  557. Mechanics of usage: include files, linking, etc
  558. -----------------------------------------------
  559. Applications using the JPEG library should include the header file jpeglib.h
  560. to obtain declarations of data types and routines. Before including
  561. jpeglib.h, include system headers that define at least the typedefs FILE and
  562. size_t. On ANSI-conforming systems, including <stdio.h> is sufficient; on
  563. older Unix systems, you may need <sys/types.h> to define size_t.
  564. If the application needs to refer to individual JPEG library error codes, also
  565. include jerror.h to define those symbols.
  566. jpeglib.h indirectly includes the files jconfig.h and jmorecfg.h. If you are
  567. installing the JPEG header files in a system directory, you will want to
  568. install all four files: jpeglib.h, jerror.h, jconfig.h, jmorecfg.h.
  569. The most convenient way to include the JPEG code into your executable program
  570. is to prepare a library file ("libjpeg.a", or a corresponding name on non-Unix
  571. machines) and reference it at your link step. If you use only half of the
  572. library (only compression or only decompression), only that much code will be
  573. included from the library, unless your linker is hopelessly brain-damaged.
  574. The supplied makefiles build libjpeg.a automatically (see install.txt).
  575. While you can build the JPEG library as a shared library if the whim strikes
  576. you, we don't really recommend it. The trouble with shared libraries is that
  577. at some point you'll probably try to substitute a new version of the library
  578. without recompiling the calling applications. That generally doesn't work
  579. because the parameter struct declarations usually change with each new
  580. version. In other words, the library's API is *not* guaranteed binary
  581. compatible across versions; we only try to ensure source-code compatibility.
  582. (In hindsight, it might have been smarter to hide the parameter structs from
  583. applications and introduce a ton of access functions instead. Too late now,
  584. however.)
  585. On some systems your application may need to set up a signal handler to ensure
  586. that temporary files are deleted if the program is interrupted. This is most
  587. critical if you are on MS-DOS and use the jmemdos.c memory manager back end;
  588. it will try to grab extended memory for temp files, and that space will NOT be
  589. freed automatically. See cjpeg.c or djpeg.c for an example signal handler.
  590. It may be worth pointing out that the core JPEG library does not actually
  591. require the stdio library: only the default source/destination managers and
  592. error handler need it. You can use the library in a stdio-less environment
  593. if you replace those modules and use jmemnobs.c (or another memory manager of
  594. your own devising). More info about the minimum system library requirements
  595. may be found in jinclude.h.
  596. ADVANCED FEATURES
  597. =================
  598. Compression parameter selection
  599. -------------------------------
  600. This section describes all the optional parameters you can set for JPEG
  601. compression, as well as the "helper" routines provided to assist in this
  602. task. Proper setting of some parameters requires detailed understanding
  603. of the JPEG standard; if you don't know what a parameter is for, it's best
  604. not to mess with it! See REFERENCES in the README file for pointers to
  605. more info about JPEG.
  606. It's a good idea to call jpeg_set_defaults() first, even if you plan to set
  607. all the parameters; that way your code is more likely to work with future JPEG
  608. libraries that have additional parameters. For the same reason, we recommend
  609. you use a helper routine where one is provided, in preference to twiddling
  610. cinfo fields directly.
  611. The helper routines are:
  612. jpeg_set_defaults (j_compress_ptr cinfo)
  613. This routine sets all JPEG parameters to reasonable defaults, using
  614. only the input image's color space (field in_color_space, which must
  615. already be set in cinfo). Many applications will only need to use
  616. this routine and perhaps jpeg_set_quality().
  617. jpeg_set_colorspace (j_compress_ptr cinfo, J_COLOR_SPACE colorspace)
  618. Sets the JPEG file's colorspace (field jpeg_color_space) as specified,
  619. and sets other color-space-dependent parameters appropriately. See
  620. "Special color spaces", below, before using this. A large number of
  621. parameters, including all per-component parameters, are set by this
  622. routine; if you want to twiddle individual parameters you should call
  623. jpeg_set_colorspace() before rather than after.
  624. jpeg_default_colorspace (j_compress_ptr cinfo)
  625. Selects an appropriate JPEG colorspace based on cinfo->in_color_space,
  626. and calls jpeg_set_colorspace(). This is actually a subroutine of
  627. jpeg_set_defaults(). It's broken out in case you want to change
  628. just the colorspace-dependent JPEG parameters.
  629. jpeg_set_quality (j_compress_ptr cinfo, int quality, boolean force_baseline)
  630. Constructs JPEG quantization tables appropriate for the indicated
  631. quality setting. The quality value is expressed on the 0..100 scale
  632. recommended by IJG (cjpeg's "-quality" switch uses this routine).
  633. Note that the exact mapping from quality values to tables may change
  634. in future IJG releases as more is learned about DCT quantization.
  635. If the force_baseline parameter is TRUE, then the quantization table
  636. entries are constrained to the range 1..255 for full JPEG baseline
  637. compatibility. In the current implementation, this only makes a
  638. difference for quality settings below 25, and it effectively prevents
  639. very small/low quality files from being generated. The IJG decoder
  640. is capable of reading the non-baseline files generated at low quality
  641. settings when force_baseline is FALSE, but other decoders may not be.
  642. jpeg_set_linear_quality (j_compress_ptr cinfo, int scale_factor,
  643. boolean force_baseline)
  644. Same as jpeg_set_quality() except that the generated tables are the
  645. sample tables given in the JPEC spec section K.1, multiplied by the
  646. specified scale factor (which is expressed as a percentage; thus
  647. scale_factor = 100 reproduces the spec's tables). Note that larger
  648. scale factors give lower quality. This entry point is useful for
  649. conforming to the Adobe PostScript DCT conventions, but we do not
  650. recommend linear scaling as a user-visible quality scale otherwise.
  651. force_baseline again constrains the computed table entries to 1..255.
  652. int jpeg_quality_scaling (int quality)
  653. Converts a value on the IJG-recommended quality scale to a linear
  654. scaling percentage. Note that this routine may change or go away
  655. in future releases --- IJG may choose to adopt a scaling method that
  656. can't be expressed as a simple scalar multiplier, in which case the
  657. premise of this routine collapses. Caveat user.
  658. jpeg_default_qtables (j_compress_ptr cinfo, boolean force_baseline)
  659. Set default quantization tables with linear q_scale_factor[] values
  660. (see below).
  661. jpeg_add_quant_table (j_compress_ptr cinfo, int which_tbl,
  662. const unsigned int *basic_table,
  663. int scale_factor, boolean force_baseline)
  664. Allows an arbitrary quantization table to be created. which_tbl
  665. indicates which table slot to fill. basic_table points to an array
  666. of 64 unsigned ints given in normal array order. These values are
  667. multiplied by scale_factor/100 and then clamped to the range 1..65535
  668. (or to 1..255 if force_baseline is TRUE).
  669. CAUTION: prior to library version 6a, jpeg_add_quant_table expected
  670. the basic table to be given in JPEG zigzag order. If you need to
  671. write code that works with either older or newer versions of this
  672. routine, you must check the library version number. Something like
  673. "#if JPEG_LIB_VERSION >= 61" is the right test.
  674. jpeg_simple_progression (j_compress_ptr cinfo)
  675. Generates a default scan script for writing a progressive-JPEG file.
  676. This is the recommended method of creating a progressive file,
  677. unless you want to make a custom scan sequence. You must ensure that
  678. the JPEG color space is set correctly before calling this routine.
  679. Compression parameters (cinfo fields) include:
  680. int block_size
  681. Set DCT block size. All N from 1 to 16 are possible.
  682. Default is 8 (baseline format).
  683. Larger values produce higher compression,
  684. smaller values produce higher quality.
  685. An exact DCT stage is possible with 1 or 2.
  686. With the default quality of 75 and default Luminance qtable
  687. the DCT+Quantization stage is lossless for value 1.
  688. Note that values other than 8 require a SmartScale capable decoder,
  689. introduced with IJG JPEG 8. Setting the block_size parameter for
  690. compression works with version 8c and later.
  691. J_DCT_METHOD dct_method
  692. Selects the algorithm used for the DCT step. Choices are:
  693. JDCT_ISLOW: slow but accurate integer algorithm
  694. JDCT_IFAST: faster, less accurate integer method
  695. JDCT_FLOAT: floating-point method
  696. JDCT_DEFAULT: default method (normally JDCT_ISLOW)
  697. JDCT_FASTEST: fastest method (normally JDCT_IFAST)
  698. The FLOAT method is very slightly more accurate than the ISLOW method,
  699. but may give different results on different machines due to varying
  700. roundoff behavior. The integer methods should give the same results
  701. on all machines. On machines with sufficiently fast FP hardware, the
  702. floating-point method may also be the fastest. The IFAST method is
  703. considerably less accurate than the other two; its use is not
  704. recommended if high quality is a concern. JDCT_DEFAULT and
  705. JDCT_FASTEST are macros configurable by each installation.
  706. unsigned int scale_num, scale_denom
  707. Scale the image by the fraction scale_num/scale_denom. Default is
  708. 1/1, or no scaling. Currently, the supported scaling ratios are
  709. M/N with all N from 1 to 16, where M is the destination DCT size,
  710. which is 8 by default (see block_size parameter above).
  711. (The library design allows for arbitrary scaling ratios but this
  712. is not likely to be implemented any time soon.)
  713. J_COLOR_SPACE jpeg_color_space
  714. int num_components
  715. The JPEG color space and corresponding number of components; see
  716. "Special color spaces", below, for more info. We recommend using
  717. jpeg_set_color_space() if you want to change these.
  718. boolean optimize_coding
  719. TRUE causes the compressor to compute optimal Huffman coding tables
  720. for the image. This requires an extra pass over the data and
  721. therefore costs a good deal of space and time. The default is
  722. FALSE, which tells the compressor to use the supplied or default
  723. Huffman tables. In most cases optimal tables save only a few percent
  724. of file size compared to the default tables. Note that when this is
  725. TRUE, you need not supply Huffman tables at all, and any you do
  726. supply will be overwritten.
  727. unsigned int restart_interval
  728. int restart_in_rows
  729. To emit restart markers in the JPEG file, set one of these nonzero.
  730. Set restart_interval to specify the exact interval in MCU blocks.
  731. Set restart_in_rows to specify the interval in MCU rows. (If
  732. restart_in_rows is not 0, then restart_interval is set after the
  733. image width in MCUs is computed.) Defaults are zero (no restarts).
  734. One restart marker per MCU row is often a good choice.
  735. NOTE: the overhead of restart markers is higher in grayscale JPEG
  736. files than in color files, and MUCH higher in progressive JPEGs.
  737. If you use restarts, you may want to use larger intervals in those
  738. cases.
  739. const jpeg_scan_info * scan_info
  740. int num_scans
  741. By default, scan_info is NULL; this causes the compressor to write a
  742. single-scan sequential JPEG file. If not NULL, scan_info points to
  743. an array of scan definition records of length num_scans. The
  744. compressor will then write a JPEG file having one scan for each scan
  745. definition record. This is used to generate noninterleaved or
  746. progressive JPEG files. The library checks that the scan array
  747. defines a valid JPEG scan sequence. (jpeg_simple_progression creates
  748. a suitable scan definition array for progressive JPEG.) This is
  749. discussed further under "Progressive JPEG support".
  750. boolean do_fancy_downsampling
  751. If TRUE, use direct DCT scaling with DCT size > 8 for downsampling
  752. of chroma components.
  753. If FALSE, use only DCT size <= 8 and simple separate downsampling.
  754. Default is TRUE.
  755. For better image stability in multiple generation compression cycles
  756. it is preferable that this value matches the corresponding
  757. do_fancy_upsampling value in decompression.
  758. int smoothing_factor
  759. If non-zero, the input image is smoothed; the value should be 1 for
  760. minimal smoothing to 100 for maximum smoothing. Consult jcsample.c
  761. for details of the smoothing algorithm. The default is zero.
  762. boolean write_JFIF_header
  763. If TRUE, a JFIF APP0 marker is emitted. jpeg_set_defaults() and
  764. jpeg_set_colorspace() set this TRUE if a JFIF-legal JPEG color space
  765. (ie, YCbCr or grayscale) is selected, otherwise FALSE.
  766. UINT8 JFIF_major_version
  767. UINT8 JFIF_minor_version
  768. The version number to be written into the JFIF marker.
  769. jpeg_set_defaults() initializes the version to 1.01 (major=minor=1).
  770. You should set it to 1.02 (major=1, minor=2) if you plan to write
  771. any JFIF 1.02 extension markers.
  772. UINT8 density_unit
  773. UINT16 X_density
  774. UINT16 Y_density
  775. The resolution information to be written into the JFIF marker;
  776. not used otherwise. density_unit may be 0 for unknown,
  777. 1 for dots/inch, or 2 for dots/cm. The default values are 0,1,1
  778. indicating square pixels of unknown size.
  779. boolean write_Adobe_marker
  780. If TRUE, an Adobe APP14 marker is emitted. jpeg_set_defaults() and
  781. jpeg_set_colorspace() set this TRUE if JPEG color space RGB, CMYK,
  782. or YCCK is selected, otherwise FALSE. It is generally a bad idea
  783. to set both write_JFIF_header and write_Adobe_marker. In fact,
  784. you probably shouldn't change the default settings at all --- the
  785. default behavior ensures that the JPEG file's color space can be
  786. recognized by the decoder.
  787. JQUANT_TBL * quant_tbl_ptrs[NUM_QUANT_TBLS]
  788. Pointers to coefficient quantization tables, one per table slot,
  789. or NULL if no table is defined for a slot. Usually these should
  790. be set via one of the above helper routines; jpeg_add_quant_table()
  791. is general enough to define any quantization table. The other
  792. routines will set up table slot 0 for luminance quality and table
  793. slot 1 for chrominance.
  794. int q_scale_factor[NUM_QUANT_TBLS]
  795. Linear quantization scaling factors (percentage, initialized 100)
  796. for use with jpeg_default_qtables().
  797. See rdswitch.c and cjpeg.c for an example of usage.
  798. Note that the q_scale_factor[] fields are the "linear" scales, so you
  799. have to convert from user-defined ratings via jpeg_quality_scaling().
  800. Here is an example code which corresponds to cjpeg -quality 90,70:
  801. jpeg_set_defaults(cinfo);
  802. /* Set luminance quality 90. */
  803. cinfo->q_scale_factor[0] = jpeg_quality_scaling(90);
  804. /* Set chrominance quality 70. */
  805. cinfo->q_scale_factor[1] = jpeg_quality_scaling(70);
  806. jpeg_default_qtables(cinfo, force_baseline);
  807. CAUTION: You must also set 1x1 subsampling for efficient separate
  808. color quality selection, since the default value used by library
  809. is 2x2:
  810. cinfo->comp_info[0].v_samp_factor = 1;
  811. cinfo->comp_info[0].h_samp_factor = 1;
  812. JHUFF_TBL * dc_huff_tbl_ptrs[NUM_HUFF_TBLS]
  813. JHUFF_TBL * ac_huff_tbl_ptrs[NUM_HUFF_TBLS]
  814. Pointers to Huffman coding tables, one per table slot, or NULL if
  815. no table is defined for a slot. Slots 0 and 1 are filled with the
  816. JPEG sample tables by jpeg_set_defaults(). If you need to allocate
  817. more table structures, jpeg_alloc_huff_table() may be used.
  818. Note that optimal Huffman tables can be computed for an image
  819. by setting optimize_coding, as discussed above; there's seldom
  820. any need to mess with providing your own Huffman tables.
  821. The actual dimensions of the JPEG image that will be written to the file are
  822. given by the following fields. These are computed from the input image
  823. dimensions and the compression parameters by jpeg_start_compress(). You can
  824. also call jpeg_calc_jpeg_dimensions() to obtain the values that will result
  825. from the current parameter settings. This can be useful if you are trying
  826. to pick a scaling ratio that will get close to a desired target size.
  827. JDIMENSION jpeg_width Actual dimensions of output image.
  828. JDIMENSION jpeg_height
  829. Per-component parameters are stored in the struct cinfo.comp_info[i] for
  830. component number i. Note that components here refer to components of the
  831. JPEG color space, *not* the source image color space. A suitably large
  832. comp_info[] array is allocated by jpeg_set_defaults(); if you choose not
  833. to use that routine, it's up to you to allocate the array.
  834. int component_id
  835. The one-byte identifier code to be recorded in the JPEG file for
  836. this component. For the standard color spaces, we recommend you
  837. leave the default values alone.
  838. int h_samp_factor
  839. int v_samp_factor
  840. Horizontal and vertical sampling factors for the component; must
  841. be 1..4 according to the JPEG standard. Note that larger sampling
  842. factors indicate a higher-resolution component; many people find
  843. this behavior quite unintuitive. The default values are 2,2 for
  844. luminance components and 1,1 for chrominance components, except
  845. for grayscale where 1,1 is used.
  846. int quant_tbl_no
  847. Quantization table number for component. The default value is
  848. 0 for luminance components and 1 for chrominance components.
  849. int dc_tbl_no
  850. int ac_tbl_no
  851. DC and AC entropy coding table numbers. The default values are
  852. 0 for luminance components and 1 for chrominance components.
  853. int component_index
  854. Must equal the component's index in comp_info[]. (Beginning in
  855. release v6, the compressor library will fill this in automatically;
  856. you don't have to.)
  857. Decompression parameter selection
  858. ---------------------------------
  859. Decompression parameter selection is somewhat simpler than compression
  860. parameter selection, since all of the JPEG internal parameters are
  861. recorded in the source file and need not be supplied by the application.
  862. (Unless you are working with abbreviated files, in which case see
  863. "Abbreviated datastreams", below.) Decompression parameters control
  864. the postprocessing done on the image to deliver it in a format suitable
  865. for the application's use. Many of the parameters control speed/quality
  866. tradeoffs, in which faster decompression may be obtained at the price of
  867. a poorer-quality image. The defaults select the highest quality (slowest)
  868. processing.
  869. The following fields in the JPEG object are set by jpeg_read_header() and
  870. may be useful to the application in choosing decompression parameters:
  871. JDIMENSION image_width Width and height of image
  872. JDIMENSION image_height
  873. int num_components Number of color components
  874. J_COLOR_SPACE jpeg_color_space Colorspace of image
  875. boolean saw_JFIF_marker TRUE if a JFIF APP0 marker was seen
  876. UINT8 JFIF_major_version Version information from JFIF marker
  877. UINT8 JFIF_minor_version
  878. UINT8 density_unit Resolution data from JFIF marker
  879. UINT16 X_density
  880. UINT16 Y_density
  881. boolean saw_Adobe_marker TRUE if an Adobe APP14 marker was seen
  882. UINT8 Adobe_transform Color transform code from Adobe marker
  883. The JPEG color space, unfortunately, is something of a guess since the JPEG
  884. standard proper does not provide a way to record it. In practice most files
  885. adhere to the JFIF or Adobe conventions, and the decoder will recognize these
  886. correctly. See "Special color spaces", below, for more info.
  887. The decompression parameters that determine the basic properties of the
  888. returned image are:
  889. J_COLOR_SPACE out_color_space
  890. Output color space. jpeg_read_header() sets an appropriate default
  891. based on jpeg_color_space; typically it will be RGB or grayscale.
  892. The application can change this field to request output in a different
  893. colorspace. For example, set it to JCS_GRAYSCALE to get grayscale
  894. output from a color file. (This is useful for previewing: grayscale
  895. output is faster than full color since the color components need not
  896. be processed.) Note that not all possible color space transforms are
  897. currently implemented; you may need to extend jdcolor.c if you want an
  898. unusual conversion.
  899. unsigned int scale_num, scale_denom
  900. Scale the image by the fraction scale_num/scale_denom. Currently,
  901. the supported scaling ratios are M/N with all M from 1 to 16, where
  902. N is the source DCT size, which is 8 for baseline JPEG. (The library
  903. design allows for arbitrary scaling ratios but this is not likely
  904. to be implemented any time soon.) The values are initialized by
  905. jpeg_read_header() with the source DCT size. For baseline JPEG
  906. this is 8/8. If you change only the scale_num value while leaving
  907. the other unchanged, then this specifies the DCT scaled size to be
  908. applied on the given input. For baseline JPEG this is equivalent
  909. to M/8 scaling, since the source DCT size for baseline JPEG is 8.
  910. Smaller scaling ratios permit significantly faster decoding since
  911. fewer pixels need be processed and a simpler IDCT method can be used.
  912. boolean quantize_colors
  913. If set TRUE, colormapped output will be delivered. Default is FALSE,
  914. meaning that full-color output will be delivered.
  915. The next three parameters are relevant only if quantize_colors is TRUE.
  916. int desired_number_of_colors
  917. Maximum number of colors to use in generating a library-supplied color
  918. map (the actual number of colors is returned in a different field).
  919. Default 256. Ignored when the application supplies its own color map.
  920. boolean two_pass_quantize
  921. If TRUE, an extra pass over the image is made to select a custom color
  922. map for the image. This usually looks a lot better than the one-size-
  923. fits-all colormap that is used otherwise. Default is TRUE. Ignored
  924. when the application supplies its own color map.
  925. J_DITHER_MODE dither_mode
  926. Selects color dithering method. Supported values are:
  927. JDITHER_NONE no dithering: fast, very low quality
  928. JDITHER_ORDERED ordered dither: moderate speed and quality
  929. JDITHER_FS Floyd-Steinberg dither: slow, high quality
  930. Default is JDITHER_FS. (At present, ordered dither is implemented
  931. only in the single-pass, standard-colormap case. If you ask for
  932. ordered dither when two_pass_quantize is TRUE or when you supply
  933. an external color map, you'll get F-S dithering.)
  934. When quantize_colors is TRUE, the target color map is described by the next
  935. two fields. colormap is set to NULL by jpeg_read_header(). The application
  936. can supply a color map by setting colormap non-NULL and setting
  937. actual_number_of_colors to the map size. Otherwise, jpeg_start_decompress()
  938. selects a suitable color map and sets these two fields itself.
  939. [Implementation restriction: at present, an externally supplied colormap is
  940. only accepted for 3-component output color spaces.]
  941. JSAMPARRAY colormap
  942. The color map, represented as a 2-D pixel array of out_color_components
  943. rows and actual_number_of_colors columns. Ignored if not quantizing.
  944. CAUTION: if the JPEG library creates its own colormap, the storage
  945. pointed to by this field is released by jpeg_finish_decompress().
  946. Copy the colormap somewhere else first, if you want to save it.
  947. int actual_number_of_colors
  948. The number of colors in the color map.
  949. Additional decompression parameters that the application may set include:
  950. J_DCT_METHOD dct_method
  951. Selects the algorithm used for the DCT step. Choices are the same
  952. as described above for compression.
  953. boolean do_fancy_upsampling
  954. If TRUE, use direct DCT scaling with DCT size > 8 for upsampling
  955. of chroma components.
  956. If FALSE, use only DCT size <= 8 and simple separate upsampling.
  957. Default is TRUE.
  958. For better image stability in multiple generation compression cycles
  959. it is preferable that this value matches the corresponding
  960. do_fancy_downsampling value in compression.
  961. boolean do_block_smoothing
  962. If TRUE, interblock smoothing is applied in early stages of decoding
  963. progressive JPEG files; if FALSE, not. Default is TRUE. Early
  964. progression stages look "fuzzy" with smoothing, "blocky" without.
  965. In any case, block smoothing ceases to be applied after the first few
  966. AC coefficients are known to full accuracy, so it is relevant only
  967. when using buffered-image mode for progressive images.
  968. boolean enable_1pass_quant
  969. boolean enable_external_quant
  970. boolean enable_2pass_quant
  971. These are significant only in buffered-image mode, which is
  972. described in its own section below.
  973. The output image dimensions are given by the following fields. These are
  974. computed from the source image dimensions and the decompression parameters
  975. by jpeg_start_decompress(). You can also call jpeg_calc_output_dimensions()
  976. to obtain the values that will result from the current parameter settings.
  977. This can be useful if you are trying to pick a scaling ratio that will get
  978. close to a desired target size. It's also important if you are using the
  979. JPEG library's memory manager to allocate output buffer space, because you
  980. are supposed to request such buffers *before* jpeg_start_decompress().
  981. JDIMENSION output_width Actual dimensions of output image.
  982. JDIMENSION output_height
  983. int out_color_components Number of color components in out_color_space.
  984. int output_components Number of color components returned.
  985. int rec_outbuf_height Recommended height of scanline buffer.
  986. When quantizing colors, output_components is 1, indicating a single color map
  987. index per pixel. Otherwise it equals out_color_components. The output arrays
  988. are required to be output_width * output_components JSAMPLEs wide.
  989. rec_outbuf_height is the recommended minimum height (in scanlines) of the
  990. buffer passed to jpeg_read_scanlines(). If the buffer is smaller, the
  991. library will still work, but time will be wasted due to unnecessary data
  992. copying. In high-quality modes, rec_outbuf_height is always 1, but some
  993. faster, lower-quality modes set it to larger values (typically 2 to 4).
  994. If you are going to ask for a high-speed processing mode, you may as well
  995. go to the trouble of honoring rec_outbuf_height so as to avoid data copying.
  996. (An output buffer larger than rec_outbuf_height lines is OK, but won't
  997. provide any material speed improvement over that height.)
  998. Special color spaces
  999. --------------------
  1000. The JPEG standard itself is "color blind" and doesn't specify any particular
  1001. color space. It is customary to convert color data to a luminance/chrominance
  1002. color space before compressing, since this permits greater compression. The
  1003. existing de-facto JPEG file format standards specify YCbCr or grayscale data
  1004. (JFIF), or grayscale, RGB, YCbCr, CMYK, or YCCK (Adobe). For special
  1005. applications such as multispectral images, other color spaces can be used,
  1006. but it must be understood that such files will be unportable.
  1007. The JPEG library can handle the most common colorspace conversions (namely
  1008. RGB <=> YCbCr and CMYK <=> YCCK). It can also deal with data of an unknown
  1009. color space, passing it through without conversion. If you deal extensively
  1010. with an unusual color space, you can easily extend the library to understand
  1011. additional color spaces and perform appropriate conversions.
  1012. For compression, the source data's color space is specified by field
  1013. in_color_space. This is transformed to the JPEG file's color space given
  1014. by jpeg_color_space. jpeg_set_defaults() chooses a reasonable JPEG color
  1015. space depending on in_color_space, but you can override this by calling
  1016. jpeg_set_colorspace(). Of course you must select a supported transformation.
  1017. jccolor.c currently supports the following transformations:
  1018. RGB => YCbCr
  1019. RGB => GRAYSCALE
  1020. YCbCr => GRAYSCALE
  1021. CMYK => YCCK
  1022. plus the null transforms: GRAYSCALE => GRAYSCALE, RGB => RGB,
  1023. YCbCr => YCbCr, CMYK => CMYK, YCCK => YCCK, and UNKNOWN => UNKNOWN.
  1024. The de-facto file format standards (JFIF and Adobe) specify APPn markers that
  1025. indicate the color space of the JPEG file. It is important to ensure that
  1026. these are written correctly, or omitted if the JPEG file's color space is not
  1027. one of the ones supported by the de-facto standards. jpeg_set_colorspace()
  1028. will set the compression parameters to include or omit the APPn markers
  1029. properly, so long as it is told the truth about the JPEG color space.
  1030. For example, if you are writing some random 3-component color space without
  1031. conversion, don't try to fake out the library by setting in_color_space and
  1032. jpeg_color_space to JCS_YCbCr; use JCS_UNKNOWN. You may want to write an
  1033. APPn marker of your own devising to identify the colorspace --- see "Special
  1034. markers", below.
  1035. When told that the color space is UNKNOWN, the library will default to using
  1036. luminance-quality compression parameters for all color components. You may
  1037. well want to change these parameters. See the source code for
  1038. jpeg_set_colorspace(), in jcparam.c, for details.
  1039. For decompression, the JPEG file's color space is given in jpeg_color_space,
  1040. and this is transformed to the output color space out_color_space.
  1041. jpeg_read_header's setting of jpeg_color_space can be relied on if the file
  1042. conforms to JFIF or Adobe conventions, but otherwise it is no better than a
  1043. guess. If you know the JPEG file's color space for certain, you can override
  1044. jpeg_read_header's guess by setting jpeg_color_space. jpeg_read_header also
  1045. selects a default output color space based on (its guess of) jpeg_color_space;
  1046. set out_color_space to override this. Again, you must select a supported
  1047. transformation. jdcolor.c currently supports
  1048. YCbCr => RGB
  1049. YCbCr => GRAYSCALE
  1050. RGB => GRAYSCALE
  1051. GRAYSCALE => RGB
  1052. YCCK => CMYK
  1053. as well as the null transforms. (Since GRAYSCALE=>RGB is provided, an
  1054. application can force grayscale JPEGs to look like color JPEGs if it only
  1055. wants to handle one case.)
  1056. The two-pass color quantizer, jquant2.c, is specialized to handle RGB data
  1057. (it weights distances appropriately for RGB colors). You'll need to modify
  1058. the code if you want to use it for non-RGB output color spaces. Note that
  1059. jquant2.c is used to map to an application-supplied colormap as well as for
  1060. the normal two-pass colormap selection process.
  1061. CAUTION: it appears that Adobe Photoshop writes inverted data in CMYK JPEG
  1062. files: 0 represents 100% ink coverage, rather than 0% ink as you'd expect.
  1063. This is arguably a bug in Photoshop, but if you need to work with Photoshop
  1064. CMYK files, you will have to deal with it in your application. We cannot
  1065. "fix" this in the library by inverting the data during the CMYK<=>YCCK
  1066. transform, because that would break other applications, notably Ghostscript.
  1067. Photoshop versions prior to 3.0 write EPS files containing JPEG-encoded CMYK
  1068. data in the same inverted-YCCK representation used in bare JPEG files, but
  1069. the surrounding PostScript code performs an inversion using the PS image
  1070. operator. I am told that Photoshop 3.0 will write uninverted YCCK in
  1071. EPS/JPEG files, and will omit the PS-level inversion. (But the data
  1072. polarity used in bare JPEG files will not change in 3.0.) In either case,
  1073. the JPEG library must not invert the data itself, or else Ghostscript would
  1074. read these EPS files incorrectly.
  1075. Error handling
  1076. --------------
  1077. When the default error handler is used, any error detected inside the JPEG
  1078. routines will cause a message to be printed on stderr, followed by exit().
  1079. You can supply your own error handling routines to override this behavior
  1080. and to control the treatment of nonfatal warnings and trace/debug messages.
  1081. The file example.c illustrates the most common case, which is to have the
  1082. application regain control after an error rather than exiting.
  1083. The JPEG library never writes any message directly; it always goes through
  1084. the error handling routines. Three classes of messages are recognized:
  1085. * Fatal errors: the library cannot continue.
  1086. * Warnings: the library can continue, but the data is corrupt, and a
  1087. damaged output image is likely to result.
  1088. * Trace/informational messages. These come with a trace level indicating
  1089. the importance of the message; you can control the verbosity of the
  1090. program by adjusting the maximum trace level that will be displayed.
  1091. You may, if you wish, simply replace the entire JPEG error handling module
  1092. (jerror.c) with your own code. However, you can avoid code duplication by
  1093. only replacing some of the routines depending on the behavior you need.
  1094. This is accomplished by calling jpeg_std_error() as usual, but then overriding
  1095. some of the method pointers in the jpeg_error_mgr struct, as illustrated by
  1096. example.c.
  1097. All of the error handling routines will receive a pointer to the JPEG object
  1098. (a j_common_ptr which points to either a jpeg_compress_struct or a
  1099. jpeg_decompress_struct; if you need to tell which, test the is_decompressor
  1100. field). This struct includes a pointer to the error manager struct in its
  1101. "err" field. Frequently, custom error handler routines will need to access
  1102. additional data which is not known to the JPEG library or the standard error
  1103. handler. The most convenient way to do this is to embed either the JPEG
  1104. object or the jpeg_error_mgr struct in a larger structure that contains
  1105. additional fields; then casting the passed pointer provides access to the
  1106. additional fields. Again, see example.c for one way to do it. (Beginning
  1107. with IJG version 6b, there is also a void pointer "client_data" in each
  1108. JPEG object, which the application can also use to find related data.
  1109. The library does not touch client_data at all.)
  1110. The individual methods that you might wish to override are:
  1111. error_exit (j_common_ptr cinfo)
  1112. Receives control for a fatal error. Information sufficient to
  1113. generate the error message has been stored in cinfo->err; call
  1114. output_message to display it. Control must NOT return to the caller;
  1115. generally this routine will exit() or longjmp() somewhere.
  1116. Typically you would override this routine to get rid of the exit()
  1117. default behavior. Note that if you continue processing, you should
  1118. clean up the JPEG object with jpeg_abort() or jpeg_destroy().
  1119. output_message (j_common_ptr cinfo)
  1120. Actual output of any JPEG message. Override this to send messages
  1121. somewhere other than stderr. Note that this method does not know
  1122. how to generate a message, only where to send it.
  1123. format_message (j_common_ptr cinfo, char * buffer)
  1124. Constructs a readable error message string based on the error info
  1125. stored in cinfo->err. This method is called by output_message. Few
  1126. applications should need to override this method. One possible
  1127. reason for doing so is to implement dynamic switching of error message
  1128. language.
  1129. emit_message (j_common_ptr cinfo, int msg_level)
  1130. Decide whether or not to emit a warning or trace message; if so,
  1131. calls output_message. The main reason for overriding this method
  1132. would be to abort on warnings. msg_level is -1 for warnings,
  1133. 0 and up for trace messages.
  1134. Only error_exit() and emit_message() are called from the rest of the JPEG
  1135. library; the other two are internal to the error handler.
  1136. The actual message texts are stored in an array of strings which is pointed to
  1137. by the field err->jpeg_message_table. The messages are numbered from 0 to
  1138. err->last_jpeg_message, and it is these code numbers that are used in the
  1139. JPEG library code. You could replace the message texts (for instance, with
  1140. messages in French or German) by changing the message table pointer. See
  1141. jerror.h for the default texts. CAUTION: this table will almost certainly
  1142. change or grow from one library version to the next.
  1143. It may be useful for an application to add its own message texts that are
  1144. handled by the same mechanism. The error handler supports a second "add-on"
  1145. message table for this purpose. To define an addon table, set the pointer
  1146. err->addon_message_table and the message numbers err->first_addon_message and
  1147. err->last_addon_message. If you number the addon messages beginning at 1000
  1148. or so, you won't have to worry about conflicts with the library's built-in
  1149. messages. See the sample applications cjpeg/djpeg for an example of using
  1150. addon messages (the addon messages are defined in cderror.h).
  1151. Actual invocation of the error handler is done via macros defined in jerror.h:
  1152. ERREXITn(...) for fatal errors
  1153. WARNMSn(...) for corrupt-data warnings
  1154. TRACEMSn(...) for trace and informational messages.
  1155. These macros store the message code and any additional parameters into the
  1156. error handler struct, then invoke the error_exit() or emit_message() method.
  1157. The variants of each macro are for varying numbers of additional parameters.
  1158. The additional parameters are inserted into the generated message using
  1159. standard printf() format codes.
  1160. See jerror.h and jerror.c for further details.
  1161. Compressed data handling (source and destination managers)
  1162. ----------------------------------------------------------
  1163. The JPEG compression library sends its compressed data to a "destination
  1164. manager" module. The default destination manager just writes the data to a
  1165. memory buffer or to a stdio stream, but you can provide your own manager to
  1166. do something else. Similarly, the decompression library calls a "source
  1167. manager" to obtain the compressed data; you can provide your own source
  1168. manager if you want the data to come from somewhere other than a memory
  1169. buffer or a stdio stream.
  1170. In both cases, compressed data is processed a bufferload at a time: the
  1171. destination or source manager provides a work buffer, and the library invokes
  1172. the manager only when the buffer is filled or emptied. (You could define a
  1173. one-character buffer to force the manager to be invoked for each byte, but
  1174. that would be rather inefficient.) The buffer's size and location are
  1175. controlled by the manager, not by the library. For example, the memory
  1176. source manager just makes the buffer pointer and length point to the original
  1177. data in memory. In this case the buffer-reload procedure will be invoked
  1178. only if the decompressor ran off the end of the datastream, which would
  1179. indicate an erroneous datastream.
  1180. The work buffer is defined as an array of datatype JOCTET, which is generally
  1181. "char" or "unsigned char". On a machine where char is not exactly 8 bits
  1182. wide, you must define JOCTET as a wider data type and then modify the data
  1183. source and destination modules to transcribe the work arrays into 8-bit units
  1184. on external storage.
  1185. A data destination manager struct contains a pointer and count defining the
  1186. next byte to write in the work buffer and the remaining free space:
  1187. JOCTET * next_output_byte; /* => next byte to write in buffer */
  1188. size_t free_in_buffer; /* # of byte spaces remaining in buffer */
  1189. The library increments the pointer and decrements the count until the buffer
  1190. is filled. The manager's empty_output_buffer method must reset the pointer
  1191. and count. The manager is expected to remember the buffer's starting address
  1192. and total size in private fields not visible to the library.
  1193. A data destination manager provides three methods:
  1194. init_destination (j_compress_ptr cinfo)
  1195. Initialize destination. This is called by jpeg_start_compress()
  1196. before any data is actually written. It must initialize
  1197. next_output_byte and free_in_buffer. free_in_buffer must be
  1198. initialized to a positive value.
  1199. empty_output_buffer (j_compress_ptr cinfo)
  1200. This is called whenever the buffer has filled (free_in_buffer
  1201. reaches zero). In typical applications, it should write out the
  1202. *entire* buffer (use the saved start address and buffer length;
  1203. ignore the current state of next_output_byte and free_in_buffer).
  1204. Then reset the pointer & count to the start of the buffer, and
  1205. return TRUE indicating that the buffer has been dumped.
  1206. free_in_buffer must be set to a positive value when TRUE is
  1207. returned. A FALSE return should only be used when I/O suspension is
  1208. desired (this operating mode is discussed in the next section).
  1209. term_destination (j_compress_ptr cinfo)
  1210. Terminate destination --- called by jpeg_finish_compress() after all
  1211. data has been written. In most applications, this must flush any
  1212. data remaining in the buffer. Use either next_output_byte or
  1213. free_in_buffer to determine how much data is in the buffer.
  1214. term_destination() is NOT called by jpeg_abort() or jpeg_destroy(). If you
  1215. want the destination manager to be cleaned up during an abort, you must do it
  1216. yourself.
  1217. You will also need code to create a jpeg_destination_mgr struct, fill in its
  1218. method pointers, and insert a pointer to the struct into the "dest" field of
  1219. the JPEG compression object. This can be done in-line in your setup code if
  1220. you like, but it's probably cleaner to provide a separate routine similar to
  1221. the jpeg_stdio_dest() or jpeg_mem_dest() routines of the supplied destination
  1222. managers.
  1223. Decompression source managers follow a parallel design, but with some
  1224. additional frammishes. The source manager struct contains a pointer and count
  1225. defining the next byte to read from the work buffer and the number of bytes
  1226. remaining:
  1227. const JOCTET * next_input_byte; /* => next byte to read from buffer */
  1228. size_t bytes_in_buffer; /* # of bytes remaining in buffer */
  1229. The library increments the pointer and decrements the count until the buffer
  1230. is emptied. The manager's fill_input_buffer method must reset the pointer and
  1231. count. In most applications, the manager must remember the buffer's starting
  1232. address and total size in private fields not visible to the library.
  1233. A data source manager provides five methods:
  1234. init_source (j_decompress_ptr cinfo)
  1235. Initialize source. This is called by jpeg_read_header() before any
  1236. data is actually read. Unlike init_destination(), it may leave
  1237. bytes_in_buffer set to 0 (in which case a fill_input_buffer() call
  1238. will occur immediately).
  1239. fill_input_buffer (j_decompress_ptr cinfo)
  1240. This is called whenever bytes_in_buffer has reached zero and more
  1241. data is wanted. In typical applications, it should read fresh data
  1242. into the buffer (ignoring the current state of next_input_byte and
  1243. bytes_in_buffer), reset the pointer & count to the start of the
  1244. buffer, and return TRUE indicating that the buffer has been reloaded.
  1245. It is not necessary to fill the buffer entirely, only to obtain at
  1246. least one more byte. bytes_in_buffer MUST be set to a positive value
  1247. if TRUE is returned. A FALSE return should only be used when I/O
  1248. suspension is desired (this mode is discussed in the next section).
  1249. skip_input_data (j_decompress_ptr cinfo, long num_bytes)
  1250. Skip num_bytes worth of data. The buffer pointer and count should
  1251. be advanced over num_bytes input bytes, refilling the buffer as
  1252. needed. This is used to skip over a potentially large amount of
  1253. uninteresting data (such as an APPn marker). In some applications
  1254. it may be possible to optimize away the reading of the skipped data,
  1255. but it's not clear that being smart is worth much trouble; large
  1256. skips are uncommon. bytes_in_buffer may be zero on return.
  1257. A zero or negative skip count should be treated as a no-op.
  1258. resync_to_restart (j_decompress_ptr cinfo, int desired)
  1259. This routine is called only when the decompressor has failed to find
  1260. a restart (RSTn) marker where one is expected. Its mission is to
  1261. find a suitable point for resuming decompression. For most
  1262. applications, we recommend that you just use the default resync
  1263. procedure, jpeg_resync_to_restart(). However, if you are able to back
  1264. up in the input data stream, or if you have a-priori knowledge about
  1265. the likely location of restart markers, you may be able to do better.
  1266. Read the read_restart_marker() and jpeg_resync_to_restart() routines
  1267. in jdmarker.c if you think you'd like to implement your own resync
  1268. procedure.
  1269. term_source (j_decompress_ptr cinfo)
  1270. Terminate source --- called by jpeg_finish_decompress() after all
  1271. data has been read. Often a no-op.
  1272. For both fill_input_buffer() and skip_input_data(), there is no such thing
  1273. as an EOF return. If the end of the file has been reached, the routine has
  1274. a choice of exiting via ERREXIT() or inserting fake data into the buffer.
  1275. In most cases, generating a warning message and inserting a fake EOI marker
  1276. is the best course of action --- this will allow the decompressor to output
  1277. however much of the image is there. In pathological cases, the decompressor
  1278. may swallow the EOI and again demand data ... just keep feeding it fake EOIs.
  1279. jdatasrc.c illustrates the recommended error recovery behavior.
  1280. term_source() is NOT called by jpeg_abort() or jpeg_destroy(). If you want
  1281. the source manager to be cleaned up during an abort, you must do it yourself.
  1282. You will also need code to create a jpeg_source_mgr struct, fill in its method
  1283. pointers, and insert a pointer to the struct into the "src" field of the JPEG
  1284. decompression object. This can be done in-line in your setup code if you
  1285. like, but it's probably cleaner to provide a separate routine similar to the
  1286. jpeg_stdio_src() or jpeg_mem_src() routines of the supplied source managers.
  1287. For more information, consult the memory and stdio source and destination
  1288. managers in jdatasrc.c and jdatadst.c.
  1289. I/O suspension
  1290. --------------
  1291. Some applications need to use the JPEG library as an incremental memory-to-
  1292. memory filter: when the compressed data buffer is filled or emptied, they want
  1293. control to return to the outer loop, rather than expecting that the buffer can
  1294. be emptied or reloaded within the data source/destination manager subroutine.
  1295. The library supports this need by providing an "I/O suspension" mode, which we
  1296. describe in this section.
  1297. The I/O suspension mode is not a panacea: nothing is guaranteed about the
  1298. maximum amount of time spent in any one call to the library, so it will not
  1299. eliminate response-time problems in single-threaded applications. If you
  1300. need guaranteed response time, we suggest you "bite the bullet" and implement
  1301. a real multi-tasking capability.
  1302. To use I/O suspension, cooperation is needed between the calling application
  1303. and the data source or destination manager; you will always need a custom
  1304. source/destination manager. (Please read the previous section if you haven't
  1305. already.) The basic idea is that the empty_output_buffer() or
  1306. fill_input_buffer() routine is a no-op, merely returning FALSE to indicate
  1307. that it has done nothing. Upon seeing this, the JPEG library suspends
  1308. operation and returns to its caller. The surrounding application is
  1309. responsible for emptying or refilling the work buffer before calling the
  1310. JPEG library again.
  1311. Compression suspension:
  1312. For compression suspension, use an empty_output_buffer() routine that returns
  1313. FALSE; typically it will not do anything else. This will cause the
  1314. compressor to return to the caller of jpeg_write_scanlines(), with the return
  1315. value indicating that not all the supplied scanlines have been accepted.
  1316. The application must make more room in the output buffer, adjust the output
  1317. buffer pointer/count appropriately, and then call jpeg_write_scanlines()
  1318. again, pointing to the first unconsumed scanline.
  1319. When forced to suspend, the compressor will backtrack to a convenient stopping
  1320. point (usually the start of the current MCU); it will regenerate some output
  1321. data when restarted. Therefore, although empty_output_buffer() is only
  1322. called when the buffer is filled, you should NOT write out the entire buffer
  1323. after a suspension. Write only the data up to the current position of
  1324. next_output_byte/free_in_buffer. The data beyond that point will be
  1325. regenerated after resumption.
  1326. Because of the backtracking behavior, a good-size output buffer is essential
  1327. for efficiency; you don't want the compressor to suspend often. (In fact, an
  1328. overly small buffer could lead to infinite looping, if a single MCU required
  1329. more data than would fit in the buffer.) We recommend a buffer of at least
  1330. several Kbytes. You may want to insert explicit code to ensure that you don't
  1331. call jpeg_write_scanlines() unless there is a reasonable amount of space in
  1332. the output buffer; in other words, flush the buffer before trying to compress
  1333. more data.
  1334. The compressor does not allow suspension while it is trying to write JPEG
  1335. markers at the beginning and end of the file. This means that:
  1336. * At the beginning of a compression operation, there must be enough free
  1337. space in the output buffer to hold the header markers (typically 600 or
  1338. so bytes). The recommended buffer size is bigger than this anyway, so
  1339. this is not a problem as long as you start with an empty buffer. However,
  1340. this restriction might catch you if you insert large special markers, such
  1341. as a JFIF thumbnail image, without flushing the buffer afterwards.
  1342. * When you call jpeg_finish_compress(), there must be enough space in the
  1343. output buffer to emit any buffered data and the final EOI marker. In the
  1344. current implementation, half a dozen bytes should suffice for this, but
  1345. for safety's sake we recommend ensuring that at least 100 bytes are free
  1346. before calling jpeg_finish_compress().
  1347. A more significant restriction is that jpeg_finish_compress() cannot suspend.
  1348. This means you cannot use suspension with multi-pass operating modes, namely
  1349. Huffman code optimization and multiple-scan output. Those modes write the
  1350. whole file during jpeg_finish_compress(), which will certainly result in
  1351. buffer overrun. (Note that this restriction applies only to compression,
  1352. not decompression. The decompressor supports input suspension in all of its
  1353. operating modes.)
  1354. Decompression suspension:
  1355. For decompression suspension, use a fill_input_buffer() routine that simply
  1356. returns FALSE (except perhaps during error recovery, as discussed below).
  1357. This will cause the decompressor to return to its caller with an indication
  1358. that suspension has occurred. This can happen at four places:
  1359. * jpeg_read_header(): will return JPEG_SUSPENDED.
  1360. * jpeg_start_decompress(): will return FALSE, rather than its usual TRUE.
  1361. * jpeg_read_scanlines(): will return the number of scanlines already
  1362. completed (possibly 0).
  1363. * jpeg_finish_decompress(): will return FALSE, rather than its usual TRUE.
  1364. The surrounding application must recognize these cases, load more data into
  1365. the input buffer, and repeat the call. In the case of jpeg_read_scanlines(),
  1366. increment the passed pointers past any scanlines successfully read.
  1367. Just as with compression, the decompressor will typically backtrack to a
  1368. convenient restart point before suspending. When fill_input_buffer() is
  1369. called, next_input_byte/bytes_in_buffer point to the current restart point,
  1370. which is where the decompressor will backtrack to if FALSE is returned.
  1371. The data beyond that position must NOT be discarded if you suspend; it needs
  1372. to be re-read upon resumption. In most implementations, you'll need to shift
  1373. this data down to the start of your work buffer and then load more data after
  1374. it. Again, this behavior means that a several-Kbyte work buffer is essential
  1375. for decent performance; furthermore, you should load a reasonable amount of
  1376. new data before resuming decompression. (If you loaded, say, only one new
  1377. byte each time around, you could waste a LOT of cycles.)
  1378. The skip_input_data() source manager routine requires special care in a
  1379. suspension scenario. This routine is NOT granted the ability to suspend the
  1380. decompressor; it can decrement bytes_in_buffer to zero, but no more. If the
  1381. requested skip distance exceeds the amount of data currently in the input
  1382. buffer, then skip_input_data() must set bytes_in_buffer to zero and record the
  1383. additional skip distance somewhere else. The decompressor will immediately
  1384. call fill_input_buffer(), which should return FALSE, which will cause a
  1385. suspension return. The surrounding application must then arrange to discard
  1386. the recorded number of bytes before it resumes loading the input buffer.
  1387. (Yes, this design is rather baroque, but it avoids complexity in the far more
  1388. common case where a non-suspending source manager is used.)
  1389. If the input data has been exhausted, we recommend that you emit a warning
  1390. and insert dummy EOI markers just as a non-suspending data source manager
  1391. would do. This can be handled either in the surrounding application logic or
  1392. within fill_input_buffer(); the latter is probably more efficient. If
  1393. fill_input_buffer() knows that no more data is available, it can set the
  1394. pointer/count to point to a dummy EOI marker and then return TRUE just as
  1395. though it had read more data in a non-suspending situation.
  1396. The decompressor does not attempt to suspend within standard JPEG markers;
  1397. instead it will backtrack to the start of the marker and reprocess the whole
  1398. marker next time. Hence the input buffer must be large enough to hold the
  1399. longest standard marker in the file. Standard JPEG markers should normally
  1400. not exceed a few hundred bytes each (DHT tables are typically the longest).
  1401. We recommend at least a 2K buffer for performance reasons, which is much
  1402. larger than any correct marker is likely to be. For robustness against
  1403. damaged marker length counts, you may wish to insert a test in your
  1404. application for the case that the input buffer is completely full and yet
  1405. the decoder has suspended without consuming any data --- otherwise, if this
  1406. situation did occur, it would lead to an endless loop. (The library can't
  1407. provide this test since it has no idea whether "the buffer is full", or
  1408. even whether there is a fixed-size input buffer.)
  1409. The input buffer would need to be 64K to allow for arbitrary COM or APPn
  1410. markers, but these are handled specially: they are either saved into allocated
  1411. memory, or skipped over by calling skip_input_data(). In the former case,
  1412. suspension is handled correctly, and in the latter case, the problem of
  1413. buffer overrun is placed on skip_input_data's shoulders, as explained above.
  1414. Note that if you provide your own marker handling routine for large markers,
  1415. you should consider how to deal with buffer overflow.
  1416. Multiple-buffer management:
  1417. In some applications it is desirable to store the compressed data in a linked
  1418. list of buffer areas, so as to avoid data copying. This can be handled by
  1419. having empty_output_buffer() or fill_input_buffer() set the pointer and count
  1420. to reference the next available buffer; FALSE is returned only if no more
  1421. buffers are available. Although seemingly straightforward, there is a
  1422. pitfall in this approach: the backtrack that occurs when FALSE is returned
  1423. could back up into an earlier buffer. For example, when fill_input_buffer()
  1424. is called, the current pointer & count indicate the backtrack restart point.
  1425. Since fill_input_buffer() will set the pointer and count to refer to a new
  1426. buffer, the restart position must be saved somewhere else. Suppose a second
  1427. call to fill_input_buffer() occurs in the same library call, and no
  1428. additional input data is available, so fill_input_buffer must return FALSE.
  1429. If the JPEG library has not moved the pointer/count forward in the current
  1430. buffer, then *the correct restart point is the saved position in the prior
  1431. buffer*. Prior buffers may be discarded only after the library establishes
  1432. a restart point within a later buffer. Similar remarks apply for output into
  1433. a chain of buffers.
  1434. The library will never attempt to backtrack over a skip_input_data() call,
  1435. so any skipped data can be permanently discarded. You still have to deal
  1436. with the case of skipping not-yet-received data, however.
  1437. It's much simpler to use only a single buffer; when fill_input_buffer() is
  1438. called, move any unconsumed data (beyond the current pointer/count) down to
  1439. the beginning of this buffer and then load new data into the remaining buffer
  1440. space. This approach requires a little more data copying but is far easier
  1441. to get right.
  1442. Progressive JPEG support
  1443. ------------------------
  1444. Progressive JPEG rearranges the stored data into a series of scans of
  1445. increasing quality. In situations where a JPEG file is transmitted across a
  1446. slow communications link, a decoder can generate a low-quality image very
  1447. quickly from the first scan, then gradually improve the displayed quality as
  1448. more scans are received. The final image after all scans are complete is
  1449. identical to that of a regular (sequential) JPEG file of the same quality
  1450. setting. Progressive JPEG files are often slightly smaller than equivalent
  1451. sequential JPEG files, but the possibility of incremental display is the main
  1452. reason for using progressive JPEG.
  1453. The IJG encoder library generates progressive JPEG files when given a
  1454. suitable "scan script" defining how to divide the data into scans.
  1455. Creation of progressive JPEG files is otherwise transparent to the encoder.
  1456. Progressive JPEG files can also be read transparently by the decoder library.
  1457. If the decoding application simply uses the library as defined above, it
  1458. will receive a final decoded image without any indication that the file was
  1459. progressive. Of course, this approach does not allow incremental display.
  1460. To perform incremental display, an application needs to use the decoder
  1461. library's "buffered-image" mode, in which it receives a decoded image
  1462. multiple times.
  1463. Each displayed scan requires about as much work to decode as a full JPEG
  1464. image of the same size, so the decoder must be fairly fast in relation to the
  1465. data transmission rate in order to make incremental display useful. However,
  1466. it is possible to skip displaying the image and simply add the incoming bits
  1467. to the decoder's coefficient buffer. This is fast because only Huffman
  1468. decoding need be done, not IDCT, upsampling, colorspace conversion, etc.
  1469. The IJG decoder library allows the application to switch dynamically between
  1470. displaying the image and simply absorbing the incoming bits. A properly
  1471. coded application can automatically adapt the number of display passes to
  1472. suit the time available as the image is received. Also, a final
  1473. higher-quality display cycle can be performed from the buffered data after
  1474. the end of the file is reached.
  1475. Progressive compression:
  1476. To create a progressive JPEG file (or a multiple-scan sequential JPEG file),
  1477. set the scan_info cinfo field to point to an array of scan descriptors, and
  1478. perform compression as usual. Instead of constructing your own scan list,
  1479. you can call the jpeg_simple_progression() helper routine to create a
  1480. recommended progression sequence; this method should be used by all
  1481. applications that don't want to get involved in the nitty-gritty of
  1482. progressive scan sequence design. (If you want to provide user control of
  1483. scan sequences, you may wish to borrow the scan script reading code found
  1484. in rdswitch.c, so that you can read scan script files just like cjpeg's.)
  1485. When scan_info is not NULL, the compression library will store DCT'd data
  1486. into a buffer array as jpeg_write_scanlines() is called, and will emit all
  1487. the requested scans during jpeg_finish_compress(). This implies that
  1488. multiple-scan output cannot be created with a suspending data destination
  1489. manager, since jpeg_finish_compress() does not support suspension. We
  1490. should also note that the compressor currently forces Huffman optimization
  1491. mode when creating a progressive JPEG file, because the default Huffman
  1492. tables are unsuitable for progressive files.
  1493. Progressive decompression:
  1494. When buffered-image mode is not used, the decoder library will read all of
  1495. a multi-scan file during jpeg_start_decompress(), so that it can provide a
  1496. final decoded image. (Here "multi-scan" means either progressive or
  1497. multi-scan sequential.) This makes multi-scan files transparent to the
  1498. decoding application. However, existing applications that used suspending
  1499. input with version 5 of the IJG library will need to be modified to check
  1500. for a suspension return from jpeg_start_decompress().
  1501. To perform incremental display, an application must use the library's
  1502. buffered-image mode. This is described in the next section.
  1503. Buffered-image mode
  1504. -------------------
  1505. In buffered-image mode, the library stores the partially decoded image in a
  1506. coefficient buffer, from which it can be read out as many times as desired.
  1507. This mode is typically used for incremental display of progressive JPEG files,
  1508. but it can be used with any JPEG file. Each scan of a progressive JPEG file
  1509. adds more data (more detail) to the buffered image. The application can
  1510. display in lockstep with the source file (one display pass per input scan),
  1511. or it can allow input processing to outrun display processing. By making
  1512. input and display processing run independently, it is possible for the
  1513. application to adapt progressive display to a wide range of data transmission
  1514. rates.
  1515. The basic control flow for buffered-image decoding is
  1516. jpeg_create_decompress()
  1517. set data source
  1518. jpeg_read_header()
  1519. set overall decompression parameters
  1520. cinfo.buffered_image = TRUE; /* select buffered-image mode */
  1521. jpeg_start_decompress()
  1522. for (each output pass) {
  1523. adjust output decompression parameters if required
  1524. jpeg_start_output() /* start a new output pass */
  1525. for (all scanlines in image) {
  1526. jpeg_read_scanlines()
  1527. display scanlines
  1528. }
  1529. jpeg_finish_output() /* terminate output pass */
  1530. }
  1531. jpeg_finish_decompress()
  1532. jpeg_destroy_decompress()
  1533. This differs from ordinary unbuffered decoding in that there is an additional
  1534. level of looping. The application can choose how many output passes to make
  1535. and how to display each pass.
  1536. The simplest approach to displaying progressive images is to do one display
  1537. pass for each scan appearing in the input file. In this case the outer loop
  1538. condition is typically
  1539. while (! jpeg_input_complete(&cinfo))
  1540. and the start-output call should read
  1541. jpeg_start_output(&cinfo, cinfo.input_scan_number);
  1542. The second parameter to jpeg_start_output() indicates which scan of the input
  1543. file is to be displayed; the scans are numbered starting at 1 for this
  1544. purpose. (You can use a loop counter starting at 1 if you like, but using
  1545. the library's input scan counter is easier.) The library automatically reads
  1546. data as necessary to complete each requested scan, and jpeg_finish_output()
  1547. advances to the next scan or end-of-image marker (hence input_scan_number
  1548. will be incremented by the time control arrives back at jpeg_start_output()).
  1549. With this technique, data is read from the input file only as needed, and
  1550. input and output processing run in lockstep.
  1551. After reading the final scan and reaching the end of the input file, the
  1552. buffered image remains available; it can be read additional times by
  1553. repeating the jpeg_start_output()/jpeg_read_scanlines()/jpeg_finish_output()
  1554. sequence. For example, a useful technique is to use fast one-pass color
  1555. quantization for display passes made while the image is arriving, followed by
  1556. a final display pass using two-pass quantization for highest quality. This
  1557. is done by changing the library parameters before the final output pass.
  1558. Changing parameters between passes is discussed in detail below.
  1559. In general the last scan of a progressive file cannot be recognized as such
  1560. until after it is read, so a post-input display pass is the best approach if
  1561. you want special processing in the final pass.
  1562. When done with the image, be sure to call jpeg_finish_decompress() to release
  1563. the buffered image (or just use jpeg_destroy_decompress()).
  1564. If input data arrives faster than it can be displayed, the application can
  1565. cause the library to decode input data in advance of what's needed to produce
  1566. output. This is done by calling the routine jpeg_consume_input().
  1567. The return value is one of the following:
  1568. JPEG_REACHED_SOS: reached an SOS marker (the start of a new scan)
  1569. JPEG_REACHED_EOI: reached the EOI marker (end of image)
  1570. JPEG_ROW_COMPLETED: completed reading one MCU row of compressed data
  1571. JPEG_SCAN_COMPLETED: completed reading last MCU row of current scan
  1572. JPEG_SUSPENDED: suspended before completing any of the above
  1573. (JPEG_SUSPENDED can occur only if a suspending data source is used.) This
  1574. routine can be called at any time after initializing the JPEG object. It
  1575. reads some additional data and returns when one of the indicated significant
  1576. events occurs. (If called after the EOI marker is reached, it will
  1577. immediately return JPEG_REACHED_EOI without attempting to read more data.)
  1578. The library's output processing will automatically call jpeg_consume_input()
  1579. whenever the output processing overtakes the input; thus, simple lockstep
  1580. display requires no direct calls to jpeg_consume_input(). But by adding
  1581. calls to jpeg_consume_input(), you can absorb data in advance of what is
  1582. being displayed. This has two benefits:
  1583. * You can limit buildup of unprocessed data in your input buffer.
  1584. * You can eliminate extra display passes by paying attention to the
  1585. state of the library's input processing.
  1586. The first of these benefits only requires interspersing calls to
  1587. jpeg_consume_input() with your display operations and any other processing
  1588. you may be doing. To avoid wasting cycles due to backtracking, it's best to
  1589. call jpeg_consume_input() only after a hundred or so new bytes have arrived.
  1590. This is discussed further under "I/O suspension", above. (Note: the JPEG
  1591. library currently is not thread-safe. You must not call jpeg_consume_input()
  1592. from one thread of control if a different library routine is working on the
  1593. same JPEG object in another thread.)
  1594. When input arrives fast enough that more than one new scan is available
  1595. before you start a new output pass, you may as well skip the output pass
  1596. corresponding to the completed scan. This occurs for free if you pass
  1597. cinfo.input_scan_number as the target scan number to jpeg_start_output().
  1598. The input_scan_number field is simply the index of the scan currently being
  1599. consumed by the input processor. You can ensure that this is up-to-date by
  1600. emptying the input buffer just before calling jpeg_start_output(): call
  1601. jpeg_consume_input() repeatedly until it returns JPEG_SUSPENDED or
  1602. JPEG_REACHED_EOI.
  1603. The target scan number passed to jpeg_start_output() is saved in the
  1604. cinfo.output_scan_number field. The library's output processing calls
  1605. jpeg_consume_input() whenever the current input scan number and row within
  1606. that scan is less than or equal to the current output scan number and row.
  1607. Thus, input processing can "get ahead" of the output processing but is not
  1608. allowed to "fall behind". You can achieve several different effects by
  1609. manipulating this interlock rule. For example, if you pass a target scan
  1610. number greater than the current input scan number, the output processor will
  1611. wait until that scan starts to arrive before producing any output. (To avoid
  1612. an infinite loop, the target scan number is automatically reset to the last
  1613. scan number when the end of image is reached. Thus, if you specify a large
  1614. target scan number, the library will just absorb the entire input file and
  1615. then perform an output pass. This is effectively the same as what
  1616. jpeg_start_decompress() does when you don't select buffered-image mode.)
  1617. When you pass a target scan number equal to the current input scan number,
  1618. the image is displayed no faster than the current input scan arrives. The
  1619. final possibility is to pass a target scan number less than the current input
  1620. scan number; this disables the input/output interlock and causes the output
  1621. processor to simply display whatever it finds in the image buffer, without
  1622. waiting for input. (However, the library will not accept a target scan
  1623. number less than one, so you can't avoid waiting for the first scan.)
  1624. When data is arriving faster than the output display processing can advance
  1625. through the image, jpeg_consume_input() will store data into the buffered
  1626. image beyond the point at which the output processing is reading data out
  1627. again. If the input arrives fast enough, it may "wrap around" the buffer to
  1628. the point where the input is more than one whole scan ahead of the output.
  1629. If the output processing simply proceeds through its display pass without
  1630. paying attention to the input, the effect seen on-screen is that the lower
  1631. part of the image is one or more scans better in quality than the upper part.
  1632. Then, when the next output scan is started, you have a choice of what target
  1633. scan number to use. The recommended choice is to use the current input scan
  1634. number at that time, which implies that you've skipped the output scans
  1635. corresponding to the input scans that were completed while you processed the
  1636. previous output scan. In this way, the decoder automatically adapts its
  1637. speed to the arriving data, by skipping output scans as necessary to keep up
  1638. with the arriving data.
  1639. When using this strategy, you'll want to be sure that you perform a final
  1640. output pass after receiving all the data; otherwise your last display may not
  1641. be full quality across the whole screen. So the right outer loop logic is
  1642. something like this:
  1643. do {
  1644. absorb any waiting input by calling jpeg_consume_input()
  1645. final_pass = jpeg_input_complete(&cinfo);
  1646. adjust output decompression parameters if required
  1647. jpeg_start_output(&cinfo, cinfo.input_scan_number);
  1648. ...
  1649. jpeg_finish_output()
  1650. } while (! final_pass);
  1651. rather than quitting as soon as jpeg_input_complete() returns TRUE. This
  1652. arrangement makes it simple to use higher-quality decoding parameters
  1653. for the final pass. But if you don't want to use special parameters for
  1654. the final pass, the right loop logic is like this:
  1655. for (;;) {
  1656. absorb any waiting input by calling jpeg_consume_input()
  1657. jpeg_start_output(&cinfo, cinfo.input_scan_number);
  1658. ...
  1659. jpeg_finish_output()
  1660. if (jpeg_input_complete(&cinfo) &&
  1661. cinfo.input_scan_number == cinfo.output_scan_number)
  1662. break;
  1663. }
  1664. In this case you don't need to know in advance whether an output pass is to
  1665. be the last one, so it's not necessary to have reached EOF before starting
  1666. the final output pass; rather, what you want to test is whether the output
  1667. pass was performed in sync with the final input scan. This form of the loop
  1668. will avoid an extra output pass whenever the decoder is able (or nearly able)
  1669. to keep up with the incoming data.
  1670. When the data transmission speed is high, you might begin a display pass,
  1671. then find that much or all of the file has arrived before you can complete
  1672. the pass. (You can detect this by noting the JPEG_REACHED_EOI return code
  1673. from jpeg_consume_input(), or equivalently by testing jpeg_input_complete().)
  1674. In this situation you may wish to abort the current display pass and start a
  1675. new one using the newly arrived information. To do so, just call
  1676. jpeg_finish_output() and then start a new pass with jpeg_start_output().
  1677. A variant strategy is to abort and restart display if more than one complete
  1678. scan arrives during an output pass; this can be detected by noting
  1679. JPEG_REACHED_SOS returns and/or examining cinfo.input_scan_number. This
  1680. idea should be employed with caution, however, since the display process
  1681. might never get to the bottom of the image before being aborted, resulting
  1682. in the lower part of the screen being several passes worse than the upper.
  1683. In most cases it's probably best to abort an output pass only if the whole
  1684. file has arrived and you want to begin the final output pass immediately.
  1685. When receiving data across a communication link, we recommend always using
  1686. the current input scan number for the output target scan number; if a
  1687. higher-quality final pass is to be done, it should be started (aborting any
  1688. incomplete output pass) as soon as the end of file is received. However,
  1689. many other strategies are possible. For example, the application can examine
  1690. the parameters of the current input scan and decide whether to display it or
  1691. not. If the scan contains only chroma data, one might choose not to use it
  1692. as the target scan, expecting that the scan will be small and will arrive
  1693. quickly. To skip to the next scan, call jpeg_consume_input() until it
  1694. returns JPEG_REACHED_SOS or JPEG_REACHED_EOI. Or just use the next higher
  1695. number as the target scan for jpeg_start_output(); but that method doesn't
  1696. let you inspect the next scan's parameters before deciding to display it.
  1697. In buffered-image mode, jpeg_start_decompress() never performs input and
  1698. thus never suspends. An application that uses input suspension with
  1699. buffered-image mode must be prepared for suspension returns from these
  1700. routines:
  1701. * jpeg_start_output() performs input only if you request 2-pass quantization
  1702. and the target scan isn't fully read yet. (This is discussed below.)
  1703. * jpeg_read_scanlines(), as always, returns the number of scanlines that it
  1704. was able to produce before suspending.
  1705. * jpeg_finish_output() will read any markers following the target scan,
  1706. up to the end of the file or the SOS marker that begins another scan.
  1707. (But it reads no input if jpeg_consume_input() has already reached the
  1708. end of the file or a SOS marker beyond the target output scan.)
  1709. * jpeg_finish_decompress() will read until the end of file, and thus can
  1710. suspend if the end hasn't already been reached (as can be tested by
  1711. calling jpeg_input_complete()).
  1712. jpeg_start_output(), jpeg_finish_output(), and jpeg_finish_decompress()
  1713. all return TRUE if they completed their tasks, FALSE if they had to suspend.
  1714. In the event of a FALSE return, the application must load more input data
  1715. and repeat the call. Applications that use non-suspending data sources need
  1716. not check the return values of these three routines.
  1717. It is possible to change decoding parameters between output passes in the
  1718. buffered-image mode. The decoder library currently supports only very
  1719. limited changes of parameters. ONLY THE FOLLOWING parameter changes are
  1720. allowed after jpeg_start_decompress() is called:
  1721. * dct_method can be changed before each call to jpeg_start_output().
  1722. For example, one could use a fast DCT method for early scans, changing
  1723. to a higher quality method for the final scan.
  1724. * dither_mode can be changed before each call to jpeg_start_output();
  1725. of course this has no impact if not using color quantization. Typically
  1726. one would use ordered dither for initial passes, then switch to
  1727. Floyd-Steinberg dither for the final pass. Caution: changing dither mode
  1728. can cause more memory to be allocated by the library. Although the amount
  1729. of memory involved is not large (a scanline or so), it may cause the
  1730. initial max_memory_to_use specification to be exceeded, which in the worst
  1731. case would result in an out-of-memory failure.
  1732. * do_block_smoothing can be changed before each call to jpeg_start_output().
  1733. This setting is relevant only when decoding a progressive JPEG image.
  1734. During the first DC-only scan, block smoothing provides a very "fuzzy" look
  1735. instead of the very "blocky" look seen without it; which is better seems a
  1736. matter of personal taste. But block smoothing is nearly always a win
  1737. during later stages, especially when decoding a successive-approximation
  1738. image: smoothing helps to hide the slight blockiness that otherwise shows
  1739. up on smooth gradients until the lowest coefficient bits are sent.
  1740. * Color quantization mode can be changed under the rules described below.
  1741. You *cannot* change between full-color and quantized output (because that
  1742. would alter the required I/O buffer sizes), but you can change which
  1743. quantization method is used.
  1744. When generating color-quantized output, changing quantization method is a
  1745. very useful way of switching between high-speed and high-quality display.
  1746. The library allows you to change among its three quantization methods:
  1747. 1. Single-pass quantization to a fixed color cube.
  1748. Selected by cinfo.two_pass_quantize = FALSE and cinfo.colormap = NULL.
  1749. 2. Single-pass quantization to an application-supplied colormap.
  1750. Selected by setting cinfo.colormap to point to the colormap (the value of
  1751. two_pass_quantize is ignored); also set cinfo.actual_number_of_colors.
  1752. 3. Two-pass quantization to a colormap chosen specifically for the image.
  1753. Selected by cinfo.two_pass_quantize = TRUE and cinfo.colormap = NULL.
  1754. (This is the default setting selected by jpeg_read_header, but it is
  1755. probably NOT what you want for the first pass of progressive display!)
  1756. These methods offer successively better quality and lesser speed. However,
  1757. only the first method is available for quantizing in non-RGB color spaces.
  1758. IMPORTANT: because the different quantizer methods have very different
  1759. working-storage requirements, the library requires you to indicate which
  1760. one(s) you intend to use before you call jpeg_start_decompress(). (If we did
  1761. not require this, the max_memory_to_use setting would be a complete fiction.)
  1762. You do this by setting one or more of these three cinfo fields to TRUE:
  1763. enable_1pass_quant Fixed color cube colormap
  1764. enable_external_quant Externally-supplied colormap
  1765. enable_2pass_quant Two-pass custom colormap
  1766. All three are initialized FALSE by jpeg_read_header(). But
  1767. jpeg_start_decompress() automatically sets TRUE the one selected by the
  1768. current two_pass_quantize and colormap settings, so you only need to set the
  1769. enable flags for any other quantization methods you plan to change to later.
  1770. After setting the enable flags correctly at jpeg_start_decompress() time, you
  1771. can change to any enabled quantization method by setting two_pass_quantize
  1772. and colormap properly just before calling jpeg_start_output(). The following
  1773. special rules apply:
  1774. 1. You must explicitly set cinfo.colormap to NULL when switching to 1-pass
  1775. or 2-pass mode from a different mode, or when you want the 2-pass
  1776. quantizer to be re-run to generate a new colormap.
  1777. 2. To switch to an external colormap, or to change to a different external
  1778. colormap than was used on the prior pass, you must call
  1779. jpeg_new_colormap() after setting cinfo.colormap.
  1780. NOTE: if you want to use the same colormap as was used in the prior pass,
  1781. you should not do either of these things. This will save some nontrivial
  1782. switchover costs.
  1783. (These requirements exist because cinfo.colormap will always be non-NULL
  1784. after completing a prior output pass, since both the 1-pass and 2-pass
  1785. quantizers set it to point to their output colormaps. Thus you have to
  1786. do one of these two things to notify the library that something has changed.
  1787. Yup, it's a bit klugy, but it's necessary to do it this way for backwards
  1788. compatibility.)
  1789. Note that in buffered-image mode, the library generates any requested colormap
  1790. during jpeg_start_output(), not during jpeg_start_decompress().
  1791. When using two-pass quantization, jpeg_start_output() makes a pass over the
  1792. buffered image to determine the optimum color map; it therefore may take a
  1793. significant amount of time, whereas ordinarily it does little work. The
  1794. progress monitor hook is called during this pass, if defined. It is also
  1795. important to realize that if the specified target scan number is greater than
  1796. or equal to the current input scan number, jpeg_start_output() will attempt
  1797. to consume input as it makes this pass. If you use a suspending data source,
  1798. you need to check for a FALSE return from jpeg_start_output() under these
  1799. conditions. The combination of 2-pass quantization and a not-yet-fully-read
  1800. target scan is the only case in which jpeg_start_output() will consume input.
  1801. Application authors who support buffered-image mode may be tempted to use it
  1802. for all JPEG images, even single-scan ones. This will work, but it is
  1803. inefficient: there is no need to create an image-sized coefficient buffer for
  1804. single-scan images. Requesting buffered-image mode for such an image wastes
  1805. memory. Worse, it can cost time on large images, since the buffered data has
  1806. to be swapped out or written to a temporary file. If you are concerned about
  1807. maximum performance on baseline JPEG files, you should use buffered-image
  1808. mode only when the incoming file actually has multiple scans. This can be
  1809. tested by calling jpeg_has_multiple_scans(), which will return a correct
  1810. result at any time after jpeg_read_header() completes.
  1811. It is also worth noting that when you use jpeg_consume_input() to let input
  1812. processing get ahead of output processing, the resulting pattern of access to
  1813. the coefficient buffer is quite nonsequential. It's best to use the memory
  1814. manager jmemnobs.c if you can (ie, if you have enough real or virtual main
  1815. memory). If not, at least make sure that max_memory_to_use is set as high as
  1816. possible. If the JPEG memory manager has to use a temporary file, you will
  1817. probably see a lot of disk traffic and poor performance. (This could be
  1818. improved with additional work on the memory manager, but we haven't gotten
  1819. around to it yet.)
  1820. In some applications it may be convenient to use jpeg_consume_input() for all
  1821. input processing, including reading the initial markers; that is, you may
  1822. wish to call jpeg_consume_input() instead of jpeg_read_header() during
  1823. startup. This works, but note that you must check for JPEG_REACHED_SOS and
  1824. JPEG_REACHED_EOI return codes as the equivalent of jpeg_read_header's codes.
  1825. Once the first SOS marker has been reached, you must call
  1826. jpeg_start_decompress() before jpeg_consume_input() will consume more input;
  1827. it'll just keep returning JPEG_REACHED_SOS until you do. If you read a
  1828. tables-only file this way, jpeg_consume_input() will return JPEG_REACHED_EOI
  1829. without ever returning JPEG_REACHED_SOS; be sure to check for this case.
  1830. If this happens, the decompressor will not read any more input until you call
  1831. jpeg_abort() to reset it. It is OK to call jpeg_consume_input() even when not
  1832. using buffered-image mode, but in that case it's basically a no-op after the
  1833. initial markers have been read: it will just return JPEG_SUSPENDED.
  1834. Abbreviated datastreams and multiple images
  1835. -------------------------------------------
  1836. A JPEG compression or decompression object can be reused to process multiple
  1837. images. This saves a small amount of time per image by eliminating the
  1838. "create" and "destroy" operations, but that isn't the real purpose of the
  1839. feature. Rather, reuse of an object provides support for abbreviated JPEG
  1840. datastreams. Object reuse can also simplify processing a series of images in
  1841. a single input or output file. This section explains these features.
  1842. A JPEG file normally contains several hundred bytes worth of quantization
  1843. and Huffman tables. In a situation where many images will be stored or
  1844. transmitted with identical tables, this may represent an annoying overhead.
  1845. The JPEG standard therefore permits tables to be omitted. The standard
  1846. defines three classes of JPEG datastreams:
  1847. * "Interchange" datastreams contain an image and all tables needed to decode
  1848. the image. These are the usual kind of JPEG file.
  1849. * "Abbreviated image" datastreams contain an image, but are missing some or
  1850. all of the tables needed to decode that image.
  1851. * "Abbreviated table specification" (henceforth "tables-only") datastreams
  1852. contain only table specifications.
  1853. To decode an abbreviated image, it is necessary to load the missing table(s)
  1854. into the decoder beforehand. This can be accomplished by reading a separate
  1855. tables-only file. A variant scheme uses a series of images in which the first
  1856. image is an interchange (complete) datastream, while subsequent ones are
  1857. abbreviated and rely on the tables loaded by the first image. It is assumed
  1858. that once the decoder has read a table, it will remember that table until a
  1859. new definition for the same table number is encountered.
  1860. It is the application designer's responsibility to figure out how to associate
  1861. the correct tables with an abbreviated image. While abbreviated datastreams
  1862. can be useful in a closed environment, their use is strongly discouraged in
  1863. any situation where data exchange with other applications might be needed.
  1864. Caveat designer.
  1865. The JPEG library provides support for reading and writing any combination of
  1866. tables-only datastreams and abbreviated images. In both compression and
  1867. decompression objects, a quantization or Huffman table will be retained for
  1868. the lifetime of the object, unless it is overwritten by a new table definition.
  1869. To create abbreviated image datastreams, it is only necessary to tell the
  1870. compressor not to emit some or all of the tables it is using. Each
  1871. quantization and Huffman table struct contains a boolean field "sent_table",
  1872. which normally is initialized to FALSE. For each table used by the image, the
  1873. header-writing process emits the table and sets sent_table = TRUE unless it is
  1874. already TRUE. (In normal usage, this prevents outputting the same table
  1875. definition multiple times, as would otherwise occur because the chroma
  1876. components typically share tables.) Thus, setting this field to TRUE before
  1877. calling jpeg_start_compress() will prevent the table from being written at
  1878. all.
  1879. If you want to create a "pure" abbreviated image file containing no tables,
  1880. just call "jpeg_suppress_tables(&cinfo, TRUE)" after constructing all the
  1881. tables. If you want to emit some but not all tables, you'll need to set the
  1882. individual sent_table fields directly.
  1883. To create an abbreviated image, you must also call jpeg_start_compress()
  1884. with a second parameter of FALSE, not TRUE. Otherwise jpeg_start_compress()
  1885. will force all the sent_table fields to FALSE. (This is a safety feature to
  1886. prevent abbreviated images from being created accidentally.)
  1887. To create a tables-only file, perform the same parameter setup that you
  1888. normally would, but instead of calling jpeg_start_compress() and so on, call
  1889. jpeg_write_tables(&cinfo). This will write an abbreviated datastream
  1890. containing only SOI, DQT and/or DHT markers, and EOI. All the quantization
  1891. and Huffman tables that are currently defined in the compression object will
  1892. be emitted unless their sent_tables flag is already TRUE, and then all the
  1893. sent_tables flags will be set TRUE.
  1894. A sure-fire way to create matching tables-only and abbreviated image files
  1895. is to proceed as follows:
  1896. create JPEG compression object
  1897. set JPEG parameters
  1898. set destination to tables-only file
  1899. jpeg_write_tables(&cinfo);
  1900. set destination to image file
  1901. jpeg_start_compress(&cinfo, FALSE);
  1902. write data...
  1903. jpeg_finish_compress(&cinfo);
  1904. Since the JPEG parameters are not altered between writing the table file and
  1905. the abbreviated image file, the same tables are sure to be used. Of course,
  1906. you can repeat the jpeg_start_compress() ... jpeg_finish_compress() sequence
  1907. many times to produce many abbreviated image files matching the table file.
  1908. You cannot suppress output of the computed Huffman tables when Huffman
  1909. optimization is selected. (If you could, there'd be no way to decode the
  1910. image...) Generally, you don't want to set optimize_coding = TRUE when
  1911. you are trying to produce abbreviated files.
  1912. In some cases you might want to compress an image using tables which are
  1913. not stored in the application, but are defined in an interchange or
  1914. tables-only file readable by the application. This can be done by setting up
  1915. a JPEG decompression object to read the specification file, then copying the
  1916. tables into your compression object. See jpeg_copy_critical_parameters()
  1917. for an example of copying quantization tables.
  1918. To read abbreviated image files, you simply need to load the proper tables
  1919. into the decompression object before trying to read the abbreviated image.
  1920. If the proper tables are stored in the application program, you can just
  1921. allocate the table structs and fill in their contents directly. For example,
  1922. to load a fixed quantization table into table slot "n":
  1923. if (cinfo.quant_tbl_ptrs[n] == NULL)
  1924. cinfo.quant_tbl_ptrs[n] = jpeg_alloc_quant_table((j_common_ptr) &cinfo);
  1925. quant_ptr = cinfo.quant_tbl_ptrs[n]; /* quant_ptr is JQUANT_TBL* */
  1926. for (i = 0; i < 64; i++) {
  1927. /* Qtable[] is desired quantization table, in natural array order */
  1928. quant_ptr->quantval[i] = Qtable[i];
  1929. }
  1930. Code to load a fixed Huffman table is typically (for AC table "n"):
  1931. if (cinfo.ac_huff_tbl_ptrs[n] == NULL)
  1932. cinfo.ac_huff_tbl_ptrs[n] = jpeg_alloc_huff_table((j_common_ptr) &cinfo);
  1933. huff_ptr = cinfo.ac_huff_tbl_ptrs[n]; /* huff_ptr is JHUFF_TBL* */
  1934. for (i = 1; i <= 16; i++) {
  1935. /* counts[i] is number of Huffman codes of length i bits, i=1..16 */
  1936. huff_ptr->bits[i] = counts[i];
  1937. }
  1938. for (i = 0; i < 256; i++) {
  1939. /* symbols[] is the list of Huffman symbols, in code-length order */
  1940. huff_ptr->huffval[i] = symbols[i];
  1941. }
  1942. (Note that trying to set cinfo.quant_tbl_ptrs[n] to point directly at a
  1943. constant JQUANT_TBL object is not safe. If the incoming file happened to
  1944. contain a quantization table definition, your master table would get
  1945. overwritten! Instead allocate a working table copy and copy the master table
  1946. into it, as illustrated above. Ditto for Huffman tables, of course.)
  1947. You might want to read the tables from a tables-only file, rather than
  1948. hard-wiring them into your application. The jpeg_read_header() call is
  1949. sufficient to read a tables-only file. You must pass a second parameter of
  1950. FALSE to indicate that you do not require an image to be present. Thus, the
  1951. typical scenario is
  1952. create JPEG decompression object
  1953. set source to tables-only file
  1954. jpeg_read_header(&cinfo, FALSE);
  1955. set source to abbreviated image file
  1956. jpeg_read_header(&cinfo, TRUE);
  1957. set decompression parameters
  1958. jpeg_start_decompress(&cinfo);
  1959. read data...
  1960. jpeg_finish_decompress(&cinfo);
  1961. In some cases, you may want to read a file without knowing whether it contains
  1962. an image or just tables. In that case, pass FALSE and check the return value
  1963. from jpeg_read_header(): it will be JPEG_HEADER_OK if an image was found,
  1964. JPEG_HEADER_TABLES_ONLY if only tables were found. (A third return value,
  1965. JPEG_SUSPENDED, is possible when using a suspending data source manager.)
  1966. Note that jpeg_read_header() will not complain if you read an abbreviated
  1967. image for which you haven't loaded the missing tables; the missing-table check
  1968. occurs later, in jpeg_start_decompress().
  1969. It is possible to read a series of images from a single source file by
  1970. repeating the jpeg_read_header() ... jpeg_finish_decompress() sequence,
  1971. without releasing/recreating the JPEG object or the data source module.
  1972. (If you did reinitialize, any partial bufferload left in the data source
  1973. buffer at the end of one image would be discarded, causing you to lose the
  1974. start of the next image.) When you use this method, stored tables are
  1975. automatically carried forward, so some of the images can be abbreviated images
  1976. that depend on tables from earlier images.
  1977. If you intend to write a series of images into a single destination file,
  1978. you might want to make a specialized data destination module that doesn't
  1979. flush the output buffer at term_destination() time. This would speed things
  1980. up by some trifling amount. Of course, you'd need to remember to flush the
  1981. buffer after the last image. You can make the later images be abbreviated
  1982. ones by passing FALSE to jpeg_start_compress().
  1983. Special markers
  1984. ---------------
  1985. Some applications may need to insert or extract special data in the JPEG
  1986. datastream. The JPEG standard provides marker types "COM" (comment) and
  1987. "APP0" through "APP15" (application) to hold application-specific data.
  1988. Unfortunately, the use of these markers is not specified by the standard.
  1989. COM markers are fairly widely used to hold user-supplied text. The JFIF file
  1990. format spec uses APP0 markers with specified initial strings to hold certain
  1991. data. Adobe applications use APP14 markers beginning with the string "Adobe"
  1992. for miscellaneous data. Other APPn markers are rarely seen, but might
  1993. contain almost anything.
  1994. If you wish to store user-supplied text, we recommend you use COM markers
  1995. and place readable 7-bit ASCII text in them. Newline conventions are not
  1996. standardized --- expect to find LF (Unix style), CR/LF (DOS style), or CR
  1997. (Mac style). A robust COM reader should be able to cope with random binary
  1998. garbage, including nulls, since some applications generate COM markers
  1999. containing non-ASCII junk. (But yours should not be one of them.)
  2000. For program-supplied data, use an APPn marker, and be sure to begin it with an
  2001. identifying string so that you can tell whether the marker is actually yours.
  2002. It's probably best to avoid using APP0 or APP14 for any private markers.
  2003. (NOTE: the upcoming SPIFF standard will use APP8 markers; we recommend you
  2004. not use APP8 markers for any private purposes, either.)
  2005. Keep in mind that at most 65533 bytes can be put into one marker, but you
  2006. can have as many markers as you like.
  2007. By default, the IJG compression library will write a JFIF APP0 marker if the
  2008. selected JPEG colorspace is grayscale or YCbCr, or an Adobe APP14 marker if
  2009. the selected colorspace is RGB, CMYK, or YCCK. You can disable this, but
  2010. we don't recommend it. The decompression library will recognize JFIF and
  2011. Adobe markers and will set the JPEG colorspace properly when one is found.
  2012. You can write special markers immediately following the datastream header by
  2013. calling jpeg_write_marker() after jpeg_start_compress() and before the first
  2014. call to jpeg_write_scanlines(). When you do this, the markers appear after
  2015. the SOI and the JFIF APP0 and Adobe APP14 markers (if written), but before
  2016. all else. Specify the marker type parameter as "JPEG_COM" for COM or
  2017. "JPEG_APP0 + n" for APPn. (Actually, jpeg_write_marker will let you write
  2018. any marker type, but we don't recommend writing any other kinds of marker.)
  2019. For example, to write a user comment string pointed to by comment_text:
  2020. jpeg_write_marker(cinfo, JPEG_COM, comment_text, strlen(comment_text));
  2021. If it's not convenient to store all the marker data in memory at once,
  2022. you can instead call jpeg_write_m_header() followed by multiple calls to
  2023. jpeg_write_m_byte(). If you do it this way, it's your responsibility to
  2024. call jpeg_write_m_byte() exactly the number of times given in the length
  2025. parameter to jpeg_write_m_header(). (This method lets you empty the
  2026. output buffer partway through a marker, which might be important when
  2027. using a suspending data destination module. In any case, if you are using
  2028. a suspending destination, you should flush its buffer after inserting
  2029. any special markers. See "I/O suspension".)
  2030. Or, if you prefer to synthesize the marker byte sequence yourself,
  2031. you can just cram it straight into the data destination module.
  2032. If you are writing JFIF 1.02 extension markers (thumbnail images), don't
  2033. forget to set cinfo.JFIF_minor_version = 2 so that the encoder will write the
  2034. correct JFIF version number in the JFIF header marker. The library's default
  2035. is to write version 1.01, but that's wrong if you insert any 1.02 extension
  2036. markers. (We could probably get away with just defaulting to 1.02, but there
  2037. used to be broken decoders that would complain about unknown minor version
  2038. numbers. To reduce compatibility risks it's safest not to write 1.02 unless
  2039. you are actually using 1.02 extensions.)
  2040. When reading, two methods of handling special markers are available:
  2041. 1. You can ask the library to save the contents of COM and/or APPn markers
  2042. into memory, and then examine them at your leisure afterwards.
  2043. 2. You can supply your own routine to process COM and/or APPn markers
  2044. on-the-fly as they are read.
  2045. The first method is simpler to use, especially if you are using a suspending
  2046. data source; writing a marker processor that copes with input suspension is
  2047. not easy (consider what happens if the marker is longer than your available
  2048. input buffer). However, the second method conserves memory since the marker
  2049. data need not be kept around after it's been processed.
  2050. For either method, you'd normally set up marker handling after creating a
  2051. decompression object and before calling jpeg_read_header(), because the
  2052. markers of interest will typically be near the head of the file and so will
  2053. be scanned by jpeg_read_header. Once you've established a marker handling
  2054. method, it will be used for the life of that decompression object
  2055. (potentially many datastreams), unless you change it. Marker handling is
  2056. determined separately for COM markers and for each APPn marker code.
  2057. To save the contents of special markers in memory, call
  2058. jpeg_save_markers(cinfo, marker_code, length_limit)
  2059. where marker_code is the marker type to save, JPEG_COM or JPEG_APP0+n.
  2060. (To arrange to save all the special marker types, you need to call this
  2061. routine 17 times, for COM and APP0-APP15.) If the incoming marker is longer
  2062. than length_limit data bytes, only length_limit bytes will be saved; this
  2063. parameter allows you to avoid chewing up memory when you only need to see the
  2064. first few bytes of a potentially large marker. If you want to save all the
  2065. data, set length_limit to 0xFFFF; that is enough since marker lengths are only
  2066. 16 bits. As a special case, setting length_limit to 0 prevents that marker
  2067. type from being saved at all. (That is the default behavior, in fact.)
  2068. After jpeg_read_header() completes, you can examine the special markers by
  2069. following the cinfo->marker_list pointer chain. All the special markers in
  2070. the file appear in this list, in order of their occurrence in the file (but
  2071. omitting any markers of types you didn't ask for). Both the original data
  2072. length and the saved data length are recorded for each list entry; the latter
  2073. will not exceed length_limit for the particular marker type. Note that these
  2074. lengths exclude the marker length word, whereas the stored representation
  2075. within the JPEG file includes it. (Hence the maximum data length is really
  2076. only 65533.)
  2077. It is possible that additional special markers appear in the file beyond the
  2078. SOS marker at which jpeg_read_header stops; if so, the marker list will be
  2079. extended during reading of the rest of the file. This is not expected to be
  2080. common, however. If you are short on memory you may want to reset the length
  2081. limit to zero for all marker types after finishing jpeg_read_header, to
  2082. ensure that the max_memory_to_use setting cannot be exceeded due to addition
  2083. of later markers.
  2084. The marker list remains stored until you call jpeg_finish_decompress or
  2085. jpeg_abort, at which point the memory is freed and the list is set to empty.
  2086. (jpeg_destroy also releases the storage, of course.)
  2087. Note that the library is internally interested in APP0 and APP14 markers;
  2088. if you try to set a small nonzero length limit on these types, the library
  2089. will silently force the length up to the minimum it wants. (But you can set
  2090. a zero length limit to prevent them from being saved at all.) Also, in a
  2091. 16-bit environment, the maximum length limit may be constrained to less than
  2092. 65533 by malloc() limitations. It is therefore best not to assume that the
  2093. effective length limit is exactly what you set it to be.
  2094. If you want to supply your own marker-reading routine, you do it by calling
  2095. jpeg_set_marker_processor(). A marker processor routine must have the
  2096. signature
  2097. boolean jpeg_marker_parser_method (j_decompress_ptr cinfo)
  2098. Although the marker code is not explicitly passed, the routine can find it
  2099. in cinfo->unread_marker. At the time of call, the marker proper has been
  2100. read from the data source module. The processor routine is responsible for
  2101. reading the marker length word and the remaining parameter bytes, if any.
  2102. Return TRUE to indicate success. (FALSE should be returned only if you are
  2103. using a suspending data source and it tells you to suspend. See the standard
  2104. marker processors in jdmarker.c for appropriate coding methods if you need to
  2105. use a suspending data source.)
  2106. If you override the default APP0 or APP14 processors, it is up to you to
  2107. recognize JFIF and Adobe markers if you want colorspace recognition to occur
  2108. properly. We recommend copying and extending the default processors if you
  2109. want to do that. (A better idea is to save these marker types for later
  2110. examination by calling jpeg_save_markers(); that method doesn't interfere
  2111. with the library's own processing of these markers.)
  2112. jpeg_set_marker_processor() and jpeg_save_markers() are mutually exclusive
  2113. --- if you call one it overrides any previous call to the other, for the
  2114. particular marker type specified.
  2115. A simple example of an external COM processor can be found in djpeg.c.
  2116. Also, see jpegtran.c for an example of using jpeg_save_markers.
  2117. Raw (downsampled) image data
  2118. ----------------------------
  2119. Some applications need to supply already-downsampled image data to the JPEG
  2120. compressor, or to receive raw downsampled data from the decompressor. The
  2121. library supports this requirement by allowing the application to write or
  2122. read raw data, bypassing the normal preprocessing or postprocessing steps.
  2123. The interface is different from the standard one and is somewhat harder to
  2124. use. If your interest is merely in bypassing color conversion, we recommend
  2125. that you use the standard interface and simply set jpeg_color_space =
  2126. in_color_space (or jpeg_color_space = out_color_space for decompression).
  2127. The mechanism described in this section is necessary only to supply or
  2128. receive downsampled image data, in which not all components have the same
  2129. dimensions.
  2130. To compress raw data, you must supply the data in the colorspace to be used
  2131. in the JPEG file (please read the earlier section on Special color spaces)
  2132. and downsampled to the sampling factors specified in the JPEG parameters.
  2133. You must supply the data in the format used internally by the JPEG library,
  2134. namely a JSAMPIMAGE array. This is an array of pointers to two-dimensional
  2135. arrays, each of type JSAMPARRAY. Each 2-D array holds the values for one
  2136. color component. This structure is necessary since the components are of
  2137. different sizes. If the image dimensions are not a multiple of the MCU size,
  2138. you must also pad the data correctly (usually, this is done by replicating
  2139. the last column and/or row). The data must be padded to a multiple of a DCT
  2140. block in each component: that is, each downsampled row must contain a
  2141. multiple of 8 valid samples, and there must be a multiple of 8 sample rows
  2142. for each component. (For applications such as conversion of digital TV
  2143. images, the standard image size is usually a multiple of the DCT block size,
  2144. so that no padding need actually be done.)
  2145. The procedure for compression of raw data is basically the same as normal
  2146. compression, except that you call jpeg_write_raw_data() in place of
  2147. jpeg_write_scanlines(). Before calling jpeg_start_compress(), you must do
  2148. the following:
  2149. * Set cinfo->raw_data_in to TRUE. (It is set FALSE by jpeg_set_defaults().)
  2150. This notifies the library that you will be supplying raw data.
  2151. Furthermore, set cinfo->do_fancy_downsampling to FALSE if you want to use
  2152. real downsampled data. (It is set TRUE by jpeg_set_defaults().)
  2153. * Ensure jpeg_color_space is correct --- an explicit jpeg_set_colorspace()
  2154. call is a good idea. Note that since color conversion is bypassed,
  2155. in_color_space is ignored, except that jpeg_set_defaults() uses it to
  2156. choose the default jpeg_color_space setting.
  2157. * Ensure the sampling factors, cinfo->comp_info[i].h_samp_factor and
  2158. cinfo->comp_info[i].v_samp_factor, are correct. Since these indicate the
  2159. dimensions of the data you are supplying, it's wise to set them
  2160. explicitly, rather than assuming the library's defaults are what you want.
  2161. To pass raw data to the library, call jpeg_write_raw_data() in place of
  2162. jpeg_write_scanlines(). The two routines work similarly except that
  2163. jpeg_write_raw_data takes a JSAMPIMAGE data array rather than JSAMPARRAY.
  2164. The scanlines count passed to and returned from jpeg_write_raw_data is
  2165. measured in terms of the component with the largest v_samp_factor.
  2166. jpeg_write_raw_data() processes one MCU row per call, which is to say
  2167. v_samp_factor*DCTSIZE sample rows of each component. The passed num_lines
  2168. value must be at least max_v_samp_factor*DCTSIZE, and the return value will
  2169. be exactly that amount (or possibly some multiple of that amount, in future
  2170. library versions). This is true even on the last call at the bottom of the
  2171. image; don't forget to pad your data as necessary.
  2172. The required dimensions of the supplied data can be computed for each
  2173. component as
  2174. cinfo->comp_info[i].width_in_blocks*DCTSIZE samples per row
  2175. cinfo->comp_info[i].height_in_blocks*DCTSIZE rows in image
  2176. after jpeg_start_compress() has initialized those fields. If the valid data
  2177. is smaller than this, it must be padded appropriately. For some sampling
  2178. factors and image sizes, additional dummy DCT blocks are inserted to make
  2179. the image a multiple of the MCU dimensions. The library creates such dummy
  2180. blocks itself; it does not read them from your supplied data. Therefore you
  2181. need never pad by more than DCTSIZE samples. An example may help here.
  2182. Assume 2h2v downsampling of YCbCr data, that is
  2183. cinfo->comp_info[0].h_samp_factor = 2 for Y
  2184. cinfo->comp_info[0].v_samp_factor = 2
  2185. cinfo->comp_info[1].h_samp_factor = 1 for Cb
  2186. cinfo->comp_info[1].v_samp_factor = 1
  2187. cinfo->comp_info[2].h_samp_factor = 1 for Cr
  2188. cinfo->comp_info[2].v_samp_factor = 1
  2189. and suppose that the nominal image dimensions (cinfo->image_width and
  2190. cinfo->image_height) are 101x101 pixels. Then jpeg_start_compress() will
  2191. compute downsampled_width = 101 and width_in_blocks = 13 for Y,
  2192. downsampled_width = 51 and width_in_blocks = 7 for Cb and Cr (and the same
  2193. for the height fields). You must pad the Y data to at least 13*8 = 104
  2194. columns and rows, the Cb/Cr data to at least 7*8 = 56 columns and rows. The
  2195. MCU height is max_v_samp_factor = 2 DCT rows so you must pass at least 16
  2196. scanlines on each call to jpeg_write_raw_data(), which is to say 16 actual
  2197. sample rows of Y and 8 each of Cb and Cr. A total of 7 MCU rows are needed,
  2198. so you must pass a total of 7*16 = 112 "scanlines". The last DCT block row
  2199. of Y data is dummy, so it doesn't matter what you pass for it in the data
  2200. arrays, but the scanlines count must total up to 112 so that all of the Cb
  2201. and Cr data gets passed.
  2202. Output suspension is supported with raw-data compression: if the data
  2203. destination module suspends, jpeg_write_raw_data() will return 0.
  2204. In this case the same data rows must be passed again on the next call.
  2205. Decompression with raw data output implies bypassing all postprocessing.
  2206. You must deal with the color space and sampling factors present in the
  2207. incoming file. If your application only handles, say, 2h1v YCbCr data,
  2208. you must check for and fail on other color spaces or other sampling factors.
  2209. The library will not convert to a different color space for you.
  2210. To obtain raw data output, set cinfo->raw_data_out = TRUE before
  2211. jpeg_start_decompress() (it is set FALSE by jpeg_read_header()). Be sure to
  2212. verify that the color space and sampling factors are ones you can handle.
  2213. Furthermore, set cinfo->do_fancy_upsampling = FALSE if you want to get real
  2214. downsampled data (it is set TRUE by jpeg_read_header()).
  2215. Then call jpeg_read_raw_data() in place of jpeg_read_scanlines(). The
  2216. decompression process is otherwise the same as usual.
  2217. jpeg_read_raw_data() returns one MCU row per call, and thus you must pass a
  2218. buffer of at least max_v_samp_factor*DCTSIZE scanlines (scanline counting is
  2219. the same as for raw-data compression). The buffer you pass must be large
  2220. enough to hold the actual data plus padding to DCT-block boundaries. As with
  2221. compression, any entirely dummy DCT blocks are not processed so you need not
  2222. allocate space for them, but the total scanline count includes them. The
  2223. above example of computing buffer dimensions for raw-data compression is
  2224. equally valid for decompression.
  2225. Input suspension is supported with raw-data decompression: if the data source
  2226. module suspends, jpeg_read_raw_data() will return 0. You can also use
  2227. buffered-image mode to read raw data in multiple passes.
  2228. Really raw data: DCT coefficients
  2229. ---------------------------------
  2230. It is possible to read or write the contents of a JPEG file as raw DCT
  2231. coefficients. This facility is mainly intended for use in lossless
  2232. transcoding between different JPEG file formats. Other possible applications
  2233. include lossless cropping of a JPEG image, lossless reassembly of a
  2234. multi-strip or multi-tile TIFF/JPEG file into a single JPEG datastream, etc.
  2235. To read the contents of a JPEG file as DCT coefficients, open the file and do
  2236. jpeg_read_header() as usual. But instead of calling jpeg_start_decompress()
  2237. and jpeg_read_scanlines(), call jpeg_read_coefficients(). This will read the
  2238. entire image into a set of virtual coefficient-block arrays, one array per
  2239. component. The return value is a pointer to an array of virtual-array
  2240. descriptors. Each virtual array can be accessed directly using the JPEG
  2241. memory manager's access_virt_barray method (see Memory management, below,
  2242. and also read structure.txt's discussion of virtual array handling). Or,
  2243. for simple transcoding to a different JPEG file format, the array list can
  2244. just be handed directly to jpeg_write_coefficients().
  2245. Each block in the block arrays contains quantized coefficient values in
  2246. normal array order (not JPEG zigzag order). The block arrays contain only
  2247. DCT blocks containing real data; any entirely-dummy blocks added to fill out
  2248. interleaved MCUs at the right or bottom edges of the image are discarded
  2249. during reading and are not stored in the block arrays. (The size of each
  2250. block array can be determined from the width_in_blocks and height_in_blocks
  2251. fields of the component's comp_info entry.) This is also the data format
  2252. expected by jpeg_write_coefficients().
  2253. When you are done using the virtual arrays, call jpeg_finish_decompress()
  2254. to release the array storage and return the decompression object to an idle
  2255. state; or just call jpeg_destroy() if you don't need to reuse the object.
  2256. If you use a suspending data source, jpeg_read_coefficients() will return
  2257. NULL if it is forced to suspend; a non-NULL return value indicates successful
  2258. completion. You need not test for a NULL return value when using a
  2259. non-suspending data source.
  2260. It is also possible to call jpeg_read_coefficients() to obtain access to the
  2261. decoder's coefficient arrays during a normal decode cycle in buffered-image
  2262. mode. This frammish might be useful for progressively displaying an incoming
  2263. image and then re-encoding it without loss. To do this, decode in buffered-
  2264. image mode as discussed previously, then call jpeg_read_coefficients() after
  2265. the last jpeg_finish_output() call. The arrays will be available for your use
  2266. until you call jpeg_finish_decompress().
  2267. To write the contents of a JPEG file as DCT coefficients, you must provide
  2268. the DCT coefficients stored in virtual block arrays. You can either pass
  2269. block arrays read from an input JPEG file by jpeg_read_coefficients(), or
  2270. allocate virtual arrays from the JPEG compression object and fill them
  2271. yourself. In either case, jpeg_write_coefficients() is substituted for
  2272. jpeg_start_compress() and jpeg_write_scanlines(). Thus the sequence is
  2273. * Create compression object
  2274. * Set all compression parameters as necessary
  2275. * Request virtual arrays if needed
  2276. * jpeg_write_coefficients()
  2277. * jpeg_finish_compress()
  2278. * Destroy or re-use compression object
  2279. jpeg_write_coefficients() is passed a pointer to an array of virtual block
  2280. array descriptors; the number of arrays is equal to cinfo.num_components.
  2281. The virtual arrays need only have been requested, not realized, before
  2282. jpeg_write_coefficients() is called. A side-effect of
  2283. jpeg_write_coefficients() is to realize any virtual arrays that have been
  2284. requested from the compression object's memory manager. Thus, when obtaining
  2285. the virtual arrays from the compression object, you should fill the arrays
  2286. after calling jpeg_write_coefficients(). The data is actually written out
  2287. when you call jpeg_finish_compress(); jpeg_write_coefficients() only writes
  2288. the file header.
  2289. When writing raw DCT coefficients, it is crucial that the JPEG quantization
  2290. tables and sampling factors match the way the data was encoded, or the
  2291. resulting file will be invalid. For transcoding from an existing JPEG file,
  2292. we recommend using jpeg_copy_critical_parameters(). This routine initializes
  2293. all the compression parameters to default values (like jpeg_set_defaults()),
  2294. then copies the critical information from a source decompression object.
  2295. The decompression object should have just been used to read the entire
  2296. JPEG input file --- that is, it should be awaiting jpeg_finish_decompress().
  2297. jpeg_write_coefficients() marks all tables stored in the compression object
  2298. as needing to be written to the output file (thus, it acts like
  2299. jpeg_start_compress(cinfo, TRUE)). This is for safety's sake, to avoid
  2300. emitting abbreviated JPEG files by accident. If you really want to emit an
  2301. abbreviated JPEG file, call jpeg_suppress_tables(), or set the tables'
  2302. individual sent_table flags, between calling jpeg_write_coefficients() and
  2303. jpeg_finish_compress().
  2304. Progress monitoring
  2305. -------------------
  2306. Some applications may need to regain control from the JPEG library every so
  2307. often. The typical use of this feature is to produce a percent-done bar or
  2308. other progress display. (For a simple example, see cjpeg.c or djpeg.c.)
  2309. Although you do get control back frequently during the data-transferring pass
  2310. (the jpeg_read_scanlines or jpeg_write_scanlines loop), any additional passes
  2311. will occur inside jpeg_finish_compress or jpeg_start_decompress; those
  2312. routines may take a long time to execute, and you don't get control back
  2313. until they are done.
  2314. You can define a progress-monitor routine which will be called periodically
  2315. by the library. No guarantees are made about how often this call will occur,
  2316. so we don't recommend you use it for mouse tracking or anything like that.
  2317. At present, a call will occur once per MCU row, scanline, or sample row
  2318. group, whichever unit is convenient for the current processing mode; so the
  2319. wider the image, the longer the time between calls. During the data
  2320. transferring pass, only one call occurs per call of jpeg_read_scanlines or
  2321. jpeg_write_scanlines, so don't pass a large number of scanlines at once if
  2322. you want fine resolution in the progress count. (If you really need to use
  2323. the callback mechanism for time-critical tasks like mouse tracking, you could
  2324. insert additional calls inside some of the library's inner loops.)
  2325. To establish a progress-monitor callback, create a struct jpeg_progress_mgr,
  2326. fill in its progress_monitor field with a pointer to your callback routine,
  2327. and set cinfo->progress to point to the struct. The callback will be called
  2328. whenever cinfo->progress is non-NULL. (This pointer is set to NULL by
  2329. jpeg_create_compress or jpeg_create_decompress; the library will not change
  2330. it thereafter. So if you allocate dynamic storage for the progress struct,
  2331. make sure it will live as long as the JPEG object does. Allocating from the
  2332. JPEG memory manager with lifetime JPOOL_PERMANENT will work nicely.) You
  2333. can use the same callback routine for both compression and decompression.
  2334. The jpeg_progress_mgr struct contains four fields which are set by the library:
  2335. long pass_counter; /* work units completed in this pass */
  2336. long pass_limit; /* total number of work units in this pass */
  2337. int completed_passes; /* passes completed so far */
  2338. int total_passes; /* total number of passes expected */
  2339. During any one pass, pass_counter increases from 0 up to (not including)
  2340. pass_limit; the step size is usually but not necessarily 1. The pass_limit
  2341. value may change from one pass to another. The expected total number of
  2342. passes is in total_passes, and the number of passes already completed is in
  2343. completed_passes. Thus the fraction of work completed may be estimated as
  2344. completed_passes + (pass_counter/pass_limit)
  2345. --------------------------------------------
  2346. total_passes
  2347. ignoring the fact that the passes may not be equal amounts of work.
  2348. When decompressing, pass_limit can even change within a pass, because it
  2349. depends on the number of scans in the JPEG file, which isn't always known in
  2350. advance. The computed fraction-of-work-done may jump suddenly (if the library
  2351. discovers it has overestimated the number of scans) or even decrease (in the
  2352. opposite case). It is not wise to put great faith in the work estimate.
  2353. When using the decompressor's buffered-image mode, the progress monitor work
  2354. estimate is likely to be completely unhelpful, because the library has no way
  2355. to know how many output passes will be demanded of it. Currently, the library
  2356. sets total_passes based on the assumption that there will be one more output
  2357. pass if the input file end hasn't yet been read (jpeg_input_complete() isn't
  2358. TRUE), but no more output passes if the file end has been reached when the
  2359. output pass is started. This means that total_passes will rise as additional
  2360. output passes are requested. If you have a way of determining the input file
  2361. size, estimating progress based on the fraction of the file that's been read
  2362. will probably be more useful than using the library's value.
  2363. Memory management
  2364. -----------------
  2365. This section covers some key facts about the JPEG library's built-in memory
  2366. manager. For more info, please read structure.txt's section about the memory
  2367. manager, and consult the source code if necessary.
  2368. All memory and temporary file allocation within the library is done via the
  2369. memory manager. If necessary, you can replace the "back end" of the memory
  2370. manager to control allocation yourself (for example, if you don't want the
  2371. library to use malloc() and free() for some reason).
  2372. Some data is allocated "permanently" and will not be freed until the JPEG
  2373. object is destroyed. Most data is allocated "per image" and is freed by
  2374. jpeg_finish_compress, jpeg_finish_decompress, or jpeg_abort. You can call the
  2375. memory manager yourself to allocate structures that will automatically be
  2376. freed at these times. Typical code for this is
  2377. ptr = (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE, size);
  2378. Use JPOOL_PERMANENT to get storage that lasts as long as the JPEG object.
  2379. Use alloc_large instead of alloc_small for anything bigger than a few Kbytes.
  2380. There are also alloc_sarray and alloc_barray routines that automatically
  2381. build 2-D sample or block arrays.
  2382. The library's minimum space requirements to process an image depend on the
  2383. image's width, but not on its height, because the library ordinarily works
  2384. with "strip" buffers that are as wide as the image but just a few rows high.
  2385. Some operating modes (eg, two-pass color quantization) require full-image
  2386. buffers. Such buffers are treated as "virtual arrays": only the current strip
  2387. need be in memory, and the rest can be swapped out to a temporary file.
  2388. If you use the simplest memory manager back end (jmemnobs.c), then no
  2389. temporary files are used; virtual arrays are simply malloc()'d. Images bigger
  2390. than memory can be processed only if your system supports virtual memory.
  2391. The other memory manager back ends support temporary files of various flavors
  2392. and thus work in machines without virtual memory. They may also be useful on
  2393. Unix machines if you need to process images that exceed available swap space.
  2394. When using temporary files, the library will make the in-memory buffers for
  2395. its virtual arrays just big enough to stay within a "maximum memory" setting.
  2396. Your application can set this limit by setting cinfo->mem->max_memory_to_use
  2397. after creating the JPEG object. (Of course, there is still a minimum size for
  2398. the buffers, so the max-memory setting is effective only if it is bigger than
  2399. the minimum space needed.) If you allocate any large structures yourself, you
  2400. must allocate them before jpeg_start_compress() or jpeg_start_decompress() in
  2401. order to have them counted against the max memory limit. Also keep in mind
  2402. that space allocated with alloc_small() is ignored, on the assumption that
  2403. it's too small to be worth worrying about; so a reasonable safety margin
  2404. should be left when setting max_memory_to_use.
  2405. If you use the jmemname.c or jmemdos.c memory manager back end, it is
  2406. important to clean up the JPEG object properly to ensure that the temporary
  2407. files get deleted. (This is especially crucial with jmemdos.c, where the
  2408. "temporary files" may be extended-memory segments; if they are not freed,
  2409. DOS will require a reboot to recover the memory.) Thus, with these memory
  2410. managers, it's a good idea to provide a signal handler that will trap any
  2411. early exit from your program. The handler should call either jpeg_abort()
  2412. or jpeg_destroy() for any active JPEG objects. A handler is not needed with
  2413. jmemnobs.c, and shouldn't be necessary with jmemansi.c or jmemmac.c either,
  2414. since the C library is supposed to take care of deleting files made with
  2415. tmpfile().
  2416. Memory usage
  2417. ------------
  2418. Working memory requirements while performing compression or decompression
  2419. depend on image dimensions, image characteristics (such as colorspace and
  2420. JPEG process), and operating mode (application-selected options).
  2421. As of v6b, the decompressor requires:
  2422. 1. About 24K in more-or-less-fixed-size data. This varies a bit depending
  2423. on operating mode and image characteristics (particularly color vs.
  2424. grayscale), but it doesn't depend on image dimensions.
  2425. 2. Strip buffers (of size proportional to the image width) for IDCT and
  2426. upsampling results. The worst case for commonly used sampling factors
  2427. is about 34 bytes * width in pixels for a color image. A grayscale image
  2428. only needs about 8 bytes per pixel column.
  2429. 3. A full-image DCT coefficient buffer is needed to decode a multi-scan JPEG
  2430. file (including progressive JPEGs), or whenever you select buffered-image
  2431. mode. This takes 2 bytes/coefficient. At typical 2x2 sampling, that's
  2432. 3 bytes per pixel for a color image. Worst case (1x1 sampling) requires
  2433. 6 bytes/pixel. For grayscale, figure 2 bytes/pixel.
  2434. 4. To perform 2-pass color quantization, the decompressor also needs a
  2435. 128K color lookup table and a full-image pixel buffer (3 bytes/pixel).
  2436. This does not count any memory allocated by the application, such as a
  2437. buffer to hold the final output image.
  2438. The above figures are valid for 8-bit JPEG data precision and a machine with
  2439. 32-bit ints. For 12-bit JPEG data, double the size of the strip buffers and
  2440. quantization pixel buffer. The "fixed-size" data will be somewhat smaller
  2441. with 16-bit ints, larger with 64-bit ints. Also, CMYK or other unusual
  2442. color spaces will require different amounts of space.
  2443. The full-image coefficient and pixel buffers, if needed at all, do not
  2444. have to be fully RAM resident; you can have the library use temporary
  2445. files instead when the total memory usage would exceed a limit you set.
  2446. (But if your OS supports virtual memory, it's probably better to just use
  2447. jmemnobs and let the OS do the swapping.)
  2448. The compressor's memory requirements are similar, except that it has no need
  2449. for color quantization. Also, it needs a full-image DCT coefficient buffer
  2450. if Huffman-table optimization is asked for, even if progressive mode is not
  2451. requested.
  2452. If you need more detailed information about memory usage in a particular
  2453. situation, you can enable the MEM_STATS code in jmemmgr.c.
  2454. Library compile-time options
  2455. ----------------------------
  2456. A number of compile-time options are available by modifying jmorecfg.h.
  2457. The JPEG standard provides for both the baseline 8-bit DCT process and
  2458. a 12-bit DCT process. The IJG code supports 12-bit JPEG if you define
  2459. BITS_IN_JSAMPLE as 12 rather than 8. Note that this causes JSAMPLE to be
  2460. larger than a char, so it affects the surrounding application's image data.
  2461. The sample applications cjpeg and djpeg can support 12-bit mode only for PPM
  2462. and GIF file formats; you must disable the other file formats to compile a
  2463. 12-bit cjpeg or djpeg. (install.txt has more information about that.)
  2464. At present, a 12-bit library can handle *only* 12-bit images, not both
  2465. precisions. (If you need to include both 8- and 12-bit libraries in a single
  2466. application, you could probably do it by defining NEED_SHORT_EXTERNAL_NAMES
  2467. for just one of the copies. You'd have to access the 8-bit and 12-bit copies
  2468. from separate application source files. This is untested ... if you try it,
  2469. we'd like to hear whether it works!)
  2470. Note that a 12-bit library always compresses in Huffman optimization mode,
  2471. in order to generate valid Huffman tables. This is necessary because our
  2472. default Huffman tables only cover 8-bit data. If you need to output 12-bit
  2473. files in one pass, you'll have to supply suitable default Huffman tables.
  2474. You may also want to supply your own DCT quantization tables; the existing
  2475. quality-scaling code has been developed for 8-bit use, and probably doesn't
  2476. generate especially good tables for 12-bit.
  2477. The maximum number of components (color channels) in the image is determined
  2478. by MAX_COMPONENTS. The JPEG standard allows up to 255 components, but we
  2479. expect that few applications will need more than four or so.
  2480. On machines with unusual data type sizes, you may be able to improve
  2481. performance or reduce memory space by tweaking the various typedefs in
  2482. jmorecfg.h. In particular, on some RISC CPUs, access to arrays of "short"s
  2483. is quite slow; consider trading memory for speed by making JCOEF, INT16, and
  2484. UINT16 be "int" or "unsigned int". UINT8 is also a candidate to become int.
  2485. You probably don't want to make JSAMPLE be int unless you have lots of memory
  2486. to burn.
  2487. You can reduce the size of the library by compiling out various optional
  2488. functions. To do this, undefine xxx_SUPPORTED symbols as necessary.
  2489. You can also save a few K by not having text error messages in the library;
  2490. the standard error message table occupies about 5Kb. This is particularly
  2491. reasonable for embedded applications where there's no good way to display
  2492. a message anyway. To do this, remove the creation of the message table
  2493. (jpeg_std_message_table[]) from jerror.c, and alter format_message to do
  2494. something reasonable without it. You could output the numeric value of the
  2495. message code number, for example. If you do this, you can also save a couple
  2496. more K by modifying the TRACEMSn() macros in jerror.h to expand to nothing;
  2497. you don't need trace capability anyway, right?
  2498. Portability considerations
  2499. --------------------------
  2500. The JPEG library has been written to be extremely portable; the sample
  2501. applications cjpeg and djpeg are slightly less so. This section summarizes
  2502. the design goals in this area. (If you encounter any bugs that cause the
  2503. library to be less portable than is claimed here, we'd appreciate hearing
  2504. about them.)
  2505. The code works fine on ANSI C, C++, and pre-ANSI C compilers, using any of
  2506. the popular system include file setups, and some not-so-popular ones too.
  2507. See install.txt for configuration procedures.
  2508. The code is not dependent on the exact sizes of the C data types. As
  2509. distributed, we make the assumptions that
  2510. char is at least 8 bits wide
  2511. short is at least 16 bits wide
  2512. int is at least 16 bits wide
  2513. long is at least 32 bits wide
  2514. (These are the minimum requirements of the ANSI C standard.) Wider types will
  2515. work fine, although memory may be used inefficiently if char is much larger
  2516. than 8 bits or short is much bigger than 16 bits. The code should work
  2517. equally well with 16- or 32-bit ints.
  2518. In a system where these assumptions are not met, you may be able to make the
  2519. code work by modifying the typedefs in jmorecfg.h. However, you will probably
  2520. have difficulty if int is less than 16 bits wide, since references to plain
  2521. int abound in the code.
  2522. char can be either signed or unsigned, although the code runs faster if an
  2523. unsigned char type is available. If char is wider than 8 bits, you will need
  2524. to redefine JOCTET and/or provide custom data source/destination managers so
  2525. that JOCTET represents exactly 8 bits of data on external storage.
  2526. The JPEG library proper does not assume ASCII representation of characters.
  2527. But some of the image file I/O modules in cjpeg/djpeg do have ASCII
  2528. dependencies in file-header manipulation; so does cjpeg's select_file_type()
  2529. routine.
  2530. The JPEG library does not rely heavily on the C library. In particular, C
  2531. stdio is used only by the data source/destination modules and the error
  2532. handler, all of which are application-replaceable. (cjpeg/djpeg are more
  2533. heavily dependent on stdio.) malloc and free are called only from the memory
  2534. manager "back end" module, so you can use a different memory allocator by
  2535. replacing that one file.
  2536. The code generally assumes that C names must be unique in the first 15
  2537. characters. However, global function names can be made unique in the
  2538. first 6 characters by defining NEED_SHORT_EXTERNAL_NAMES.
  2539. More info about porting the code may be gleaned by reading jconfig.txt,
  2540. jmorecfg.h, and jinclude.h.
  2541. Notes for MS-DOS implementors
  2542. -----------------------------
  2543. The IJG code is designed to work efficiently in 80x86 "small" or "medium"
  2544. memory models (i.e., data pointers are 16 bits unless explicitly declared
  2545. "far"; code pointers can be either size). You may be able to use small
  2546. model to compile cjpeg or djpeg by itself, but you will probably have to use
  2547. medium model for any larger application. This won't make much difference in
  2548. performance. You *will* take a noticeable performance hit if you use a
  2549. large-data memory model (perhaps 10%-25%), and you should avoid "huge" model
  2550. if at all possible.
  2551. The JPEG library typically needs 2Kb-3Kb of stack space. It will also
  2552. malloc about 20K-30K of near heap space while executing (and lots of far
  2553. heap, but that doesn't count in this calculation). This figure will vary
  2554. depending on selected operating mode, and to a lesser extent on image size.
  2555. There is also about 5Kb-6Kb of constant data which will be allocated in the
  2556. near data segment (about 4Kb of this is the error message table).
  2557. Thus you have perhaps 20K available for other modules' static data and near
  2558. heap space before you need to go to a larger memory model. The C library's
  2559. static data will account for several K of this, but that still leaves a good
  2560. deal for your needs. (If you are tight on space, you could reduce the sizes
  2561. of the I/O buffers allocated by jdatasrc.c and jdatadst.c, say from 4K to
  2562. 1K. Another possibility is to move the error message table to far memory;
  2563. this should be doable with only localized hacking on jerror.c.)
  2564. About 2K of the near heap space is "permanent" memory that will not be
  2565. released until you destroy the JPEG object. This is only an issue if you
  2566. save a JPEG object between compression or decompression operations.
  2567. Far data space may also be a tight resource when you are dealing with large
  2568. images. The most memory-intensive case is decompression with two-pass color
  2569. quantization, or single-pass quantization to an externally supplied color
  2570. map. This requires a 128Kb color lookup table plus strip buffers amounting
  2571. to about 40 bytes per column for typical sampling ratios (eg, about 25600
  2572. bytes for a 640-pixel-wide image). You may not be able to process wide
  2573. images if you have large data structures of your own.
  2574. Of course, all of these concerns vanish if you use a 32-bit flat-memory-model
  2575. compiler, such as DJGPP or Watcom C. We highly recommend flat model if you
  2576. can use it; the JPEG library is significantly faster in flat model.