|
0
|
1 /* stbi-1.33 - public domain JPEG/PNG reader - http://nothings.org/stb_image.c
|
|
|
2 when you control the images you're loading
|
|
|
3 no warranty implied; use at your own risk
|
|
|
4
|
|
|
5 QUICK NOTES:
|
|
|
6 Primarily of interest to game developers and other people who can
|
|
|
7 avoid problematic images and only need the trivial interface
|
|
|
8
|
|
|
9 JPEG baseline (no JPEG progressive)
|
|
|
10 PNG 8-bit only
|
|
|
11
|
|
|
12 TGA (not sure what subset, if a subset)
|
|
|
13 BMP non-1bpp, non-RLE
|
|
|
14 PSD (composited view only, no extra channels)
|
|
|
15
|
|
|
16 GIF (*comp always reports as 4-channel)
|
|
|
17 HDR (radiance rgbE format)
|
|
|
18 PIC (Softimage PIC)
|
|
|
19
|
|
|
20 - decode from memory or through FILE (define STBI_NO_STDIO to remove code)
|
|
|
21 - decode from arbitrary I/O callbacks
|
|
|
22 - overridable dequantizing-IDCT, YCbCr-to-RGB conversion (define STBI_SIMD)
|
|
|
23
|
|
|
24 Latest revisions:
|
|
|
25 1.33 (2011-07-14) minor fixes suggested by Dave Moore
|
|
|
26 1.32 (2011-07-13) info support for all filetypes (SpartanJ)
|
|
|
27 1.31 (2011-06-19) a few more leak fixes, bug in PNG handling (SpartanJ)
|
|
|
28 1.30 (2011-06-11) added ability to load files via io callbacks (Ben Wenger)
|
|
|
29 1.29 (2010-08-16) various warning fixes from Aurelien Pocheville
|
|
|
30 1.28 (2010-08-01) fix bug in GIF palette transparency (SpartanJ)
|
|
|
31 1.27 (2010-08-01) cast-to-uint8 to fix warnings (Laurent Gomila)
|
|
|
32 allow trailing 0s at end of image data (Laurent Gomila)
|
|
|
33 1.26 (2010-07-24) fix bug in file buffering for PNG reported by SpartanJ
|
|
|
34
|
|
|
35 See end of file for full revision history.
|
|
|
36
|
|
|
37 TODO:
|
|
|
38 stbi_info support for BMP,PSD,HDR,PIC
|
|
|
39
|
|
|
40
|
|
|
41 ============================ Contributors =========================
|
|
|
42
|
|
|
43 Image formats Optimizations & bugfixes
|
|
|
44 Sean Barrett (jpeg, png, bmp) Fabian "ryg" Giesen
|
|
|
45 Nicolas Schulz (hdr, psd)
|
|
|
46 Jonathan Dummer (tga) Bug fixes & warning fixes
|
|
|
47 Jean-Marc Lienher (gif) Marc LeBlanc
|
|
|
48 Tom Seddon (pic) Christpher Lloyd
|
|
|
49 Thatcher Ulrich (psd) Dave Moore
|
|
|
50 Won Chun
|
|
|
51 the Horde3D community
|
|
|
52 Extensions, features Janez Zemva
|
|
|
53 Jetro Lauha (stbi_info) Jonathan Blow
|
|
|
54 James "moose2000" Brown (iPhone PNG) Laurent Gomila
|
|
|
55 Ben "Disch" Wenger (io callbacks) Aruelien Pocheville
|
|
|
56 Martin "SpartanJ" Golini Ryamond Barbiero
|
|
|
57 David Woo
|
|
|
58
|
|
|
59
|
|
|
60 If your name should be here but isn't, let Sean know.
|
|
|
61
|
|
|
62 */
|
|
|
63
|
|
|
64 #ifndef STBI_INCLUDE_STB_IMAGE_H
|
|
|
65 #define STBI_INCLUDE_STB_IMAGE_H
|
|
|
66
|
|
|
67 // To get a header file for this, either cut and paste the header,
|
|
|
68 // or create stb_image.h, #define STBI_HEADER_FILE_ONLY, and
|
|
|
69 // then include stb_image.c from it.
|
|
|
70
|
|
|
71 //// begin header file ////////////////////////////////////////////////////
|
|
|
72 //
|
|
|
73 // Limitations:
|
|
|
74 // - no jpeg progressive support
|
|
|
75 // - non-HDR formats support 8-bit samples only (jpeg, png)
|
|
|
76 // - no delayed line count (jpeg) -- IJG doesn't support either
|
|
|
77 // - no 1-bit BMP
|
|
|
78 // - GIF always returns *comp=4
|
|
|
79 //
|
|
|
80 // Basic usage (see HDR discussion below):
|
|
|
81 // int x,y,n;
|
|
|
82 // unsigned char *data = stbi_load(filename, &x, &y, &n, 0);
|
|
|
83 // // ... process data if not NULL ...
|
|
|
84 // // ... x = width, y = height, n = # 8-bit components per pixel ...
|
|
|
85 // // ... replace '0' with '1'..'4' to force that many components per pixel
|
|
|
86 // // ... but 'n' will always be the number that it would have been if you said 0
|
|
|
87 // stbi_image_free(data)
|
|
|
88 //
|
|
|
89 // Standard parameters:
|
|
|
90 // int *x -- outputs image width in pixels
|
|
|
91 // int *y -- outputs image height in pixels
|
|
|
92 // int *comp -- outputs # of image components in image file
|
|
|
93 // int req_comp -- if non-zero, # of image components requested in result
|
|
|
94 //
|
|
|
95 // The return value from an image loader is an 'unsigned char *' which points
|
|
|
96 // to the pixel data. The pixel data consists of *y scanlines of *x pixels,
|
|
|
97 // with each pixel consisting of N interleaved 8-bit components; the first
|
|
|
98 // pixel pointed to is top-left-most in the image. There is no padding between
|
|
|
99 // image scanlines or between pixels, regardless of format. The number of
|
|
|
100 // components N is 'req_comp' if req_comp is non-zero, or *comp otherwise.
|
|
|
101 // If req_comp is non-zero, *comp has the number of components that _would_
|
|
|
102 // have been output otherwise. E.g. if you set req_comp to 4, you will always
|
|
|
103 // get RGBA output, but you can check *comp to easily see if it's opaque.
|
|
|
104 //
|
|
|
105 // An output image with N components has the following components interleaved
|
|
|
106 // in this order in each pixel:
|
|
|
107 //
|
|
|
108 // N=#comp components
|
|
|
109 // 1 grey
|
|
|
110 // 2 grey, alpha
|
|
|
111 // 3 red, green, blue
|
|
|
112 // 4 red, green, blue, alpha
|
|
|
113 //
|
|
|
114 // If image loading fails for any reason, the return value will be NULL,
|
|
|
115 // and *x, *y, *comp will be unchanged. The function stbi_failure_reason()
|
|
|
116 // can be queried for an extremely brief, end-user unfriendly explanation
|
|
|
117 // of why the load failed. Define STBI_NO_FAILURE_STRINGS to avoid
|
|
|
118 // compiling these strings at all, and STBI_FAILURE_USERMSG to get slightly
|
|
|
119 // more user-friendly ones.
|
|
|
120 //
|
|
|
121 // Paletted PNG, BMP, GIF, and PIC images are automatically depalettized.
|
|
|
122 //
|
|
|
123 // ===========================================================================
|
|
|
124 //
|
|
|
125 // iPhone PNG support:
|
|
|
126 //
|
|
|
127 // By default we convert iphone-formatted PNGs back to RGB; nominally they
|
|
|
128 // would silently load as BGR, except the existing code should have just
|
|
|
129 // failed on such iPhone PNGs. But you can disable this conversion by
|
|
|
130 // by calling stbi_convert_iphone_png_to_rgb(0), in which case
|
|
|
131 // you will always just get the native iphone "format" through.
|
|
|
132 //
|
|
|
133 // Call stbi_set_unpremultiply_on_load(1) as well to force a divide per
|
|
|
134 // pixel to remove any premultiplied alpha *only* if the image file explicitly
|
|
|
135 // says there's premultiplied data (currently only happens in iPhone images,
|
|
|
136 // and only if iPhone convert-to-rgb processing is on).
|
|
|
137 //
|
|
|
138 // ===========================================================================
|
|
|
139 //
|
|
|
140 // HDR image support (disable by defining STBI_NO_HDR)
|
|
|
141 //
|
|
|
142 // stb_image now supports loading HDR images in general, and currently
|
|
|
143 // the Radiance .HDR file format, although the support is provided
|
|
|
144 // generically. You can still load any file through the existing interface;
|
|
|
145 // if you attempt to load an HDR file, it will be automatically remapped to
|
|
|
146 // LDR, assuming gamma 2.2 and an arbitrary scale factor defaulting to 1;
|
|
|
147 // both of these constants can be reconfigured through this interface:
|
|
|
148 //
|
|
|
149 // stbi_hdr_to_ldr_gamma(2.2f);
|
|
|
150 // stbi_hdr_to_ldr_scale(1.0f);
|
|
|
151 //
|
|
|
152 // (note, do not use _inverse_ constants; stbi_image will invert them
|
|
|
153 // appropriately).
|
|
|
154 //
|
|
|
155 // Additionally, there is a new, parallel interface for loading files as
|
|
|
156 // (linear) floats to preserve the full dynamic range:
|
|
|
157 //
|
|
|
158 // float *data = stbi_loadf(filename, &x, &y, &n, 0);
|
|
|
159 //
|
|
|
160 // If you load LDR images through this interface, those images will
|
|
|
161 // be promoted to floating point values, run through the inverse of
|
|
|
162 // constants corresponding to the above:
|
|
|
163 //
|
|
|
164 // stbi_ldr_to_hdr_scale(1.0f);
|
|
|
165 // stbi_ldr_to_hdr_gamma(2.2f);
|
|
|
166 //
|
|
|
167 // Finally, given a filename (or an open file or memory block--see header
|
|
|
168 // file for details) containing image data, you can query for the "most
|
|
|
169 // appropriate" interface to use (that is, whether the image is HDR or
|
|
|
170 // not), using:
|
|
|
171 //
|
|
|
172 // stbi_is_hdr(char *filename);
|
|
|
173 //
|
|
|
174 // ===========================================================================
|
|
|
175 //
|
|
|
176 // I/O callbacks
|
|
|
177 //
|
|
|
178 // I/O callbacks allow you to read from arbitrary sources, like packaged
|
|
|
179 // files or some other source. Data read from callbacks are processed
|
|
|
180 // through a small internal buffer (currently 128 bytes) to try to reduce
|
|
|
181 // overhead.
|
|
|
182 //
|
|
|
183 // The three functions you must define are "read" (reads some bytes of data),
|
|
|
184 // "skip" (skips some bytes of data), "eof" (reports if the stream is at the end).
|
|
|
185
|
|
|
186
|
|
|
187 #ifndef STBI_NO_STDIO
|
|
|
188
|
|
|
189 #if defined(_MSC_VER) && _MSC_VER >= 0x1400
|
|
|
190 #define _CRT_SECURE_NO_WARNINGS // suppress bogus warnings about fopen()
|
|
|
191 #endif
|
|
|
192
|
|
|
193 #include <stdio.h>
|
|
|
194 #endif
|
|
|
195
|
|
|
196 #define STBI_VERSION 1
|
|
|
197
|
|
|
198 enum
|
|
|
199 {
|
|
|
200 STBI_default = 0, // only used for req_comp
|
|
|
201
|
|
|
202 STBI_grey = 1,
|
|
|
203 STBI_grey_alpha = 2,
|
|
|
204 STBI_rgb = 3,
|
|
|
205 STBI_rgb_alpha = 4
|
|
|
206 };
|
|
|
207
|
|
|
208 typedef unsigned char stbi_uc;
|
|
|
209
|
|
|
210 #ifdef __cplusplus
|
|
|
211 extern "C" {
|
|
|
212 #endif
|
|
|
213
|
|
|
214 //////////////////////////////////////////////////////////////////////////////
|
|
|
215 //
|
|
|
216 // PRIMARY API - works on images of any type
|
|
|
217 //
|
|
|
218
|
|
|
219 //
|
|
|
220 // load image by filename, open file, or memory buffer
|
|
|
221 //
|
|
|
222
|
|
|
223 extern stbi_uc *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
|
|
|
224
|
|
|
225 #ifndef STBI_NO_STDIO
|
|
|
226 extern stbi_uc *stbi_load (char const *filename, int *x, int *y, int *comp, int req_comp);
|
|
|
227 extern stbi_uc *stbi_load_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
|
|
|
228 // for stbi_load_from_file, file pointer is left pointing immediately after image
|
|
|
229 #endif
|
|
|
230
|
|
|
231 typedef struct
|
|
|
232 {
|
|
|
233 int (*read) (void *user,char *data,int size); // fill 'data' with 'size' bytes. return number of bytes actually read
|
|
|
234 void (*skip) (void *user,unsigned n); // skip the next 'n' bytes
|
|
|
235 int (*eof) (void *user); // returns nonzero if we are at end of file/data
|
|
|
236 } stbi_io_callbacks;
|
|
|
237
|
|
|
238 extern stbi_uc *stbi_load_from_callbacks (stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp);
|
|
|
239
|
|
|
240 #ifndef STBI_NO_HDR
|
|
|
241 extern float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp);
|
|
|
242
|
|
|
243 #ifndef STBI_NO_STDIO
|
|
|
244 extern float *stbi_loadf (char const *filename, int *x, int *y, int *comp, int req_comp);
|
|
|
245 extern float *stbi_loadf_from_file (FILE *f, int *x, int *y, int *comp, int req_comp);
|
|
|
246 #endif
|
|
|
247
|
|
|
248 extern float *stbi_loadf_from_callbacks (stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp);
|
|
|
249
|
|
|
250 extern void stbi_hdr_to_ldr_gamma(float gamma);
|
|
|
251 extern void stbi_hdr_to_ldr_scale(float scale);
|
|
|
252
|
|
|
253 extern void stbi_ldr_to_hdr_gamma(float gamma);
|
|
|
254 extern void stbi_ldr_to_hdr_scale(float scale);
|
|
|
255 #endif // STBI_NO_HDR
|
|
|
256
|
|
|
257 // stbi_is_hdr is always defined
|
|
|
258 extern int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clbk, void *user);
|
|
|
259 extern int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len);
|
|
|
260 #ifndef STBI_NO_STDIO
|
|
|
261 extern int stbi_is_hdr (char const *filename);
|
|
|
262 extern int stbi_is_hdr_from_file(FILE *f);
|
|
|
263 #endif // STBI_NO_STDIO
|
|
|
264
|
|
|
265
|
|
|
266 // get a VERY brief reason for failure
|
|
|
267 // NOT THREADSAFE
|
|
|
268 extern const char *stbi_failure_reason (void);
|
|
|
269
|
|
|
270 // free the loaded image -- this is just free()
|
|
|
271 extern void stbi_image_free (void *retval_from_stbi_load);
|
|
|
272
|
|
|
273 // get image dimensions & components without fully decoding
|
|
|
274 extern int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp);
|
|
|
275 extern int stbi_info_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp);
|
|
|
276
|
|
|
277 #ifndef STBI_NO_STDIO
|
|
|
278 extern int stbi_info (char const *filename, int *x, int *y, int *comp);
|
|
|
279 extern int stbi_info_from_file (FILE *f, int *x, int *y, int *comp);
|
|
|
280
|
|
|
281 #endif
|
|
|
282
|
|
|
283
|
|
|
284
|
|
|
285 // for image formats that explicitly notate that they have premultiplied alpha,
|
|
|
286 // we just return the colors as stored in the file. set this flag to force
|
|
|
287 // unpremultiplication. results are undefined if the unpremultiply overflow.
|
|
|
288 extern void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpremultiply);
|
|
|
289
|
|
|
290 // indicate whether we should process iphone images back to canonical format,
|
|
|
291 // or just pass them through "as-is"
|
|
|
292 extern void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_convert);
|
|
|
293
|
|
|
294
|
|
|
295 // ZLIB client - used by PNG, available for other purposes
|
|
|
296
|
|
|
297 extern char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen);
|
|
|
298 extern char *stbi_zlib_decode_malloc(const char *buffer, int len, int *outlen);
|
|
|
299 extern int stbi_zlib_decode_buffer(char *obuffer, int olen, const char *ibuffer, int ilen);
|
|
|
300
|
|
|
301 extern char *stbi_zlib_decode_noheader_malloc(const char *buffer, int len, int *outlen);
|
|
|
302 extern int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen);
|
|
|
303
|
|
|
304
|
|
|
305 // define faster low-level operations (typically SIMD support)
|
|
|
306 #ifdef STBI_SIMD
|
|
|
307 typedef void (*stbi_idct_8x8)(stbi_uc *out, int out_stride, short data[64], unsigned short *dequantize);
|
|
|
308 // compute an integer IDCT on "input"
|
|
|
309 // input[x] = data[x] * dequantize[x]
|
|
|
310 // write results to 'out': 64 samples, each run of 8 spaced by 'out_stride'
|
|
|
311 // CLAMP results to 0..255
|
|
|
312 typedef void (*stbi_YCbCr_to_RGB_run)(stbi_uc *output, stbi_uc const *y, stbi_uc const *cb, stbi_uc const *cr, int count, int step);
|
|
|
313 // compute a conversion from YCbCr to RGB
|
|
|
314 // 'count' pixels
|
|
|
315 // write pixels to 'output'; each pixel is 'step' bytes (either 3 or 4; if 4, write '255' as 4th), order R,G,B
|
|
|
316 // y: Y input channel
|
|
|
317 // cb: Cb input channel; scale/biased to be 0..255
|
|
|
318 // cr: Cr input channel; scale/biased to be 0..255
|
|
|
319
|
|
|
320 extern void stbi_install_idct(stbi_idct_8x8 func);
|
|
|
321 extern void stbi_install_YCbCr_to_RGB(stbi_YCbCr_to_RGB_run func);
|
|
|
322 #endif // STBI_SIMD
|
|
|
323
|
|
|
324
|
|
|
325 #ifdef __cplusplus
|
|
|
326 }
|
|
|
327 #endif
|
|
|
328
|
|
|
329 //
|
|
|
330 //
|
|
|
331 //// end header file /////////////////////////////////////////////////////
|
|
|
332 #endif // STBI_INCLUDE_STB_IMAGE_H
|
|
|
333
|
|
|
334 #ifndef STBI_HEADER_FILE_ONLY
|
|
|
335
|
|
|
336 #ifndef STBI_NO_HDR
|
|
|
337 #include <math.h> // ldexp
|
|
|
338 #include <string.h> // strcmp, strtok
|
|
|
339 #endif
|
|
|
340
|
|
|
341 #ifndef STBI_NO_STDIO
|
|
|
342 #include <stdio.h>
|
|
|
343 #endif
|
|
|
344 #include <stdlib.h>
|
|
|
345 #include <memory.h>
|
|
|
346 #include <assert.h>
|
|
|
347 #include <stdarg.h>
|
|
|
348
|
|
|
349 #ifndef _MSC_VER
|
|
|
350 #ifdef __cplusplus
|
|
|
351 #define stbi_inline inline
|
|
|
352 #else
|
|
|
353 #define stbi_inline
|
|
|
354 #endif
|
|
|
355 #else
|
|
|
356 #define stbi_inline __forceinline
|
|
|
357 #endif
|
|
|
358
|
|
|
359
|
|
|
360 // implementation:
|
|
|
361 typedef unsigned char uint8;
|
|
|
362 typedef unsigned short uint16;
|
|
|
363 typedef signed short int16;
|
|
|
364 typedef unsigned int uint32;
|
|
|
365 typedef signed int int32;
|
|
|
366 typedef unsigned int uint;
|
|
|
367
|
|
|
368 // should produce compiler error if size is wrong
|
|
|
369 typedef unsigned char validate_uint32[sizeof(uint32)==4 ? 1 : -1];
|
|
|
370
|
|
|
371 #if defined(STBI_NO_STDIO) && !defined(STBI_NO_WRITE)
|
|
|
372 #define STBI_NO_WRITE
|
|
|
373 #endif
|
|
|
374
|
|
|
375 #define STBI_NOTUSED(v) (void)sizeof(v)
|
|
|
376
|
|
|
377 #ifdef _MSC_VER
|
|
|
378 #define STBI_HAS_LROTL
|
|
|
379 #endif
|
|
|
380
|
|
|
381 #ifdef STBI_HAS_LROTL
|
|
|
382 #define stbi_lrot(x,y) _lrotl(x,y)
|
|
|
383 #else
|
|
|
384 #define stbi_lrot(x,y) (((x) << (y)) | ((x) >> (32 - (y))))
|
|
|
385 #endif
|
|
|
386
|
|
|
387 ///////////////////////////////////////////////
|
|
|
388 //
|
|
|
389 // stbi struct and start_xxx functions
|
|
|
390
|
|
|
391 // stbi structure is our basic context used by all images, so it
|
|
|
392 // contains all the IO context, plus some basic image information
|
|
|
393 typedef struct
|
|
|
394 {
|
|
|
395 uint32 img_x, img_y;
|
|
|
396 int img_n, img_out_n;
|
|
|
397
|
|
|
398 stbi_io_callbacks io;
|
|
|
399 void *io_user_data;
|
|
|
400
|
|
|
401 int read_from_callbacks;
|
|
|
402 int buflen;
|
|
|
403 uint8 buffer_start[128];
|
|
|
404
|
|
|
405 uint8 *img_buffer, *img_buffer_end;
|
|
|
406 uint8 *img_buffer_original;
|
|
|
407 } stbi;
|
|
|
408
|
|
|
409
|
|
|
410 static void refill_buffer(stbi *s);
|
|
|
411
|
|
|
412 // initialize a memory-decode context
|
|
|
413 static void start_mem(stbi *s, uint8 const *buffer, int len)
|
|
|
414 {
|
|
|
415 s->io.read = NULL;
|
|
|
416 s->read_from_callbacks = 0;
|
|
|
417 s->img_buffer = s->img_buffer_original = (uint8 *) buffer;
|
|
|
418 s->img_buffer_end = (uint8 *) buffer+len;
|
|
|
419 }
|
|
|
420
|
|
|
421 // initialize a callback-based context
|
|
|
422 static void start_callbacks(stbi *s, stbi_io_callbacks *c, void *user)
|
|
|
423 {
|
|
|
424 s->io = *c;
|
|
|
425 s->io_user_data = user;
|
|
|
426 s->buflen = sizeof(s->buffer_start);
|
|
|
427 s->read_from_callbacks = 1;
|
|
|
428 s->img_buffer_original = s->buffer_start;
|
|
|
429 refill_buffer(s);
|
|
|
430 }
|
|
|
431
|
|
|
432 #ifndef STBI_NO_STDIO
|
|
|
433
|
|
|
434 static int stdio_read(void *user, char *data, int size)
|
|
|
435 {
|
|
|
436 return (int) fread(data,1,size,(FILE*) user);
|
|
|
437 }
|
|
|
438
|
|
|
439 static void stdio_skip(void *user, unsigned n)
|
|
|
440 {
|
|
|
441 fseek((FILE*) user, n, SEEK_CUR);
|
|
|
442 }
|
|
|
443
|
|
|
444 static int stdio_eof(void *user)
|
|
|
445 {
|
|
|
446 return feof((FILE*) user);
|
|
|
447 }
|
|
|
448
|
|
|
449 static stbi_io_callbacks stbi_stdio_callbacks =
|
|
|
450 {
|
|
|
451 stdio_read,
|
|
|
452 stdio_skip,
|
|
|
453 stdio_eof,
|
|
|
454 };
|
|
|
455
|
|
|
456 static void start_file(stbi *s, FILE *f)
|
|
|
457 {
|
|
|
458 start_callbacks(s, &stbi_stdio_callbacks, (void *) f);
|
|
|
459 }
|
|
|
460
|
|
|
461 //static void stop_file(stbi *s) { }
|
|
|
462
|
|
|
463 #endif // !STBI_NO_STDIO
|
|
|
464
|
|
|
465 static void stbi_rewind(stbi *s)
|
|
|
466 {
|
|
|
467 // conceptually rewind SHOULD rewind to the beginning of the stream,
|
|
|
468 // but we just rewind to the beginning of the initial buffer, because
|
|
|
469 // we only use it after doing 'test', which only ever looks at at most 92 bytes
|
|
|
470 s->img_buffer = s->img_buffer_original;
|
|
|
471 }
|
|
|
472
|
|
|
473 static int stbi_jpeg_test(stbi *s);
|
|
|
474 static stbi_uc *stbi_jpeg_load(stbi *s, int *x, int *y, int *comp, int req_comp);
|
|
|
475 static int stbi_jpeg_info(stbi *s, int *x, int *y, int *comp);
|
|
|
476 static int stbi_png_test(stbi *s);
|
|
|
477 static stbi_uc *stbi_png_load(stbi *s, int *x, int *y, int *comp, int req_comp);
|
|
|
478 static int stbi_png_info(stbi *s, int *x, int *y, int *comp);
|
|
|
479 #ifdef STBI_CRAP_FORMATS
|
|
|
480 static int stbi_bmp_test(stbi *s);
|
|
|
481 static stbi_uc *stbi_bmp_load(stbi *s, int *x, int *y, int *comp, int req_comp);
|
|
|
482 static int stbi_tga_test(stbi *s);
|
|
|
483 static stbi_uc *stbi_tga_load(stbi *s, int *x, int *y, int *comp, int req_comp);
|
|
|
484 static int stbi_tga_info(stbi *s, int *x, int *y, int *comp);
|
|
|
485 static int stbi_psd_test(stbi *s);
|
|
|
486 static stbi_uc *stbi_psd_load(stbi *s, int *x, int *y, int *comp, int req_comp);
|
|
|
487 static int stbi_pic_test(stbi *s);
|
|
|
488 static stbi_uc *stbi_pic_load(stbi *s, int *x, int *y, int *comp, int req_comp);
|
|
|
489 static int stbi_gif_test(stbi *s);
|
|
|
490 static stbi_uc *stbi_gif_load(stbi *s, int *x, int *y, int *comp, int req_comp);
|
|
|
491 static int stbi_gif_info(stbi *s, int *x, int *y, int *comp);
|
|
|
492 #endif
|
|
|
493
|
|
|
494 #ifndef STBI_NO_HDR
|
|
|
495 static int stbi_hdr_test(stbi *s);
|
|
|
496 static float *stbi_hdr_load(stbi *s, int *x, int *y, int *comp, int req_comp);
|
|
|
497 #endif
|
|
|
498
|
|
|
499 // this is not threadsafe
|
|
|
500 static const char *failure_reason;
|
|
|
501
|
|
|
502 const char *stbi_failure_reason(void)
|
|
|
503 {
|
|
|
504 return failure_reason;
|
|
|
505 }
|
|
|
506
|
|
|
507 static int e(const char *str)
|
|
|
508 {
|
|
|
509 failure_reason = str;
|
|
|
510 return 0;
|
|
|
511 }
|
|
|
512
|
|
|
513 // e - error
|
|
|
514 // epf - error returning pointer to float
|
|
|
515 // epuc - error returning pointer to unsigned char
|
|
|
516
|
|
|
517 #ifdef STBI_NO_FAILURE_STRINGS
|
|
|
518 #define e(x,y) 0
|
|
|
519 #elif defined(STBI_FAILURE_USERMSG)
|
|
|
520 #define e(x,y) e(y)
|
|
|
521 #else
|
|
|
522 #define e(x,y) e(x)
|
|
|
523 #endif
|
|
|
524
|
|
|
525 #define epf(x,y) ((float *) (e(x,y)?NULL:NULL))
|
|
|
526 #define epuc(x,y) ((unsigned char *) (e(x,y)?NULL:NULL))
|
|
|
527
|
|
|
528 void stbi_image_free(void *retval_from_stbi_load)
|
|
|
529 {
|
|
|
530 free(retval_from_stbi_load);
|
|
|
531 }
|
|
|
532
|
|
|
533 #ifndef STBI_NO_HDR
|
|
|
534 static float *ldr_to_hdr(stbi_uc *data, int x, int y, int comp);
|
|
|
535 static stbi_uc *hdr_to_ldr(float *data, int x, int y, int comp);
|
|
|
536 #endif
|
|
|
537
|
|
|
538 static unsigned char *stbi_load_main(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
539 {
|
|
|
540 if (stbi_jpeg_test(s)) return stbi_jpeg_load(s,x,y,comp,req_comp);
|
|
|
541 if (stbi_png_test(s)) return stbi_png_load(s,x,y,comp,req_comp);
|
|
|
542 #ifdef STBI_CRAP_FORMATS
|
|
|
543 if (stbi_bmp_test(s)) return stbi_bmp_load(s,x,y,comp,req_comp);
|
|
|
544 if (stbi_gif_test(s)) return stbi_gif_load(s,x,y,comp,req_comp);
|
|
|
545 if (stbi_psd_test(s)) return stbi_psd_load(s,x,y,comp,req_comp);
|
|
|
546 if (stbi_pic_test(s)) return stbi_pic_load(s,x,y,comp,req_comp);
|
|
|
547 #endif
|
|
|
548
|
|
|
549 #ifndef STBI_NO_HDR
|
|
|
550 if (stbi_hdr_test(s)) {
|
|
|
551 float *hdr = stbi_hdr_load(s, x,y,comp,req_comp);
|
|
|
552 return hdr_to_ldr(hdr, *x, *y, req_comp ? req_comp : *comp);
|
|
|
553 }
|
|
|
554 #endif
|
|
|
555
|
|
|
556 #ifdef STBI_CRAP_FORMATS
|
|
|
557 // test tga last because it's a crappy test!
|
|
|
558 if (stbi_tga_test(s))
|
|
|
559 return stbi_tga_load(s,x,y,comp,req_comp);
|
|
|
560 #endif
|
|
|
561
|
|
|
562 return epuc("unknown image type", "Image not of any known type, or corrupt");
|
|
|
563 }
|
|
|
564
|
|
|
565 #ifndef STBI_NO_STDIO
|
|
|
566 unsigned char *stbi_load(char const *filename, int *x, int *y, int *comp, int req_comp)
|
|
|
567 {
|
|
|
568 FILE *f = fopen(filename, "rb");
|
|
|
569 unsigned char *result;
|
|
|
570 if (!f) return epuc("can't fopen", "Unable to open file");
|
|
|
571 result = stbi_load_from_file(f,x,y,comp,req_comp);
|
|
|
572 fclose(f);
|
|
|
573 return result;
|
|
|
574 }
|
|
|
575
|
|
|
576 unsigned char *stbi_load_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
|
|
|
577 {
|
|
|
578 stbi s;
|
|
|
579 start_file(&s,f);
|
|
|
580 return stbi_load_main(&s,x,y,comp,req_comp);
|
|
|
581 }
|
|
|
582 #endif //!STBI_NO_STDIO
|
|
|
583
|
|
|
584 unsigned char *stbi_load_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
|
|
|
585 {
|
|
|
586 stbi s;
|
|
|
587 start_mem(&s,buffer,len);
|
|
|
588 return stbi_load_main(&s,x,y,comp,req_comp);
|
|
|
589 }
|
|
|
590
|
|
|
591 unsigned char *stbi_load_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp)
|
|
|
592 {
|
|
|
593 stbi s;
|
|
|
594 start_callbacks(&s, (stbi_io_callbacks *) clbk, user);
|
|
|
595 return stbi_load_main(&s,x,y,comp,req_comp);
|
|
|
596 }
|
|
|
597
|
|
|
598 #ifndef STBI_NO_HDR
|
|
|
599
|
|
|
600 float *stbi_loadf_main(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
601 {
|
|
|
602 unsigned char *data;
|
|
|
603 #ifndef STBI_NO_HDR
|
|
|
604 if (stbi_hdr_test(s))
|
|
|
605 return stbi_hdr_load(s,x,y,comp,req_comp);
|
|
|
606 #endif
|
|
|
607 data = stbi_load_main(s, x, y, comp, req_comp);
|
|
|
608 if (data)
|
|
|
609 return ldr_to_hdr(data, *x, *y, req_comp ? req_comp : *comp);
|
|
|
610 return epf("unknown image type", "Image not of any known type, or corrupt");
|
|
|
611 }
|
|
|
612
|
|
|
613 float *stbi_loadf_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp, int req_comp)
|
|
|
614 {
|
|
|
615 stbi s;
|
|
|
616 start_mem(&s,buffer,len);
|
|
|
617 return stbi_loadf_main(&s,x,y,comp,req_comp);
|
|
|
618 }
|
|
|
619
|
|
|
620 float *stbi_loadf_from_callbacks(stbi_io_callbacks const *clbk, void *user, int *x, int *y, int *comp, int req_comp)
|
|
|
621 {
|
|
|
622 stbi s;
|
|
|
623 start_callbacks(&s, (stbi_io_callbacks *) clbk, user);
|
|
|
624 return stbi_loadf_main(&s,x,y,comp,req_comp);
|
|
|
625 }
|
|
|
626
|
|
|
627 #ifndef STBI_NO_STDIO
|
|
|
628 float *stbi_loadf(char const *filename, int *x, int *y, int *comp, int req_comp)
|
|
|
629 {
|
|
|
630 FILE *f = fopen(filename, "rb");
|
|
|
631 float *result;
|
|
|
632 if (!f) return epf("can't fopen", "Unable to open file");
|
|
|
633 result = stbi_loadf_from_file(f,x,y,comp,req_comp);
|
|
|
634 fclose(f);
|
|
|
635 return result;
|
|
|
636 }
|
|
|
637
|
|
|
638 float *stbi_loadf_from_file(FILE *f, int *x, int *y, int *comp, int req_comp)
|
|
|
639 {
|
|
|
640 stbi s;
|
|
|
641 start_file(&s,f);
|
|
|
642 return stbi_loadf_main(&s,x,y,comp,req_comp);
|
|
|
643 }
|
|
|
644 #endif // !STBI_NO_STDIO
|
|
|
645
|
|
|
646 #endif // !STBI_NO_HDR
|
|
|
647
|
|
|
648 // these is-hdr-or-not is defined independent of whether STBI_NO_HDR is
|
|
|
649 // defined, for API simplicity; if STBI_NO_HDR is defined, it always
|
|
|
650 // reports false!
|
|
|
651
|
|
|
652 int stbi_is_hdr_from_memory(stbi_uc const *buffer, int len)
|
|
|
653 {
|
|
|
654 #ifndef STBI_NO_HDR
|
|
|
655 stbi s;
|
|
|
656 start_mem(&s,buffer,len);
|
|
|
657 return stbi_hdr_test(&s);
|
|
|
658 #else
|
|
|
659 STBI_NOTUSED(buffer);
|
|
|
660 STBI_NOTUSED(len);
|
|
|
661 return 0;
|
|
|
662 #endif
|
|
|
663 }
|
|
|
664
|
|
|
665 #ifndef STBI_NO_STDIO
|
|
|
666 extern int stbi_is_hdr (char const *filename)
|
|
|
667 {
|
|
|
668 FILE *f = fopen(filename, "rb");
|
|
|
669 int result=0;
|
|
|
670 if (f) {
|
|
|
671 result = stbi_is_hdr_from_file(f);
|
|
|
672 fclose(f);
|
|
|
673 }
|
|
|
674 return result;
|
|
|
675 }
|
|
|
676
|
|
|
677 extern int stbi_is_hdr_from_file(FILE *f)
|
|
|
678 {
|
|
|
679 #ifndef STBI_NO_HDR
|
|
|
680 stbi s;
|
|
|
681 start_file(&s,f);
|
|
|
682 return stbi_hdr_test(&s);
|
|
|
683 #else
|
|
|
684 return 0;
|
|
|
685 #endif
|
|
|
686 }
|
|
|
687 #endif // !STBI_NO_STDIO
|
|
|
688
|
|
|
689 extern int stbi_is_hdr_from_callbacks(stbi_io_callbacks const *clbk, void *user)
|
|
|
690 {
|
|
|
691 #ifndef STBI_NO_HDR
|
|
|
692 stbi s;
|
|
|
693 start_callbacks(&s, (stbi_io_callbacks *) clbk, user);
|
|
|
694 return stbi_hdr_test(&s);
|
|
|
695 #else
|
|
|
696 return 0;
|
|
|
697 #endif
|
|
|
698 }
|
|
|
699
|
|
|
700 #ifndef STBI_NO_HDR
|
|
|
701 static float h2l_gamma_i=1.0f/2.2f, h2l_scale_i=1.0f;
|
|
|
702 static float l2h_gamma=2.2f, l2h_scale=1.0f;
|
|
|
703
|
|
|
704 void stbi_hdr_to_ldr_gamma(float gamma) { h2l_gamma_i = 1/gamma; }
|
|
|
705 void stbi_hdr_to_ldr_scale(float scale) { h2l_scale_i = 1/scale; }
|
|
|
706
|
|
|
707 void stbi_ldr_to_hdr_gamma(float gamma) { l2h_gamma = gamma; }
|
|
|
708 void stbi_ldr_to_hdr_scale(float scale) { l2h_scale = scale; }
|
|
|
709 #endif
|
|
|
710
|
|
|
711
|
|
|
712 //////////////////////////////////////////////////////////////////////////////
|
|
|
713 //
|
|
|
714 // Common code used by all image loaders
|
|
|
715 //
|
|
|
716
|
|
|
717 enum
|
|
|
718 {
|
|
|
719 SCAN_load=0,
|
|
|
720 SCAN_type,
|
|
|
721 SCAN_header
|
|
|
722 };
|
|
|
723
|
|
|
724 static void refill_buffer(stbi *s)
|
|
|
725 {
|
|
|
726 int n = (s->io.read)(s->io_user_data,(char*)s->buffer_start,s->buflen);
|
|
|
727 if (n == 0) {
|
|
|
728 // at end of file, treat same as if from memory
|
|
|
729 s->read_from_callbacks = 0;
|
|
|
730 s->img_buffer = s->img_buffer_end-1;
|
|
|
731 *s->img_buffer = 0;
|
|
|
732 } else {
|
|
|
733 s->img_buffer = s->buffer_start;
|
|
|
734 s->img_buffer_end = s->buffer_start + n;
|
|
|
735 }
|
|
|
736 }
|
|
|
737
|
|
|
738 stbi_inline static int get8(stbi *s)
|
|
|
739 {
|
|
|
740 if (s->img_buffer < s->img_buffer_end)
|
|
|
741 return *s->img_buffer++;
|
|
|
742 if (s->read_from_callbacks) {
|
|
|
743 refill_buffer(s);
|
|
|
744 return *s->img_buffer++;
|
|
|
745 }
|
|
|
746 return 0;
|
|
|
747 }
|
|
|
748
|
|
|
749 stbi_inline static int at_eof(stbi *s)
|
|
|
750 {
|
|
|
751 if (s->io.read) {
|
|
|
752 if (!(s->io.eof)(s->io_user_data)) return 0;
|
|
|
753 // if feof() is true, check if buffer = end
|
|
|
754 // special case: we've only got the special 0 character at the end
|
|
|
755 if (s->read_from_callbacks == 0) return 1;
|
|
|
756 }
|
|
|
757
|
|
|
758 return s->img_buffer >= s->img_buffer_end;
|
|
|
759 }
|
|
|
760
|
|
|
761 stbi_inline static uint8 get8u(stbi *s)
|
|
|
762 {
|
|
|
763 return (uint8) get8(s);
|
|
|
764 }
|
|
|
765
|
|
|
766 static void skip(stbi *s, int n)
|
|
|
767 {
|
|
|
768 if (s->io.read) {
|
|
|
769 int blen = s->img_buffer_end - s->img_buffer;
|
|
|
770 if (blen < n) {
|
|
|
771 s->img_buffer = s->img_buffer_end;
|
|
|
772 (s->io.skip)(s->io_user_data, n - blen);
|
|
|
773 return;
|
|
|
774 }
|
|
|
775 }
|
|
|
776 s->img_buffer += n;
|
|
|
777 }
|
|
|
778
|
|
|
779 static int getn(stbi *s, stbi_uc *buffer, int n)
|
|
|
780 {
|
|
|
781 if (s->io.read) {
|
|
|
782 int blen = s->img_buffer_end - s->img_buffer;
|
|
|
783 if (blen < n) {
|
|
|
784 int res, count;
|
|
|
785
|
|
|
786 memcpy(buffer, s->img_buffer, blen);
|
|
|
787
|
|
|
788 count = (s->io.read)(s->io_user_data, (char*) buffer + blen, n - blen);
|
|
|
789 res = (count == (n-blen));
|
|
|
790 s->img_buffer = s->img_buffer_end;
|
|
|
791 return res;
|
|
|
792 }
|
|
|
793 }
|
|
|
794
|
|
|
795 if (s->img_buffer+n <= s->img_buffer_end) {
|
|
|
796 memcpy(buffer, s->img_buffer, n);
|
|
|
797 s->img_buffer += n;
|
|
|
798 return 1;
|
|
|
799 } else
|
|
|
800 return 0;
|
|
|
801 }
|
|
|
802
|
|
|
803 static int get16(stbi *s)
|
|
|
804 {
|
|
|
805 int z = get8(s);
|
|
|
806 return (z << 8) + get8(s);
|
|
|
807 }
|
|
|
808
|
|
|
809 static uint32 get32(stbi *s)
|
|
|
810 {
|
|
|
811 uint32 z = get16(s);
|
|
|
812 return (z << 16) + get16(s);
|
|
|
813 }
|
|
|
814
|
|
24
|
815 #ifdef STBI_CRAP_FORMATS
|
|
0
|
816 static int get16le(stbi *s)
|
|
|
817 {
|
|
|
818 int z = get8(s);
|
|
|
819 return z + (get8(s) << 8);
|
|
|
820 }
|
|
|
821
|
|
|
822 static uint32 get32le(stbi *s)
|
|
|
823 {
|
|
|
824 uint32 z = get16le(s);
|
|
|
825 return z + (get16le(s) << 16);
|
|
|
826 }
|
|
24
|
827 #endif
|
|
0
|
828
|
|
|
829 //////////////////////////////////////////////////////////////////////////////
|
|
|
830 //
|
|
|
831 // generic converter from built-in img_n to req_comp
|
|
|
832 // individual types do this automatically as much as possible (e.g. jpeg
|
|
|
833 // does all cases internally since it needs to colorspace convert anyway,
|
|
|
834 // and it never has alpha, so very few cases ). png can automatically
|
|
|
835 // interleave an alpha=255 channel, but falls back to this for other cases
|
|
|
836 //
|
|
|
837 // assume data buffer is malloced, so malloc a new one and free that one
|
|
|
838 // only failure mode is malloc failing
|
|
|
839
|
|
|
840 static uint8 compute_y(int r, int g, int b)
|
|
|
841 {
|
|
|
842 return (uint8) (((r*77) + (g*150) + (29*b)) >> 8);
|
|
|
843 }
|
|
|
844
|
|
|
845 static unsigned char *convert_format(unsigned char *data, int img_n, int req_comp, uint x, uint y)
|
|
|
846 {
|
|
|
847 int i,j;
|
|
|
848 unsigned char *good;
|
|
|
849
|
|
|
850 if (req_comp == img_n) return data;
|
|
|
851 assert(req_comp >= 1 && req_comp <= 4);
|
|
|
852
|
|
|
853 good = (unsigned char *) malloc(req_comp * x * y);
|
|
|
854 if (good == NULL) {
|
|
|
855 free(data);
|
|
|
856 return epuc("outofmem", "Out of memory");
|
|
|
857 }
|
|
|
858
|
|
|
859 for (j=0; j < (int) y; ++j) {
|
|
|
860 unsigned char *src = data + j * x * img_n ;
|
|
|
861 unsigned char *dest = good + j * x * req_comp;
|
|
|
862
|
|
|
863 #define COMBO(a,b) ((a)*8+(b))
|
|
|
864 #define CASE(a,b) case COMBO(a,b): for(i=x-1; i >= 0; --i, src += a, dest += b)
|
|
|
865 // convert source image with img_n components to one with req_comp components;
|
|
|
866 // avoid switch per pixel, so use switch per scanline and massive macros
|
|
|
867 switch (COMBO(img_n, req_comp)) {
|
|
|
868 CASE(1,2) dest[0]=src[0], dest[1]=255; break;
|
|
|
869 CASE(1,3) dest[0]=dest[1]=dest[2]=src[0]; break;
|
|
|
870 CASE(1,4) dest[0]=dest[1]=dest[2]=src[0], dest[3]=255; break;
|
|
|
871 CASE(2,1) dest[0]=src[0]; break;
|
|
|
872 CASE(2,3) dest[0]=dest[1]=dest[2]=src[0]; break;
|
|
|
873 CASE(2,4) dest[0]=dest[1]=dest[2]=src[0], dest[3]=src[1]; break;
|
|
|
874 CASE(3,4) dest[0]=src[0],dest[1]=src[1],dest[2]=src[2],dest[3]=255; break;
|
|
|
875 CASE(3,1) dest[0]=compute_y(src[0],src[1],src[2]); break;
|
|
|
876 CASE(3,2) dest[0]=compute_y(src[0],src[1],src[2]), dest[1] = 255; break;
|
|
|
877 CASE(4,1) dest[0]=compute_y(src[0],src[1],src[2]); break;
|
|
|
878 CASE(4,2) dest[0]=compute_y(src[0],src[1],src[2]), dest[1] = src[3]; break;
|
|
|
879 CASE(4,3) dest[0]=src[0],dest[1]=src[1],dest[2]=src[2]; break;
|
|
|
880 default: assert(0);
|
|
|
881 }
|
|
|
882 #undef CASE
|
|
|
883 }
|
|
|
884
|
|
|
885 free(data);
|
|
|
886 return good;
|
|
|
887 }
|
|
|
888
|
|
|
889 #ifndef STBI_NO_HDR
|
|
|
890 static float *ldr_to_hdr(stbi_uc *data, int x, int y, int comp)
|
|
|
891 {
|
|
|
892 int i,k,n;
|
|
|
893 float *output = (float *) malloc(x * y * comp * sizeof(float));
|
|
|
894 if (output == NULL) { free(data); return epf("outofmem", "Out of memory"); }
|
|
|
895 // compute number of non-alpha components
|
|
|
896 if (comp & 1) n = comp; else n = comp-1;
|
|
|
897 for (i=0; i < x*y; ++i) {
|
|
|
898 for (k=0; k < n; ++k) {
|
|
|
899 output[i*comp + k] = (float) pow(data[i*comp+k]/255.0f, l2h_gamma) * l2h_scale;
|
|
|
900 }
|
|
|
901 if (k < comp) output[i*comp + k] = data[i*comp+k]/255.0f;
|
|
|
902 }
|
|
|
903 free(data);
|
|
|
904 return output;
|
|
|
905 }
|
|
|
906
|
|
|
907 #define float2int(x) ((int) (x))
|
|
|
908 static stbi_uc *hdr_to_ldr(float *data, int x, int y, int comp)
|
|
|
909 {
|
|
|
910 int i,k,n;
|
|
|
911 stbi_uc *output = (stbi_uc *) malloc(x * y * comp);
|
|
|
912 if (output == NULL) { free(data); return epuc("outofmem", "Out of memory"); }
|
|
|
913 // compute number of non-alpha components
|
|
|
914 if (comp & 1) n = comp; else n = comp-1;
|
|
|
915 for (i=0; i < x*y; ++i) {
|
|
|
916 for (k=0; k < n; ++k) {
|
|
|
917 float z = (float) pow(data[i*comp+k]*h2l_scale_i, h2l_gamma_i) * 255 + 0.5f;
|
|
|
918 if (z < 0) z = 0;
|
|
|
919 if (z > 255) z = 255;
|
|
|
920 output[i*comp + k] = (uint8) float2int(z);
|
|
|
921 }
|
|
|
922 if (k < comp) {
|
|
|
923 float z = data[i*comp+k] * 255 + 0.5f;
|
|
|
924 if (z < 0) z = 0;
|
|
|
925 if (z > 255) z = 255;
|
|
|
926 output[i*comp + k] = (uint8) float2int(z);
|
|
|
927 }
|
|
|
928 }
|
|
|
929 free(data);
|
|
|
930 return output;
|
|
|
931 }
|
|
|
932 #endif
|
|
|
933
|
|
|
934 //////////////////////////////////////////////////////////////////////////////
|
|
|
935 //
|
|
|
936 // "baseline" JPEG/JFIF decoder (not actually fully baseline implementation)
|
|
|
937 //
|
|
|
938 // simple implementation
|
|
|
939 // - channel subsampling of at most 2 in each dimension
|
|
|
940 // - doesn't support delayed output of y-dimension
|
|
|
941 // - simple interface (only one output format: 8-bit interleaved RGB)
|
|
|
942 // - doesn't try to recover corrupt jpegs
|
|
|
943 // - doesn't allow partial loading, loading multiple at once
|
|
|
944 // - still fast on x86 (copying globals into locals doesn't help x86)
|
|
|
945 // - allocates lots of intermediate memory (full size of all components)
|
|
|
946 // - non-interleaved case requires this anyway
|
|
|
947 // - allows good upsampling (see next)
|
|
|
948 // high-quality
|
|
|
949 // - upsampled channels are bilinearly interpolated, even across blocks
|
|
|
950 // - quality integer IDCT derived from IJG's 'slow'
|
|
|
951 // performance
|
|
|
952 // - fast huffman; reasonable integer IDCT
|
|
|
953 // - uses a lot of intermediate memory, could cache poorly
|
|
|
954 // - load http://nothings.org/remote/anemones.jpg 3 times on 2.8Ghz P4
|
|
|
955 // stb_jpeg: 1.34 seconds (MSVC6, default release build)
|
|
|
956 // stb_jpeg: 1.06 seconds (MSVC6, processor = Pentium Pro)
|
|
|
957 // IJL11.dll: 1.08 seconds (compiled by intel)
|
|
|
958 // IJG 1998: 0.98 seconds (MSVC6, makefile provided by IJG)
|
|
|
959 // IJG 1998: 0.95 seconds (MSVC6, makefile + proc=PPro)
|
|
|
960
|
|
|
961 // huffman decoding acceleration
|
|
|
962 #define FAST_BITS 9 // larger handles more cases; smaller stomps less cache
|
|
|
963
|
|
|
964 typedef struct
|
|
|
965 {
|
|
|
966 uint8 fast[1 << FAST_BITS];
|
|
|
967 // weirdly, repacking this into AoS is a 10% speed loss, instead of a win
|
|
|
968 uint16 code[256];
|
|
|
969 uint8 values[256];
|
|
|
970 uint8 size[257];
|
|
|
971 unsigned int maxcode[18];
|
|
|
972 int delta[17]; // old 'firstsymbol' - old 'firstcode'
|
|
|
973 } huffman;
|
|
|
974
|
|
|
975 typedef struct
|
|
|
976 {
|
|
|
977 #ifdef STBI_SIMD
|
|
|
978 unsigned short dequant2[4][64];
|
|
|
979 #endif
|
|
|
980 stbi *s;
|
|
|
981 huffman huff_dc[4];
|
|
|
982 huffman huff_ac[4];
|
|
|
983 uint8 dequant[4][64];
|
|
|
984
|
|
|
985 // sizes for components, interleaved MCUs
|
|
|
986 int img_h_max, img_v_max;
|
|
|
987 int img_mcu_x, img_mcu_y;
|
|
|
988 int img_mcu_w, img_mcu_h;
|
|
|
989
|
|
|
990 // definition of jpeg image component
|
|
|
991 struct
|
|
|
992 {
|
|
|
993 int id;
|
|
|
994 int h,v;
|
|
|
995 int tq;
|
|
|
996 int hd,ha;
|
|
|
997 int dc_pred;
|
|
|
998
|
|
|
999 int x,y,w2,h2;
|
|
|
1000 uint8 *data;
|
|
|
1001 void *raw_data;
|
|
|
1002 uint8 *linebuf;
|
|
|
1003 } img_comp[4];
|
|
|
1004
|
|
|
1005 uint32 code_buffer; // jpeg entropy-coded buffer
|
|
|
1006 int code_bits; // number of valid bits
|
|
|
1007 unsigned char marker; // marker seen while filling entropy buffer
|
|
|
1008 int nomore; // flag if we saw a marker so must stop
|
|
|
1009
|
|
|
1010 int scan_n, order[4];
|
|
|
1011 int restart_interval, todo;
|
|
|
1012 } jpeg;
|
|
|
1013
|
|
|
1014 static int build_huffman(huffman *h, int *count)
|
|
|
1015 {
|
|
|
1016 int i,j,k=0,code;
|
|
|
1017 // build size list for each symbol (from JPEG spec)
|
|
|
1018 for (i=0; i < 16; ++i)
|
|
|
1019 for (j=0; j < count[i]; ++j)
|
|
|
1020 h->size[k++] = (uint8) (i+1);
|
|
|
1021 h->size[k] = 0;
|
|
|
1022
|
|
|
1023 // compute actual symbols (from jpeg spec)
|
|
|
1024 code = 0;
|
|
|
1025 k = 0;
|
|
|
1026 for(j=1; j <= 16; ++j) {
|
|
|
1027 // compute delta to add to code to compute symbol id
|
|
|
1028 h->delta[j] = k - code;
|
|
|
1029 if (h->size[k] == j) {
|
|
|
1030 while (h->size[k] == j)
|
|
|
1031 h->code[k++] = (uint16) (code++);
|
|
|
1032 if (code-1 >= (1 << j)) return e("bad code lengths","Corrupt JPEG");
|
|
|
1033 }
|
|
|
1034 // compute largest code + 1 for this size, preshifted as needed later
|
|
|
1035 h->maxcode[j] = code << (16-j);
|
|
|
1036 code <<= 1;
|
|
|
1037 }
|
|
|
1038 h->maxcode[j] = 0xffffffff;
|
|
|
1039
|
|
|
1040 // build non-spec acceleration table; 255 is flag for not-accelerated
|
|
|
1041 memset(h->fast, 255, 1 << FAST_BITS);
|
|
|
1042 for (i=0; i < k; ++i) {
|
|
|
1043 int s = h->size[i];
|
|
|
1044 if (s <= FAST_BITS) {
|
|
|
1045 int c = h->code[i] << (FAST_BITS-s);
|
|
|
1046 int m = 1 << (FAST_BITS-s);
|
|
|
1047 for (j=0; j < m; ++j) {
|
|
|
1048 h->fast[c+j] = (uint8) i;
|
|
|
1049 }
|
|
|
1050 }
|
|
|
1051 }
|
|
|
1052 return 1;
|
|
|
1053 }
|
|
|
1054
|
|
|
1055 static void grow_buffer_unsafe(jpeg *j)
|
|
|
1056 {
|
|
|
1057 do {
|
|
|
1058 int b = j->nomore ? 0 : get8(j->s);
|
|
|
1059 if (b == 0xff) {
|
|
|
1060 int c = get8(j->s);
|
|
|
1061 if (c != 0) {
|
|
|
1062 j->marker = (unsigned char) c;
|
|
|
1063 j->nomore = 1;
|
|
|
1064 return;
|
|
|
1065 }
|
|
|
1066 }
|
|
|
1067 j->code_buffer |= b << (24 - j->code_bits);
|
|
|
1068 j->code_bits += 8;
|
|
|
1069 } while (j->code_bits <= 24);
|
|
|
1070 }
|
|
|
1071
|
|
|
1072 // (1 << n) - 1
|
|
|
1073 static uint32 bmask[17]={0,1,3,7,15,31,63,127,255,511,1023,2047,4095,8191,16383,32767,65535};
|
|
|
1074
|
|
|
1075 // decode a jpeg huffman value from the bitstream
|
|
|
1076 stbi_inline static int decode(jpeg *j, huffman *h)
|
|
|
1077 {
|
|
|
1078 unsigned int temp;
|
|
|
1079 int c,k;
|
|
|
1080
|
|
|
1081 if (j->code_bits < 16) grow_buffer_unsafe(j);
|
|
|
1082
|
|
|
1083 // look at the top FAST_BITS and determine what symbol ID it is,
|
|
|
1084 // if the code is <= FAST_BITS
|
|
|
1085 c = (j->code_buffer >> (32 - FAST_BITS)) & ((1 << FAST_BITS)-1);
|
|
|
1086 k = h->fast[c];
|
|
|
1087 if (k < 255) {
|
|
|
1088 int s = h->size[k];
|
|
|
1089 if (s > j->code_bits)
|
|
|
1090 return -1;
|
|
|
1091 j->code_buffer <<= s;
|
|
|
1092 j->code_bits -= s;
|
|
|
1093 return h->values[k];
|
|
|
1094 }
|
|
|
1095
|
|
|
1096 // naive test is to shift the code_buffer down so k bits are
|
|
|
1097 // valid, then test against maxcode. To speed this up, we've
|
|
|
1098 // preshifted maxcode left so that it has (16-k) 0s at the
|
|
|
1099 // end; in other words, regardless of the number of bits, it
|
|
|
1100 // wants to be compared against something shifted to have 16;
|
|
|
1101 // that way we don't need to shift inside the loop.
|
|
|
1102 temp = j->code_buffer >> 16;
|
|
|
1103 for (k=FAST_BITS+1 ; ; ++k)
|
|
|
1104 if (temp < h->maxcode[k])
|
|
|
1105 break;
|
|
|
1106 if (k == 17) {
|
|
|
1107 // error! code not found
|
|
|
1108 j->code_bits -= 16;
|
|
|
1109 return -1;
|
|
|
1110 }
|
|
|
1111
|
|
|
1112 if (k > j->code_bits)
|
|
|
1113 return -1;
|
|
|
1114
|
|
|
1115 // convert the huffman code to the symbol id
|
|
|
1116 c = ((j->code_buffer >> (32 - k)) & bmask[k]) + h->delta[k];
|
|
|
1117 assert((((j->code_buffer) >> (32 - h->size[c])) & bmask[h->size[c]]) == h->code[c]);
|
|
|
1118
|
|
|
1119 // convert the id to a symbol
|
|
|
1120 j->code_bits -= k;
|
|
|
1121 j->code_buffer <<= k;
|
|
|
1122 return h->values[c];
|
|
|
1123 }
|
|
|
1124
|
|
|
1125 // combined JPEG 'receive' and JPEG 'extend', since baseline
|
|
|
1126 // always extends everything it receives.
|
|
|
1127 stbi_inline static int extend_receive(jpeg *j, int n)
|
|
|
1128 {
|
|
|
1129 unsigned int m = 1 << (n-1);
|
|
|
1130 unsigned int k;
|
|
|
1131 if (j->code_bits < n) grow_buffer_unsafe(j);
|
|
|
1132
|
|
|
1133 #if 1
|
|
|
1134 k = stbi_lrot(j->code_buffer, n);
|
|
|
1135 j->code_buffer = k & ~bmask[n];
|
|
|
1136 k &= bmask[n];
|
|
|
1137 j->code_bits -= n;
|
|
|
1138 #else
|
|
|
1139 k = (j->code_buffer >> (32 - n)) & bmask[n];
|
|
|
1140 j->code_bits -= n;
|
|
|
1141 j->code_buffer <<= n;
|
|
|
1142 #endif
|
|
|
1143 // the following test is probably a random branch that won't
|
|
|
1144 // predict well. I tried to table accelerate it but failed.
|
|
|
1145 // maybe it's compiling as a conditional move?
|
|
|
1146 if (k < m)
|
|
|
1147 return (-1 << n) + k + 1;
|
|
|
1148 else
|
|
|
1149 return k;
|
|
|
1150 }
|
|
|
1151
|
|
|
1152 // given a value that's at position X in the zigzag stream,
|
|
|
1153 // where does it appear in the 8x8 matrix coded as row-major?
|
|
|
1154 static uint8 dezigzag[64+15] =
|
|
|
1155 {
|
|
|
1156 0, 1, 8, 16, 9, 2, 3, 10,
|
|
|
1157 17, 24, 32, 25, 18, 11, 4, 5,
|
|
|
1158 12, 19, 26, 33, 40, 48, 41, 34,
|
|
|
1159 27, 20, 13, 6, 7, 14, 21, 28,
|
|
|
1160 35, 42, 49, 56, 57, 50, 43, 36,
|
|
|
1161 29, 22, 15, 23, 30, 37, 44, 51,
|
|
|
1162 58, 59, 52, 45, 38, 31, 39, 46,
|
|
|
1163 53, 60, 61, 54, 47, 55, 62, 63,
|
|
|
1164 // let corrupt input sample past end
|
|
|
1165 63, 63, 63, 63, 63, 63, 63, 63,
|
|
|
1166 63, 63, 63, 63, 63, 63, 63
|
|
|
1167 };
|
|
|
1168
|
|
|
1169 // decode one 64-entry block--
|
|
|
1170 static int decode_block(jpeg *j, short data[64], huffman *hdc, huffman *hac, int b)
|
|
|
1171 {
|
|
|
1172 int diff,dc,k;
|
|
|
1173 int t = decode(j, hdc);
|
|
|
1174 if (t < 0) return e("bad huffman code","Corrupt JPEG");
|
|
|
1175
|
|
|
1176 // 0 all the ac values now so we can do it 32-bits at a time
|
|
|
1177 memset(data,0,64*sizeof(data[0]));
|
|
|
1178
|
|
|
1179 diff = t ? extend_receive(j, t) : 0;
|
|
|
1180 dc = j->img_comp[b].dc_pred + diff;
|
|
|
1181 j->img_comp[b].dc_pred = dc;
|
|
|
1182 data[0] = (short) dc;
|
|
|
1183
|
|
|
1184 // decode AC components, see JPEG spec
|
|
|
1185 k = 1;
|
|
|
1186 do {
|
|
|
1187 int r,s;
|
|
|
1188 int rs = decode(j, hac);
|
|
|
1189 if (rs < 0) return e("bad huffman code","Corrupt JPEG");
|
|
|
1190 s = rs & 15;
|
|
|
1191 r = rs >> 4;
|
|
|
1192 if (s == 0) {
|
|
|
1193 if (rs != 0xf0) break; // end block
|
|
|
1194 k += 16;
|
|
|
1195 } else {
|
|
|
1196 k += r;
|
|
|
1197 // decode into unzigzag'd location
|
|
|
1198 data[dezigzag[k++]] = (short) extend_receive(j,s);
|
|
|
1199 }
|
|
|
1200 } while (k < 64);
|
|
|
1201 return 1;
|
|
|
1202 }
|
|
|
1203
|
|
|
1204 // take a -128..127 value and clamp it and convert to 0..255
|
|
|
1205 stbi_inline static uint8 clamp(int x)
|
|
|
1206 {
|
|
|
1207 // trick to use a single test to catch both cases
|
|
|
1208 if ((unsigned int) x > 255) {
|
|
|
1209 if (x < 0) return 0;
|
|
|
1210 if (x > 255) return 255;
|
|
|
1211 }
|
|
|
1212 return (uint8) x;
|
|
|
1213 }
|
|
|
1214
|
|
|
1215 #define f2f(x) (int) (((x) * 4096 + 0.5))
|
|
|
1216 #define fsh(x) ((x) << 12)
|
|
|
1217
|
|
|
1218 // derived from jidctint -- DCT_ISLOW
|
|
|
1219 #define IDCT_1D(s0,s1,s2,s3,s4,s5,s6,s7) \
|
|
|
1220 int t0,t1,t2,t3,p1,p2,p3,p4,p5,x0,x1,x2,x3; \
|
|
|
1221 p2 = s2; \
|
|
|
1222 p3 = s6; \
|
|
|
1223 p1 = (p2+p3) * f2f(0.5411961f); \
|
|
|
1224 t2 = p1 + p3*f2f(-1.847759065f); \
|
|
|
1225 t3 = p1 + p2*f2f( 0.765366865f); \
|
|
|
1226 p2 = s0; \
|
|
|
1227 p3 = s4; \
|
|
|
1228 t0 = fsh(p2+p3); \
|
|
|
1229 t1 = fsh(p2-p3); \
|
|
|
1230 x0 = t0+t3; \
|
|
|
1231 x3 = t0-t3; \
|
|
|
1232 x1 = t1+t2; \
|
|
|
1233 x2 = t1-t2; \
|
|
|
1234 t0 = s7; \
|
|
|
1235 t1 = s5; \
|
|
|
1236 t2 = s3; \
|
|
|
1237 t3 = s1; \
|
|
|
1238 p3 = t0+t2; \
|
|
|
1239 p4 = t1+t3; \
|
|
|
1240 p1 = t0+t3; \
|
|
|
1241 p2 = t1+t2; \
|
|
|
1242 p5 = (p3+p4)*f2f( 1.175875602f); \
|
|
|
1243 t0 = t0*f2f( 0.298631336f); \
|
|
|
1244 t1 = t1*f2f( 2.053119869f); \
|
|
|
1245 t2 = t2*f2f( 3.072711026f); \
|
|
|
1246 t3 = t3*f2f( 1.501321110f); \
|
|
|
1247 p1 = p5 + p1*f2f(-0.899976223f); \
|
|
|
1248 p2 = p5 + p2*f2f(-2.562915447f); \
|
|
|
1249 p3 = p3*f2f(-1.961570560f); \
|
|
|
1250 p4 = p4*f2f(-0.390180644f); \
|
|
|
1251 t3 += p1+p4; \
|
|
|
1252 t2 += p2+p3; \
|
|
|
1253 t1 += p2+p4; \
|
|
|
1254 t0 += p1+p3;
|
|
|
1255
|
|
|
1256 #ifdef STBI_SIMD
|
|
|
1257 typedef unsigned short stbi_dequantize_t;
|
|
|
1258 #else
|
|
|
1259 typedef uint8 stbi_dequantize_t;
|
|
|
1260 #endif
|
|
|
1261
|
|
|
1262 // .344 seconds on 3*anemones.jpg
|
|
|
1263 static void idct_block(uint8 *out, int out_stride, short data[64], stbi_dequantize_t *dequantize)
|
|
|
1264 {
|
|
|
1265 int i,val[64],*v=val;
|
|
|
1266 stbi_dequantize_t *dq = dequantize;
|
|
|
1267 uint8 *o;
|
|
|
1268 short *d = data;
|
|
|
1269
|
|
|
1270 // columns
|
|
|
1271 for (i=0; i < 8; ++i,++d,++dq, ++v) {
|
|
|
1272 // if all zeroes, shortcut -- this avoids dequantizing 0s and IDCTing
|
|
|
1273 if (d[ 8]==0 && d[16]==0 && d[24]==0 && d[32]==0
|
|
|
1274 && d[40]==0 && d[48]==0 && d[56]==0) {
|
|
|
1275 // no shortcut 0 seconds
|
|
|
1276 // (1|2|3|4|5|6|7)==0 0 seconds
|
|
|
1277 // all separate -0.047 seconds
|
|
|
1278 // 1 && 2|3 && 4|5 && 6|7: -0.047 seconds
|
|
|
1279 int dcterm = d[0] * dq[0] << 2;
|
|
|
1280 v[0] = v[8] = v[16] = v[24] = v[32] = v[40] = v[48] = v[56] = dcterm;
|
|
|
1281 } else {
|
|
|
1282 IDCT_1D(d[ 0]*dq[ 0],d[ 8]*dq[ 8],d[16]*dq[16],d[24]*dq[24],
|
|
|
1283 d[32]*dq[32],d[40]*dq[40],d[48]*dq[48],d[56]*dq[56])
|
|
|
1284 // constants scaled things up by 1<<12; let's bring them back
|
|
|
1285 // down, but keep 2 extra bits of precision
|
|
|
1286 x0 += 512; x1 += 512; x2 += 512; x3 += 512;
|
|
|
1287 v[ 0] = (x0+t3) >> 10;
|
|
|
1288 v[56] = (x0-t3) >> 10;
|
|
|
1289 v[ 8] = (x1+t2) >> 10;
|
|
|
1290 v[48] = (x1-t2) >> 10;
|
|
|
1291 v[16] = (x2+t1) >> 10;
|
|
|
1292 v[40] = (x2-t1) >> 10;
|
|
|
1293 v[24] = (x3+t0) >> 10;
|
|
|
1294 v[32] = (x3-t0) >> 10;
|
|
|
1295 }
|
|
|
1296 }
|
|
|
1297
|
|
|
1298 for (i=0, v=val, o=out; i < 8; ++i,v+=8,o+=out_stride) {
|
|
|
1299 // no fast case since the first 1D IDCT spread components out
|
|
|
1300 IDCT_1D(v[0],v[1],v[2],v[3],v[4],v[5],v[6],v[7])
|
|
|
1301 // constants scaled things up by 1<<12, plus we had 1<<2 from first
|
|
|
1302 // loop, plus horizontal and vertical each scale by sqrt(8) so together
|
|
|
1303 // we've got an extra 1<<3, so 1<<17 total we need to remove.
|
|
|
1304 // so we want to round that, which means adding 0.5 * 1<<17,
|
|
|
1305 // aka 65536. Also, we'll end up with -128 to 127 that we want
|
|
|
1306 // to encode as 0..255 by adding 128, so we'll add that before the shift
|
|
|
1307 x0 += 65536 + (128<<17);
|
|
|
1308 x1 += 65536 + (128<<17);
|
|
|
1309 x2 += 65536 + (128<<17);
|
|
|
1310 x3 += 65536 + (128<<17);
|
|
|
1311 // tried computing the shifts into temps, or'ing the temps to see
|
|
|
1312 // if any were out of range, but that was slower
|
|
|
1313 o[0] = clamp((x0+t3) >> 17);
|
|
|
1314 o[7] = clamp((x0-t3) >> 17);
|
|
|
1315 o[1] = clamp((x1+t2) >> 17);
|
|
|
1316 o[6] = clamp((x1-t2) >> 17);
|
|
|
1317 o[2] = clamp((x2+t1) >> 17);
|
|
|
1318 o[5] = clamp((x2-t1) >> 17);
|
|
|
1319 o[3] = clamp((x3+t0) >> 17);
|
|
|
1320 o[4] = clamp((x3-t0) >> 17);
|
|
|
1321 }
|
|
|
1322 }
|
|
|
1323
|
|
|
1324 #ifdef STBI_SIMD
|
|
|
1325 static stbi_idct_8x8 stbi_idct_installed = idct_block;
|
|
|
1326
|
|
|
1327 void stbi_install_idct(stbi_idct_8x8 func)
|
|
|
1328 {
|
|
|
1329 stbi_idct_installed = func;
|
|
|
1330 }
|
|
|
1331 #endif
|
|
|
1332
|
|
|
1333 #define MARKER_none 0xff
|
|
|
1334 // if there's a pending marker from the entropy stream, return that
|
|
|
1335 // otherwise, fetch from the stream and get a marker. if there's no
|
|
|
1336 // marker, return 0xff, which is never a valid marker value
|
|
|
1337 static uint8 get_marker(jpeg *j)
|
|
|
1338 {
|
|
|
1339 uint8 x;
|
|
|
1340 if (j->marker != MARKER_none) { x = j->marker; j->marker = MARKER_none; return x; }
|
|
|
1341 x = get8u(j->s);
|
|
|
1342 if (x != 0xff) return MARKER_none;
|
|
|
1343 while (x == 0xff)
|
|
|
1344 x = get8u(j->s);
|
|
|
1345 return x;
|
|
|
1346 }
|
|
|
1347
|
|
|
1348 // in each scan, we'll have scan_n components, and the order
|
|
|
1349 // of the components is specified by order[]
|
|
|
1350 #define RESTART(x) ((x) >= 0xd0 && (x) <= 0xd7)
|
|
|
1351
|
|
|
1352 // after a restart interval, reset the entropy decoder and
|
|
|
1353 // the dc prediction
|
|
|
1354 static void reset(jpeg *j)
|
|
|
1355 {
|
|
|
1356 j->code_bits = 0;
|
|
|
1357 j->code_buffer = 0;
|
|
|
1358 j->nomore = 0;
|
|
|
1359 j->img_comp[0].dc_pred = j->img_comp[1].dc_pred = j->img_comp[2].dc_pred = 0;
|
|
|
1360 j->marker = MARKER_none;
|
|
|
1361 j->todo = j->restart_interval ? j->restart_interval : 0x7fffffff;
|
|
|
1362 // no more than 1<<31 MCUs if no restart_interal? that's plenty safe,
|
|
|
1363 // since we don't even allow 1<<30 pixels
|
|
|
1364 }
|
|
|
1365
|
|
|
1366 static int parse_entropy_coded_data(jpeg *z)
|
|
|
1367 {
|
|
|
1368 reset(z);
|
|
|
1369 if (z->scan_n == 1) {
|
|
|
1370 int i,j;
|
|
|
1371 #ifdef STBI_SIMD
|
|
|
1372 __declspec(align(16))
|
|
|
1373 #endif
|
|
|
1374 short data[64];
|
|
|
1375 int n = z->order[0];
|
|
|
1376 // non-interleaved data, we just need to process one block at a time,
|
|
|
1377 // in trivial scanline order
|
|
|
1378 // number of blocks to do just depends on how many actual "pixels" this
|
|
|
1379 // component has, independent of interleaved MCU blocking and such
|
|
|
1380 int w = (z->img_comp[n].x+7) >> 3;
|
|
|
1381 int h = (z->img_comp[n].y+7) >> 3;
|
|
|
1382 for (j=0; j < h; ++j) {
|
|
|
1383 for (i=0; i < w; ++i) {
|
|
|
1384 if (!decode_block(z, data, z->huff_dc+z->img_comp[n].hd, z->huff_ac+z->img_comp[n].ha, n)) return 0;
|
|
|
1385 #ifdef STBI_SIMD
|
|
|
1386 stbi_idct_installed(z->img_comp[n].data+z->img_comp[n].w2*j*8+i*8, z->img_comp[n].w2, data, z->dequant2[z->img_comp[n].tq]);
|
|
|
1387 #else
|
|
|
1388 idct_block(z->img_comp[n].data+z->img_comp[n].w2*j*8+i*8, z->img_comp[n].w2, data, z->dequant[z->img_comp[n].tq]);
|
|
|
1389 #endif
|
|
|
1390 // every data block is an MCU, so countdown the restart interval
|
|
|
1391 if (--z->todo <= 0) {
|
|
|
1392 if (z->code_bits < 24) grow_buffer_unsafe(z);
|
|
|
1393 // if it's NOT a restart, then just bail, so we get corrupt data
|
|
|
1394 // rather than no data
|
|
|
1395 if (!RESTART(z->marker)) return 1;
|
|
|
1396 reset(z);
|
|
|
1397 }
|
|
|
1398 }
|
|
|
1399 }
|
|
|
1400 } else { // interleaved!
|
|
|
1401 int i,j,k,x,y;
|
|
|
1402 short data[64];
|
|
|
1403 for (j=0; j < z->img_mcu_y; ++j) {
|
|
|
1404 for (i=0; i < z->img_mcu_x; ++i) {
|
|
|
1405 // scan an interleaved mcu... process scan_n components in order
|
|
|
1406 for (k=0; k < z->scan_n; ++k) {
|
|
|
1407 int n = z->order[k];
|
|
|
1408 // scan out an mcu's worth of this component; that's just determined
|
|
|
1409 // by the basic H and V specified for the component
|
|
|
1410 for (y=0; y < z->img_comp[n].v; ++y) {
|
|
|
1411 for (x=0; x < z->img_comp[n].h; ++x) {
|
|
|
1412 int x2 = (i*z->img_comp[n].h + x)*8;
|
|
|
1413 int y2 = (j*z->img_comp[n].v + y)*8;
|
|
|
1414 if (!decode_block(z, data, z->huff_dc+z->img_comp[n].hd, z->huff_ac+z->img_comp[n].ha, n)) return 0;
|
|
|
1415 #ifdef STBI_SIMD
|
|
|
1416 stbi_idct_installed(z->img_comp[n].data+z->img_comp[n].w2*y2+x2, z->img_comp[n].w2, data, z->dequant2[z->img_comp[n].tq]);
|
|
|
1417 #else
|
|
|
1418 idct_block(z->img_comp[n].data+z->img_comp[n].w2*y2+x2, z->img_comp[n].w2, data, z->dequant[z->img_comp[n].tq]);
|
|
|
1419 #endif
|
|
|
1420 }
|
|
|
1421 }
|
|
|
1422 }
|
|
|
1423 // after all interleaved components, that's an interleaved MCU,
|
|
|
1424 // so now count down the restart interval
|
|
|
1425 if (--z->todo <= 0) {
|
|
|
1426 if (z->code_bits < 24) grow_buffer_unsafe(z);
|
|
|
1427 // if it's NOT a restart, then just bail, so we get corrupt data
|
|
|
1428 // rather than no data
|
|
|
1429 if (!RESTART(z->marker)) return 1;
|
|
|
1430 reset(z);
|
|
|
1431 }
|
|
|
1432 }
|
|
|
1433 }
|
|
|
1434 }
|
|
|
1435 return 1;
|
|
|
1436 }
|
|
|
1437
|
|
|
1438 static int process_marker(jpeg *z, int m)
|
|
|
1439 {
|
|
|
1440 int L;
|
|
|
1441 switch (m) {
|
|
|
1442 case MARKER_none: // no marker found
|
|
|
1443 return e("expected marker","Corrupt JPEG");
|
|
|
1444
|
|
|
1445 case 0xC2: // SOF - progressive
|
|
|
1446 return e("progressive jpeg","JPEG format not supported (progressive)");
|
|
|
1447
|
|
|
1448 case 0xDD: // DRI - specify restart interval
|
|
|
1449 if (get16(z->s) != 4) return e("bad DRI len","Corrupt JPEG");
|
|
|
1450 z->restart_interval = get16(z->s);
|
|
|
1451 return 1;
|
|
|
1452
|
|
|
1453 case 0xDB: // DQT - define quantization table
|
|
|
1454 L = get16(z->s)-2;
|
|
|
1455 while (L > 0) {
|
|
|
1456 int q = get8(z->s);
|
|
|
1457 int p = q >> 4;
|
|
|
1458 int t = q & 15,i;
|
|
|
1459 if (p != 0) return e("bad DQT type","Corrupt JPEG");
|
|
|
1460 if (t > 3) return e("bad DQT table","Corrupt JPEG");
|
|
|
1461 for (i=0; i < 64; ++i)
|
|
|
1462 z->dequant[t][dezigzag[i]] = get8u(z->s);
|
|
|
1463 #ifdef STBI_SIMD
|
|
|
1464 for (i=0; i < 64; ++i)
|
|
|
1465 z->dequant2[t][i] = z->dequant[t][i];
|
|
|
1466 #endif
|
|
|
1467 L -= 65;
|
|
|
1468 }
|
|
|
1469 return L==0;
|
|
|
1470
|
|
|
1471 case 0xC4: // DHT - define huffman table
|
|
|
1472 L = get16(z->s)-2;
|
|
|
1473 while (L > 0) {
|
|
|
1474 uint8 *v;
|
|
|
1475 int sizes[16],i,m=0;
|
|
|
1476 int q = get8(z->s);
|
|
|
1477 int tc = q >> 4;
|
|
|
1478 int th = q & 15;
|
|
|
1479 if (tc > 1 || th > 3) return e("bad DHT header","Corrupt JPEG");
|
|
|
1480 for (i=0; i < 16; ++i) {
|
|
|
1481 sizes[i] = get8(z->s);
|
|
|
1482 m += sizes[i];
|
|
|
1483 }
|
|
|
1484 L -= 17;
|
|
|
1485 if (tc == 0) {
|
|
|
1486 if (!build_huffman(z->huff_dc+th, sizes)) return 0;
|
|
|
1487 v = z->huff_dc[th].values;
|
|
|
1488 } else {
|
|
|
1489 if (!build_huffman(z->huff_ac+th, sizes)) return 0;
|
|
|
1490 v = z->huff_ac[th].values;
|
|
|
1491 }
|
|
|
1492 for (i=0; i < m; ++i)
|
|
|
1493 v[i] = get8u(z->s);
|
|
|
1494 L -= m;
|
|
|
1495 }
|
|
|
1496 return L==0;
|
|
|
1497 }
|
|
|
1498 // check for comment block or APP blocks
|
|
|
1499 if ((m >= 0xE0 && m <= 0xEF) || m == 0xFE) {
|
|
|
1500 skip(z->s, get16(z->s)-2);
|
|
|
1501 return 1;
|
|
|
1502 }
|
|
|
1503 return 0;
|
|
|
1504 }
|
|
|
1505
|
|
|
1506 // after we see SOS
|
|
|
1507 static int process_scan_header(jpeg *z)
|
|
|
1508 {
|
|
|
1509 int i;
|
|
|
1510 int Ls = get16(z->s);
|
|
|
1511 z->scan_n = get8(z->s);
|
|
|
1512 if (z->scan_n < 1 || z->scan_n > 4 || z->scan_n > (int) z->s->img_n) return e("bad SOS component count","Corrupt JPEG");
|
|
|
1513 if (Ls != 6+2*z->scan_n) return e("bad SOS len","Corrupt JPEG");
|
|
|
1514 for (i=0; i < z->scan_n; ++i) {
|
|
|
1515 int id = get8(z->s), which;
|
|
|
1516 int q = get8(z->s);
|
|
|
1517 for (which = 0; which < z->s->img_n; ++which)
|
|
|
1518 if (z->img_comp[which].id == id)
|
|
|
1519 break;
|
|
|
1520 if (which == z->s->img_n) return 0;
|
|
|
1521 z->img_comp[which].hd = q >> 4; if (z->img_comp[which].hd > 3) return e("bad DC huff","Corrupt JPEG");
|
|
|
1522 z->img_comp[which].ha = q & 15; if (z->img_comp[which].ha > 3) return e("bad AC huff","Corrupt JPEG");
|
|
|
1523 z->order[i] = which;
|
|
|
1524 }
|
|
|
1525 if (get8(z->s) != 0) return e("bad SOS","Corrupt JPEG");
|
|
|
1526 get8(z->s); // should be 63, but might be 0
|
|
|
1527 if (get8(z->s) != 0) return e("bad SOS","Corrupt JPEG");
|
|
|
1528
|
|
|
1529 return 1;
|
|
|
1530 }
|
|
|
1531
|
|
|
1532 static int process_frame_header(jpeg *z, int scan)
|
|
|
1533 {
|
|
|
1534 stbi *s = z->s;
|
|
|
1535 int Lf,p,i,q, h_max=1,v_max=1,c;
|
|
|
1536 Lf = get16(s); if (Lf < 11) return e("bad SOF len","Corrupt JPEG"); // JPEG
|
|
|
1537 p = get8(s); if (p != 8) return e("only 8-bit","JPEG format not supported: 8-bit only"); // JPEG baseline
|
|
|
1538 s->img_y = get16(s); if (s->img_y == 0) return e("no header height", "JPEG format not supported: delayed height"); // Legal, but we don't handle it--but neither does IJG
|
|
|
1539 s->img_x = get16(s); if (s->img_x == 0) return e("0 width","Corrupt JPEG"); // JPEG requires
|
|
|
1540 c = get8(s);
|
|
|
1541 if (c != 3 && c != 1) return e("bad component count","Corrupt JPEG"); // JFIF requires
|
|
|
1542 s->img_n = c;
|
|
|
1543 for (i=0; i < c; ++i) {
|
|
|
1544 z->img_comp[i].data = NULL;
|
|
|
1545 z->img_comp[i].linebuf = NULL;
|
|
|
1546 }
|
|
|
1547
|
|
|
1548 if (Lf != 8+3*s->img_n) return e("bad SOF len","Corrupt JPEG");
|
|
|
1549
|
|
|
1550 for (i=0; i < s->img_n; ++i) {
|
|
|
1551 z->img_comp[i].id = get8(s);
|
|
|
1552 if (z->img_comp[i].id != i+1) // JFIF requires
|
|
|
1553 if (z->img_comp[i].id != i) // some version of jpegtran outputs non-JFIF-compliant files!
|
|
|
1554 return e("bad component ID","Corrupt JPEG");
|
|
|
1555 q = get8(s);
|
|
|
1556 z->img_comp[i].h = (q >> 4); if (!z->img_comp[i].h || z->img_comp[i].h > 4) return e("bad H","Corrupt JPEG");
|
|
|
1557 z->img_comp[i].v = q & 15; if (!z->img_comp[i].v || z->img_comp[i].v > 4) return e("bad V","Corrupt JPEG");
|
|
|
1558 z->img_comp[i].tq = get8(s); if (z->img_comp[i].tq > 3) return e("bad TQ","Corrupt JPEG");
|
|
|
1559 }
|
|
|
1560
|
|
|
1561 if (scan != SCAN_load) return 1;
|
|
|
1562
|
|
|
1563 if ((1 << 30) / s->img_x / s->img_n < s->img_y) return e("too large", "Image too large to decode");
|
|
|
1564
|
|
|
1565 for (i=0; i < s->img_n; ++i) {
|
|
|
1566 if (z->img_comp[i].h > h_max) h_max = z->img_comp[i].h;
|
|
|
1567 if (z->img_comp[i].v > v_max) v_max = z->img_comp[i].v;
|
|
|
1568 }
|
|
|
1569
|
|
|
1570 // compute interleaved mcu info
|
|
|
1571 z->img_h_max = h_max;
|
|
|
1572 z->img_v_max = v_max;
|
|
|
1573 z->img_mcu_w = h_max * 8;
|
|
|
1574 z->img_mcu_h = v_max * 8;
|
|
|
1575 z->img_mcu_x = (s->img_x + z->img_mcu_w-1) / z->img_mcu_w;
|
|
|
1576 z->img_mcu_y = (s->img_y + z->img_mcu_h-1) / z->img_mcu_h;
|
|
|
1577
|
|
|
1578 for (i=0; i < s->img_n; ++i) {
|
|
|
1579 // number of effective pixels (e.g. for non-interleaved MCU)
|
|
|
1580 z->img_comp[i].x = (s->img_x * z->img_comp[i].h + h_max-1) / h_max;
|
|
|
1581 z->img_comp[i].y = (s->img_y * z->img_comp[i].v + v_max-1) / v_max;
|
|
|
1582 // to simplify generation, we'll allocate enough memory to decode
|
|
|
1583 // the bogus oversized data from using interleaved MCUs and their
|
|
|
1584 // big blocks (e.g. a 16x16 iMCU on an image of width 33); we won't
|
|
|
1585 // discard the extra data until colorspace conversion
|
|
|
1586 z->img_comp[i].w2 = z->img_mcu_x * z->img_comp[i].h * 8;
|
|
|
1587 z->img_comp[i].h2 = z->img_mcu_y * z->img_comp[i].v * 8;
|
|
|
1588 z->img_comp[i].raw_data = malloc(z->img_comp[i].w2 * z->img_comp[i].h2+15);
|
|
|
1589 if (z->img_comp[i].raw_data == NULL) {
|
|
|
1590 for(--i; i >= 0; --i) {
|
|
|
1591 free(z->img_comp[i].raw_data);
|
|
|
1592 z->img_comp[i].data = NULL;
|
|
|
1593 }
|
|
|
1594 return e("outofmem", "Out of memory");
|
|
|
1595 }
|
|
|
1596 // align blocks for installable-idct using mmx/sse
|
|
|
1597 z->img_comp[i].data = (uint8*) (((size_t) z->img_comp[i].raw_data + 15) & ~15);
|
|
|
1598 z->img_comp[i].linebuf = NULL;
|
|
|
1599 }
|
|
|
1600
|
|
|
1601 return 1;
|
|
|
1602 }
|
|
|
1603
|
|
|
1604 // use comparisons since in some cases we handle more than one case (e.g. SOF)
|
|
|
1605 #define DNL(x) ((x) == 0xdc)
|
|
|
1606 #define SOI(x) ((x) == 0xd8)
|
|
|
1607 #define EOI(x) ((x) == 0xd9)
|
|
|
1608 #define SOF(x) ((x) == 0xc0 || (x) == 0xc1)
|
|
|
1609 #define SOS(x) ((x) == 0xda)
|
|
|
1610
|
|
|
1611 static int decode_jpeg_header(jpeg *z, int scan)
|
|
|
1612 {
|
|
|
1613 int m;
|
|
|
1614 z->marker = MARKER_none; // initialize cached marker to empty
|
|
|
1615 m = get_marker(z);
|
|
|
1616 if (!SOI(m)) return e("no SOI","Corrupt JPEG");
|
|
|
1617 if (scan == SCAN_type) return 1;
|
|
|
1618 m = get_marker(z);
|
|
|
1619 while (!SOF(m)) {
|
|
|
1620 if (!process_marker(z,m)) return 0;
|
|
|
1621 m = get_marker(z);
|
|
|
1622 while (m == MARKER_none) {
|
|
|
1623 // some files have extra padding after their blocks, so ok, we'll scan
|
|
|
1624 if (at_eof(z->s)) return e("no SOF", "Corrupt JPEG");
|
|
|
1625 m = get_marker(z);
|
|
|
1626 }
|
|
|
1627 }
|
|
|
1628 if (!process_frame_header(z, scan)) return 0;
|
|
|
1629 return 1;
|
|
|
1630 }
|
|
|
1631
|
|
|
1632 static int decode_jpeg_image(jpeg *j)
|
|
|
1633 {
|
|
|
1634 int m;
|
|
|
1635 j->restart_interval = 0;
|
|
|
1636 if (!decode_jpeg_header(j, SCAN_load)) return 0;
|
|
|
1637 m = get_marker(j);
|
|
|
1638 while (!EOI(m)) {
|
|
|
1639 if (SOS(m)) {
|
|
|
1640 if (!process_scan_header(j)) return 0;
|
|
|
1641 if (!parse_entropy_coded_data(j)) return 0;
|
|
|
1642 if (j->marker == MARKER_none ) {
|
|
|
1643 // handle 0s at the end of image data from IP Kamera 9060
|
|
|
1644 while (!at_eof(j->s)) {
|
|
|
1645 int x = get8(j->s);
|
|
|
1646 if (x == 255) {
|
|
|
1647 j->marker = get8u(j->s);
|
|
|
1648 break;
|
|
|
1649 } else if (x != 0) {
|
|
|
1650 return 0;
|
|
|
1651 }
|
|
|
1652 }
|
|
|
1653 // if we reach eof without hitting a marker, get_marker() below will fail and we'll eventually return 0
|
|
|
1654 }
|
|
|
1655 } else {
|
|
|
1656 if (!process_marker(j, m)) return 0;
|
|
|
1657 }
|
|
|
1658 m = get_marker(j);
|
|
|
1659 }
|
|
|
1660 return 1;
|
|
|
1661 }
|
|
|
1662
|
|
|
1663 // static jfif-centered resampling (across block boundaries)
|
|
|
1664
|
|
|
1665 typedef uint8 *(*resample_row_func)(uint8 *out, uint8 *in0, uint8 *in1,
|
|
|
1666 int w, int hs);
|
|
|
1667
|
|
|
1668 #define div4(x) ((uint8) ((x) >> 2))
|
|
|
1669
|
|
|
1670 static uint8 *resample_row_1(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
|
|
|
1671 {
|
|
|
1672 STBI_NOTUSED(out);
|
|
|
1673 STBI_NOTUSED(in_far);
|
|
|
1674 STBI_NOTUSED(w);
|
|
|
1675 STBI_NOTUSED(hs);
|
|
|
1676 return in_near;
|
|
|
1677 }
|
|
|
1678
|
|
|
1679 static uint8* resample_row_v_2(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
|
|
|
1680 {
|
|
|
1681 // need to generate two samples vertically for every one in input
|
|
|
1682 int i;
|
|
|
1683 STBI_NOTUSED(hs);
|
|
|
1684 for (i=0; i < w; ++i)
|
|
|
1685 out[i] = div4(3*in_near[i] + in_far[i] + 2);
|
|
|
1686 return out;
|
|
|
1687 }
|
|
|
1688
|
|
|
1689 static uint8* resample_row_h_2(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
|
|
|
1690 {
|
|
|
1691 // need to generate two samples horizontally for every one in input
|
|
|
1692 int i;
|
|
|
1693 uint8 *input = in_near;
|
|
|
1694
|
|
|
1695 if (w == 1) {
|
|
|
1696 // if only one sample, can't do any interpolation
|
|
|
1697 out[0] = out[1] = input[0];
|
|
|
1698 return out;
|
|
|
1699 }
|
|
|
1700
|
|
|
1701 out[0] = input[0];
|
|
|
1702 out[1] = div4(input[0]*3 + input[1] + 2);
|
|
|
1703 for (i=1; i < w-1; ++i) {
|
|
|
1704 int n = 3*input[i]+2;
|
|
|
1705 out[i*2+0] = div4(n+input[i-1]);
|
|
|
1706 out[i*2+1] = div4(n+input[i+1]);
|
|
|
1707 }
|
|
|
1708 out[i*2+0] = div4(input[w-2]*3 + input[w-1] + 2);
|
|
|
1709 out[i*2+1] = input[w-1];
|
|
|
1710
|
|
|
1711 STBI_NOTUSED(in_far);
|
|
|
1712 STBI_NOTUSED(hs);
|
|
|
1713
|
|
|
1714 return out;
|
|
|
1715 }
|
|
|
1716
|
|
|
1717 #define div16(x) ((uint8) ((x) >> 4))
|
|
|
1718
|
|
|
1719 static uint8 *resample_row_hv_2(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
|
|
|
1720 {
|
|
|
1721 // need to generate 2x2 samples for every one in input
|
|
|
1722 int i,t0,t1;
|
|
|
1723 if (w == 1) {
|
|
|
1724 out[0] = out[1] = div4(3*in_near[0] + in_far[0] + 2);
|
|
|
1725 return out;
|
|
|
1726 }
|
|
|
1727
|
|
|
1728 t1 = 3*in_near[0] + in_far[0];
|
|
|
1729 out[0] = div4(t1+2);
|
|
|
1730 for (i=1; i < w; ++i) {
|
|
|
1731 t0 = t1;
|
|
|
1732 t1 = 3*in_near[i]+in_far[i];
|
|
|
1733 out[i*2-1] = div16(3*t0 + t1 + 8);
|
|
|
1734 out[i*2 ] = div16(3*t1 + t0 + 8);
|
|
|
1735 }
|
|
|
1736 out[w*2-1] = div4(t1+2);
|
|
|
1737
|
|
|
1738 STBI_NOTUSED(hs);
|
|
|
1739
|
|
|
1740 return out;
|
|
|
1741 }
|
|
|
1742
|
|
|
1743 static uint8 *resample_row_generic(uint8 *out, uint8 *in_near, uint8 *in_far, int w, int hs)
|
|
|
1744 {
|
|
|
1745 // resample with nearest-neighbor
|
|
|
1746 int i,j;
|
|
|
1747 in_far = in_far;
|
|
|
1748 for (i=0; i < w; ++i)
|
|
|
1749 for (j=0; j < hs; ++j)
|
|
|
1750 out[i*hs+j] = in_near[i];
|
|
|
1751 return out;
|
|
|
1752 }
|
|
|
1753
|
|
|
1754 #define float2fixed(x) ((int) ((x) * 65536 + 0.5))
|
|
|
1755
|
|
|
1756 // 0.38 seconds on 3*anemones.jpg (0.25 with processor = Pro)
|
|
|
1757 // VC6 without processor=Pro is generating multiple LEAs per multiply!
|
|
|
1758 static void YCbCr_to_RGB_row(uint8 *out, const uint8 *y, const uint8 *pcb, const uint8 *pcr, int count, int step)
|
|
|
1759 {
|
|
|
1760 int i;
|
|
|
1761 for (i=0; i < count; ++i) {
|
|
|
1762 int y_fixed = (y[i] << 16) + 32768; // rounding
|
|
|
1763 int r,g,b;
|
|
|
1764 int cr = pcr[i] - 128;
|
|
|
1765 int cb = pcb[i] - 128;
|
|
|
1766 r = y_fixed + cr*float2fixed(1.40200f);
|
|
|
1767 g = y_fixed - cr*float2fixed(0.71414f) - cb*float2fixed(0.34414f);
|
|
|
1768 b = y_fixed + cb*float2fixed(1.77200f);
|
|
|
1769 r >>= 16;
|
|
|
1770 g >>= 16;
|
|
|
1771 b >>= 16;
|
|
|
1772 if ((unsigned) r > 255) { if (r < 0) r = 0; else r = 255; }
|
|
|
1773 if ((unsigned) g > 255) { if (g < 0) g = 0; else g = 255; }
|
|
|
1774 if ((unsigned) b > 255) { if (b < 0) b = 0; else b = 255; }
|
|
|
1775 out[0] = (uint8)r;
|
|
|
1776 out[1] = (uint8)g;
|
|
|
1777 out[2] = (uint8)b;
|
|
|
1778 out[3] = 255;
|
|
|
1779 out += step;
|
|
|
1780 }
|
|
|
1781 }
|
|
|
1782
|
|
|
1783 #ifdef STBI_SIMD
|
|
|
1784 static stbi_YCbCr_to_RGB_run stbi_YCbCr_installed = YCbCr_to_RGB_row;
|
|
|
1785
|
|
|
1786 void stbi_install_YCbCr_to_RGB(stbi_YCbCr_to_RGB_run func)
|
|
|
1787 {
|
|
|
1788 stbi_YCbCr_installed = func;
|
|
|
1789 }
|
|
|
1790 #endif
|
|
|
1791
|
|
|
1792
|
|
|
1793 // clean up the temporary component buffers
|
|
|
1794 static void cleanup_jpeg(jpeg *j)
|
|
|
1795 {
|
|
|
1796 int i;
|
|
|
1797 for (i=0; i < j->s->img_n; ++i) {
|
|
|
1798 if (j->img_comp[i].data) {
|
|
|
1799 free(j->img_comp[i].raw_data);
|
|
|
1800 j->img_comp[i].data = NULL;
|
|
|
1801 }
|
|
|
1802 if (j->img_comp[i].linebuf) {
|
|
|
1803 free(j->img_comp[i].linebuf);
|
|
|
1804 j->img_comp[i].linebuf = NULL;
|
|
|
1805 }
|
|
|
1806 }
|
|
|
1807 }
|
|
|
1808
|
|
|
1809 typedef struct
|
|
|
1810 {
|
|
|
1811 resample_row_func resample;
|
|
|
1812 uint8 *line0,*line1;
|
|
|
1813 int hs,vs; // expansion factor in each axis
|
|
|
1814 int w_lores; // horizontal pixels pre-expansion
|
|
|
1815 int ystep; // how far through vertical expansion we are
|
|
|
1816 int ypos; // which pre-expansion row we're on
|
|
|
1817 } stbi_resample;
|
|
|
1818
|
|
|
1819 static uint8 *load_jpeg_image(jpeg *z, int *out_x, int *out_y, int *comp, int req_comp)
|
|
|
1820 {
|
|
|
1821 int n, decode_n;
|
|
|
1822 // validate req_comp
|
|
|
1823 if (req_comp < 0 || req_comp > 4) return epuc("bad req_comp", "Internal error");
|
|
|
1824 z->s->img_n = 0;
|
|
|
1825
|
|
|
1826 // load a jpeg image from whichever source
|
|
|
1827 if (!decode_jpeg_image(z)) { cleanup_jpeg(z); return NULL; }
|
|
|
1828
|
|
|
1829 // determine actual number of components to generate
|
|
|
1830 n = req_comp ? req_comp : z->s->img_n;
|
|
|
1831
|
|
|
1832 if (z->s->img_n == 3 && n < 3)
|
|
|
1833 decode_n = 1;
|
|
|
1834 else
|
|
|
1835 decode_n = z->s->img_n;
|
|
|
1836
|
|
|
1837 // resample and color-convert
|
|
|
1838 {
|
|
|
1839 int k;
|
|
|
1840 uint i,j;
|
|
|
1841 uint8 *output;
|
|
|
1842 uint8 *coutput[4];
|
|
|
1843
|
|
|
1844 stbi_resample res_comp[4];
|
|
|
1845
|
|
|
1846 for (k=0; k < decode_n; ++k) {
|
|
|
1847 stbi_resample *r = &res_comp[k];
|
|
|
1848
|
|
|
1849 // allocate line buffer big enough for upsampling off the edges
|
|
|
1850 // with upsample factor of 4
|
|
|
1851 z->img_comp[k].linebuf = (uint8 *) malloc(z->s->img_x + 3);
|
|
|
1852 if (!z->img_comp[k].linebuf) { cleanup_jpeg(z); return epuc("outofmem", "Out of memory"); }
|
|
|
1853
|
|
|
1854 r->hs = z->img_h_max / z->img_comp[k].h;
|
|
|
1855 r->vs = z->img_v_max / z->img_comp[k].v;
|
|
|
1856 r->ystep = r->vs >> 1;
|
|
|
1857 r->w_lores = (z->s->img_x + r->hs-1) / r->hs;
|
|
|
1858 r->ypos = 0;
|
|
|
1859 r->line0 = r->line1 = z->img_comp[k].data;
|
|
|
1860
|
|
|
1861 if (r->hs == 1 && r->vs == 1) r->resample = resample_row_1;
|
|
|
1862 else if (r->hs == 1 && r->vs == 2) r->resample = resample_row_v_2;
|
|
|
1863 else if (r->hs == 2 && r->vs == 1) r->resample = resample_row_h_2;
|
|
|
1864 else if (r->hs == 2 && r->vs == 2) r->resample = resample_row_hv_2;
|
|
|
1865 else r->resample = resample_row_generic;
|
|
|
1866 }
|
|
|
1867
|
|
|
1868 // can't error after this so, this is safe
|
|
|
1869 output = (uint8 *) malloc(n * z->s->img_x * z->s->img_y + 1);
|
|
|
1870 if (!output) { cleanup_jpeg(z); return epuc("outofmem", "Out of memory"); }
|
|
|
1871
|
|
|
1872 // now go ahead and resample
|
|
|
1873 for (j=0; j < z->s->img_y; ++j) {
|
|
|
1874 uint8 *out = output + n * z->s->img_x * j;
|
|
|
1875 for (k=0; k < decode_n; ++k) {
|
|
|
1876 stbi_resample *r = &res_comp[k];
|
|
|
1877 int y_bot = r->ystep >= (r->vs >> 1);
|
|
|
1878 coutput[k] = r->resample(z->img_comp[k].linebuf,
|
|
|
1879 y_bot ? r->line1 : r->line0,
|
|
|
1880 y_bot ? r->line0 : r->line1,
|
|
|
1881 r->w_lores, r->hs);
|
|
|
1882 if (++r->ystep >= r->vs) {
|
|
|
1883 r->ystep = 0;
|
|
|
1884 r->line0 = r->line1;
|
|
|
1885 if (++r->ypos < z->img_comp[k].y)
|
|
|
1886 r->line1 += z->img_comp[k].w2;
|
|
|
1887 }
|
|
|
1888 }
|
|
|
1889 if (n >= 3) {
|
|
|
1890 uint8 *y = coutput[0];
|
|
|
1891 if (z->s->img_n == 3) {
|
|
|
1892 #ifdef STBI_SIMD
|
|
|
1893 stbi_YCbCr_installed(out, y, coutput[1], coutput[2], z->s.img_x, n);
|
|
|
1894 #else
|
|
|
1895 YCbCr_to_RGB_row(out, y, coutput[1], coutput[2], z->s->img_x, n);
|
|
|
1896 #endif
|
|
|
1897 } else
|
|
|
1898 for (i=0; i < z->s->img_x; ++i) {
|
|
|
1899 out[0] = out[1] = out[2] = y[i];
|
|
|
1900 out[3] = 255; // not used if n==3
|
|
|
1901 out += n;
|
|
|
1902 }
|
|
|
1903 } else {
|
|
|
1904 uint8 *y = coutput[0];
|
|
|
1905 if (n == 1)
|
|
|
1906 for (i=0; i < z->s->img_x; ++i) out[i] = y[i];
|
|
|
1907 else
|
|
|
1908 for (i=0; i < z->s->img_x; ++i) *out++ = y[i], *out++ = 255;
|
|
|
1909 }
|
|
|
1910 }
|
|
|
1911 cleanup_jpeg(z);
|
|
|
1912 *out_x = z->s->img_x;
|
|
|
1913 *out_y = z->s->img_y;
|
|
|
1914 if (comp) *comp = z->s->img_n; // report original components, not output
|
|
|
1915 return output;
|
|
|
1916 }
|
|
|
1917 }
|
|
|
1918
|
|
|
1919 static unsigned char *stbi_jpeg_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
1920 {
|
|
|
1921 jpeg j;
|
|
|
1922 j.s = s;
|
|
|
1923 return load_jpeg_image(&j, x,y,comp,req_comp);
|
|
|
1924 }
|
|
|
1925
|
|
|
1926 static int stbi_jpeg_test(stbi *s)
|
|
|
1927 {
|
|
|
1928 int r;
|
|
|
1929 jpeg j;
|
|
|
1930 j.s = s;
|
|
|
1931 r = decode_jpeg_header(&j, SCAN_type);
|
|
|
1932 stbi_rewind(s);
|
|
|
1933 return r;
|
|
|
1934 }
|
|
|
1935
|
|
|
1936 static int stbi_jpeg_info_raw(jpeg *j, int *x, int *y, int *comp)
|
|
|
1937 {
|
|
|
1938 if (!decode_jpeg_header(j, SCAN_header)) {
|
|
|
1939 stbi_rewind( j->s );
|
|
|
1940 return 0;
|
|
|
1941 }
|
|
|
1942 if (x) *x = j->s->img_x;
|
|
|
1943 if (y) *y = j->s->img_y;
|
|
|
1944 if (comp) *comp = j->s->img_n;
|
|
|
1945 return 1;
|
|
|
1946 }
|
|
|
1947
|
|
|
1948 static int stbi_jpeg_info(stbi *s, int *x, int *y, int *comp)
|
|
|
1949 {
|
|
|
1950 jpeg j;
|
|
|
1951 j.s = s;
|
|
|
1952 return stbi_jpeg_info_raw(&j, x, y, comp);
|
|
|
1953 }
|
|
|
1954
|
|
|
1955 // public domain zlib decode v0.2 Sean Barrett 2006-11-18
|
|
|
1956 // simple implementation
|
|
|
1957 // - all input must be provided in an upfront buffer
|
|
|
1958 // - all output is written to a single output buffer (can malloc/realloc)
|
|
|
1959 // performance
|
|
|
1960 // - fast huffman
|
|
|
1961
|
|
|
1962 // fast-way is faster to check than jpeg huffman, but slow way is slower
|
|
|
1963 #define ZFAST_BITS 9 // accelerate all cases in default tables
|
|
|
1964 #define ZFAST_MASK ((1 << ZFAST_BITS) - 1)
|
|
|
1965
|
|
|
1966 // zlib-style huffman encoding
|
|
|
1967 // (jpegs packs from left, zlib from right, so can't share code)
|
|
|
1968 typedef struct
|
|
|
1969 {
|
|
|
1970 uint16 fast[1 << ZFAST_BITS];
|
|
|
1971 uint16 firstcode[16];
|
|
|
1972 int maxcode[17];
|
|
|
1973 uint16 firstsymbol[16];
|
|
|
1974 uint8 size[288];
|
|
|
1975 uint16 value[288];
|
|
|
1976 } zhuffman;
|
|
|
1977
|
|
|
1978 stbi_inline static int bitreverse16(int n)
|
|
|
1979 {
|
|
|
1980 n = ((n & 0xAAAA) >> 1) | ((n & 0x5555) << 1);
|
|
|
1981 n = ((n & 0xCCCC) >> 2) | ((n & 0x3333) << 2);
|
|
|
1982 n = ((n & 0xF0F0) >> 4) | ((n & 0x0F0F) << 4);
|
|
|
1983 n = ((n & 0xFF00) >> 8) | ((n & 0x00FF) << 8);
|
|
|
1984 return n;
|
|
|
1985 }
|
|
|
1986
|
|
|
1987 stbi_inline static int bit_reverse(int v, int bits)
|
|
|
1988 {
|
|
|
1989 assert(bits <= 16);
|
|
|
1990 // to bit reverse n bits, reverse 16 and shift
|
|
|
1991 // e.g. 11 bits, bit reverse and shift away 5
|
|
|
1992 return bitreverse16(v) >> (16-bits);
|
|
|
1993 }
|
|
|
1994
|
|
|
1995 static int zbuild_huffman(zhuffman *z, uint8 *sizelist, int num)
|
|
|
1996 {
|
|
|
1997 int i,k=0;
|
|
|
1998 int code, next_code[16], sizes[17];
|
|
|
1999
|
|
|
2000 // DEFLATE spec for generating codes
|
|
|
2001 memset(sizes, 0, sizeof(sizes));
|
|
|
2002 memset(z->fast, 255, sizeof(z->fast));
|
|
|
2003 for (i=0; i < num; ++i)
|
|
|
2004 ++sizes[sizelist[i]];
|
|
|
2005 sizes[0] = 0;
|
|
|
2006 for (i=1; i < 16; ++i)
|
|
|
2007 assert(sizes[i] <= (1 << i));
|
|
|
2008 code = 0;
|
|
|
2009 for (i=1; i < 16; ++i) {
|
|
|
2010 next_code[i] = code;
|
|
|
2011 z->firstcode[i] = (uint16) code;
|
|
|
2012 z->firstsymbol[i] = (uint16) k;
|
|
|
2013 code = (code + sizes[i]);
|
|
|
2014 if (sizes[i])
|
|
|
2015 if (code-1 >= (1 << i)) return e("bad codelengths","Corrupt JPEG");
|
|
|
2016 z->maxcode[i] = code << (16-i); // preshift for inner loop
|
|
|
2017 code <<= 1;
|
|
|
2018 k += sizes[i];
|
|
|
2019 }
|
|
|
2020 z->maxcode[16] = 0x10000; // sentinel
|
|
|
2021 for (i=0; i < num; ++i) {
|
|
|
2022 int s = sizelist[i];
|
|
|
2023 if (s) {
|
|
|
2024 int c = next_code[s] - z->firstcode[s] + z->firstsymbol[s];
|
|
|
2025 z->size[c] = (uint8)s;
|
|
|
2026 z->value[c] = (uint16)i;
|
|
|
2027 if (s <= ZFAST_BITS) {
|
|
|
2028 int k = bit_reverse(next_code[s],s);
|
|
|
2029 while (k < (1 << ZFAST_BITS)) {
|
|
|
2030 z->fast[k] = (uint16) c;
|
|
|
2031 k += (1 << s);
|
|
|
2032 }
|
|
|
2033 }
|
|
|
2034 ++next_code[s];
|
|
|
2035 }
|
|
|
2036 }
|
|
|
2037 return 1;
|
|
|
2038 }
|
|
|
2039
|
|
|
2040 // zlib-from-memory implementation for PNG reading
|
|
|
2041 // because PNG allows splitting the zlib stream arbitrarily,
|
|
|
2042 // and it's annoying structurally to have PNG call ZLIB call PNG,
|
|
|
2043 // we require PNG read all the IDATs and combine them into a single
|
|
|
2044 // memory buffer
|
|
|
2045
|
|
|
2046 typedef struct
|
|
|
2047 {
|
|
|
2048 uint8 *zbuffer, *zbuffer_end;
|
|
|
2049 int num_bits;
|
|
|
2050 uint32 code_buffer;
|
|
|
2051
|
|
|
2052 char *zout;
|
|
|
2053 char *zout_start;
|
|
|
2054 char *zout_end;
|
|
|
2055 int z_expandable;
|
|
|
2056
|
|
|
2057 zhuffman z_length, z_distance;
|
|
|
2058 } zbuf;
|
|
|
2059
|
|
|
2060 stbi_inline static int zget8(zbuf *z)
|
|
|
2061 {
|
|
|
2062 if (z->zbuffer >= z->zbuffer_end) return 0;
|
|
|
2063 return *z->zbuffer++;
|
|
|
2064 }
|
|
|
2065
|
|
|
2066 static void fill_bits(zbuf *z)
|
|
|
2067 {
|
|
|
2068 do {
|
|
|
2069 assert(z->code_buffer < (1U << z->num_bits));
|
|
|
2070 z->code_buffer |= zget8(z) << z->num_bits;
|
|
|
2071 z->num_bits += 8;
|
|
|
2072 } while (z->num_bits <= 24);
|
|
|
2073 }
|
|
|
2074
|
|
|
2075 stbi_inline static unsigned int zreceive(zbuf *z, int n)
|
|
|
2076 {
|
|
|
2077 unsigned int k;
|
|
|
2078 if (z->num_bits < n) fill_bits(z);
|
|
|
2079 k = z->code_buffer & ((1 << n) - 1);
|
|
|
2080 z->code_buffer >>= n;
|
|
|
2081 z->num_bits -= n;
|
|
|
2082 return k;
|
|
|
2083 }
|
|
|
2084
|
|
|
2085 stbi_inline static int zhuffman_decode(zbuf *a, zhuffman *z)
|
|
|
2086 {
|
|
|
2087 int b,s,k;
|
|
|
2088 if (a->num_bits < 16) fill_bits(a);
|
|
|
2089 b = z->fast[a->code_buffer & ZFAST_MASK];
|
|
|
2090 if (b < 0xffff) {
|
|
|
2091 s = z->size[b];
|
|
|
2092 a->code_buffer >>= s;
|
|
|
2093 a->num_bits -= s;
|
|
|
2094 return z->value[b];
|
|
|
2095 }
|
|
|
2096
|
|
|
2097 // not resolved by fast table, so compute it the slow way
|
|
|
2098 // use jpeg approach, which requires MSbits at top
|
|
|
2099 k = bit_reverse(a->code_buffer, 16);
|
|
|
2100 for (s=ZFAST_BITS+1; ; ++s)
|
|
|
2101 if (k < z->maxcode[s])
|
|
|
2102 break;
|
|
|
2103 if (s == 16) return -1; // invalid code!
|
|
|
2104 // code size is s, so:
|
|
|
2105 b = (k >> (16-s)) - z->firstcode[s] + z->firstsymbol[s];
|
|
|
2106 assert(z->size[b] == s);
|
|
|
2107 a->code_buffer >>= s;
|
|
|
2108 a->num_bits -= s;
|
|
|
2109 return z->value[b];
|
|
|
2110 }
|
|
|
2111
|
|
|
2112 static int expand(zbuf *z, int n) // need to make room for n bytes
|
|
|
2113 {
|
|
|
2114 char *q;
|
|
|
2115 int cur, limit;
|
|
|
2116 if (!z->z_expandable) return e("output buffer limit","Corrupt PNG");
|
|
|
2117 cur = (int) (z->zout - z->zout_start);
|
|
|
2118 limit = (int) (z->zout_end - z->zout_start);
|
|
|
2119 while (cur + n > limit)
|
|
|
2120 limit *= 2;
|
|
|
2121 q = (char *) realloc(z->zout_start, limit);
|
|
|
2122 if (q == NULL) return e("outofmem", "Out of memory");
|
|
|
2123 z->zout_start = q;
|
|
|
2124 z->zout = q + cur;
|
|
|
2125 z->zout_end = q + limit;
|
|
|
2126 return 1;
|
|
|
2127 }
|
|
|
2128
|
|
|
2129 static int length_base[31] = {
|
|
|
2130 3,4,5,6,7,8,9,10,11,13,
|
|
|
2131 15,17,19,23,27,31,35,43,51,59,
|
|
|
2132 67,83,99,115,131,163,195,227,258,0,0 };
|
|
|
2133
|
|
|
2134 static int length_extra[31]=
|
|
|
2135 { 0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0 };
|
|
|
2136
|
|
|
2137 static int dist_base[32] = { 1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,
|
|
|
2138 257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0};
|
|
|
2139
|
|
|
2140 static int dist_extra[32] =
|
|
|
2141 { 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};
|
|
|
2142
|
|
|
2143 static int parse_huffman_block(zbuf *a)
|
|
|
2144 {
|
|
|
2145 for(;;) {
|
|
|
2146 int z = zhuffman_decode(a, &a->z_length);
|
|
|
2147 if (z < 256) {
|
|
|
2148 if (z < 0) return e("bad huffman code","Corrupt PNG"); // error in huffman codes
|
|
|
2149 if (a->zout >= a->zout_end) if (!expand(a, 1)) return 0;
|
|
|
2150 *a->zout++ = (char) z;
|
|
|
2151 } else {
|
|
|
2152 uint8 *p;
|
|
|
2153 int len,dist;
|
|
|
2154 if (z == 256) return 1;
|
|
|
2155 z -= 257;
|
|
|
2156 len = length_base[z];
|
|
|
2157 if (length_extra[z]) len += zreceive(a, length_extra[z]);
|
|
|
2158 z = zhuffman_decode(a, &a->z_distance);
|
|
|
2159 if (z < 0) return e("bad huffman code","Corrupt PNG");
|
|
|
2160 dist = dist_base[z];
|
|
|
2161 if (dist_extra[z]) dist += zreceive(a, dist_extra[z]);
|
|
|
2162 if (a->zout - a->zout_start < dist) return e("bad dist","Corrupt PNG");
|
|
|
2163 if (a->zout + len > a->zout_end) if (!expand(a, len)) return 0;
|
|
|
2164 p = (uint8 *) (a->zout - dist);
|
|
|
2165 while (len--)
|
|
|
2166 *a->zout++ = *p++;
|
|
|
2167 }
|
|
|
2168 }
|
|
|
2169 }
|
|
|
2170
|
|
|
2171 static int compute_huffman_codes(zbuf *a)
|
|
|
2172 {
|
|
|
2173 static uint8 length_dezigzag[19] = { 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15 };
|
|
|
2174 zhuffman z_codelength;
|
|
|
2175 uint8 lencodes[286+32+137];//padding for maximum single op
|
|
|
2176 uint8 codelength_sizes[19];
|
|
|
2177 int i,n;
|
|
|
2178
|
|
|
2179 int hlit = zreceive(a,5) + 257;
|
|
|
2180 int hdist = zreceive(a,5) + 1;
|
|
|
2181 int hclen = zreceive(a,4) + 4;
|
|
|
2182
|
|
|
2183 memset(codelength_sizes, 0, sizeof(codelength_sizes));
|
|
|
2184 for (i=0; i < hclen; ++i) {
|
|
|
2185 int s = zreceive(a,3);
|
|
|
2186 codelength_sizes[length_dezigzag[i]] = (uint8) s;
|
|
|
2187 }
|
|
|
2188 if (!zbuild_huffman(&z_codelength, codelength_sizes, 19)) return 0;
|
|
|
2189
|
|
|
2190 n = 0;
|
|
|
2191 while (n < hlit + hdist) {
|
|
|
2192 int c = zhuffman_decode(a, &z_codelength);
|
|
|
2193 assert(c >= 0 && c < 19);
|
|
|
2194 if (c < 16)
|
|
|
2195 lencodes[n++] = (uint8) c;
|
|
|
2196 else if (c == 16) {
|
|
|
2197 c = zreceive(a,2)+3;
|
|
|
2198 memset(lencodes+n, lencodes[n-1], c);
|
|
|
2199 n += c;
|
|
|
2200 } else if (c == 17) {
|
|
|
2201 c = zreceive(a,3)+3;
|
|
|
2202 memset(lencodes+n, 0, c);
|
|
|
2203 n += c;
|
|
|
2204 } else {
|
|
|
2205 assert(c == 18);
|
|
|
2206 c = zreceive(a,7)+11;
|
|
|
2207 memset(lencodes+n, 0, c);
|
|
|
2208 n += c;
|
|
|
2209 }
|
|
|
2210 }
|
|
|
2211 if (n != hlit+hdist) return e("bad codelengths","Corrupt PNG");
|
|
|
2212 if (!zbuild_huffman(&a->z_length, lencodes, hlit)) return 0;
|
|
|
2213 if (!zbuild_huffman(&a->z_distance, lencodes+hlit, hdist)) return 0;
|
|
|
2214 return 1;
|
|
|
2215 }
|
|
|
2216
|
|
|
2217 static int parse_uncompressed_block(zbuf *a)
|
|
|
2218 {
|
|
|
2219 uint8 header[4];
|
|
|
2220 int len,nlen,k;
|
|
|
2221 if (a->num_bits & 7)
|
|
|
2222 zreceive(a, a->num_bits & 7); // discard
|
|
|
2223 // drain the bit-packed data into header
|
|
|
2224 k = 0;
|
|
|
2225 while (a->num_bits > 0) {
|
|
|
2226 header[k++] = (uint8) (a->code_buffer & 255); // wtf this warns?
|
|
|
2227 a->code_buffer >>= 8;
|
|
|
2228 a->num_bits -= 8;
|
|
|
2229 }
|
|
|
2230 assert(a->num_bits == 0);
|
|
|
2231 // now fill header the normal way
|
|
|
2232 while (k < 4)
|
|
|
2233 header[k++] = (uint8) zget8(a);
|
|
|
2234 len = header[1] * 256 + header[0];
|
|
|
2235 nlen = header[3] * 256 + header[2];
|
|
|
2236 if (nlen != (len ^ 0xffff)) return e("zlib corrupt","Corrupt PNG");
|
|
|
2237 if (a->zbuffer + len > a->zbuffer_end) return e("read past buffer","Corrupt PNG");
|
|
|
2238 if (a->zout + len > a->zout_end)
|
|
|
2239 if (!expand(a, len)) return 0;
|
|
|
2240 memcpy(a->zout, a->zbuffer, len);
|
|
|
2241 a->zbuffer += len;
|
|
|
2242 a->zout += len;
|
|
|
2243 return 1;
|
|
|
2244 }
|
|
|
2245
|
|
|
2246 static int parse_zlib_header(zbuf *a)
|
|
|
2247 {
|
|
|
2248 int cmf = zget8(a);
|
|
|
2249 int cm = cmf & 15;
|
|
|
2250 // int cinfo = cmf >> 4;
|
|
|
2251 int flg = zget8(a);
|
|
|
2252 if ((cmf*256+flg) % 31 != 0) return e("bad zlib header","Corrupt PNG"); // zlib spec
|
|
|
2253 if (flg & 32) return e("no preset dict","Corrupt PNG"); // preset dictionary not allowed in png
|
|
|
2254 if (cm != 8) return e("bad compression","Corrupt PNG"); // DEFLATE required for png
|
|
|
2255 // window = 1 << (8 + cinfo)... but who cares, we fully buffer output
|
|
|
2256 return 1;
|
|
|
2257 }
|
|
|
2258
|
|
|
2259 // @TODO: should statically initialize these for optimal thread safety
|
|
|
2260 static uint8 default_length[288], default_distance[32];
|
|
|
2261 static void init_defaults(void)
|
|
|
2262 {
|
|
|
2263 int i; // use <= to match clearly with spec
|
|
|
2264 for (i=0; i <= 143; ++i) default_length[i] = 8;
|
|
|
2265 for ( ; i <= 255; ++i) default_length[i] = 9;
|
|
|
2266 for ( ; i <= 279; ++i) default_length[i] = 7;
|
|
|
2267 for ( ; i <= 287; ++i) default_length[i] = 8;
|
|
|
2268
|
|
|
2269 for (i=0; i <= 31; ++i) default_distance[i] = 5;
|
|
|
2270 }
|
|
|
2271
|
|
|
2272 int stbi_png_partial; // a quick hack to only allow decoding some of a PNG... I should implement real streaming support instead
|
|
|
2273 static int parse_zlib(zbuf *a, int parse_header)
|
|
|
2274 {
|
|
|
2275 int final, type;
|
|
|
2276 if (parse_header)
|
|
|
2277 if (!parse_zlib_header(a)) return 0;
|
|
|
2278 a->num_bits = 0;
|
|
|
2279 a->code_buffer = 0;
|
|
|
2280 do {
|
|
|
2281 final = zreceive(a,1);
|
|
|
2282 type = zreceive(a,2);
|
|
|
2283 if (type == 0) {
|
|
|
2284 if (!parse_uncompressed_block(a)) return 0;
|
|
|
2285 } else if (type == 3) {
|
|
|
2286 return 0;
|
|
|
2287 } else {
|
|
|
2288 if (type == 1) {
|
|
|
2289 // use fixed code lengths
|
|
|
2290 if (!default_distance[31]) init_defaults();
|
|
|
2291 if (!zbuild_huffman(&a->z_length , default_length , 288)) return 0;
|
|
|
2292 if (!zbuild_huffman(&a->z_distance, default_distance, 32)) return 0;
|
|
|
2293 } else {
|
|
|
2294 if (!compute_huffman_codes(a)) return 0;
|
|
|
2295 }
|
|
|
2296 if (!parse_huffman_block(a)) return 0;
|
|
|
2297 }
|
|
|
2298 if (stbi_png_partial && a->zout - a->zout_start > 65536)
|
|
|
2299 break;
|
|
|
2300 } while (!final);
|
|
|
2301 return 1;
|
|
|
2302 }
|
|
|
2303
|
|
|
2304 static int do_zlib(zbuf *a, char *obuf, int olen, int exp, int parse_header)
|
|
|
2305 {
|
|
|
2306 a->zout_start = obuf;
|
|
|
2307 a->zout = obuf;
|
|
|
2308 a->zout_end = obuf + olen;
|
|
|
2309 a->z_expandable = exp;
|
|
|
2310
|
|
|
2311 return parse_zlib(a, parse_header);
|
|
|
2312 }
|
|
|
2313
|
|
|
2314 char *stbi_zlib_decode_malloc_guesssize(const char *buffer, int len, int initial_size, int *outlen)
|
|
|
2315 {
|
|
|
2316 zbuf a;
|
|
|
2317 char *p = (char *) malloc(initial_size);
|
|
|
2318 if (p == NULL) return NULL;
|
|
|
2319 a.zbuffer = (uint8 *) buffer;
|
|
|
2320 a.zbuffer_end = (uint8 *) buffer + len;
|
|
|
2321 if (do_zlib(&a, p, initial_size, 1, 1)) {
|
|
|
2322 if (outlen) *outlen = (int) (a.zout - a.zout_start);
|
|
|
2323 return a.zout_start;
|
|
|
2324 } else {
|
|
|
2325 free(a.zout_start);
|
|
|
2326 return NULL;
|
|
|
2327 }
|
|
|
2328 }
|
|
|
2329
|
|
|
2330 char *stbi_zlib_decode_malloc(char const *buffer, int len, int *outlen)
|
|
|
2331 {
|
|
|
2332 return stbi_zlib_decode_malloc_guesssize(buffer, len, 16384, outlen);
|
|
|
2333 }
|
|
|
2334
|
|
|
2335 char *stbi_zlib_decode_malloc_guesssize_headerflag(const char *buffer, int len, int initial_size, int *outlen, int parse_header)
|
|
|
2336 {
|
|
|
2337 zbuf a;
|
|
|
2338 char *p = (char *) malloc(initial_size);
|
|
|
2339 if (p == NULL) return NULL;
|
|
|
2340 a.zbuffer = (uint8 *) buffer;
|
|
|
2341 a.zbuffer_end = (uint8 *) buffer + len;
|
|
|
2342 if (do_zlib(&a, p, initial_size, 1, parse_header)) {
|
|
|
2343 if (outlen) *outlen = (int) (a.zout - a.zout_start);
|
|
|
2344 return a.zout_start;
|
|
|
2345 } else {
|
|
|
2346 free(a.zout_start);
|
|
|
2347 return NULL;
|
|
|
2348 }
|
|
|
2349 }
|
|
|
2350
|
|
|
2351 int stbi_zlib_decode_buffer(char *obuffer, int olen, char const *ibuffer, int ilen)
|
|
|
2352 {
|
|
|
2353 zbuf a;
|
|
|
2354 a.zbuffer = (uint8 *) ibuffer;
|
|
|
2355 a.zbuffer_end = (uint8 *) ibuffer + ilen;
|
|
|
2356 if (do_zlib(&a, obuffer, olen, 0, 1))
|
|
|
2357 return (int) (a.zout - a.zout_start);
|
|
|
2358 else
|
|
|
2359 return -1;
|
|
|
2360 }
|
|
|
2361
|
|
|
2362 char *stbi_zlib_decode_noheader_malloc(char const *buffer, int len, int *outlen)
|
|
|
2363 {
|
|
|
2364 zbuf a;
|
|
|
2365 char *p = (char *) malloc(16384);
|
|
|
2366 if (p == NULL) return NULL;
|
|
|
2367 a.zbuffer = (uint8 *) buffer;
|
|
|
2368 a.zbuffer_end = (uint8 *) buffer+len;
|
|
|
2369 if (do_zlib(&a, p, 16384, 1, 0)) {
|
|
|
2370 if (outlen) *outlen = (int) (a.zout - a.zout_start);
|
|
|
2371 return a.zout_start;
|
|
|
2372 } else {
|
|
|
2373 free(a.zout_start);
|
|
|
2374 return NULL;
|
|
|
2375 }
|
|
|
2376 }
|
|
|
2377
|
|
|
2378 int stbi_zlib_decode_noheader_buffer(char *obuffer, int olen, const char *ibuffer, int ilen)
|
|
|
2379 {
|
|
|
2380 zbuf a;
|
|
|
2381 a.zbuffer = (uint8 *) ibuffer;
|
|
|
2382 a.zbuffer_end = (uint8 *) ibuffer + ilen;
|
|
|
2383 if (do_zlib(&a, obuffer, olen, 0, 0))
|
|
|
2384 return (int) (a.zout - a.zout_start);
|
|
|
2385 else
|
|
|
2386 return -1;
|
|
|
2387 }
|
|
|
2388
|
|
|
2389 // public domain "baseline" PNG decoder v0.10 Sean Barrett 2006-11-18
|
|
|
2390 // simple implementation
|
|
|
2391 // - only 8-bit samples
|
|
|
2392 // - no CRC checking
|
|
|
2393 // - allocates lots of intermediate memory
|
|
|
2394 // - avoids problem of streaming data between subsystems
|
|
|
2395 // - avoids explicit window management
|
|
|
2396 // performance
|
|
|
2397 // - uses stb_zlib, a PD zlib implementation with fast huffman decoding
|
|
|
2398
|
|
|
2399
|
|
|
2400 typedef struct
|
|
|
2401 {
|
|
|
2402 uint32 length;
|
|
|
2403 uint32 type;
|
|
|
2404 } chunk;
|
|
|
2405
|
|
|
2406 #define PNG_TYPE(a,b,c,d) (((a) << 24) + ((b) << 16) + ((c) << 8) + (d))
|
|
|
2407
|
|
|
2408 static chunk get_chunk_header(stbi *s)
|
|
|
2409 {
|
|
|
2410 chunk c;
|
|
|
2411 c.length = get32(s);
|
|
|
2412 c.type = get32(s);
|
|
|
2413 return c;
|
|
|
2414 }
|
|
|
2415
|
|
|
2416 static int check_png_header(stbi *s)
|
|
|
2417 {
|
|
|
2418 static uint8 png_sig[8] = { 137,80,78,71,13,10,26,10 };
|
|
|
2419 int i;
|
|
|
2420 for (i=0; i < 8; ++i)
|
|
|
2421 if (get8u(s) != png_sig[i]) return e("bad png sig","Not a PNG");
|
|
|
2422 return 1;
|
|
|
2423 }
|
|
|
2424
|
|
|
2425 typedef struct
|
|
|
2426 {
|
|
|
2427 stbi *s;
|
|
|
2428 uint8 *idata, *expanded, *out;
|
|
|
2429 } png;
|
|
|
2430
|
|
|
2431
|
|
|
2432 enum {
|
|
|
2433 F_none=0, F_sub=1, F_up=2, F_avg=3, F_paeth=4,
|
|
|
2434 F_avg_first, F_paeth_first
|
|
|
2435 };
|
|
|
2436
|
|
|
2437 static uint8 first_row_filter[5] =
|
|
|
2438 {
|
|
|
2439 F_none, F_sub, F_none, F_avg_first, F_paeth_first
|
|
|
2440 };
|
|
|
2441
|
|
|
2442 static int paeth(int a, int b, int c)
|
|
|
2443 {
|
|
|
2444 int p = a + b - c;
|
|
|
2445 int pa = abs(p-a);
|
|
|
2446 int pb = abs(p-b);
|
|
|
2447 int pc = abs(p-c);
|
|
|
2448 if (pa <= pb && pa <= pc) return a;
|
|
|
2449 if (pb <= pc) return b;
|
|
|
2450 return c;
|
|
|
2451 }
|
|
|
2452
|
|
|
2453 // create the png data from post-deflated data
|
|
|
2454 static int create_png_image_raw(png *a, uint8 *raw, uint32 raw_len, int out_n, uint32 x, uint32 y)
|
|
|
2455 {
|
|
|
2456 stbi *s = a->s;
|
|
|
2457 uint32 i,j,stride = x*out_n;
|
|
|
2458 int k;
|
|
|
2459 int img_n = s->img_n; // copy it into a local for later
|
|
|
2460 assert(out_n == s->img_n || out_n == s->img_n+1);
|
|
|
2461 if (stbi_png_partial) y = 1;
|
|
|
2462 a->out = (uint8 *) malloc(x * y * out_n);
|
|
|
2463 if (!a->out) return e("outofmem", "Out of memory");
|
|
|
2464 if (!stbi_png_partial) {
|
|
|
2465 if (s->img_x == x && s->img_y == y) {
|
|
|
2466 if (raw_len != (img_n * x + 1) * y) return e("not enough pixels","Corrupt PNG");
|
|
|
2467 } else { // interlaced:
|
|
|
2468 if (raw_len < (img_n * x + 1) * y) return e("not enough pixels","Corrupt PNG");
|
|
|
2469 }
|
|
|
2470 }
|
|
|
2471 for (j=0; j < y; ++j) {
|
|
|
2472 uint8 *cur = a->out + stride*j;
|
|
|
2473 uint8 *prior = cur - stride;
|
|
|
2474 int filter = *raw++;
|
|
|
2475 if (filter > 4) return e("invalid filter","Corrupt PNG");
|
|
|
2476 // if first row, use special filter that doesn't sample previous row
|
|
|
2477 if (j == 0) filter = first_row_filter[filter];
|
|
|
2478 // handle first pixel explicitly
|
|
|
2479 for (k=0; k < img_n; ++k) {
|
|
|
2480 switch (filter) {
|
|
|
2481 case F_none : cur[k] = raw[k]; break;
|
|
|
2482 case F_sub : cur[k] = raw[k]; break;
|
|
|
2483 case F_up : cur[k] = raw[k] + prior[k]; break;
|
|
|
2484 case F_avg : cur[k] = raw[k] + (prior[k]>>1); break;
|
|
|
2485 case F_paeth : cur[k] = (uint8) (raw[k] + paeth(0,prior[k],0)); break;
|
|
|
2486 case F_avg_first : cur[k] = raw[k]; break;
|
|
|
2487 case F_paeth_first: cur[k] = raw[k]; break;
|
|
|
2488 }
|
|
|
2489 }
|
|
|
2490 if (img_n != out_n) cur[img_n] = 255;
|
|
|
2491 raw += img_n;
|
|
|
2492 cur += out_n;
|
|
|
2493 prior += out_n;
|
|
|
2494 // this is a little gross, so that we don't switch per-pixel or per-component
|
|
|
2495 if (img_n == out_n) {
|
|
|
2496 #define CASE(f) \
|
|
|
2497 case f: \
|
|
|
2498 for (i=x-1; i >= 1; --i, raw+=img_n,cur+=img_n,prior+=img_n) \
|
|
|
2499 for (k=0; k < img_n; ++k)
|
|
|
2500 switch (filter) {
|
|
|
2501 CASE(F_none) cur[k] = raw[k]; break;
|
|
|
2502 CASE(F_sub) cur[k] = raw[k] + cur[k-img_n]; break;
|
|
|
2503 CASE(F_up) cur[k] = raw[k] + prior[k]; break;
|
|
|
2504 CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-img_n])>>1); break;
|
|
|
2505 CASE(F_paeth) cur[k] = (uint8) (raw[k] + paeth(cur[k-img_n],prior[k],prior[k-img_n])); break;
|
|
|
2506 CASE(F_avg_first) cur[k] = raw[k] + (cur[k-img_n] >> 1); break;
|
|
|
2507 CASE(F_paeth_first) cur[k] = (uint8) (raw[k] + paeth(cur[k-img_n],0,0)); break;
|
|
|
2508 }
|
|
|
2509 #undef CASE
|
|
|
2510 } else {
|
|
|
2511 assert(img_n+1 == out_n);
|
|
|
2512 #define CASE(f) \
|
|
|
2513 case f: \
|
|
|
2514 for (i=x-1; i >= 1; --i, cur[img_n]=255,raw+=img_n,cur+=out_n,prior+=out_n) \
|
|
|
2515 for (k=0; k < img_n; ++k)
|
|
|
2516 switch (filter) {
|
|
|
2517 CASE(F_none) cur[k] = raw[k]; break;
|
|
|
2518 CASE(F_sub) cur[k] = raw[k] + cur[k-out_n]; break;
|
|
|
2519 CASE(F_up) cur[k] = raw[k] + prior[k]; break;
|
|
|
2520 CASE(F_avg) cur[k] = raw[k] + ((prior[k] + cur[k-out_n])>>1); break;
|
|
|
2521 CASE(F_paeth) cur[k] = (uint8) (raw[k] + paeth(cur[k-out_n],prior[k],prior[k-out_n])); break;
|
|
|
2522 CASE(F_avg_first) cur[k] = raw[k] + (cur[k-out_n] >> 1); break;
|
|
|
2523 CASE(F_paeth_first) cur[k] = (uint8) (raw[k] + paeth(cur[k-out_n],0,0)); break;
|
|
|
2524 }
|
|
|
2525 #undef CASE
|
|
|
2526 }
|
|
|
2527 }
|
|
|
2528 return 1;
|
|
|
2529 }
|
|
|
2530
|
|
|
2531 static int create_png_image(png *a, uint8 *raw, uint32 raw_len, int out_n, int interlaced)
|
|
|
2532 {
|
|
|
2533 uint8 *final;
|
|
|
2534 int p;
|
|
|
2535 int save;
|
|
|
2536 if (!interlaced)
|
|
|
2537 return create_png_image_raw(a, raw, raw_len, out_n, a->s->img_x, a->s->img_y);
|
|
|
2538 save = stbi_png_partial;
|
|
|
2539 stbi_png_partial = 0;
|
|
|
2540
|
|
|
2541 // de-interlacing
|
|
|
2542 final = (uint8 *) malloc(a->s->img_x * a->s->img_y * out_n);
|
|
|
2543 for (p=0; p < 7; ++p) {
|
|
|
2544 int xorig[] = { 0,4,0,2,0,1,0 };
|
|
|
2545 int yorig[] = { 0,0,4,0,2,0,1 };
|
|
|
2546 int xspc[] = { 8,8,4,4,2,2,1 };
|
|
|
2547 int yspc[] = { 8,8,8,4,4,2,2 };
|
|
|
2548 int i,j,x,y;
|
|
|
2549 // pass1_x[4] = 0, pass1_x[5] = 1, pass1_x[12] = 1
|
|
|
2550 x = (a->s->img_x - xorig[p] + xspc[p]-1) / xspc[p];
|
|
|
2551 y = (a->s->img_y - yorig[p] + yspc[p]-1) / yspc[p];
|
|
|
2552 if (x && y) {
|
|
|
2553 if (!create_png_image_raw(a, raw, raw_len, out_n, x, y)) {
|
|
|
2554 free(final);
|
|
|
2555 return 0;
|
|
|
2556 }
|
|
|
2557 for (j=0; j < y; ++j)
|
|
|
2558 for (i=0; i < x; ++i)
|
|
|
2559 memcpy(final + (j*yspc[p]+yorig[p])*a->s->img_x*out_n + (i*xspc[p]+xorig[p])*out_n,
|
|
|
2560 a->out + (j*x+i)*out_n, out_n);
|
|
|
2561 free(a->out);
|
|
|
2562 raw += (x*out_n+1)*y;
|
|
|
2563 raw_len -= (x*out_n+1)*y;
|
|
|
2564 }
|
|
|
2565 }
|
|
|
2566 a->out = final;
|
|
|
2567
|
|
|
2568 stbi_png_partial = save;
|
|
|
2569 return 1;
|
|
|
2570 }
|
|
|
2571
|
|
|
2572 static int compute_transparency(png *z, uint8 tc[3], int out_n)
|
|
|
2573 {
|
|
|
2574 stbi *s = z->s;
|
|
|
2575 uint32 i, pixel_count = s->img_x * s->img_y;
|
|
|
2576 uint8 *p = z->out;
|
|
|
2577
|
|
|
2578 // compute color-based transparency, assuming we've
|
|
|
2579 // already got 255 as the alpha value in the output
|
|
|
2580 assert(out_n == 2 || out_n == 4);
|
|
|
2581
|
|
|
2582 if (out_n == 2) {
|
|
|
2583 for (i=0; i < pixel_count; ++i) {
|
|
|
2584 p[1] = (p[0] == tc[0] ? 0 : 255);
|
|
|
2585 p += 2;
|
|
|
2586 }
|
|
|
2587 } else {
|
|
|
2588 for (i=0; i < pixel_count; ++i) {
|
|
|
2589 if (p[0] == tc[0] && p[1] == tc[1] && p[2] == tc[2])
|
|
|
2590 p[3] = 0;
|
|
|
2591 p += 4;
|
|
|
2592 }
|
|
|
2593 }
|
|
|
2594 return 1;
|
|
|
2595 }
|
|
|
2596
|
|
|
2597 static int expand_palette(png *a, uint8 *palette, int len, int pal_img_n)
|
|
|
2598 {
|
|
|
2599 uint32 i, pixel_count = a->s->img_x * a->s->img_y;
|
|
|
2600 uint8 *p, *temp_out, *orig = a->out;
|
|
|
2601
|
|
|
2602 p = (uint8 *) malloc(pixel_count * pal_img_n);
|
|
|
2603 if (p == NULL) return e("outofmem", "Out of memory");
|
|
|
2604
|
|
|
2605 // between here and free(out) below, exitting would leak
|
|
|
2606 temp_out = p;
|
|
|
2607
|
|
|
2608 if (pal_img_n == 3) {
|
|
|
2609 for (i=0; i < pixel_count; ++i) {
|
|
|
2610 int n = orig[i]*4;
|
|
|
2611 p[0] = palette[n ];
|
|
|
2612 p[1] = palette[n+1];
|
|
|
2613 p[2] = palette[n+2];
|
|
|
2614 p += 3;
|
|
|
2615 }
|
|
|
2616 } else {
|
|
|
2617 for (i=0; i < pixel_count; ++i) {
|
|
|
2618 int n = orig[i]*4;
|
|
|
2619 p[0] = palette[n ];
|
|
|
2620 p[1] = palette[n+1];
|
|
|
2621 p[2] = palette[n+2];
|
|
|
2622 p[3] = palette[n+3];
|
|
|
2623 p += 4;
|
|
|
2624 }
|
|
|
2625 }
|
|
|
2626 free(a->out);
|
|
|
2627 a->out = temp_out;
|
|
|
2628
|
|
|
2629 STBI_NOTUSED(len);
|
|
|
2630
|
|
|
2631 return 1;
|
|
|
2632 }
|
|
|
2633
|
|
|
2634 static int stbi_unpremultiply_on_load = 0;
|
|
|
2635 static int stbi_de_iphone_flag = 0;
|
|
|
2636
|
|
|
2637 void stbi_set_unpremultiply_on_load(int flag_true_if_should_unpremultiply)
|
|
|
2638 {
|
|
|
2639 stbi_unpremultiply_on_load = flag_true_if_should_unpremultiply;
|
|
|
2640 }
|
|
|
2641 void stbi_convert_iphone_png_to_rgb(int flag_true_if_should_convert)
|
|
|
2642 {
|
|
|
2643 stbi_de_iphone_flag = flag_true_if_should_convert;
|
|
|
2644 }
|
|
|
2645
|
|
|
2646 static void stbi_de_iphone(png *z)
|
|
|
2647 {
|
|
|
2648 stbi *s = z->s;
|
|
|
2649 uint32 i, pixel_count = s->img_x * s->img_y;
|
|
|
2650 uint8 *p = z->out;
|
|
|
2651
|
|
|
2652 if (s->img_out_n == 3) { // convert bgr to rgb
|
|
|
2653 for (i=0; i < pixel_count; ++i) {
|
|
|
2654 uint8 t = p[0];
|
|
|
2655 p[0] = p[2];
|
|
|
2656 p[2] = t;
|
|
|
2657 p += 3;
|
|
|
2658 }
|
|
|
2659 } else {
|
|
|
2660 assert(s->img_out_n == 4);
|
|
|
2661 if (stbi_unpremultiply_on_load) {
|
|
|
2662 // convert bgr to rgb and unpremultiply
|
|
|
2663 for (i=0; i < pixel_count; ++i) {
|
|
|
2664 uint8 a = p[3];
|
|
|
2665 uint8 t = p[0];
|
|
|
2666 if (a) {
|
|
|
2667 p[0] = p[2] * 255 / a;
|
|
|
2668 p[1] = p[1] * 255 / a;
|
|
|
2669 p[2] = t * 255 / a;
|
|
|
2670 } else {
|
|
|
2671 p[0] = p[2];
|
|
|
2672 p[2] = t;
|
|
|
2673 }
|
|
|
2674 p += 4;
|
|
|
2675 }
|
|
|
2676 } else {
|
|
|
2677 // convert bgr to rgb
|
|
|
2678 for (i=0; i < pixel_count; ++i) {
|
|
|
2679 uint8 t = p[0];
|
|
|
2680 p[0] = p[2];
|
|
|
2681 p[2] = t;
|
|
|
2682 p += 4;
|
|
|
2683 }
|
|
|
2684 }
|
|
|
2685 }
|
|
|
2686 }
|
|
|
2687
|
|
|
2688 static int parse_png_file(png *z, int scan, int req_comp)
|
|
|
2689 {
|
|
|
2690 uint8 palette[1024], pal_img_n=0;
|
|
|
2691 uint8 has_trans=0, tc[3];
|
|
|
2692 uint32 ioff=0, idata_limit=0, i, pal_len=0;
|
|
|
2693 int first=1,k,interlace=0, iphone=0;
|
|
|
2694 stbi *s = z->s;
|
|
|
2695
|
|
|
2696 z->expanded = NULL;
|
|
|
2697 z->idata = NULL;
|
|
|
2698 z->out = NULL;
|
|
|
2699
|
|
|
2700 if (!check_png_header(s)) return 0;
|
|
|
2701
|
|
|
2702 if (scan == SCAN_type) return 1;
|
|
|
2703
|
|
|
2704 for (;;) {
|
|
|
2705 chunk c = get_chunk_header(s);
|
|
|
2706 switch (c.type) {
|
|
|
2707 case PNG_TYPE('C','g','B','I'):
|
|
|
2708 iphone = stbi_de_iphone_flag;
|
|
|
2709 skip(s, c.length);
|
|
|
2710 break;
|
|
|
2711 case PNG_TYPE('I','H','D','R'): {
|
|
|
2712 int depth,color,comp,filter;
|
|
|
2713 if (!first) return e("multiple IHDR","Corrupt PNG");
|
|
|
2714 first = 0;
|
|
|
2715 if (c.length != 13) return e("bad IHDR len","Corrupt PNG");
|
|
|
2716 s->img_x = get32(s); if (s->img_x > (1 << 24)) return e("too large","Very large image (corrupt?)");
|
|
|
2717 s->img_y = get32(s); if (s->img_y > (1 << 24)) return e("too large","Very large image (corrupt?)");
|
|
|
2718 depth = get8(s); if (depth != 8) return e("8bit only","PNG not supported: 8-bit only");
|
|
|
2719 color = get8(s); if (color > 6) return e("bad ctype","Corrupt PNG");
|
|
|
2720 if (color == 3) pal_img_n = 3; else if (color & 1) return e("bad ctype","Corrupt PNG");
|
|
|
2721 comp = get8(s); if (comp) return e("bad comp method","Corrupt PNG");
|
|
|
2722 filter= get8(s); if (filter) return e("bad filter method","Corrupt PNG");
|
|
|
2723 interlace = get8(s); if (interlace>1) return e("bad interlace method","Corrupt PNG");
|
|
|
2724 if (!s->img_x || !s->img_y) return e("0-pixel image","Corrupt PNG");
|
|
|
2725 if (!pal_img_n) {
|
|
|
2726 s->img_n = (color & 2 ? 3 : 1) + (color & 4 ? 1 : 0);
|
|
|
2727 if ((1 << 30) / s->img_x / s->img_n < s->img_y) return e("too large", "Image too large to decode");
|
|
|
2728 if (scan == SCAN_header) return 1;
|
|
|
2729 } else {
|
|
|
2730 // if paletted, then pal_n is our final components, and
|
|
|
2731 // img_n is # components to decompress/filter.
|
|
|
2732 s->img_n = 1;
|
|
|
2733 if ((1 << 30) / s->img_x / 4 < s->img_y) return e("too large","Corrupt PNG");
|
|
|
2734 // if SCAN_header, have to scan to see if we have a tRNS
|
|
|
2735 }
|
|
|
2736 break;
|
|
|
2737 }
|
|
|
2738
|
|
|
2739 case PNG_TYPE('P','L','T','E'): {
|
|
|
2740 if (first) return e("first not IHDR", "Corrupt PNG");
|
|
|
2741 if (c.length > 256*3) return e("invalid PLTE","Corrupt PNG");
|
|
|
2742 pal_len = c.length / 3;
|
|
|
2743 if (pal_len * 3 != c.length) return e("invalid PLTE","Corrupt PNG");
|
|
|
2744 for (i=0; i < pal_len; ++i) {
|
|
|
2745 palette[i*4+0] = get8u(s);
|
|
|
2746 palette[i*4+1] = get8u(s);
|
|
|
2747 palette[i*4+2] = get8u(s);
|
|
|
2748 palette[i*4+3] = 255;
|
|
|
2749 }
|
|
|
2750 break;
|
|
|
2751 }
|
|
|
2752
|
|
|
2753 case PNG_TYPE('t','R','N','S'): {
|
|
|
2754 if (first) return e("first not IHDR", "Corrupt PNG");
|
|
|
2755 if (z->idata) return e("tRNS after IDAT","Corrupt PNG");
|
|
|
2756 if (pal_img_n) {
|
|
|
2757 if (scan == SCAN_header) { s->img_n = 4; return 1; }
|
|
|
2758 if (pal_len == 0) return e("tRNS before PLTE","Corrupt PNG");
|
|
|
2759 if (c.length > pal_len) return e("bad tRNS len","Corrupt PNG");
|
|
|
2760 pal_img_n = 4;
|
|
|
2761 for (i=0; i < c.length; ++i)
|
|
|
2762 palette[i*4+3] = get8u(s);
|
|
|
2763 } else {
|
|
|
2764 if (!(s->img_n & 1)) return e("tRNS with alpha","Corrupt PNG");
|
|
|
2765 if (c.length != (uint32) s->img_n*2) return e("bad tRNS len","Corrupt PNG");
|
|
|
2766 has_trans = 1;
|
|
|
2767 for (k=0; k < s->img_n; ++k)
|
|
|
2768 tc[k] = (uint8) get16(s); // non 8-bit images will be larger
|
|
|
2769 }
|
|
|
2770 break;
|
|
|
2771 }
|
|
|
2772
|
|
|
2773 case PNG_TYPE('I','D','A','T'): {
|
|
|
2774 if (first) return e("first not IHDR", "Corrupt PNG");
|
|
|
2775 if (pal_img_n && !pal_len) return e("no PLTE","Corrupt PNG");
|
|
|
2776 if (scan == SCAN_header) { s->img_n = pal_img_n; return 1; }
|
|
|
2777 if (ioff + c.length > idata_limit) {
|
|
|
2778 uint8 *p;
|
|
|
2779 if (idata_limit == 0) idata_limit = c.length > 4096 ? c.length : 4096;
|
|
|
2780 while (ioff + c.length > idata_limit)
|
|
|
2781 idata_limit *= 2;
|
|
|
2782 p = (uint8 *) realloc(z->idata, idata_limit); if (p == NULL) return e("outofmem", "Out of memory");
|
|
|
2783 z->idata = p;
|
|
|
2784 }
|
|
|
2785 if (!getn(s, z->idata+ioff,c.length)) return e("outofdata","Corrupt PNG");
|
|
|
2786 ioff += c.length;
|
|
|
2787 break;
|
|
|
2788 }
|
|
|
2789
|
|
|
2790 case PNG_TYPE('I','E','N','D'): {
|
|
|
2791 uint32 raw_len;
|
|
|
2792 if (first) return e("first not IHDR", "Corrupt PNG");
|
|
|
2793 if (scan != SCAN_load) return 1;
|
|
|
2794 if (z->idata == NULL) return e("no IDAT","Corrupt PNG");
|
|
|
2795 z->expanded = (uint8 *) stbi_zlib_decode_malloc_guesssize_headerflag((char *) z->idata, ioff, 16384, (int *) &raw_len, !iphone);
|
|
|
2796 if (z->expanded == NULL) return 0; // zlib should set error
|
|
|
2797 free(z->idata); z->idata = NULL;
|
|
|
2798 if ((req_comp == s->img_n+1 && req_comp != 3 && !pal_img_n) || has_trans)
|
|
|
2799 s->img_out_n = s->img_n+1;
|
|
|
2800 else
|
|
|
2801 s->img_out_n = s->img_n;
|
|
|
2802 if (!create_png_image(z, z->expanded, raw_len, s->img_out_n, interlace)) return 0;
|
|
|
2803 if (has_trans)
|
|
|
2804 if (!compute_transparency(z, tc, s->img_out_n)) return 0;
|
|
|
2805 if (iphone && s->img_out_n > 2)
|
|
|
2806 stbi_de_iphone(z);
|
|
|
2807 if (pal_img_n) {
|
|
|
2808 // pal_img_n == 3 or 4
|
|
|
2809 s->img_n = pal_img_n; // record the actual colors we had
|
|
|
2810 s->img_out_n = pal_img_n;
|
|
|
2811 if (req_comp >= 3) s->img_out_n = req_comp;
|
|
|
2812 if (!expand_palette(z, palette, pal_len, s->img_out_n))
|
|
|
2813 return 0;
|
|
|
2814 }
|
|
|
2815 free(z->expanded); z->expanded = NULL;
|
|
|
2816 return 1;
|
|
|
2817 }
|
|
|
2818
|
|
|
2819 default:
|
|
|
2820 // if critical, fail
|
|
|
2821 if (first) return e("first not IHDR", "Corrupt PNG");
|
|
|
2822 if ((c.type & (1 << 29)) == 0) {
|
|
|
2823 #ifndef STBI_NO_FAILURE_STRINGS
|
|
|
2824 // not threadsafe
|
|
|
2825 static char invalid_chunk[] = "XXXX chunk not known";
|
|
|
2826 invalid_chunk[0] = (uint8) (c.type >> 24);
|
|
|
2827 invalid_chunk[1] = (uint8) (c.type >> 16);
|
|
|
2828 invalid_chunk[2] = (uint8) (c.type >> 8);
|
|
|
2829 invalid_chunk[3] = (uint8) (c.type >> 0);
|
|
|
2830 #endif
|
|
|
2831 return e(invalid_chunk, "PNG not supported: unknown chunk type");
|
|
|
2832 }
|
|
|
2833 skip(s, c.length);
|
|
|
2834 break;
|
|
|
2835 }
|
|
|
2836 // end of chunk, read and skip CRC
|
|
|
2837 get32(s);
|
|
|
2838 }
|
|
|
2839 }
|
|
|
2840
|
|
|
2841 static unsigned char *do_png(png *p, int *x, int *y, int *n, int req_comp)
|
|
|
2842 {
|
|
|
2843 unsigned char *result=NULL;
|
|
|
2844 if (req_comp < 0 || req_comp > 4) return epuc("bad req_comp", "Internal error");
|
|
|
2845 if (parse_png_file(p, SCAN_load, req_comp)) {
|
|
|
2846 result = p->out;
|
|
|
2847 p->out = NULL;
|
|
|
2848 if (req_comp && req_comp != p->s->img_out_n) {
|
|
|
2849 result = convert_format(result, p->s->img_out_n, req_comp, p->s->img_x, p->s->img_y);
|
|
|
2850 p->s->img_out_n = req_comp;
|
|
|
2851 if (result == NULL) return result;
|
|
|
2852 }
|
|
|
2853 *x = p->s->img_x;
|
|
|
2854 *y = p->s->img_y;
|
|
|
2855 if (n) *n = p->s->img_n;
|
|
|
2856 }
|
|
|
2857 free(p->out); p->out = NULL;
|
|
|
2858 free(p->expanded); p->expanded = NULL;
|
|
|
2859 free(p->idata); p->idata = NULL;
|
|
|
2860
|
|
|
2861 return result;
|
|
|
2862 }
|
|
|
2863
|
|
|
2864 static unsigned char *stbi_png_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
2865 {
|
|
|
2866 png p;
|
|
|
2867 p.s = s;
|
|
|
2868 return do_png(&p, x,y,comp,req_comp);
|
|
|
2869 }
|
|
|
2870
|
|
|
2871 static int stbi_png_test(stbi *s)
|
|
|
2872 {
|
|
|
2873 int r;
|
|
|
2874 r = check_png_header(s);
|
|
|
2875 stbi_rewind(s);
|
|
|
2876 return r;
|
|
|
2877 }
|
|
|
2878
|
|
|
2879 static int stbi_png_info_raw(png *p, int *x, int *y, int *comp)
|
|
|
2880 {
|
|
|
2881 if (!parse_png_file(p, SCAN_header, 0)) {
|
|
|
2882 stbi_rewind( p->s );
|
|
|
2883 return 0;
|
|
|
2884 }
|
|
|
2885 if (x) *x = p->s->img_x;
|
|
|
2886 if (y) *y = p->s->img_y;
|
|
|
2887 if (comp) *comp = p->s->img_n;
|
|
|
2888 return 1;
|
|
|
2889 }
|
|
|
2890
|
|
|
2891 static int stbi_png_info(stbi *s, int *x, int *y, int *comp)
|
|
|
2892 {
|
|
|
2893 png p;
|
|
|
2894 p.s = s;
|
|
|
2895 return stbi_png_info_raw(&p, x, y, comp);
|
|
|
2896 }
|
|
|
2897
|
|
|
2898 #ifdef STBI_CRAP_FORMATS
|
|
|
2899
|
|
|
2900 // Microsoft/Windows BMP image
|
|
|
2901
|
|
|
2902 static int bmp_test(stbi *s)
|
|
|
2903 {
|
|
|
2904 int sz;
|
|
|
2905 if (get8(s) != 'B') return 0;
|
|
|
2906 if (get8(s) != 'M') return 0;
|
|
|
2907 get32le(s); // discard filesize
|
|
|
2908 get16le(s); // discard reserved
|
|
|
2909 get16le(s); // discard reserved
|
|
|
2910 get32le(s); // discard data offset
|
|
|
2911 sz = get32le(s);
|
|
|
2912 if (sz == 12 || sz == 40 || sz == 56 || sz == 108) return 1;
|
|
|
2913 return 0;
|
|
|
2914 }
|
|
|
2915
|
|
|
2916 static int stbi_bmp_test(stbi *s)
|
|
|
2917 {
|
|
|
2918 int r = bmp_test(s);
|
|
|
2919 stbi_rewind(s);
|
|
|
2920 return r;
|
|
|
2921 }
|
|
|
2922
|
|
|
2923
|
|
|
2924 // returns 0..31 for the highest set bit
|
|
|
2925 static int high_bit(unsigned int z)
|
|
|
2926 {
|
|
|
2927 int n=0;
|
|
|
2928 if (z == 0) return -1;
|
|
|
2929 if (z >= 0x10000) n += 16, z >>= 16;
|
|
|
2930 if (z >= 0x00100) n += 8, z >>= 8;
|
|
|
2931 if (z >= 0x00010) n += 4, z >>= 4;
|
|
|
2932 if (z >= 0x00004) n += 2, z >>= 2;
|
|
|
2933 if (z >= 0x00002) n += 1, z >>= 1;
|
|
|
2934 return n;
|
|
|
2935 }
|
|
|
2936
|
|
|
2937 static int bitcount(unsigned int a)
|
|
|
2938 {
|
|
|
2939 a = (a & 0x55555555) + ((a >> 1) & 0x55555555); // max 2
|
|
|
2940 a = (a & 0x33333333) + ((a >> 2) & 0x33333333); // max 4
|
|
|
2941 a = (a + (a >> 4)) & 0x0f0f0f0f; // max 8 per 4, now 8 bits
|
|
|
2942 a = (a + (a >> 8)); // max 16 per 8 bits
|
|
|
2943 a = (a + (a >> 16)); // max 32 per 8 bits
|
|
|
2944 return a & 0xff;
|
|
|
2945 }
|
|
|
2946
|
|
|
2947 static int shiftsigned(int v, int shift, int bits)
|
|
|
2948 {
|
|
|
2949 int result;
|
|
|
2950 int z=0;
|
|
|
2951
|
|
|
2952 if (shift < 0) v <<= -shift;
|
|
|
2953 else v >>= shift;
|
|
|
2954 result = v;
|
|
|
2955
|
|
|
2956 z = bits;
|
|
|
2957 while (z < 8) {
|
|
|
2958 result += v >> z;
|
|
|
2959 z += bits;
|
|
|
2960 }
|
|
|
2961 return result;
|
|
|
2962 }
|
|
|
2963
|
|
|
2964 static stbi_uc *bmp_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
2965 {
|
|
|
2966 uint8 *out;
|
|
|
2967 unsigned int mr=0,mg=0,mb=0,ma=0, fake_a=0;
|
|
|
2968 stbi_uc pal[256][4];
|
|
|
2969 int psize=0,i,j,compress=0,width;
|
|
|
2970 int bpp, flip_vertically, pad, target, offset, hsz;
|
|
|
2971 if (get8(s) != 'B' || get8(s) != 'M') return epuc("not BMP", "Corrupt BMP");
|
|
|
2972 get32le(s); // discard filesize
|
|
|
2973 get16le(s); // discard reserved
|
|
|
2974 get16le(s); // discard reserved
|
|
|
2975 offset = get32le(s);
|
|
|
2976 hsz = get32le(s);
|
|
|
2977 if (hsz != 12 && hsz != 40 && hsz != 56 && hsz != 108) return epuc("unknown BMP", "BMP type not supported: unknown");
|
|
|
2978 if (hsz == 12) {
|
|
|
2979 s->img_x = get16le(s);
|
|
|
2980 s->img_y = get16le(s);
|
|
|
2981 } else {
|
|
|
2982 s->img_x = get32le(s);
|
|
|
2983 s->img_y = get32le(s);
|
|
|
2984 }
|
|
|
2985 if (get16le(s) != 1) return epuc("bad BMP", "bad BMP");
|
|
|
2986 bpp = get16le(s);
|
|
|
2987 if (bpp == 1) return epuc("monochrome", "BMP type not supported: 1-bit");
|
|
|
2988 flip_vertically = ((int) s->img_y) > 0;
|
|
|
2989 s->img_y = abs((int) s->img_y);
|
|
|
2990 if (hsz == 12) {
|
|
|
2991 if (bpp < 24)
|
|
|
2992 psize = (offset - 14 - 24) / 3;
|
|
|
2993 } else {
|
|
|
2994 compress = get32le(s);
|
|
|
2995 if (compress == 1 || compress == 2) return epuc("BMP RLE", "BMP type not supported: RLE");
|
|
|
2996 get32le(s); // discard sizeof
|
|
|
2997 get32le(s); // discard hres
|
|
|
2998 get32le(s); // discard vres
|
|
|
2999 get32le(s); // discard colorsused
|
|
|
3000 get32le(s); // discard max important
|
|
|
3001 if (hsz == 40 || hsz == 56) {
|
|
|
3002 if (hsz == 56) {
|
|
|
3003 get32le(s);
|
|
|
3004 get32le(s);
|
|
|
3005 get32le(s);
|
|
|
3006 get32le(s);
|
|
|
3007 }
|
|
|
3008 if (bpp == 16 || bpp == 32) {
|
|
|
3009 mr = mg = mb = 0;
|
|
|
3010 if (compress == 0) {
|
|
|
3011 if (bpp == 32) {
|
|
|
3012 mr = 0xffu << 16;
|
|
|
3013 mg = 0xffu << 8;
|
|
|
3014 mb = 0xffu << 0;
|
|
|
3015 ma = 0xffu << 24;
|
|
|
3016 fake_a = 1; // @TODO: check for cases like alpha value is all 0 and switch it to 255
|
|
|
3017 } else {
|
|
|
3018 mr = 31u << 10;
|
|
|
3019 mg = 31u << 5;
|
|
|
3020 mb = 31u << 0;
|
|
|
3021 }
|
|
|
3022 } else if (compress == 3) {
|
|
|
3023 mr = get32le(s);
|
|
|
3024 mg = get32le(s);
|
|
|
3025 mb = get32le(s);
|
|
|
3026 // not documented, but generated by photoshop and handled by mspaint
|
|
|
3027 if (mr == mg && mg == mb) {
|
|
|
3028 // ?!?!?
|
|
|
3029 return epuc("bad BMP", "bad BMP");
|
|
|
3030 }
|
|
|
3031 } else
|
|
|
3032 return epuc("bad BMP", "bad BMP");
|
|
|
3033 }
|
|
|
3034 } else {
|
|
|
3035 assert(hsz == 108);
|
|
|
3036 mr = get32le(s);
|
|
|
3037 mg = get32le(s);
|
|
|
3038 mb = get32le(s);
|
|
|
3039 ma = get32le(s);
|
|
|
3040 get32le(s); // discard color space
|
|
|
3041 for (i=0; i < 12; ++i)
|
|
|
3042 get32le(s); // discard color space parameters
|
|
|
3043 }
|
|
|
3044 if (bpp < 16)
|
|
|
3045 psize = (offset - 14 - hsz) >> 2;
|
|
|
3046 }
|
|
|
3047 s->img_n = ma ? 4 : 3;
|
|
|
3048 if (req_comp && req_comp >= 3) // we can directly decode 3 or 4
|
|
|
3049 target = req_comp;
|
|
|
3050 else
|
|
|
3051 target = s->img_n; // if they want monochrome, we'll post-convert
|
|
|
3052 out = (stbi_uc *) malloc(target * s->img_x * s->img_y);
|
|
|
3053 if (!out) return epuc("outofmem", "Out of memory");
|
|
|
3054 if (bpp < 16) {
|
|
|
3055 int z=0;
|
|
|
3056 if (psize == 0 || psize > 256) { free(out); return epuc("invalid", "Corrupt BMP"); }
|
|
|
3057 for (i=0; i < psize; ++i) {
|
|
|
3058 pal[i][2] = get8u(s);
|
|
|
3059 pal[i][1] = get8u(s);
|
|
|
3060 pal[i][0] = get8u(s);
|
|
|
3061 if (hsz != 12) get8(s);
|
|
|
3062 pal[i][3] = 255;
|
|
|
3063 }
|
|
|
3064 skip(s, offset - 14 - hsz - psize * (hsz == 12 ? 3 : 4));
|
|
|
3065 if (bpp == 4) width = (s->img_x + 1) >> 1;
|
|
|
3066 else if (bpp == 8) width = s->img_x;
|
|
|
3067 else { free(out); return epuc("bad bpp", "Corrupt BMP"); }
|
|
|
3068 pad = (-width)&3;
|
|
|
3069 for (j=0; j < (int) s->img_y; ++j) {
|
|
|
3070 for (i=0; i < (int) s->img_x; i += 2) {
|
|
|
3071 int v=get8(s),v2=0;
|
|
|
3072 if (bpp == 4) {
|
|
|
3073 v2 = v & 15;
|
|
|
3074 v >>= 4;
|
|
|
3075 }
|
|
|
3076 out[z++] = pal[v][0];
|
|
|
3077 out[z++] = pal[v][1];
|
|
|
3078 out[z++] = pal[v][2];
|
|
|
3079 if (target == 4) out[z++] = 255;
|
|
|
3080 if (i+1 == (int) s->img_x) break;
|
|
|
3081 v = (bpp == 8) ? get8(s) : v2;
|
|
|
3082 out[z++] = pal[v][0];
|
|
|
3083 out[z++] = pal[v][1];
|
|
|
3084 out[z++] = pal[v][2];
|
|
|
3085 if (target == 4) out[z++] = 255;
|
|
|
3086 }
|
|
|
3087 skip(s, pad);
|
|
|
3088 }
|
|
|
3089 } else {
|
|
|
3090 int rshift=0,gshift=0,bshift=0,ashift=0,rcount=0,gcount=0,bcount=0,acount=0;
|
|
|
3091 int z = 0;
|
|
|
3092 int easy=0;
|
|
|
3093 skip(s, offset - 14 - hsz);
|
|
|
3094 if (bpp == 24) width = 3 * s->img_x;
|
|
|
3095 else if (bpp == 16) width = 2*s->img_x;
|
|
|
3096 else /* bpp = 32 and pad = 0 */ width=0;
|
|
|
3097 pad = (-width) & 3;
|
|
|
3098 if (bpp == 24) {
|
|
|
3099 easy = 1;
|
|
|
3100 } else if (bpp == 32) {
|
|
|
3101 if (mb == 0xff && mg == 0xff00 && mr == 0x00ff0000 && ma == 0xff000000)
|
|
|
3102 easy = 2;
|
|
|
3103 }
|
|
|
3104 if (!easy) {
|
|
|
3105 if (!mr || !mg || !mb) { free(out); return epuc("bad masks", "Corrupt BMP"); }
|
|
|
3106 // right shift amt to put high bit in position #7
|
|
|
3107 rshift = high_bit(mr)-7; rcount = bitcount(mr);
|
|
|
3108 gshift = high_bit(mg)-7; gcount = bitcount(mr);
|
|
|
3109 bshift = high_bit(mb)-7; bcount = bitcount(mr);
|
|
|
3110 ashift = high_bit(ma)-7; acount = bitcount(mr);
|
|
|
3111 }
|
|
|
3112 for (j=0; j < (int) s->img_y; ++j) {
|
|
|
3113 if (easy) {
|
|
|
3114 for (i=0; i < (int) s->img_x; ++i) {
|
|
|
3115 int a;
|
|
|
3116 out[z+2] = get8u(s);
|
|
|
3117 out[z+1] = get8u(s);
|
|
|
3118 out[z+0] = get8u(s);
|
|
|
3119 z += 3;
|
|
|
3120 a = (easy == 2 ? get8(s) : 255);
|
|
|
3121 if (target == 4) out[z++] = (uint8) a;
|
|
|
3122 }
|
|
|
3123 } else {
|
|
|
3124 for (i=0; i < (int) s->img_x; ++i) {
|
|
|
3125 uint32 v = (bpp == 16 ? get16le(s) : get32le(s));
|
|
|
3126 int a;
|
|
|
3127 out[z++] = (uint8) shiftsigned(v & mr, rshift, rcount);
|
|
|
3128 out[z++] = (uint8) shiftsigned(v & mg, gshift, gcount);
|
|
|
3129 out[z++] = (uint8) shiftsigned(v & mb, bshift, bcount);
|
|
|
3130 a = (ma ? shiftsigned(v & ma, ashift, acount) : 255);
|
|
|
3131 if (target == 4) out[z++] = (uint8) a;
|
|
|
3132 }
|
|
|
3133 }
|
|
|
3134 skip(s, pad);
|
|
|
3135 }
|
|
|
3136 }
|
|
|
3137 if (flip_vertically) {
|
|
|
3138 stbi_uc t;
|
|
|
3139 for (j=0; j < (int) s->img_y>>1; ++j) {
|
|
|
3140 stbi_uc *p1 = out + j *s->img_x*target;
|
|
|
3141 stbi_uc *p2 = out + (s->img_y-1-j)*s->img_x*target;
|
|
|
3142 for (i=0; i < (int) s->img_x*target; ++i) {
|
|
|
3143 t = p1[i], p1[i] = p2[i], p2[i] = t;
|
|
|
3144 }
|
|
|
3145 }
|
|
|
3146 }
|
|
|
3147
|
|
|
3148 if (req_comp && req_comp != target) {
|
|
|
3149 out = convert_format(out, target, req_comp, s->img_x, s->img_y);
|
|
|
3150 if (out == NULL) return out; // convert_format frees input on failure
|
|
|
3151 }
|
|
|
3152
|
|
|
3153 *x = s->img_x;
|
|
|
3154 *y = s->img_y;
|
|
|
3155 if (comp) *comp = s->img_n;
|
|
|
3156 return out;
|
|
|
3157 }
|
|
|
3158
|
|
|
3159 static stbi_uc *stbi_bmp_load(stbi *s,int *x, int *y, int *comp, int req_comp)
|
|
|
3160 {
|
|
|
3161 return bmp_load(s, x,y,comp,req_comp);
|
|
|
3162 }
|
|
|
3163
|
|
|
3164
|
|
|
3165 // Targa Truevision - TGA
|
|
|
3166 // by Jonathan Dummer
|
|
|
3167
|
|
|
3168 static int tga_info(stbi *s, int *x, int *y, int *comp)
|
|
|
3169 {
|
|
|
3170 int tga_w, tga_h, tga_comp;
|
|
|
3171 int sz;
|
|
|
3172 get8u(s); // discard Offset
|
|
|
3173 sz = get8u(s); // color type
|
|
|
3174 if( sz > 1 ) {
|
|
|
3175 stbi_rewind(s);
|
|
|
3176 return 0; // only RGB or indexed allowed
|
|
|
3177 }
|
|
|
3178 sz = get8u(s); // image type
|
|
|
3179 // only RGB or grey allowed, +/- RLE
|
|
|
3180 if ((sz != 1) && (sz != 2) && (sz != 3) && (sz != 9) && (sz != 10) && (sz != 11)) return 0;
|
|
|
3181 skip(s,9);
|
|
|
3182 tga_w = get16le(s);
|
|
|
3183 if( tga_w < 1 ) {
|
|
|
3184 stbi_rewind(s);
|
|
|
3185 return 0; // test width
|
|
|
3186 }
|
|
|
3187 tga_h = get16le(s);
|
|
|
3188 if( tga_h < 1 ) {
|
|
|
3189 stbi_rewind(s);
|
|
|
3190 return 0; // test height
|
|
|
3191 }
|
|
|
3192 sz = get8(s); // bits per pixel
|
|
|
3193 // only RGB or RGBA or grey allowed
|
|
|
3194 if ((sz != 8) && (sz != 16) && (sz != 24) && (sz != 32)) {
|
|
|
3195 stbi_rewind(s);
|
|
|
3196 return 0;
|
|
|
3197 }
|
|
|
3198 tga_comp = sz;
|
|
|
3199 if (x) *x = tga_w;
|
|
|
3200 if (y) *y = tga_h;
|
|
|
3201 if (comp) *comp = tga_comp / 8;
|
|
|
3202 return 1; // seems to have passed everything
|
|
|
3203 }
|
|
|
3204
|
|
|
3205 int stbi_tga_info(stbi *s, int *x, int *y, int *comp)
|
|
|
3206 {
|
|
|
3207 return tga_info(s, x, y, comp);
|
|
|
3208 }
|
|
|
3209
|
|
|
3210 static int tga_test(stbi *s)
|
|
|
3211 {
|
|
|
3212 int sz;
|
|
|
3213 get8u(s); // discard Offset
|
|
|
3214 sz = get8u(s); // color type
|
|
|
3215 if ( sz > 1 ) return 0; // only RGB or indexed allowed
|
|
|
3216 sz = get8u(s); // image type
|
|
|
3217 if ( (sz != 1) && (sz != 2) && (sz != 3) && (sz != 9) && (sz != 10) && (sz != 11) ) return 0; // only RGB or grey allowed, +/- RLE
|
|
|
3218 get16(s); // discard palette start
|
|
|
3219 get16(s); // discard palette length
|
|
|
3220 get8(s); // discard bits per palette color entry
|
|
|
3221 get16(s); // discard x origin
|
|
|
3222 get16(s); // discard y origin
|
|
|
3223 if ( get16(s) < 1 ) return 0; // test width
|
|
|
3224 if ( get16(s) < 1 ) return 0; // test height
|
|
|
3225 sz = get8(s); // bits per pixel
|
|
|
3226 if ( (sz != 8) && (sz != 16) && (sz != 24) && (sz != 32) ) return 0; // only RGB or RGBA or grey allowed
|
|
|
3227 return 1; // seems to have passed everything
|
|
|
3228 }
|
|
|
3229
|
|
|
3230 static int stbi_tga_test(stbi *s)
|
|
|
3231 {
|
|
|
3232 int res = tga_test(s);
|
|
|
3233 stbi_rewind(s);
|
|
|
3234 return res;
|
|
|
3235 }
|
|
|
3236
|
|
|
3237 static stbi_uc *tga_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
3238 {
|
|
|
3239 // read in the TGA header stuff
|
|
|
3240 int tga_offset = get8u(s);
|
|
|
3241 int tga_indexed = get8u(s);
|
|
|
3242 int tga_image_type = get8u(s);
|
|
|
3243 int tga_is_RLE = 0;
|
|
|
3244 int tga_palette_start = get16le(s);
|
|
|
3245 int tga_palette_len = get16le(s);
|
|
|
3246 int tga_palette_bits = get8u(s);
|
|
|
3247 int tga_x_origin = get16le(s);
|
|
|
3248 int tga_y_origin = get16le(s);
|
|
|
3249 int tga_width = get16le(s);
|
|
|
3250 int tga_height = get16le(s);
|
|
|
3251 int tga_bits_per_pixel = get8u(s);
|
|
|
3252 int tga_inverted = get8u(s);
|
|
|
3253 // image data
|
|
|
3254 unsigned char *tga_data;
|
|
|
3255 unsigned char *tga_palette = NULL;
|
|
|
3256 int i, j;
|
|
|
3257 unsigned char raw_data[4];
|
|
|
3258 unsigned char trans_data[4];
|
|
|
3259 int RLE_count = 0;
|
|
|
3260 int RLE_repeating = 0;
|
|
|
3261 int read_next_pixel = 1;
|
|
|
3262
|
|
|
3263 // do a tiny bit of precessing
|
|
|
3264 if ( tga_image_type >= 8 )
|
|
|
3265 {
|
|
|
3266 tga_image_type -= 8;
|
|
|
3267 tga_is_RLE = 1;
|
|
|
3268 }
|
|
|
3269 // int tga_alpha_bits = tga_inverted & 15;
|
|
|
3270 tga_inverted = 1 - ((tga_inverted >> 5) & 1);
|
|
|
3271
|
|
|
3272 // error check
|
|
|
3273 if ( //(tga_indexed) ||
|
|
|
3274 (tga_width < 1) || (tga_height < 1) ||
|
|
|
3275 (tga_image_type < 1) || (tga_image_type > 3) ||
|
|
|
3276 ((tga_bits_per_pixel != 8) && (tga_bits_per_pixel != 16) &&
|
|
|
3277 (tga_bits_per_pixel != 24) && (tga_bits_per_pixel != 32))
|
|
|
3278 )
|
|
|
3279 {
|
|
|
3280 return NULL; // we don't report this as a bad TGA because we don't even know if it's TGA
|
|
|
3281 }
|
|
|
3282
|
|
|
3283 // If I'm paletted, then I'll use the number of bits from the palette
|
|
|
3284 if ( tga_indexed )
|
|
|
3285 {
|
|
|
3286 tga_bits_per_pixel = tga_palette_bits;
|
|
|
3287 }
|
|
|
3288
|
|
|
3289 // tga info
|
|
|
3290 *x = tga_width;
|
|
|
3291 *y = tga_height;
|
|
|
3292 if ( (req_comp < 1) || (req_comp > 4) )
|
|
|
3293 {
|
|
|
3294 // just use whatever the file was
|
|
|
3295 req_comp = tga_bits_per_pixel / 8;
|
|
|
3296 *comp = req_comp;
|
|
|
3297 } else
|
|
|
3298 {
|
|
|
3299 // force a new number of components
|
|
|
3300 *comp = tga_bits_per_pixel/8;
|
|
|
3301 }
|
|
|
3302 tga_data = (unsigned char*)malloc( tga_width * tga_height * req_comp );
|
|
|
3303 if (!tga_data) return epuc("outofmem", "Out of memory");
|
|
|
3304
|
|
|
3305 // skip to the data's starting position (offset usually = 0)
|
|
|
3306 skip(s, tga_offset );
|
|
|
3307 // do I need to load a palette?
|
|
|
3308 if ( tga_indexed )
|
|
|
3309 {
|
|
|
3310 // any data to skip? (offset usually = 0)
|
|
|
3311 skip(s, tga_palette_start );
|
|
|
3312 // load the palette
|
|
|
3313 tga_palette = (unsigned char*)malloc( tga_palette_len * tga_palette_bits / 8 );
|
|
|
3314 if (!tga_palette) return epuc("outofmem", "Out of memory");
|
|
|
3315 if (!getn(s, tga_palette, tga_palette_len * tga_palette_bits / 8 )) {
|
|
|
3316 free(tga_data);
|
|
|
3317 free(tga_palette);
|
|
|
3318 return epuc("bad palette", "Corrupt TGA");
|
|
|
3319 }
|
|
|
3320 }
|
|
|
3321 // load the data
|
|
|
3322 trans_data[0] = trans_data[1] = trans_data[2] = trans_data[3] = 0;
|
|
|
3323 for (i=0; i < tga_width * tga_height; ++i)
|
|
|
3324 {
|
|
|
3325 // if I'm in RLE mode, do I need to get a RLE chunk?
|
|
|
3326 if ( tga_is_RLE )
|
|
|
3327 {
|
|
|
3328 if ( RLE_count == 0 )
|
|
|
3329 {
|
|
|
3330 // yep, get the next byte as a RLE command
|
|
|
3331 int RLE_cmd = get8u(s);
|
|
|
3332 RLE_count = 1 + (RLE_cmd & 127);
|
|
|
3333 RLE_repeating = RLE_cmd >> 7;
|
|
|
3334 read_next_pixel = 1;
|
|
|
3335 } else if ( !RLE_repeating )
|
|
|
3336 {
|
|
|
3337 read_next_pixel = 1;
|
|
|
3338 }
|
|
|
3339 } else
|
|
|
3340 {
|
|
|
3341 read_next_pixel = 1;
|
|
|
3342 }
|
|
|
3343 // OK, if I need to read a pixel, do it now
|
|
|
3344 if ( read_next_pixel )
|
|
|
3345 {
|
|
|
3346 // load however much data we did have
|
|
|
3347 if ( tga_indexed )
|
|
|
3348 {
|
|
|
3349 // read in 1 byte, then perform the lookup
|
|
|
3350 int pal_idx = get8u(s);
|
|
|
3351 if ( pal_idx >= tga_palette_len )
|
|
|
3352 {
|
|
|
3353 // invalid index
|
|
|
3354 pal_idx = 0;
|
|
|
3355 }
|
|
|
3356 pal_idx *= tga_bits_per_pixel / 8;
|
|
|
3357 for (j = 0; j*8 < tga_bits_per_pixel; ++j)
|
|
|
3358 {
|
|
|
3359 raw_data[j] = tga_palette[pal_idx+j];
|
|
|
3360 }
|
|
|
3361 } else
|
|
|
3362 {
|
|
|
3363 // read in the data raw
|
|
|
3364 for (j = 0; j*8 < tga_bits_per_pixel; ++j)
|
|
|
3365 {
|
|
|
3366 raw_data[j] = get8u(s);
|
|
|
3367 }
|
|
|
3368 }
|
|
|
3369 // convert raw to the intermediate format
|
|
|
3370 switch (tga_bits_per_pixel)
|
|
|
3371 {
|
|
|
3372 case 8:
|
|
|
3373 // Luminous => RGBA
|
|
|
3374 trans_data[0] = raw_data[0];
|
|
|
3375 trans_data[1] = raw_data[0];
|
|
|
3376 trans_data[2] = raw_data[0];
|
|
|
3377 trans_data[3] = 255;
|
|
|
3378 break;
|
|
|
3379 case 16:
|
|
|
3380 // Luminous,Alpha => RGBA
|
|
|
3381 trans_data[0] = raw_data[0];
|
|
|
3382 trans_data[1] = raw_data[0];
|
|
|
3383 trans_data[2] = raw_data[0];
|
|
|
3384 trans_data[3] = raw_data[1];
|
|
|
3385 break;
|
|
|
3386 case 24:
|
|
|
3387 // BGR => RGBA
|
|
|
3388 trans_data[0] = raw_data[2];
|
|
|
3389 trans_data[1] = raw_data[1];
|
|
|
3390 trans_data[2] = raw_data[0];
|
|
|
3391 trans_data[3] = 255;
|
|
|
3392 break;
|
|
|
3393 case 32:
|
|
|
3394 // BGRA => RGBA
|
|
|
3395 trans_data[0] = raw_data[2];
|
|
|
3396 trans_data[1] = raw_data[1];
|
|
|
3397 trans_data[2] = raw_data[0];
|
|
|
3398 trans_data[3] = raw_data[3];
|
|
|
3399 break;
|
|
|
3400 }
|
|
|
3401 // clear the reading flag for the next pixel
|
|
|
3402 read_next_pixel = 0;
|
|
|
3403 } // end of reading a pixel
|
|
|
3404 // convert to final format
|
|
|
3405 switch (req_comp)
|
|
|
3406 {
|
|
|
3407 case 1:
|
|
|
3408 // RGBA => Luminance
|
|
|
3409 tga_data[i*req_comp+0] = compute_y(trans_data[0],trans_data[1],trans_data[2]);
|
|
|
3410 break;
|
|
|
3411 case 2:
|
|
|
3412 // RGBA => Luminance,Alpha
|
|
|
3413 tga_data[i*req_comp+0] = compute_y(trans_data[0],trans_data[1],trans_data[2]);
|
|
|
3414 tga_data[i*req_comp+1] = trans_data[3];
|
|
|
3415 break;
|
|
|
3416 case 3:
|
|
|
3417 // RGBA => RGB
|
|
|
3418 tga_data[i*req_comp+0] = trans_data[0];
|
|
|
3419 tga_data[i*req_comp+1] = trans_data[1];
|
|
|
3420 tga_data[i*req_comp+2] = trans_data[2];
|
|
|
3421 break;
|
|
|
3422 case 4:
|
|
|
3423 // RGBA => RGBA
|
|
|
3424 tga_data[i*req_comp+0] = trans_data[0];
|
|
|
3425 tga_data[i*req_comp+1] = trans_data[1];
|
|
|
3426 tga_data[i*req_comp+2] = trans_data[2];
|
|
|
3427 tga_data[i*req_comp+3] = trans_data[3];
|
|
|
3428 break;
|
|
|
3429 }
|
|
|
3430 // in case we're in RLE mode, keep counting down
|
|
|
3431 --RLE_count;
|
|
|
3432 }
|
|
|
3433 // do I need to invert the image?
|
|
|
3434 if ( tga_inverted )
|
|
|
3435 {
|
|
|
3436 for (j = 0; j*2 < tga_height; ++j)
|
|
|
3437 {
|
|
|
3438 int index1 = j * tga_width * req_comp;
|
|
|
3439 int index2 = (tga_height - 1 - j) * tga_width * req_comp;
|
|
|
3440 for (i = tga_width * req_comp; i > 0; --i)
|
|
|
3441 {
|
|
|
3442 unsigned char temp = tga_data[index1];
|
|
|
3443 tga_data[index1] = tga_data[index2];
|
|
|
3444 tga_data[index2] = temp;
|
|
|
3445 ++index1;
|
|
|
3446 ++index2;
|
|
|
3447 }
|
|
|
3448 }
|
|
|
3449 }
|
|
|
3450 // clear my palette, if I had one
|
|
|
3451 if ( tga_palette != NULL )
|
|
|
3452 {
|
|
|
3453 free( tga_palette );
|
|
|
3454 }
|
|
|
3455 // the things I do to get rid of an error message, and yet keep
|
|
|
3456 // Microsoft's C compilers happy... [8^(
|
|
|
3457 tga_palette_start = tga_palette_len = tga_palette_bits =
|
|
|
3458 tga_x_origin = tga_y_origin = 0;
|
|
|
3459 // OK, done
|
|
|
3460 return tga_data;
|
|
|
3461 }
|
|
|
3462
|
|
|
3463 static stbi_uc *stbi_tga_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
3464 {
|
|
|
3465 return tga_load(s,x,y,comp,req_comp);
|
|
|
3466 }
|
|
|
3467
|
|
|
3468
|
|
|
3469 // *************************************************************************************************
|
|
|
3470 // Photoshop PSD loader -- PD by Thatcher Ulrich, integration by Nicolas Schulz, tweaked by STB
|
|
|
3471
|
|
|
3472 static int psd_test(stbi *s)
|
|
|
3473 {
|
|
|
3474 if (get32(s) != 0x38425053) return 0; // "8BPS"
|
|
|
3475 else return 1;
|
|
|
3476 }
|
|
|
3477
|
|
|
3478 static int stbi_psd_test(stbi *s)
|
|
|
3479 {
|
|
|
3480 int r = psd_test(s);
|
|
|
3481 stbi_rewind(s);
|
|
|
3482 return r;
|
|
|
3483 }
|
|
|
3484
|
|
|
3485 static stbi_uc *psd_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
3486 {
|
|
|
3487 int pixelCount;
|
|
|
3488 int channelCount, compression;
|
|
|
3489 int channel, i, count, len;
|
|
|
3490 int w,h;
|
|
|
3491 uint8 *out;
|
|
|
3492
|
|
|
3493 // Check identifier
|
|
|
3494 if (get32(s) != 0x38425053) // "8BPS"
|
|
|
3495 return epuc("not PSD", "Corrupt PSD image");
|
|
|
3496
|
|
|
3497 // Check file type version.
|
|
|
3498 if (get16(s) != 1)
|
|
|
3499 return epuc("wrong version", "Unsupported version of PSD image");
|
|
|
3500
|
|
|
3501 // Skip 6 reserved bytes.
|
|
|
3502 skip(s, 6 );
|
|
|
3503
|
|
|
3504 // Read the number of channels (R, G, B, A, etc).
|
|
|
3505 channelCount = get16(s);
|
|
|
3506 if (channelCount < 0 || channelCount > 16)
|
|
|
3507 return epuc("wrong channel count", "Unsupported number of channels in PSD image");
|
|
|
3508
|
|
|
3509 // Read the rows and columns of the image.
|
|
|
3510 h = get32(s);
|
|
|
3511 w = get32(s);
|
|
|
3512
|
|
|
3513 // Make sure the depth is 8 bits.
|
|
|
3514 if (get16(s) != 8)
|
|
|
3515 return epuc("unsupported bit depth", "PSD bit depth is not 8 bit");
|
|
|
3516
|
|
|
3517 // Make sure the color mode is RGB.
|
|
|
3518 // Valid options are:
|
|
|
3519 // 0: Bitmap
|
|
|
3520 // 1: Grayscale
|
|
|
3521 // 2: Indexed color
|
|
|
3522 // 3: RGB color
|
|
|
3523 // 4: CMYK color
|
|
|
3524 // 7: Multichannel
|
|
|
3525 // 8: Duotone
|
|
|
3526 // 9: Lab color
|
|
|
3527 if (get16(s) != 3)
|
|
|
3528 return epuc("wrong color format", "PSD is not in RGB color format");
|
|
|
3529
|
|
|
3530 // Skip the Mode Data. (It's the palette for indexed color; other info for other modes.)
|
|
|
3531 skip(s,get32(s) );
|
|
|
3532
|
|
|
3533 // Skip the image resources. (resolution, pen tool paths, etc)
|
|
|
3534 skip(s, get32(s) );
|
|
|
3535
|
|
|
3536 // Skip the reserved data.
|
|
|
3537 skip(s, get32(s) );
|
|
|
3538
|
|
|
3539 // Find out if the data is compressed.
|
|
|
3540 // Known values:
|
|
|
3541 // 0: no compression
|
|
|
3542 // 1: RLE compressed
|
|
|
3543 compression = get16(s);
|
|
|
3544 if (compression > 1)
|
|
|
3545 return epuc("bad compression", "PSD has an unknown compression format");
|
|
|
3546
|
|
|
3547 // Create the destination image.
|
|
|
3548 out = (stbi_uc *) malloc(4 * w*h);
|
|
|
3549 if (!out) return epuc("outofmem", "Out of memory");
|
|
|
3550 pixelCount = w*h;
|
|
|
3551
|
|
|
3552 // Initialize the data to zero.
|
|
|
3553 //memset( out, 0, pixelCount * 4 );
|
|
|
3554
|
|
|
3555 // Finally, the image data.
|
|
|
3556 if (compression) {
|
|
|
3557 // RLE as used by .PSD and .TIFF
|
|
|
3558 // Loop until you get the number of unpacked bytes you are expecting:
|
|
|
3559 // Read the next source byte into n.
|
|
|
3560 // If n is between 0 and 127 inclusive, copy the next n+1 bytes literally.
|
|
|
3561 // Else if n is between -127 and -1 inclusive, copy the next byte -n+1 times.
|
|
|
3562 // Else if n is 128, noop.
|
|
|
3563 // Endloop
|
|
|
3564
|
|
|
3565 // The RLE-compressed data is preceeded by a 2-byte data count for each row in the data,
|
|
|
3566 // which we're going to just skip.
|
|
|
3567 skip(s, h * channelCount * 2 );
|
|
|
3568
|
|
|
3569 // Read the RLE data by channel.
|
|
|
3570 for (channel = 0; channel < 4; channel++) {
|
|
|
3571 uint8 *p;
|
|
|
3572
|
|
|
3573 p = out+channel;
|
|
|
3574 if (channel >= channelCount) {
|
|
|
3575 // Fill this channel with default data.
|
|
|
3576 for (i = 0; i < pixelCount; i++) *p = (channel == 3 ? 255 : 0), p += 4;
|
|
|
3577 } else {
|
|
|
3578 // Read the RLE data.
|
|
|
3579 count = 0;
|
|
|
3580 while (count < pixelCount) {
|
|
|
3581 len = get8(s);
|
|
|
3582 if (len == 128) {
|
|
|
3583 // No-op.
|
|
|
3584 } else if (len < 128) {
|
|
|
3585 // Copy next len+1 bytes literally.
|
|
|
3586 len++;
|
|
|
3587 count += len;
|
|
|
3588 while (len) {
|
|
|
3589 *p = get8u(s);
|
|
|
3590 p += 4;
|
|
|
3591 len--;
|
|
|
3592 }
|
|
|
3593 } else if (len > 128) {
|
|
|
3594 uint8 val;
|
|
|
3595 // Next -len+1 bytes in the dest are replicated from next source byte.
|
|
|
3596 // (Interpret len as a negative 8-bit int.)
|
|
|
3597 len ^= 0x0FF;
|
|
|
3598 len += 2;
|
|
|
3599 val = get8u(s);
|
|
|
3600 count += len;
|
|
|
3601 while (len) {
|
|
|
3602 *p = val;
|
|
|
3603 p += 4;
|
|
|
3604 len--;
|
|
|
3605 }
|
|
|
3606 }
|
|
|
3607 }
|
|
|
3608 }
|
|
|
3609 }
|
|
|
3610
|
|
|
3611 } else {
|
|
|
3612 // We're at the raw image data. It's each channel in order (Red, Green, Blue, Alpha, ...)
|
|
|
3613 // where each channel consists of an 8-bit value for each pixel in the image.
|
|
|
3614
|
|
|
3615 // Read the data by channel.
|
|
|
3616 for (channel = 0; channel < 4; channel++) {
|
|
|
3617 uint8 *p;
|
|
|
3618
|
|
|
3619 p = out + channel;
|
|
|
3620 if (channel > channelCount) {
|
|
|
3621 // Fill this channel with default data.
|
|
|
3622 for (i = 0; i < pixelCount; i++) *p = channel == 3 ? 255 : 0, p += 4;
|
|
|
3623 } else {
|
|
|
3624 // Read the data.
|
|
|
3625 for (i = 0; i < pixelCount; i++)
|
|
|
3626 *p = get8u(s), p += 4;
|
|
|
3627 }
|
|
|
3628 }
|
|
|
3629 }
|
|
|
3630
|
|
|
3631 if (req_comp && req_comp != 4) {
|
|
|
3632 out = convert_format(out, 4, req_comp, w, h);
|
|
|
3633 if (out == NULL) return out; // convert_format frees input on failure
|
|
|
3634 }
|
|
|
3635
|
|
|
3636 if (comp) *comp = channelCount;
|
|
|
3637 *y = h;
|
|
|
3638 *x = w;
|
|
|
3639
|
|
|
3640 return out;
|
|
|
3641 }
|
|
|
3642
|
|
|
3643 static stbi_uc *stbi_psd_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
3644 {
|
|
|
3645 return psd_load(s,x,y,comp,req_comp);
|
|
|
3646 }
|
|
|
3647
|
|
|
3648 // *************************************************************************************************
|
|
|
3649 // Softimage PIC loader
|
|
|
3650 // by Tom Seddon
|
|
|
3651 //
|
|
|
3652 // See http://softimage.wiki.softimage.com/index.php/INFO:_PIC_file_format
|
|
|
3653 // See http://ozviz.wasp.uwa.edu.au/~pbourke/dataformats/softimagepic/
|
|
|
3654
|
|
|
3655 static int pic_is4(stbi *s,const char *str)
|
|
|
3656 {
|
|
|
3657 int i;
|
|
|
3658 for (i=0; i<4; ++i)
|
|
|
3659 if (get8(s) != (stbi_uc)str[i])
|
|
|
3660 return 0;
|
|
|
3661
|
|
|
3662 return 1;
|
|
|
3663 }
|
|
|
3664
|
|
|
3665 static int pic_test(stbi *s)
|
|
|
3666 {
|
|
|
3667 int i;
|
|
|
3668
|
|
|
3669 if (!pic_is4(s,"\x53\x80\xF6\x34"))
|
|
|
3670 return 0;
|
|
|
3671
|
|
|
3672 for(i=0;i<84;++i)
|
|
|
3673 get8(s);
|
|
|
3674
|
|
|
3675 if (!pic_is4(s,"PICT"))
|
|
|
3676 return 0;
|
|
|
3677
|
|
|
3678 return 1;
|
|
|
3679 }
|
|
|
3680
|
|
|
3681 typedef struct
|
|
|
3682 {
|
|
|
3683 stbi_uc size,type,channel;
|
|
|
3684 } pic_packet_t;
|
|
|
3685
|
|
|
3686 static stbi_uc *pic_readval(stbi *s, int channel, stbi_uc *dest)
|
|
|
3687 {
|
|
|
3688 int mask=0x80, i;
|
|
|
3689
|
|
|
3690 for (i=0; i<4; ++i, mask>>=1) {
|
|
|
3691 if (channel & mask) {
|
|
|
3692 if (at_eof(s)) return epuc("bad file","PIC file too short");
|
|
|
3693 dest[i]=get8u(s);
|
|
|
3694 }
|
|
|
3695 }
|
|
|
3696
|
|
|
3697 return dest;
|
|
|
3698 }
|
|
|
3699
|
|
|
3700 static void pic_copyval(int channel,stbi_uc *dest,const stbi_uc *src)
|
|
|
3701 {
|
|
|
3702 int mask=0x80,i;
|
|
|
3703
|
|
|
3704 for (i=0;i<4; ++i, mask>>=1)
|
|
|
3705 if (channel&mask)
|
|
|
3706 dest[i]=src[i];
|
|
|
3707 }
|
|
|
3708
|
|
|
3709 static stbi_uc *pic_load2(stbi *s,int width,int height,int *comp, stbi_uc *result)
|
|
|
3710 {
|
|
|
3711 int act_comp=0,num_packets=0,y,chained;
|
|
|
3712 pic_packet_t packets[10];
|
|
|
3713
|
|
|
3714 // this will (should...) cater for even some bizarre stuff like having data
|
|
|
3715 // for the same channel in multiple packets.
|
|
|
3716 do {
|
|
|
3717 pic_packet_t *packet;
|
|
|
3718
|
|
|
3719 if (num_packets==sizeof(packets)/sizeof(packets[0]))
|
|
|
3720 return epuc("bad format","too many packets");
|
|
|
3721
|
|
|
3722 packet = &packets[num_packets++];
|
|
|
3723
|
|
|
3724 chained = get8(s);
|
|
|
3725 packet->size = get8u(s);
|
|
|
3726 packet->type = get8u(s);
|
|
|
3727 packet->channel = get8u(s);
|
|
|
3728
|
|
|
3729 act_comp |= packet->channel;
|
|
|
3730
|
|
|
3731 if (at_eof(s)) return epuc("bad file","file too short (reading packets)");
|
|
|
3732 if (packet->size != 8) return epuc("bad format","packet isn't 8bpp");
|
|
|
3733 } while (chained);
|
|
|
3734
|
|
|
3735 *comp = (act_comp & 0x10 ? 4 : 3); // has alpha channel?
|
|
|
3736
|
|
|
3737 for(y=0; y<height; ++y) {
|
|
|
3738 int packet_idx;
|
|
|
3739
|
|
|
3740 for(packet_idx=0; packet_idx < num_packets; ++packet_idx) {
|
|
|
3741 pic_packet_t *packet = &packets[packet_idx];
|
|
|
3742 stbi_uc *dest = result+y*width*4;
|
|
|
3743
|
|
|
3744 switch (packet->type) {
|
|
|
3745 default:
|
|
|
3746 return epuc("bad format","packet has bad compression type");
|
|
|
3747
|
|
|
3748 case 0: {//uncompressed
|
|
|
3749 int x;
|
|
|
3750
|
|
|
3751 for(x=0;x<width;++x, dest+=4)
|
|
|
3752 if (!pic_readval(s,packet->channel,dest))
|
|
|
3753 return 0;
|
|
|
3754 break;
|
|
|
3755 }
|
|
|
3756
|
|
|
3757 case 1://Pure RLE
|
|
|
3758 {
|
|
|
3759 int left=width, i;
|
|
|
3760
|
|
|
3761 while (left>0) {
|
|
|
3762 stbi_uc count,value[4];
|
|
|
3763
|
|
|
3764 count=get8u(s);
|
|
|
3765 if (at_eof(s)) return epuc("bad file","file too short (pure read count)");
|
|
|
3766
|
|
|
3767 if (count > left)
|
|
|
3768 count = (uint8) left;
|
|
|
3769
|
|
|
3770 if (!pic_readval(s,packet->channel,value)) return 0;
|
|
|
3771
|
|
|
3772 for(i=0; i<count; ++i,dest+=4)
|
|
|
3773 pic_copyval(packet->channel,dest,value);
|
|
|
3774 left -= count;
|
|
|
3775 }
|
|
|
3776 }
|
|
|
3777 break;
|
|
|
3778
|
|
|
3779 case 2: {//Mixed RLE
|
|
|
3780 int left=width;
|
|
|
3781 while (left>0) {
|
|
|
3782 int count = get8(s), i;
|
|
|
3783 if (at_eof(s)) return epuc("bad file","file too short (mixed read count)");
|
|
|
3784
|
|
|
3785 if (count >= 128) { // Repeated
|
|
|
3786 stbi_uc value[4];
|
|
|
3787 int i;
|
|
|
3788
|
|
|
3789 if (count==128)
|
|
|
3790 count = get16(s);
|
|
|
3791 else
|
|
|
3792 count -= 127;
|
|
|
3793 if (count > left)
|
|
|
3794 return epuc("bad file","scanline overrun");
|
|
|
3795
|
|
|
3796 if (!pic_readval(s,packet->channel,value))
|
|
|
3797 return 0;
|
|
|
3798
|
|
|
3799 for(i=0;i<count;++i, dest += 4)
|
|
|
3800 pic_copyval(packet->channel,dest,value);
|
|
|
3801 } else { // Raw
|
|
|
3802 ++count;
|
|
|
3803 if (count>left) return epuc("bad file","scanline overrun");
|
|
|
3804
|
|
|
3805 for(i=0;i<count;++i, dest+=4)
|
|
|
3806 if (!pic_readval(s,packet->channel,dest))
|
|
|
3807 return 0;
|
|
|
3808 }
|
|
|
3809 left-=count;
|
|
|
3810 }
|
|
|
3811 break;
|
|
|
3812 }
|
|
|
3813 }
|
|
|
3814 }
|
|
|
3815 }
|
|
|
3816
|
|
|
3817 return result;
|
|
|
3818 }
|
|
|
3819
|
|
|
3820 static stbi_uc *pic_load(stbi *s,int *px,int *py,int *comp,int req_comp)
|
|
|
3821 {
|
|
|
3822 stbi_uc *result;
|
|
|
3823 int i, x,y;
|
|
|
3824
|
|
|
3825 for (i=0; i<92; ++i)
|
|
|
3826 get8(s);
|
|
|
3827
|
|
|
3828 x = get16(s);
|
|
|
3829 y = get16(s);
|
|
|
3830 if (at_eof(s)) return epuc("bad file","file too short (pic header)");
|
|
|
3831 if ((1 << 28) / x < y) return epuc("too large", "Image too large to decode");
|
|
|
3832
|
|
|
3833 get32(s); //skip `ratio'
|
|
|
3834 get16(s); //skip `fields'
|
|
|
3835 get16(s); //skip `pad'
|
|
|
3836
|
|
|
3837 // intermediate buffer is RGBA
|
|
|
3838 result = (stbi_uc *) malloc(x*y*4);
|
|
|
3839 memset(result, 0xff, x*y*4);
|
|
|
3840
|
|
|
3841 if (!pic_load2(s,x,y,comp, result)) {
|
|
|
3842 free(result);
|
|
|
3843 result=0;
|
|
|
3844 }
|
|
|
3845 *px = x;
|
|
|
3846 *py = y;
|
|
|
3847 if (req_comp == 0) req_comp = *comp;
|
|
|
3848 result=convert_format(result,4,req_comp,x,y);
|
|
|
3849
|
|
|
3850 return result;
|
|
|
3851 }
|
|
|
3852
|
|
|
3853 static int stbi_pic_test(stbi *s)
|
|
|
3854 {
|
|
|
3855 int r = pic_test(s);
|
|
|
3856 stbi_rewind(s);
|
|
|
3857 return r;
|
|
|
3858 }
|
|
|
3859
|
|
|
3860 static stbi_uc *stbi_pic_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
3861 {
|
|
|
3862 return pic_load(s,x,y,comp,req_comp);
|
|
|
3863 }
|
|
|
3864
|
|
|
3865 // *************************************************************************************************
|
|
|
3866 // GIF loader -- public domain by Jean-Marc Lienher -- simplified/shrunk by stb
|
|
|
3867 typedef struct stbi_gif_lzw_struct {
|
|
|
3868 int16 prefix;
|
|
|
3869 uint8 first;
|
|
|
3870 uint8 suffix;
|
|
|
3871 } stbi_gif_lzw;
|
|
|
3872
|
|
|
3873 typedef struct stbi_gif_struct
|
|
|
3874 {
|
|
|
3875 int w,h;
|
|
|
3876 stbi_uc *out; // output buffer (always 4 components)
|
|
|
3877 int flags, bgindex, ratio, transparent, eflags;
|
|
|
3878 uint8 pal[256][4];
|
|
|
3879 uint8 lpal[256][4];
|
|
|
3880 stbi_gif_lzw codes[4096];
|
|
|
3881 uint8 *color_table;
|
|
|
3882 int parse, step;
|
|
|
3883 int lflags;
|
|
|
3884 int start_x, start_y;
|
|
|
3885 int max_x, max_y;
|
|
|
3886 int cur_x, cur_y;
|
|
|
3887 int line_size;
|
|
|
3888 } stbi_gif;
|
|
|
3889
|
|
|
3890 static int gif_test(stbi *s)
|
|
|
3891 {
|
|
|
3892 int sz;
|
|
|
3893 if (get8(s) != 'G' || get8(s) != 'I' || get8(s) != 'F' || get8(s) != '8') return 0;
|
|
|
3894 sz = get8(s);
|
|
|
3895 if (sz != '9' && sz != '7') return 0;
|
|
|
3896 if (get8(s) != 'a') return 0;
|
|
|
3897 return 1;
|
|
|
3898 }
|
|
|
3899
|
|
|
3900 static int stbi_gif_test(stbi *s)
|
|
|
3901 {
|
|
|
3902 int r = gif_test(s);
|
|
|
3903 stbi_rewind(s);
|
|
|
3904 return r;
|
|
|
3905 }
|
|
|
3906
|
|
|
3907 static void stbi_gif_parse_colortable(stbi *s, uint8 pal[256][4], int num_entries, int transp)
|
|
|
3908 {
|
|
|
3909 int i;
|
|
|
3910 for (i=0; i < num_entries; ++i) {
|
|
|
3911 pal[i][2] = get8u(s);
|
|
|
3912 pal[i][1] = get8u(s);
|
|
|
3913 pal[i][0] = get8u(s);
|
|
|
3914 pal[i][3] = transp ? 0 : 255;
|
|
|
3915 }
|
|
|
3916 }
|
|
|
3917
|
|
|
3918 static int stbi_gif_header(stbi *s, stbi_gif *g, int *comp, int is_info)
|
|
|
3919 {
|
|
|
3920 uint8 version;
|
|
|
3921 if (get8(s) != 'G' || get8(s) != 'I' || get8(s) != 'F' || get8(s) != '8')
|
|
|
3922 return e("not GIF", "Corrupt GIF");
|
|
|
3923
|
|
|
3924 version = get8u(s);
|
|
|
3925 if (version != '7' && version != '9') return e("not GIF", "Corrupt GIF");
|
|
|
3926 if (get8(s) != 'a') return e("not GIF", "Corrupt GIF");
|
|
|
3927
|
|
|
3928 failure_reason = "";
|
|
|
3929 g->w = get16le(s);
|
|
|
3930 g->h = get16le(s);
|
|
|
3931 g->flags = get8(s);
|
|
|
3932 g->bgindex = get8(s);
|
|
|
3933 g->ratio = get8(s);
|
|
|
3934 g->transparent = -1;
|
|
|
3935
|
|
|
3936 if (comp != 0) *comp = 4; // can't actually tell whether it's 3 or 4 until we parse the comments
|
|
|
3937
|
|
|
3938 if (is_info) return 1;
|
|
|
3939
|
|
|
3940 if (g->flags & 0x80)
|
|
|
3941 stbi_gif_parse_colortable(s,g->pal, 2 << (g->flags & 7), -1);
|
|
|
3942
|
|
|
3943 return 1;
|
|
|
3944 }
|
|
|
3945
|
|
|
3946 static int stbi_gif_info_raw(stbi *s, int *x, int *y, int *comp)
|
|
|
3947 {
|
|
|
3948 stbi_gif g;
|
|
|
3949 if (!stbi_gif_header(s, &g, comp, 1)) {
|
|
|
3950 stbi_rewind( s );
|
|
|
3951 return 0;
|
|
|
3952 }
|
|
|
3953 if (x) *x = g.w;
|
|
|
3954 if (y) *y = g.h;
|
|
|
3955 return 1;
|
|
|
3956 }
|
|
|
3957
|
|
|
3958 static void stbi_out_gif_code(stbi_gif *g, uint16 code)
|
|
|
3959 {
|
|
|
3960 uint8 *p, *c;
|
|
|
3961
|
|
|
3962 // recurse to decode the prefixes, since the linked-list is backwards,
|
|
|
3963 // and working backwards through an interleaved image would be nasty
|
|
|
3964 if (g->codes[code].prefix >= 0)
|
|
|
3965 stbi_out_gif_code(g, g->codes[code].prefix);
|
|
|
3966
|
|
|
3967 if (g->cur_y >= g->max_y) return;
|
|
|
3968
|
|
|
3969 p = &g->out[g->cur_x + g->cur_y];
|
|
|
3970 c = &g->color_table[g->codes[code].suffix * 4];
|
|
|
3971
|
|
|
3972 if (c[3] >= 128) {
|
|
|
3973 p[0] = c[2];
|
|
|
3974 p[1] = c[1];
|
|
|
3975 p[2] = c[0];
|
|
|
3976 p[3] = c[3];
|
|
|
3977 }
|
|
|
3978 g->cur_x += 4;
|
|
|
3979
|
|
|
3980 if (g->cur_x >= g->max_x) {
|
|
|
3981 g->cur_x = g->start_x;
|
|
|
3982 g->cur_y += g->step;
|
|
|
3983
|
|
|
3984 while (g->cur_y >= g->max_y && g->parse > 0) {
|
|
|
3985 g->step = (1 << g->parse) * g->line_size;
|
|
|
3986 g->cur_y = g->start_y + (g->step >> 1);
|
|
|
3987 --g->parse;
|
|
|
3988 }
|
|
|
3989 }
|
|
|
3990 }
|
|
|
3991
|
|
|
3992 static uint8 *stbi_process_gif_raster(stbi *s, stbi_gif *g)
|
|
|
3993 {
|
|
|
3994 uint8 lzw_cs;
|
|
|
3995 int32 len, code;
|
|
|
3996 uint32 first;
|
|
|
3997 int32 codesize, codemask, avail, oldcode, bits, valid_bits, clear;
|
|
|
3998 stbi_gif_lzw *p;
|
|
|
3999
|
|
|
4000 lzw_cs = get8u(s);
|
|
|
4001 clear = 1 << lzw_cs;
|
|
|
4002 first = 1;
|
|
|
4003 codesize = lzw_cs + 1;
|
|
|
4004 codemask = (1 << codesize) - 1;
|
|
|
4005 bits = 0;
|
|
|
4006 valid_bits = 0;
|
|
|
4007 for (code = 0; code < clear; code++) {
|
|
|
4008 g->codes[code].prefix = -1;
|
|
|
4009 g->codes[code].first = (uint8) code;
|
|
|
4010 g->codes[code].suffix = (uint8) code;
|
|
|
4011 }
|
|
|
4012
|
|
|
4013 // support no starting clear code
|
|
|
4014 avail = clear+2;
|
|
|
4015 oldcode = -1;
|
|
|
4016
|
|
|
4017 len = 0;
|
|
|
4018 for(;;) {
|
|
|
4019 if (valid_bits < codesize) {
|
|
|
4020 if (len == 0) {
|
|
|
4021 len = get8(s); // start new block
|
|
|
4022 if (len == 0)
|
|
|
4023 return g->out;
|
|
|
4024 }
|
|
|
4025 --len;
|
|
|
4026 bits |= (int32) get8(s) << valid_bits;
|
|
|
4027 valid_bits += 8;
|
|
|
4028 } else {
|
|
|
4029 int32 code = bits & codemask;
|
|
|
4030 bits >>= codesize;
|
|
|
4031 valid_bits -= codesize;
|
|
|
4032 // @OPTIMIZE: is there some way we can accelerate the non-clear path?
|
|
|
4033 if (code == clear) { // clear code
|
|
|
4034 codesize = lzw_cs + 1;
|
|
|
4035 codemask = (1 << codesize) - 1;
|
|
|
4036 avail = clear + 2;
|
|
|
4037 oldcode = -1;
|
|
|
4038 first = 0;
|
|
|
4039 } else if (code == clear + 1) { // end of stream code
|
|
|
4040 skip(s, len);
|
|
|
4041 while ((len = get8(s)) > 0)
|
|
|
4042 skip(s,len);
|
|
|
4043 return g->out;
|
|
|
4044 } else if (code <= avail) {
|
|
|
4045 if (first) return epuc("no clear code", "Corrupt GIF");
|
|
|
4046
|
|
|
4047 if (oldcode >= 0) {
|
|
|
4048 p = &g->codes[avail++];
|
|
|
4049 if (avail > 4096) return epuc("too many codes", "Corrupt GIF");
|
|
|
4050 p->prefix = (int16) oldcode;
|
|
|
4051 p->first = g->codes[oldcode].first;
|
|
|
4052 p->suffix = (code == avail) ? p->first : g->codes[code].first;
|
|
|
4053 } else if (code == avail)
|
|
|
4054 return epuc("illegal code in raster", "Corrupt GIF");
|
|
|
4055
|
|
|
4056 stbi_out_gif_code(g, (uint16) code);
|
|
|
4057
|
|
|
4058 if ((avail & codemask) == 0 && avail <= 0x0FFF) {
|
|
|
4059 codesize++;
|
|
|
4060 codemask = (1 << codesize) - 1;
|
|
|
4061 }
|
|
|
4062
|
|
|
4063 oldcode = code;
|
|
|
4064 } else {
|
|
|
4065 return epuc("illegal code in raster", "Corrupt GIF");
|
|
|
4066 }
|
|
|
4067 }
|
|
|
4068 }
|
|
|
4069 }
|
|
|
4070
|
|
|
4071 static void stbi_fill_gif_background(stbi_gif *g)
|
|
|
4072 {
|
|
|
4073 int i;
|
|
|
4074 uint8 *c = g->pal[g->bgindex];
|
|
|
4075 // @OPTIMIZE: write a dword at a time
|
|
|
4076 for (i = 0; i < g->w * g->h * 4; i += 4) {
|
|
|
4077 uint8 *p = &g->out[i];
|
|
|
4078 p[0] = c[2];
|
|
|
4079 p[1] = c[1];
|
|
|
4080 p[2] = c[0];
|
|
|
4081 p[3] = c[3];
|
|
|
4082 }
|
|
|
4083 }
|
|
|
4084
|
|
|
4085 // this function is designed to support animated gifs, although stb_image doesn't support it
|
|
|
4086 static uint8 *stbi_gif_load_next(stbi *s, stbi_gif *g, int *comp, int req_comp)
|
|
|
4087 {
|
|
|
4088 int i;
|
|
|
4089 uint8 *old_out = 0;
|
|
|
4090
|
|
|
4091 if (g->out == 0) {
|
|
|
4092 if (!stbi_gif_header(s, g, comp,0)) return 0; // failure_reason set by stbi_gif_header
|
|
|
4093 g->out = (uint8 *) malloc(4 * g->w * g->h);
|
|
|
4094 if (g->out == 0) return epuc("outofmem", "Out of memory");
|
|
|
4095 stbi_fill_gif_background(g);
|
|
|
4096 } else {
|
|
|
4097 // animated-gif-only path
|
|
|
4098 if (((g->eflags & 0x1C) >> 2) == 3) {
|
|
|
4099 old_out = g->out;
|
|
|
4100 g->out = (uint8 *) malloc(4 * g->w * g->h);
|
|
|
4101 if (g->out == 0) return epuc("outofmem", "Out of memory");
|
|
|
4102 memcpy(g->out, old_out, g->w*g->h*4);
|
|
|
4103 }
|
|
|
4104 }
|
|
|
4105
|
|
|
4106 for (;;) {
|
|
|
4107 switch (get8(s)) {
|
|
|
4108 case 0x2C: // Image Descriptor
|
|
|
4109 {
|
|
|
4110 int32 x, y, w, h;
|
|
|
4111 uint8 *o;
|
|
|
4112
|
|
|
4113 x = get16le(s);
|
|
|
4114 y = get16le(s);
|
|
|
4115 w = get16le(s);
|
|
|
4116 h = get16le(s);
|
|
|
4117 if (((x + w) > (g->w)) || ((y + h) > (g->h)))
|
|
|
4118 return epuc("bad Image Descriptor", "Corrupt GIF");
|
|
|
4119
|
|
|
4120 g->line_size = g->w * 4;
|
|
|
4121 g->start_x = x * 4;
|
|
|
4122 g->start_y = y * g->line_size;
|
|
|
4123 g->max_x = g->start_x + w * 4;
|
|
|
4124 g->max_y = g->start_y + h * g->line_size;
|
|
|
4125 g->cur_x = g->start_x;
|
|
|
4126 g->cur_y = g->start_y;
|
|
|
4127
|
|
|
4128 g->lflags = get8(s);
|
|
|
4129
|
|
|
4130 if (g->lflags & 0x40) {
|
|
|
4131 g->step = 8 * g->line_size; // first interlaced spacing
|
|
|
4132 g->parse = 3;
|
|
|
4133 } else {
|
|
|
4134 g->step = g->line_size;
|
|
|
4135 g->parse = 0;
|
|
|
4136 }
|
|
|
4137
|
|
|
4138 if (g->lflags & 0x80) {
|
|
|
4139 stbi_gif_parse_colortable(s,g->lpal, 2 << (g->lflags & 7), g->eflags & 0x01 ? g->transparent : -1);
|
|
|
4140 g->color_table = (uint8 *) g->lpal;
|
|
|
4141 } else if (g->flags & 0x80) {
|
|
|
4142 for (i=0; i < 256; ++i) // @OPTIMIZE: reset only the previous transparent
|
|
|
4143 g->pal[i][3] = 255;
|
|
|
4144 if (g->transparent >= 0 && (g->eflags & 0x01))
|
|
|
4145 g->pal[g->transparent][3] = 0;
|
|
|
4146 g->color_table = (uint8 *) g->pal;
|
|
|
4147 } else
|
|
|
4148 return epuc("missing color table", "Corrupt GIF");
|
|
|
4149
|
|
|
4150 o = stbi_process_gif_raster(s, g);
|
|
|
4151 if (o == NULL) return NULL;
|
|
|
4152
|
|
|
4153 if (req_comp && req_comp != 4)
|
|
|
4154 o = convert_format(o, 4, req_comp, g->w, g->h);
|
|
|
4155 return o;
|
|
|
4156 }
|
|
|
4157
|
|
|
4158 case 0x21: // Comment Extension.
|
|
|
4159 {
|
|
|
4160 int len;
|
|
|
4161 if (get8(s) == 0xF9) { // Graphic Control Extension.
|
|
|
4162 len = get8(s);
|
|
|
4163 if (len == 4) {
|
|
|
4164 g->eflags = get8(s);
|
|
|
4165 get16le(s); // delay
|
|
|
4166 g->transparent = get8(s);
|
|
|
4167 } else {
|
|
|
4168 skip(s, len);
|
|
|
4169 break;
|
|
|
4170 }
|
|
|
4171 }
|
|
|
4172 while ((len = get8(s)) != 0)
|
|
|
4173 skip(s, len);
|
|
|
4174 break;
|
|
|
4175 }
|
|
|
4176
|
|
|
4177 case 0x3B: // gif stream termination code
|
|
|
4178 return (uint8 *) 1;
|
|
|
4179
|
|
|
4180 default:
|
|
|
4181 return epuc("unknown code", "Corrupt GIF");
|
|
|
4182 }
|
|
|
4183 }
|
|
|
4184 }
|
|
|
4185
|
|
|
4186 static stbi_uc *stbi_gif_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
4187 {
|
|
|
4188 uint8 *u = 0;
|
|
|
4189 stbi_gif g={0};
|
|
|
4190
|
|
|
4191 u = stbi_gif_load_next(s, &g, comp, req_comp);
|
|
|
4192 if (u == (void *) 1) u = 0; // end of animated gif marker
|
|
|
4193 if (u) {
|
|
|
4194 *x = g.w;
|
|
|
4195 *y = g.h;
|
|
|
4196 }
|
|
|
4197
|
|
|
4198 return u;
|
|
|
4199 }
|
|
|
4200
|
|
|
4201 static int stbi_gif_info(stbi *s, int *x, int *y, int *comp)
|
|
|
4202 {
|
|
|
4203 return stbi_gif_info_raw(s,x,y,comp);
|
|
|
4204 }
|
|
|
4205
|
|
|
4206 #endif
|
|
|
4207
|
|
|
4208 // *************************************************************************************************
|
|
|
4209 // Radiance RGBE HDR loader
|
|
|
4210 // originally by Nicolas Schulz
|
|
|
4211 #ifndef STBI_NO_HDR
|
|
|
4212 static int hdr_test(stbi *s)
|
|
|
4213 {
|
|
|
4214 const char *signature = "#?RADIANCE\n";
|
|
|
4215 int i;
|
|
|
4216 for (i=0; signature[i]; ++i)
|
|
|
4217 if (get8(s) != signature[i])
|
|
|
4218 return 0;
|
|
|
4219 return 1;
|
|
|
4220 }
|
|
|
4221
|
|
|
4222 static int stbi_hdr_test(stbi* s)
|
|
|
4223 {
|
|
|
4224 int r = hdr_test(s);
|
|
|
4225 stbi_rewind(s);
|
|
|
4226 return r;
|
|
|
4227 }
|
|
|
4228
|
|
|
4229 #define HDR_BUFLEN 1024
|
|
|
4230 static char *hdr_gettoken(stbi *z, char *buffer)
|
|
|
4231 {
|
|
|
4232 int len=0;
|
|
|
4233 char c = '\0';
|
|
|
4234
|
|
|
4235 c = (char) get8(z);
|
|
|
4236
|
|
|
4237 while (!at_eof(z) && c != '\n') {
|
|
|
4238 buffer[len++] = c;
|
|
|
4239 if (len == HDR_BUFLEN-1) {
|
|
|
4240 // flush to end of line
|
|
|
4241 while (!at_eof(z) && get8(z) != '\n')
|
|
|
4242 ;
|
|
|
4243 break;
|
|
|
4244 }
|
|
|
4245 c = (char) get8(z);
|
|
|
4246 }
|
|
|
4247
|
|
|
4248 buffer[len] = 0;
|
|
|
4249 return buffer;
|
|
|
4250 }
|
|
|
4251
|
|
|
4252 static void hdr_convert(float *output, stbi_uc *input, int req_comp)
|
|
|
4253 {
|
|
|
4254 if ( input[3] != 0 ) {
|
|
|
4255 float f1;
|
|
|
4256 // Exponent
|
|
|
4257 f1 = (float) ldexp(1.0f, input[3] - (int)(128 + 8));
|
|
|
4258 if (req_comp <= 2)
|
|
|
4259 output[0] = (input[0] + input[1] + input[2]) * f1 / 3;
|
|
|
4260 else {
|
|
|
4261 output[0] = input[0] * f1;
|
|
|
4262 output[1] = input[1] * f1;
|
|
|
4263 output[2] = input[2] * f1;
|
|
|
4264 }
|
|
|
4265 if (req_comp == 2) output[1] = 1;
|
|
|
4266 if (req_comp == 4) output[3] = 1;
|
|
|
4267 } else {
|
|
|
4268 switch (req_comp) {
|
|
|
4269 case 4: output[3] = 1; // fallthrough
|
|
|
4270 case 3: output[0] = output[1] = output[2] = 0;
|
|
|
4271 break;
|
|
|
4272 case 2: output[1] = 1; // fallthrough
|
|
|
4273 case 1: output[0] = 0;
|
|
|
4274 break;
|
|
|
4275 }
|
|
|
4276 }
|
|
|
4277 }
|
|
|
4278
|
|
|
4279 static float *hdr_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
4280 {
|
|
|
4281 char buffer[HDR_BUFLEN];
|
|
|
4282 char *token;
|
|
|
4283 int valid = 0;
|
|
|
4284 int width, height;
|
|
|
4285 stbi_uc *scanline;
|
|
|
4286 float *hdr_data;
|
|
|
4287 int len;
|
|
|
4288 unsigned char count, value;
|
|
|
4289 int i, j, k, c1,c2, z;
|
|
|
4290
|
|
|
4291
|
|
|
4292 // Check identifier
|
|
|
4293 if (strcmp(hdr_gettoken(s,buffer), "#?RADIANCE") != 0)
|
|
|
4294 return epf("not HDR", "Corrupt HDR image");
|
|
|
4295
|
|
|
4296 // Parse header
|
|
|
4297 for(;;) {
|
|
|
4298 token = hdr_gettoken(s,buffer);
|
|
|
4299 if (token[0] == 0) break;
|
|
|
4300 if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0) valid = 1;
|
|
|
4301 }
|
|
|
4302
|
|
|
4303 if (!valid) return epf("unsupported format", "Unsupported HDR format");
|
|
|
4304
|
|
|
4305 // Parse width and height
|
|
|
4306 // can't use sscanf() if we're not using stdio!
|
|
|
4307 token = hdr_gettoken(s,buffer);
|
|
|
4308 if (strncmp(token, "-Y ", 3)) return epf("unsupported data layout", "Unsupported HDR format");
|
|
|
4309 token += 3;
|
|
|
4310 height = strtol(token, &token, 10);
|
|
|
4311 while (*token == ' ') ++token;
|
|
|
4312 if (strncmp(token, "+X ", 3)) return epf("unsupported data layout", "Unsupported HDR format");
|
|
|
4313 token += 3;
|
|
|
4314 width = strtol(token, NULL, 10);
|
|
|
4315
|
|
|
4316 *x = width;
|
|
|
4317 *y = height;
|
|
|
4318
|
|
|
4319 *comp = 3;
|
|
|
4320 if (req_comp == 0) req_comp = 3;
|
|
|
4321
|
|
|
4322 // Read data
|
|
|
4323 hdr_data = (float *) malloc(height * width * req_comp * sizeof(float));
|
|
|
4324
|
|
|
4325 // Load image data
|
|
|
4326 // image data is stored as some number of sca
|
|
|
4327 if ( width < 8 || width >= 32768) {
|
|
|
4328 // Read flat data
|
|
|
4329 for (j=0; j < height; ++j) {
|
|
|
4330 for (i=0; i < width; ++i) {
|
|
|
4331 stbi_uc rgbe[4];
|
|
|
4332 main_decode_loop:
|
|
|
4333 getn(s, rgbe, 4);
|
|
|
4334 hdr_convert(hdr_data + j * width * req_comp + i * req_comp, rgbe, req_comp);
|
|
|
4335 }
|
|
|
4336 }
|
|
|
4337 } else {
|
|
|
4338 // Read RLE-encoded data
|
|
|
4339 scanline = NULL;
|
|
|
4340
|
|
|
4341 for (j = 0; j < height; ++j) {
|
|
|
4342 c1 = get8(s);
|
|
|
4343 c2 = get8(s);
|
|
|
4344 len = get8(s);
|
|
|
4345 if (c1 != 2 || c2 != 2 || (len & 0x80)) {
|
|
|
4346 // not run-length encoded, so we have to actually use THIS data as a decoded
|
|
|
4347 // pixel (note this can't be a valid pixel--one of RGB must be >= 128)
|
|
|
4348 uint8 rgbe[4];
|
|
|
4349 rgbe[0] = (uint8) c1;
|
|
|
4350 rgbe[1] = (uint8) c2;
|
|
|
4351 rgbe[2] = (uint8) len;
|
|
|
4352 rgbe[3] = (uint8) get8u(s);
|
|
|
4353 hdr_convert(hdr_data, rgbe, req_comp);
|
|
|
4354 i = 1;
|
|
|
4355 j = 0;
|
|
|
4356 free(scanline);
|
|
|
4357 goto main_decode_loop; // yes, this makes no sense
|
|
|
4358 }
|
|
|
4359 len <<= 8;
|
|
|
4360 len |= get8(s);
|
|
|
4361 if (len != width) { free(hdr_data); free(scanline); return epf("invalid decoded scanline length", "corrupt HDR"); }
|
|
|
4362 if (scanline == NULL) scanline = (stbi_uc *) malloc(width * 4);
|
|
|
4363
|
|
|
4364 for (k = 0; k < 4; ++k) {
|
|
|
4365 i = 0;
|
|
|
4366 while (i < width) {
|
|
|
4367 count = get8u(s);
|
|
|
4368 if (count > 128) {
|
|
|
4369 // Run
|
|
|
4370 value = get8u(s);
|
|
|
4371 count -= 128;
|
|
|
4372 for (z = 0; z < count; ++z)
|
|
|
4373 scanline[i++ * 4 + k] = value;
|
|
|
4374 } else {
|
|
|
4375 // Dump
|
|
|
4376 for (z = 0; z < count; ++z)
|
|
|
4377 scanline[i++ * 4 + k] = get8u(s);
|
|
|
4378 }
|
|
|
4379 }
|
|
|
4380 }
|
|
|
4381 for (i=0; i < width; ++i)
|
|
|
4382 hdr_convert(hdr_data+(j*width + i)*req_comp, scanline + i*4, req_comp);
|
|
|
4383 }
|
|
|
4384 free(scanline);
|
|
|
4385 }
|
|
|
4386
|
|
|
4387 return hdr_data;
|
|
|
4388 }
|
|
|
4389
|
|
|
4390 static float *stbi_hdr_load(stbi *s, int *x, int *y, int *comp, int req_comp)
|
|
|
4391 {
|
|
|
4392 return hdr_load(s,x,y,comp,req_comp);
|
|
|
4393 }
|
|
|
4394
|
|
|
4395 static int stbi_hdr_info(stbi *s, int *x, int *y, int *comp)
|
|
|
4396 {
|
|
|
4397 char buffer[HDR_BUFLEN];
|
|
|
4398 char *token;
|
|
|
4399 int valid = 0;
|
|
|
4400
|
|
|
4401 if (strcmp(hdr_gettoken(s,buffer), "#?RADIANCE") != 0) {
|
|
|
4402 stbi_rewind( s );
|
|
|
4403 return 0;
|
|
|
4404 }
|
|
|
4405
|
|
|
4406 for(;;) {
|
|
|
4407 token = hdr_gettoken(s,buffer);
|
|
|
4408 if (token[0] == 0) break;
|
|
|
4409 if (strcmp(token, "FORMAT=32-bit_rle_rgbe") == 0) valid = 1;
|
|
|
4410 }
|
|
|
4411
|
|
|
4412 if (!valid) {
|
|
|
4413 stbi_rewind( s );
|
|
|
4414 return 0;
|
|
|
4415 }
|
|
|
4416 token = hdr_gettoken(s,buffer);
|
|
|
4417 if (strncmp(token, "-Y ", 3)) {
|
|
|
4418 stbi_rewind( s );
|
|
|
4419 return 0;
|
|
|
4420 }
|
|
|
4421 token += 3;
|
|
|
4422 *y = strtol(token, &token, 10);
|
|
|
4423 while (*token == ' ') ++token;
|
|
|
4424 if (strncmp(token, "+X ", 3)) {
|
|
|
4425 stbi_rewind( s );
|
|
|
4426 return 0;
|
|
|
4427 }
|
|
|
4428 token += 3;
|
|
|
4429 *x = strtol(token, NULL, 10);
|
|
|
4430 *comp = 3;
|
|
|
4431 return 1;
|
|
|
4432 }
|
|
|
4433 #endif // STBI_NO_HDR
|
|
|
4434
|
|
|
4435 #ifdef STBI_CRAP_FORMATS
|
|
|
4436
|
|
|
4437 static int stbi_bmp_info(stbi *s, int *x, int *y, int *comp)
|
|
|
4438 {
|
|
|
4439 int hsz;
|
|
|
4440 if (get8(s) != 'B' || get8(s) != 'M') {
|
|
|
4441 stbi_rewind( s );
|
|
|
4442 return 0;
|
|
|
4443 }
|
|
|
4444 skip(s,12);
|
|
|
4445 hsz = get32le(s);
|
|
|
4446 if (hsz != 12 && hsz != 40 && hsz != 56 && hsz != 108) {
|
|
|
4447 stbi_rewind( s );
|
|
|
4448 return 0;
|
|
|
4449 }
|
|
|
4450 if (hsz == 12) {
|
|
|
4451 *x = get16le(s);
|
|
|
4452 *y = get16le(s);
|
|
|
4453 } else {
|
|
|
4454 *x = get32le(s);
|
|
|
4455 *y = get32le(s);
|
|
|
4456 }
|
|
|
4457 if (get16le(s) != 1) {
|
|
|
4458 stbi_rewind( s );
|
|
|
4459 return 0;
|
|
|
4460 }
|
|
|
4461 *comp = get16le(s) / 8;
|
|
|
4462 return 1;
|
|
|
4463 }
|
|
|
4464
|
|
|
4465 static int stbi_psd_info(stbi *s, int *x, int *y, int *comp)
|
|
|
4466 {
|
|
|
4467 int channelCount;
|
|
|
4468 if (get32(s) != 0x38425053) {
|
|
|
4469 stbi_rewind( s );
|
|
|
4470 return 0;
|
|
|
4471 }
|
|
|
4472 if (get16(s) != 1) {
|
|
|
4473 stbi_rewind( s );
|
|
|
4474 return 0;
|
|
|
4475 }
|
|
|
4476 skip(s, 6);
|
|
|
4477 channelCount = get16(s);
|
|
|
4478 if (channelCount < 0 || channelCount > 16) {
|
|
|
4479 stbi_rewind( s );
|
|
|
4480 return 0;
|
|
|
4481 }
|
|
|
4482 *y = get32(s);
|
|
|
4483 *x = get32(s);
|
|
|
4484 if (get16(s) != 8) {
|
|
|
4485 stbi_rewind( s );
|
|
|
4486 return 0;
|
|
|
4487 }
|
|
|
4488 if (get16(s) != 3) {
|
|
|
4489 stbi_rewind( s );
|
|
|
4490 return 0;
|
|
|
4491 }
|
|
|
4492 *comp = 4;
|
|
|
4493 return 1;
|
|
|
4494 }
|
|
|
4495
|
|
|
4496 static int stbi_pic_info(stbi *s, int *x, int *y, int *comp)
|
|
|
4497 {
|
|
|
4498 int act_comp=0,num_packets=0,chained;
|
|
|
4499 pic_packet_t packets[10];
|
|
|
4500
|
|
|
4501 skip(s, 92);
|
|
|
4502
|
|
|
4503 *x = get16(s);
|
|
|
4504 *y = get16(s);
|
|
|
4505 if (at_eof(s)) return 0;
|
|
|
4506 if ( (*x) != 0 && (1 << 28) / (*x) < (*y)) {
|
|
|
4507 stbi_rewind( s );
|
|
|
4508 return 0;
|
|
|
4509 }
|
|
|
4510
|
|
|
4511 skip(s, 8);
|
|
|
4512
|
|
|
4513 do {
|
|
|
4514 pic_packet_t *packet;
|
|
|
4515
|
|
|
4516 if (num_packets==sizeof(packets)/sizeof(packets[0]))
|
|
|
4517 return 0;
|
|
|
4518
|
|
|
4519 packet = &packets[num_packets++];
|
|
|
4520 chained = get8(s);
|
|
|
4521 packet->size = get8u(s);
|
|
|
4522 packet->type = get8u(s);
|
|
|
4523 packet->channel = get8u(s);
|
|
|
4524 act_comp |= packet->channel;
|
|
|
4525
|
|
|
4526 if (at_eof(s)) {
|
|
|
4527 stbi_rewind( s );
|
|
|
4528 return 0;
|
|
|
4529 }
|
|
|
4530 if (packet->size != 8) {
|
|
|
4531 stbi_rewind( s );
|
|
|
4532 return 0;
|
|
|
4533 }
|
|
|
4534 } while (chained);
|
|
|
4535
|
|
|
4536 *comp = (act_comp & 0x10 ? 4 : 3);
|
|
|
4537
|
|
|
4538 return 1;
|
|
|
4539 }
|
|
|
4540 #endif
|
|
|
4541
|
|
|
4542
|
|
|
4543 static int stbi_info_main(stbi *s, int *x, int *y, int *comp)
|
|
|
4544 {
|
|
|
4545 if (stbi_jpeg_info(s, x, y, comp))
|
|
|
4546 return 1;
|
|
|
4547 if (stbi_png_info(s, x, y, comp))
|
|
|
4548 return 1;
|
|
|
4549 #ifdef STBI_CRAP_FORMATS
|
|
|
4550 if (stbi_gif_info(s, x, y, comp))
|
|
|
4551 return 1;
|
|
|
4552 if (stbi_bmp_info(s, x, y, comp))
|
|
|
4553 return 1;
|
|
|
4554 if (stbi_psd_info(s, x, y, comp))
|
|
|
4555 return 1;
|
|
|
4556 if (stbi_pic_info(s, x, y, comp))
|
|
|
4557 return 1;
|
|
|
4558 #ifndef STBI_NO_HDR
|
|
|
4559 if (stbi_hdr_info(s, x, y, comp))
|
|
|
4560 return 1;
|
|
|
4561 #endif
|
|
|
4562 // test tga last because it's a crappy test!
|
|
|
4563 if (stbi_tga_info(s, x, y, comp))
|
|
|
4564 return 1;
|
|
|
4565 #endif
|
|
|
4566 return e("unknown image type", "Image not of any known type, or corrupt");
|
|
|
4567 }
|
|
|
4568
|
|
|
4569 #ifndef STBI_NO_STDIO
|
|
|
4570 int stbi_info(char const *filename, int *x, int *y, int *comp)
|
|
|
4571 {
|
|
|
4572 FILE *f = fopen(filename, "rb");
|
|
|
4573 int result;
|
|
|
4574 if (!f) return e("can't fopen", "Unable to open file");
|
|
|
4575 result = stbi_info_from_file(f, x, y, comp);
|
|
|
4576 fclose(f);
|
|
|
4577 return result;
|
|
|
4578 }
|
|
|
4579
|
|
|
4580 int stbi_info_from_file(FILE *f, int *x, int *y, int *comp)
|
|
|
4581 {
|
|
|
4582 int r;
|
|
|
4583 stbi s;
|
|
|
4584 long pos = ftell(f);
|
|
|
4585 start_file(&s, f);
|
|
|
4586 r = stbi_info_main(&s,x,y,comp);
|
|
|
4587 fseek(f,pos,SEEK_SET);
|
|
|
4588 return r;
|
|
|
4589 }
|
|
|
4590 #endif // !STBI_NO_STDIO
|
|
|
4591
|
|
|
4592 int stbi_info_from_memory(stbi_uc const *buffer, int len, int *x, int *y, int *comp)
|
|
|
4593 {
|
|
|
4594 stbi s;
|
|
|
4595 start_mem(&s,buffer,len);
|
|
|
4596 return stbi_info_main(&s,x,y,comp);
|
|
|
4597 }
|
|
|
4598
|
|
|
4599 int stbi_info_from_callbacks(stbi_io_callbacks const *c, void *user, int *x, int *y, int *comp)
|
|
|
4600 {
|
|
|
4601 stbi s;
|
|
|
4602 start_callbacks(&s, (stbi_io_callbacks *) c, user);
|
|
|
4603 return stbi_info_main(&s,x,y,comp);
|
|
|
4604 }
|
|
|
4605
|
|
|
4606 #endif // STBI_HEADER_FILE_ONLY
|
|
|
4607
|
|
|
4608 /*
|
|
|
4609 revision history:
|
|
|
4610 1.33 (2011-07-14)
|
|
|
4611 make stbi_is_hdr work in STBI_NO_HDR (as specified), minor compiler-friendly improvements
|
|
|
4612 1.32 (2011-07-13)
|
|
|
4613 support for "info" function for all supported filetypes (SpartanJ)
|
|
|
4614 1.31 (2011-06-20)
|
|
|
4615 a few more leak fixes, bug in PNG handling (SpartanJ)
|
|
|
4616 1.30 (2011-06-11)
|
|
|
4617 added ability to load files via callbacks to accomidate custom input streams (Ben Wenger)
|
|
|
4618 removed deprecated format-specific test/load functions
|
|
|
4619 removed support for installable file formats (stbi_loader) -- would have been broken for IO callbacks anyway
|
|
|
4620 error cases in bmp and tga give messages and don't leak (Raymond Barbiero, grisha)
|
|
|
4621 fix inefficiency in decoding 32-bit BMP (David Woo)
|
|
|
4622 1.29 (2010-08-16)
|
|
|
4623 various warning fixes from Aurelien Pocheville
|
|
|
4624 1.28 (2010-08-01)
|
|
|
4625 fix bug in GIF palette transparency (SpartanJ)
|
|
|
4626 1.27 (2010-08-01)
|
|
|
4627 cast-to-uint8 to fix warnings
|
|
|
4628 1.26 (2010-07-24)
|
|
|
4629 fix bug in file buffering for PNG reported by SpartanJ
|
|
|
4630 1.25 (2010-07-17)
|
|
|
4631 refix trans_data warning (Won Chun)
|
|
|
4632 1.24 (2010-07-12)
|
|
|
4633 perf improvements reading from files on platforms with lock-heavy fgetc()
|
|
|
4634 minor perf improvements for jpeg
|
|
|
4635 deprecated type-specific functions so we'll get feedback if they're needed
|
|
|
4636 attempt to fix trans_data warning (Won Chun)
|
|
|
4637 1.23 fixed bug in iPhone support
|
|
|
4638 1.22 (2010-07-10)
|
|
|
4639 removed image *writing* support
|
|
|
4640 stbi_info support from Jetro Lauha
|
|
|
4641 GIF support from Jean-Marc Lienher
|
|
|
4642 iPhone PNG-extensions from James Brown
|
|
|
4643 warning-fixes from Nicolas Schulz and Janez Zemva (i.e. Janez (U+017D)emva)
|
|
|
4644 1.21 fix use of 'uint8' in header (reported by jon blow)
|
|
|
4645 1.20 added support for Softimage PIC, by Tom Seddon
|
|
|
4646 1.19 bug in interlaced PNG corruption check (found by ryg)
|
|
|
4647 1.18 2008-08-02
|
|
|
4648 fix a threading bug (local mutable static)
|
|
|
4649 1.17 support interlaced PNG
|
|
|
4650 1.16 major bugfix - convert_format converted one too many pixels
|
|
|
4651 1.15 initialize some fields for thread safety
|
|
|
4652 1.14 fix threadsafe conversion bug
|
|
|
4653 header-file-only version (#define STBI_HEADER_FILE_ONLY before including)
|
|
|
4654 1.13 threadsafe
|
|
|
4655 1.12 const qualifiers in the API
|
|
|
4656 1.11 Support installable IDCT, colorspace conversion routines
|
|
|
4657 1.10 Fixes for 64-bit (don't use "unsigned long")
|
|
|
4658 optimized upsampling by Fabian "ryg" Giesen
|
|
|
4659 1.09 Fix format-conversion for PSD code (bad global variables!)
|
|
|
4660 1.08 Thatcher Ulrich's PSD code integrated by Nicolas Schulz
|
|
|
4661 1.07 attempt to fix C++ warning/errors again
|
|
|
4662 1.06 attempt to fix C++ warning/errors again
|
|
|
4663 1.05 fix TGA loading to return correct *comp and use good luminance calc
|
|
|
4664 1.04 default float alpha is 1, not 255; use 'void *' for stbi_image_free
|
|
|
4665 1.03 bugfixes to STBI_NO_STDIO, STBI_NO_HDR
|
|
|
4666 1.02 support for (subset of) HDR files, float interface for preferred access to them
|
|
|
4667 1.01 fix bug: possible bug in handling right-side up bmps... not sure
|
|
|
4668 fix bug: the stbi_bmp_load() and stbi_tga_load() functions didn't work at all
|
|
|
4669 1.00 interface to zlib that skips zlib header
|
|
|
4670 0.99 correct handling of alpha in palette
|
|
|
4671 0.98 TGA loader by lonesock; dynamically add loaders (untested)
|
|
|
4672 0.97 jpeg errors on too large a file; also catch another malloc failure
|
|
|
4673 0.96 fix detection of invalid v value - particleman@mollyrocket forum
|
|
|
4674 0.95 during header scan, seek to markers in case of padding
|
|
|
4675 0.94 STBI_NO_STDIO to disable stdio usage; rename all #defines the same
|
|
|
4676 0.93 handle jpegtran output; verbose errors
|
|
|
4677 0.92 read 4,8,16,24,32-bit BMP files of several formats
|
|
|
4678 0.91 output 24-bit Windows 3.0 BMP files
|
|
|
4679 0.90 fix a few more warnings; bump version number to approach 1.0
|
|
|
4680 0.61 bugfixes due to Marc LeBlanc, Christopher Lloyd
|
|
|
4681 0.60 fix compiling as c++
|
|
|
4682 0.59 fix warnings: merge Dave Moore's -Wall fixes
|
|
|
4683 0.58 fix bug: zlib uncompressed mode len/nlen was wrong endian
|
|
|
4684 0.57 fix bug: jpg last huffman symbol before marker was >9 bits but less than 16 available
|
|
|
4685 0.56 fix bug: zlib uncompressed mode len vs. nlen
|
|
|
4686 0.55 fix bug: restart_interval not initialized to 0
|
|
|
4687 0.54 allow NULL for 'int *comp'
|
|
|
4688 0.53 fix bug in png 3->4; speedup png decoding
|
|
|
4689 0.52 png handles req_comp=3,4 directly; minor cleanup; jpeg comments
|
|
|
4690 0.51 obey req_comp requests, 1-component jpegs return as 1-component,
|
|
|
4691 on 'test' only check type, not whether we support this variant
|
|
|
4692 0.50 first released version
|
|
|
4693 */
|
