Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(271)

Side by Side Diff: third_party/libpng/pngwutil.c

Issue 23494067: Revert "libpng 1.6.3" (Closed) Base URL: svn://svn.chromium.org/chrome/trunk/src
Patch Set: Created 7 years, 2 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « third_party/libpng/pngwtran.c ('k') | third_party/zlib/zlib.gyp » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 1
2 /* pngwutil.c - utilities to write a PNG file 2 /* pngwutil.c - utilities to write a PNG file
3 * 3 *
4 * Last changed in libpng 1.6.2 [April 25, 2013] 4 * Last changed in libpng 1.2.43 [February 25, 2010]
5 * Copyright (c) 1998-2013 Glenn Randers-Pehrson 5 * Copyright (c) 1998-2010 Glenn Randers-Pehrson
6 * (Version 0.96 Copyright (c) 1996, 1997 Andreas Dilger) 6 * (Version 0.96 Copyright (c) 1996, 1997 Andreas Dilger)
7 * (Version 0.88 Copyright (c) 1995, 1996 Guy Eric Schalnat, Group 42, Inc.) 7 * (Version 0.88 Copyright (c) 1995, 1996 Guy Eric Schalnat, Group 42, Inc.)
8 * 8 *
9 * This code is released under the libpng license. 9 * This code is released under the libpng license.
10 * For conditions of distribution and use, see the disclaimer 10 * For conditions of distribution and use, see the disclaimer
11 * and license in png.h 11 * and license in png.h
12 */ 12 */
13 13
14 #include "pngpriv.h" 14 #define PNG_INTERNAL
15 15 #define PNG_NO_PEDANTIC_WARNINGS
16 #include "png.h"
16 #ifdef PNG_WRITE_SUPPORTED 17 #ifdef PNG_WRITE_SUPPORTED
17 18
18 #ifdef PNG_WRITE_INT_FUNCTIONS_SUPPORTED
19 /* Place a 32-bit number into a buffer in PNG byte order. We work 19 /* Place a 32-bit number into a buffer in PNG byte order. We work
20 * with unsigned numbers for convenience, although one supported 20 * with unsigned numbers for convenience, although one supported
21 * ancillary chunk uses signed (two's complement) numbers. 21 * ancillary chunk uses signed (two's complement) numbers.
22 */ 22 */
23 void PNGAPI 23 void PNGAPI
24 png_save_uint_32(png_bytep buf, png_uint_32 i) 24 png_save_uint_32(png_bytep buf, png_uint_32 i)
25 { 25 {
26 buf[0] = (png_byte)((i >> 24) & 0xff); 26 buf[0] = (png_byte)((i >> 24) & 0xff);
27 buf[1] = (png_byte)((i >> 16) & 0xff); 27 buf[1] = (png_byte)((i >> 16) & 0xff);
28 buf[2] = (png_byte)((i >> 8) & 0xff); 28 buf[2] = (png_byte)((i >> 8) & 0xff);
29 buf[3] = (png_byte)(i & 0xff); 29 buf[3] = (png_byte)(i & 0xff);
30 } 30 }
31 31
32 /* The png_save_int_32 function assumes integers are stored in two's
33 * complement format. If this isn't the case, then this routine needs to
34 * be modified to write data in two's complement format.
35 */
36 void PNGAPI
37 png_save_int_32(png_bytep buf, png_int_32 i)
38 {
39 buf[0] = (png_byte)((i >> 24) & 0xff);
40 buf[1] = (png_byte)((i >> 16) & 0xff);
41 buf[2] = (png_byte)((i >> 8) & 0xff);
42 buf[3] = (png_byte)(i & 0xff);
43 }
44
32 /* Place a 16-bit number into a buffer in PNG byte order. 45 /* Place a 16-bit number into a buffer in PNG byte order.
33 * The parameter is declared unsigned int, not png_uint_16, 46 * The parameter is declared unsigned int, not png_uint_16,
34 * just to avoid potential problems on pre-ANSI C compilers. 47 * just to avoid potential problems on pre-ANSI C compilers.
35 */ 48 */
36 void PNGAPI 49 void PNGAPI
37 png_save_uint_16(png_bytep buf, unsigned int i) 50 png_save_uint_16(png_bytep buf, unsigned int i)
38 { 51 {
39 buf[0] = (png_byte)((i >> 8) & 0xff); 52 buf[0] = (png_byte)((i >> 8) & 0xff);
40 buf[1] = (png_byte)(i & 0xff); 53 buf[1] = (png_byte)(i & 0xff);
41 } 54 }
42 #endif
43 55
44 /* Simple function to write the signature. If we have already written 56 /* Simple function to write the signature. If we have already written
45 * the magic bytes of the signature, or more likely, the PNG stream is 57 * the magic bytes of the signature, or more likely, the PNG stream is
46 * being embedded into another stream and doesn't need its own signature, 58 * being embedded into another stream and doesn't need its own signature,
47 * we should call png_set_sig_bytes() to tell libpng how many of the 59 * we should call png_set_sig_bytes() to tell libpng how many of the
48 * bytes have already been written. 60 * bytes have already been written.
49 */ 61 */
50 void PNGAPI 62 void /* PRIVATE */
51 png_write_sig(png_structrp png_ptr) 63 png_write_sig(png_structp png_ptr)
52 { 64 {
53 png_byte png_signature[8] = {137, 80, 78, 71, 13, 10, 26, 10}; 65 png_byte png_signature[8] = {137, 80, 78, 71, 13, 10, 26, 10};
54 66
55 #ifdef PNG_IO_STATE_SUPPORTED
56 /* Inform the I/O callback that the signature is being written */
57 png_ptr->io_state = PNG_IO_WRITING | PNG_IO_SIGNATURE;
58 #endif
59
60 /* Write the rest of the 8 byte signature */ 67 /* Write the rest of the 8 byte signature */
61 png_write_data(png_ptr, &png_signature[png_ptr->sig_bytes], 68 png_write_data(png_ptr, &png_signature[png_ptr->sig_bytes],
62 (png_size_t)(8 - png_ptr->sig_bytes)); 69 (png_size_t)(8 - png_ptr->sig_bytes));
63
64 if (png_ptr->sig_bytes < 3) 70 if (png_ptr->sig_bytes < 3)
65 png_ptr->mode |= PNG_HAVE_PNG_SIGNATURE; 71 png_ptr->mode |= PNG_HAVE_PNG_SIGNATURE;
66 } 72 }
67 73
74 /* Write a PNG chunk all at once. The type is an array of ASCII characters
75 * representing the chunk name. The array must be at least 4 bytes in
76 * length, and does not need to be null terminated. To be safe, pass the
77 * pre-defined chunk names here, and if you need a new one, define it
78 * where the others are defined. The length is the length of the data.
79 * All the data must be present. If that is not possible, use the
80 * png_write_chunk_start(), png_write_chunk_data(), and png_write_chunk_end()
81 * functions instead.
82 */
83 void PNGAPI
84 png_write_chunk(png_structp png_ptr, png_bytep chunk_name,
85 png_bytep data, png_size_t length)
86 {
87 if (png_ptr == NULL)
88 return;
89 png_write_chunk_start(png_ptr, chunk_name, (png_uint_32)length);
90 png_write_chunk_data(png_ptr, data, (png_size_t)length);
91 png_write_chunk_end(png_ptr);
92 }
93
68 /* Write the start of a PNG chunk. The type is the chunk type. 94 /* Write the start of a PNG chunk. The type is the chunk type.
69 * The total_length is the sum of the lengths of all the data you will be 95 * The total_length is the sum of the lengths of all the data you will be
70 * passing in png_write_chunk_data(). 96 * passing in png_write_chunk_data().
71 */ 97 */
72 static void 98 void PNGAPI
73 png_write_chunk_header(png_structrp png_ptr, png_uint_32 chunk_name, 99 png_write_chunk_start(png_structp png_ptr, png_bytep chunk_name,
74 png_uint_32 length) 100 png_uint_32 length)
75 { 101 {
76 png_byte buf[8]; 102 png_byte buf[8];
77 103
78 #if defined(PNG_DEBUG) && (PNG_DEBUG > 0) 104 png_debug2(0, "Writing %s chunk, length = %lu", chunk_name,
79 PNG_CSTRING_FROM_CHUNK(buf, chunk_name); 105 (unsigned long)length);
80 png_debug2(0, "Writing %s chunk, length = %lu", buf, (unsigned long)length);
81 #endif
82 106
83 if (png_ptr == NULL) 107 if (png_ptr == NULL)
84 return; 108 return;
85 109
86 #ifdef PNG_IO_STATE_SUPPORTED
87 /* Inform the I/O callback that the chunk header is being written.
88 * PNG_IO_CHUNK_HDR requires a single I/O call.
89 */
90 png_ptr->io_state = PNG_IO_WRITING | PNG_IO_CHUNK_HDR;
91 #endif
92 110
93 /* Write the length and the chunk name */ 111 /* Write the length and the chunk name */
94 png_save_uint_32(buf, length); 112 png_save_uint_32(buf, length);
95 png_save_uint_32(buf + 4, chunk_name); 113 png_memcpy(buf + 4, chunk_name, 4);
96 png_write_data(png_ptr, buf, 8); 114 png_write_data(png_ptr, buf, (png_size_t)8);
97
98 /* Put the chunk name into png_ptr->chunk_name */ 115 /* Put the chunk name into png_ptr->chunk_name */
99 png_ptr->chunk_name = chunk_name; 116 png_memcpy(png_ptr->chunk_name, chunk_name, 4);
100
101 /* Reset the crc and run it over the chunk name */ 117 /* Reset the crc and run it over the chunk name */
102 png_reset_crc(png_ptr); 118 png_reset_crc(png_ptr);
103 119 png_calculate_crc(png_ptr, chunk_name, (png_size_t)4);
104 png_calculate_crc(png_ptr, buf + 4, 4);
105
106 #ifdef PNG_IO_STATE_SUPPORTED
107 /* Inform the I/O callback that chunk data will (possibly) be written.
108 * PNG_IO_CHUNK_DATA does NOT require a specific number of I/O calls.
109 */
110 png_ptr->io_state = PNG_IO_WRITING | PNG_IO_CHUNK_DATA;
111 #endif
112 } 120 }
113 121
114 void PNGAPI 122 /* Write the data of a PNG chunk started with png_write_chunk_start().
115 png_write_chunk_start(png_structrp png_ptr, png_const_bytep chunk_string,
116 png_uint_32 length)
117 {
118 png_write_chunk_header(png_ptr, PNG_CHUNK_FROM_STRING(chunk_string), length);
119 }
120
121 /* Write the data of a PNG chunk started with png_write_chunk_header().
122 * Note that multiple calls to this function are allowed, and that the 123 * Note that multiple calls to this function are allowed, and that the
123 * sum of the lengths from these calls *must* add up to the total_length 124 * sum of the lengths from these calls *must* add up to the total_length
124 * given to png_write_chunk_header(). 125 * given to png_write_chunk_start().
125 */ 126 */
126 void PNGAPI 127 void PNGAPI
127 png_write_chunk_data(png_structrp png_ptr, png_const_bytep data, 128 png_write_chunk_data(png_structp png_ptr, png_bytep data, png_size_t length)
128 png_size_t length)
129 { 129 {
130 /* Write the data, and run the CRC over it */ 130 /* Write the data, and run the CRC over it */
131 if (png_ptr == NULL) 131 if (png_ptr == NULL)
132 return; 132 return;
133
134 if (data != NULL && length > 0) 133 if (data != NULL && length > 0)
135 { 134 {
136 png_write_data(png_ptr, data, length); 135 png_write_data(png_ptr, data, length);
137
138 /* Update the CRC after writing the data, 136 /* Update the CRC after writing the data,
139 * in case that the user I/O routine alters it. 137 * in case that the user I/O routine alters it.
140 */ 138 */
141 png_calculate_crc(png_ptr, data, length); 139 png_calculate_crc(png_ptr, data, length);
142 } 140 }
143 } 141 }
144 142
145 /* Finish a chunk started with png_write_chunk_header(). */ 143 /* Finish a chunk started with png_write_chunk_start(). */
146 void PNGAPI 144 void PNGAPI
147 png_write_chunk_end(png_structrp png_ptr) 145 png_write_chunk_end(png_structp png_ptr)
148 { 146 {
149 png_byte buf[4]; 147 png_byte buf[4];
150 148
151 if (png_ptr == NULL) return; 149 if (png_ptr == NULL) return;
152 150
153 #ifdef PNG_IO_STATE_SUPPORTED
154 /* Inform the I/O callback that the chunk CRC is being written.
155 * PNG_IO_CHUNK_CRC requires a single I/O function call.
156 */
157 png_ptr->io_state = PNG_IO_WRITING | PNG_IO_CHUNK_CRC;
158 #endif
159
160 /* Write the crc in a single operation */ 151 /* Write the crc in a single operation */
161 png_save_uint_32(buf, png_ptr->crc); 152 png_save_uint_32(buf, png_ptr->crc);
162 153
163 png_write_data(png_ptr, buf, (png_size_t)4); 154 png_write_data(png_ptr, buf, (png_size_t)4);
164 } 155 }
165 156
166 /* Write a PNG chunk all at once. The type is an array of ASCII characters 157 #if defined(PNG_WRITE_TEXT_SUPPORTED) || defined(PNG_WRITE_iCCP_SUPPORTED)
167 * representing the chunk name. The array must be at least 4 bytes in
168 * length, and does not need to be null terminated. To be safe, pass the
169 * pre-defined chunk names here, and if you need a new one, define it
170 * where the others are defined. The length is the length of the data.
171 * All the data must be present. If that is not possible, use the
172 * png_write_chunk_start(), png_write_chunk_data(), and png_write_chunk_end()
173 * functions instead.
174 */
175 static void
176 png_write_complete_chunk(png_structrp png_ptr, png_uint_32 chunk_name,
177 png_const_bytep data, png_size_t length)
178 {
179 if (png_ptr == NULL)
180 return;
181
182 /* On 64 bit architectures 'length' may not fit in a png_uint_32. */
183 if (length > PNG_UINT_31_MAX)
184 png_error(png_ptr, "length exceeds PNG maxima");
185
186 png_write_chunk_header(png_ptr, chunk_name, (png_uint_32)length);
187 png_write_chunk_data(png_ptr, data, length);
188 png_write_chunk_end(png_ptr);
189 }
190
191 /* This is the API that calls the internal function above. */
192 void PNGAPI
193 png_write_chunk(png_structrp png_ptr, png_const_bytep chunk_string,
194 png_const_bytep data, png_size_t length)
195 {
196 png_write_complete_chunk(png_ptr, PNG_CHUNK_FROM_STRING(chunk_string), data,
197 length);
198 }
199
200 /* This is used below to find the size of an image to pass to png_deflate_claim,
201 * so it only needs to be accurate if the size is less than 16384 bytes (the
202 * point at which a lower LZ window size can be used.)
203 */
204 static png_alloc_size_t
205 png_image_size(png_structrp png_ptr)
206 {
207 /* Only return sizes up to the maximum of a png_uint_32, do this by limiting
208 * the width and height used to 15 bits.
209 */
210 png_uint_32 h = png_ptr->height;
211
212 if (png_ptr->rowbytes < 32768 && h < 32768)
213 {
214 if (png_ptr->interlaced)
215 {
216 /* Interlacing makes the image larger because of the replication of
217 * both the filter byte and the padding to a byte boundary.
218 */
219 png_uint_32 w = png_ptr->width;
220 unsigned int pd = png_ptr->pixel_depth;
221 png_alloc_size_t cb_base;
222 int pass;
223
224 for (cb_base=0, pass=0; pass<=6; ++pass)
225 {
226 png_uint_32 pw = PNG_PASS_COLS(w, pass);
227
228 if (pw > 0)
229 cb_base += (PNG_ROWBYTES(pd, pw)+1) * PNG_PASS_ROWS(h, pass);
230 }
231
232 return cb_base;
233 }
234
235 else
236 return (png_ptr->rowbytes+1) * h;
237 }
238
239 else
240 return 0xffffffffU;
241 }
242
243 #ifdef PNG_WRITE_OPTIMIZE_CMF_SUPPORTED
244 /* This is the code to hack the first two bytes of the deflate stream (the
245 * deflate header) to correct the windowBits value to match the actual data
246 * size. Note that the second argument is the *uncompressed* size but the
247 * first argument is the *compressed* data (and it must be deflate
248 * compressed.)
249 */
250 static void
251 optimize_cmf(png_bytep data, png_alloc_size_t data_size)
252 {
253 /* Optimize the CMF field in the zlib stream. The resultant zlib stream is
254 * still compliant to the stream specification.
255 */
256 if (data_size <= 16384) /* else windowBits must be 15 */
257 {
258 unsigned int z_cmf = data[0]; /* zlib compression method and flags */
259
260 if ((z_cmf & 0x0f) == 8 && (z_cmf & 0xf0) <= 0x70)
261 {
262 unsigned int z_cinfo;
263 unsigned int half_z_window_size;
264
265 z_cinfo = z_cmf >> 4;
266 half_z_window_size = 1U << (z_cinfo + 7);
267
268 if (data_size <= half_z_window_size) /* else no change */
269 {
270 unsigned int tmp;
271
272 do
273 {
274 half_z_window_size >>= 1;
275 --z_cinfo;
276 }
277 while (z_cinfo > 0 && data_size <= half_z_window_size);
278
279 z_cmf = (z_cmf & 0x0f) | (z_cinfo << 4);
280
281 data[0] = (png_byte)z_cmf;
282 tmp = data[1] & 0xe0;
283 tmp += 0x1f - ((z_cmf << 8) + tmp) % 0x1f;
284 data[1] = (png_byte)tmp;
285 }
286 }
287 }
288 }
289 #else
290 # define optimize_cmf(dp,dl) ((void)0)
291 #endif /* PNG_WRITE_OPTIMIZE_CMF_SUPPORTED */
292
293 /* Initialize the compressor for the appropriate type of compression. */
294 static int
295 png_deflate_claim(png_structrp png_ptr, png_uint_32 owner,
296 png_alloc_size_t data_size)
297 {
298 if (png_ptr->zowner != 0)
299 {
300 char msg[64];
301
302 PNG_STRING_FROM_CHUNK(msg, owner);
303 msg[4] = ':';
304 msg[5] = ' ';
305 PNG_STRING_FROM_CHUNK(msg+6, png_ptr->zowner);
306 /* So the message that results is "<chunk> using zstream"; this is an
307 * internal error, but is very useful for debugging. i18n requirements
308 * are minimal.
309 */
310 (void)png_safecat(msg, (sizeof msg), 10, " using zstream");
311 # if PNG_LIBPNG_BUILD_BASE_TYPE >= PNG_LIBPNG_BUILD_RC
312 png_warning(png_ptr, msg);
313
314 /* Attempt sane error recovery */
315 if (png_ptr->zowner == png_IDAT) /* don't steal from IDAT */
316 {
317 png_ptr->zstream.msg = PNGZ_MSG_CAST("in use by IDAT");
318 return Z_STREAM_ERROR;
319 }
320
321 png_ptr->zowner = 0;
322 # else
323 png_error(png_ptr, msg);
324 # endif
325 }
326
327 {
328 int level = png_ptr->zlib_level;
329 int method = png_ptr->zlib_method;
330 int windowBits = png_ptr->zlib_window_bits;
331 int memLevel = png_ptr->zlib_mem_level;
332 int strategy; /* set below */
333 int ret; /* zlib return code */
334
335 if (owner == png_IDAT)
336 {
337 if (png_ptr->flags & PNG_FLAG_ZLIB_CUSTOM_STRATEGY)
338 strategy = png_ptr->zlib_strategy;
339
340 else if (png_ptr->do_filter != PNG_FILTER_NONE)
341 strategy = PNG_Z_DEFAULT_STRATEGY;
342
343 else
344 strategy = PNG_Z_DEFAULT_NOFILTER_STRATEGY;
345 }
346
347 else
348 {
349 # ifdef PNG_WRITE_CUSTOMIZE_ZTXT_COMPRESSION_SUPPORTED
350 level = png_ptr->zlib_text_level;
351 method = png_ptr->zlib_text_method;
352 windowBits = png_ptr->zlib_text_window_bits;
353 memLevel = png_ptr->zlib_text_mem_level;
354 strategy = png_ptr->zlib_text_strategy;
355 # else
356 /* If customization is not supported the values all come from the
357 * IDAT values except for the strategy, which is fixed to the
358 * default. (This is the pre-1.6.0 behavior too, although it was
359 * implemented in a very different way.)
360 */
361 strategy = Z_DEFAULT_STRATEGY;
362 # endif
363 }
364
365 /* Adjust 'windowBits' down if larger than 'data_size'; to stop this
366 * happening just pass 32768 as the data_size parameter. Notice that zlib
367 * requires an extra 262 bytes in the window in addition to the data to be
368 * able to see the whole of the data, so if data_size+262 takes us to the
369 * next windowBits size we need to fix up the value later. (Because even
370 * though deflate needs the extra window, inflate does not!)
371 */
372 if (data_size <= 16384)
373 {
374 /* IMPLEMENTATION NOTE: this 'half_window_size' stuff is only here to
375 * work round a Microsoft Visual C misbehavior which, contrary to C-90,
376 * widens the result of the following shift to 64-bits if (and,
377 * apparently, only if) it is used in a test.
378 */
379 unsigned int half_window_size = 1U << (windowBits-1);
380
381 while (data_size + 262 <= half_window_size)
382 {
383 half_window_size >>= 1;
384 --windowBits;
385 }
386 }
387
388 /* Check against the previous initialized values, if any. */
389 if ((png_ptr->flags & PNG_FLAG_ZSTREAM_INITIALIZED) &&
390 (png_ptr->zlib_set_level != level ||
391 png_ptr->zlib_set_method != method ||
392 png_ptr->zlib_set_window_bits != windowBits ||
393 png_ptr->zlib_set_mem_level != memLevel ||
394 png_ptr->zlib_set_strategy != strategy))
395 {
396 if (deflateEnd(&png_ptr->zstream) != Z_OK)
397 png_warning(png_ptr, "deflateEnd failed (ignored)");
398
399 png_ptr->flags &= ~PNG_FLAG_ZSTREAM_INITIALIZED;
400 }
401
402 /* For safety clear out the input and output pointers (currently zlib
403 * doesn't use them on Init, but it might in the future).
404 */
405 png_ptr->zstream.next_in = NULL;
406 png_ptr->zstream.avail_in = 0;
407 png_ptr->zstream.next_out = NULL;
408 png_ptr->zstream.avail_out = 0;
409
410 /* Now initialize if required, setting the new parameters, otherwise just
411 * to a simple reset to the previous parameters.
412 */
413 if (png_ptr->flags & PNG_FLAG_ZSTREAM_INITIALIZED)
414 ret = deflateReset(&png_ptr->zstream);
415
416 else
417 {
418 ret = deflateInit2(&png_ptr->zstream, level, method, windowBits,
419 memLevel, strategy);
420
421 if (ret == Z_OK)
422 png_ptr->flags |= PNG_FLAG_ZSTREAM_INITIALIZED;
423 }
424
425 /* The return code is from either deflateReset or deflateInit2; they have
426 * pretty much the same set of error codes.
427 */
428 if (ret == Z_OK)
429 png_ptr->zowner = owner;
430
431 else
432 png_zstream_error(png_ptr, ret);
433
434 return ret;
435 }
436 }
437
438 /* Clean up (or trim) a linked list of compression buffers. */
439 void /* PRIVATE */
440 png_free_buffer_list(png_structrp png_ptr, png_compression_bufferp *listp)
441 {
442 png_compression_bufferp list = *listp;
443
444 if (list != NULL)
445 {
446 *listp = NULL;
447
448 do
449 {
450 png_compression_bufferp next = list->next;
451
452 png_free(png_ptr, list);
453 list = next;
454 }
455 while (list != NULL);
456 }
457 }
458
459 #ifdef PNG_WRITE_COMPRESSED_TEXT_SUPPORTED
460 /* This pair of functions encapsulates the operation of (a) compressing a 158 /* This pair of functions encapsulates the operation of (a) compressing a
461 * text string, and (b) issuing it later as a series of chunk data writes. 159 * text string, and (b) issuing it later as a series of chunk data writes.
462 * The compression_state structure is shared context for these functions 160 * The compression_state structure is shared context for these functions
463 * set up by the caller to allow access to the relevant local variables. 161 * set up by the caller in order to make the whole mess thread-safe.
464 *
465 * compression_buffer (new in 1.6.0) is just a linked list of zbuffer_size
466 * temporary buffers. From 1.6.0 it is retained in png_struct so that it will
467 * be correctly freed in the event of a write error (previous implementations
468 * just leaked memory.)
469 */ 162 */
163
470 typedef struct 164 typedef struct
471 { 165 {
472 png_const_bytep input; /* The uncompressed input data */ 166 char *input; /* The uncompressed input data */
473 png_alloc_size_t input_len; /* Its length */ 167 int input_len; /* Its length */
474 png_uint_32 output_len; /* Final compressed length */ 168 int num_output_ptr; /* Number of output pointers used */
475 png_byte output[1024]; /* First block of output */ 169 int max_output_ptr; /* Size of output_ptr */
170 png_charpp output_ptr; /* Array of pointers to output */
476 } compression_state; 171 } compression_state;
477 172
478 static void 173 /* Compress given text into storage in the png_ptr structure */
479 png_text_compress_init(compression_state *comp, png_const_bytep input, 174 static int /* PRIVATE */
480 png_alloc_size_t input_len) 175 png_text_compress(png_structp png_ptr,
481 { 176 png_charp text, png_size_t text_len, int compression,
482 comp->input = input; 177 compression_state *comp)
483 comp->input_len = input_len;
484 comp->output_len = 0;
485 }
486
487 /* Compress the data in the compression state input */
488 static int
489 png_text_compress(png_structrp png_ptr, png_uint_32 chunk_name,
490 compression_state *comp, png_uint_32 prefix_len)
491 { 178 {
492 int ret; 179 int ret;
493 180
494 /* To find the length of the output it is necessary to first compress the 181 comp->num_output_ptr = 0;
495 * input, the result is buffered rather than using the two-pass algorithm 182 comp->max_output_ptr = 0;
496 * that is used on the inflate side; deflate is assumed to be slower and a 183 comp->output_ptr = NULL;
497 * PNG writer is assumed to have more memory available than a PNG reader. 184 comp->input = NULL;
185 comp->input_len = 0;
186
187 /* We may just want to pass the text right through */
188 if (compression == PNG_TEXT_COMPRESSION_NONE)
189 {
190 comp->input = text;
191 comp->input_len = text_len;
192 return((int)text_len);
193 }
194
195 if (compression >= PNG_TEXT_COMPRESSION_LAST)
196 {
197 #if defined(PNG_STDIO_SUPPORTED) && !defined(_WIN32_WCE)
198 char msg[50];
199 png_snprintf(msg, 50, "Unknown compression type %d", compression);
200 png_warning(png_ptr, msg);
201 #else
202 png_warning(png_ptr, "Unknown compression type");
203 #endif
204 }
205
206 /* We can't write the chunk until we find out how much data we have,
207 * which means we need to run the compressor first and save the
208 * output. This shouldn't be a problem, as the vast majority of
209 * comments should be reasonable, but we will set up an array of
210 * malloc'd pointers to be sure.
498 * 211 *
499 * IMPLEMENTATION NOTE: the zlib API deflateBound() can be used to find an 212 * If we knew the application was well behaved, we could simplify this
500 * upper limit on the output size, but it is always bigger than the input 213 * greatly by assuming we can always malloc an output buffer large
501 * size so it is likely to be more efficient to use this linked-list 214 * enough to hold the compressed text ((1001 * text_len / 1000) + 12)
502 * approach. 215 * and malloc this directly. The only time this would be a bad idea is
216 * if we can't malloc more than 64K and we have 64K of random input
217 * data, or if the input string is incredibly large (although this
218 * wouldn't cause a failure, just a slowdown due to swapping).
503 */ 219 */
504 ret = png_deflate_claim(png_ptr, chunk_name, comp->input_len); 220
505 221 /* Set up the compression buffers */
506 if (ret != Z_OK) 222 png_ptr->zstream.avail_in = (uInt)text_len;
507 return ret; 223 png_ptr->zstream.next_in = (Bytef *)text;
508 224 png_ptr->zstream.avail_out = (uInt)png_ptr->zbuf_size;
509 /* Set up the compression buffers, we need a loop here to avoid overflowing a 225 png_ptr->zstream.next_out = (Bytef *)png_ptr->zbuf;
510 * uInt. Use ZLIB_IO_MAX to limit the input. The output is always limited 226
511 * by the output buffer size, so there is no need to check that. Since this 227 /* This is the same compression loop as in png_write_row() */
512 * is ANSI-C we know that an 'int', hence a uInt, is always at least 16 bits 228 do
513 * in size. 229 {
514 */ 230 /* Compress the data */
515 { 231 ret = deflate(&png_ptr->zstream, Z_NO_FLUSH);
516 png_compression_bufferp *end = &png_ptr->zbuffer_list; 232 if (ret != Z_OK)
517 png_alloc_size_t input_len = comp->input_len; /* may be zero! */ 233 {
518 png_uint_32 output_len; 234 /* Error */
519 235 if (png_ptr->zstream.msg != NULL)
520 /* zlib updates these for us: */ 236 png_error(png_ptr, png_ptr->zstream.msg);
521 png_ptr->zstream.next_in = PNGZ_INPUT_CAST(comp->input); 237 else
522 png_ptr->zstream.avail_in = 0; /* Set below */ 238 png_error(png_ptr, "zlib error");
523 png_ptr->zstream.next_out = comp->output; 239 }
524 png_ptr->zstream.avail_out = (sizeof comp->output); 240 /* Check to see if we need more room */
525 241 if (!(png_ptr->zstream.avail_out))
526 output_len = png_ptr->zstream.avail_out; 242 {
527 243 /* Make sure the output array has room */
528 do 244 if (comp->num_output_ptr >= comp->max_output_ptr)
529 {
530 uInt avail_in = ZLIB_IO_MAX;
531
532 if (avail_in > input_len)
533 avail_in = (uInt)input_len;
534
535 input_len -= avail_in;
536
537 png_ptr->zstream.avail_in = avail_in;
538
539 if (png_ptr->zstream.avail_out == 0)
540 { 245 {
541 png_compression_buffer *next; 246 int old_max;
542 247
543 /* Chunk data is limited to 2^31 bytes in length, so the prefix 248 old_max = comp->max_output_ptr;
544 * length must be counted here. 249 comp->max_output_ptr = comp->num_output_ptr + 4;
545 */ 250 if (comp->output_ptr != NULL)
546 if (output_len + prefix_len > PNG_UINT_31_MAX)
547 { 251 {
548 ret = Z_MEM_ERROR; 252 png_charpp old_ptr;
549 break; 253
254 old_ptr = comp->output_ptr;
255 comp->output_ptr = (png_charpp)png_malloc(png_ptr,
256 (png_uint_32)
257 (comp->max_output_ptr * png_sizeof(png_charpp)));
258 png_memcpy(comp->output_ptr, old_ptr, old_max
259 * png_sizeof(png_charp));
260 png_free(png_ptr, old_ptr);
550 } 261 }
551 262 else
552 /* Need a new (malloc'ed) buffer, but there may be one present 263 comp->output_ptr = (png_charpp)png_malloc(png_ptr,
553 * already. 264 (png_uint_32)
554 */ 265 (comp->max_output_ptr * png_sizeof(png_charp)));
555 next = *end; 266 }
556 if (next == NULL) 267
268 /* Save the data */
269 comp->output_ptr[comp->num_output_ptr] =
270 (png_charp)png_malloc(png_ptr,
271 (png_uint_32)png_ptr->zbuf_size);
272 png_memcpy(comp->output_ptr[comp->num_output_ptr], png_ptr->zbuf,
273 png_ptr->zbuf_size);
274 comp->num_output_ptr++;
275
276 /* and reset the buffer */
277 png_ptr->zstream.avail_out = (uInt)png_ptr->zbuf_size;
278 png_ptr->zstream.next_out = png_ptr->zbuf;
279 }
280 /* Continue until we don't have any more to compress */
281 } while (png_ptr->zstream.avail_in);
282
283 /* Finish the compression */
284 do
285 {
286 /* Tell zlib we are finished */
287 ret = deflate(&png_ptr->zstream, Z_FINISH);
288
289 if (ret == Z_OK)
290 {
291 /* Check to see if we need more room */
292 if (!(png_ptr->zstream.avail_out))
293 {
294 /* Check to make sure our output array has room */
295 if (comp->num_output_ptr >= comp->max_output_ptr)
557 { 296 {
558 next = png_voidcast(png_compression_bufferp, png_malloc_base 297 int old_max;
559 (png_ptr, PNG_COMPRESSION_BUFFER_SIZE(png_ptr))); 298
560 299 old_max = comp->max_output_ptr;
561 if (next == NULL) 300 comp->max_output_ptr = comp->num_output_ptr + 4;
301 if (comp->output_ptr != NULL)
562 { 302 {
563 ret = Z_MEM_ERROR; 303 png_charpp old_ptr;
564 break; 304
305 old_ptr = comp->output_ptr;
306 /* This could be optimized to realloc() */
307 comp->output_ptr = (png_charpp)png_malloc(png_ptr,
308 (png_uint_32)(comp->max_output_ptr *
309 png_sizeof(png_charp)));
310 png_memcpy(comp->output_ptr, old_ptr,
311 old_max * png_sizeof(png_charp));
312 png_free(png_ptr, old_ptr);
565 } 313 }
566 314 else
567 /* Link in this buffer (so that it will be freed later) */ 315 comp->output_ptr = (png_charpp)png_malloc(png_ptr,
568 next->next = NULL; 316 (png_uint_32)(comp->max_output_ptr *
569 *end = next; 317 png_sizeof(png_charp)));
570 } 318 }
571 319
572 png_ptr->zstream.next_out = next->output; 320 /* Save the data */
573 png_ptr->zstream.avail_out = png_ptr->zbuffer_size; 321 comp->output_ptr[comp->num_output_ptr] =
574 output_len += png_ptr->zstream.avail_out; 322 (png_charp)png_malloc(png_ptr,
575 323 (png_uint_32)png_ptr->zbuf_size);
576 /* Move 'end' to the next buffer pointer. */ 324 png_memcpy(comp->output_ptr[comp->num_output_ptr], png_ptr->zbuf,
577 end = &next->next; 325 png_ptr->zbuf_size);
326 comp->num_output_ptr++;
327
328 /* and reset the buffer pointers */
329 png_ptr->zstream.avail_out = (uInt)png_ptr->zbuf_size;
330 png_ptr->zstream.next_out = png_ptr->zbuf;
578 } 331 }
579 332 }
580 /* Compress the data */ 333 else if (ret != Z_STREAM_END)
581 ret = deflate(&png_ptr->zstream, 334 {
582 input_len > 0 ? Z_NO_FLUSH : Z_FINISH); 335 /* We got an error */
583 336 if (png_ptr->zstream.msg != NULL)
584 /* Claw back input data that was not consumed (because avail_in is 337 png_error(png_ptr, png_ptr->zstream.msg);
585 * reset above every time round the loop). 338 else
586 */ 339 png_error(png_ptr, "zlib error");
587 input_len += png_ptr->zstream.avail_in; 340 }
588 png_ptr->zstream.avail_in = 0; /* safety */ 341 } while (ret != Z_STREAM_END);
589 } 342
590 while (ret == Z_OK); 343 /* Text length is number of buffers plus last buffer */
591 344 text_len = png_ptr->zbuf_size * comp->num_output_ptr;
592 /* There may be some space left in the last output buffer, this needs to 345 if (png_ptr->zstream.avail_out < png_ptr->zbuf_size)
593 * be subtracted from output_len. 346 text_len += png_ptr->zbuf_size - (png_size_t)png_ptr->zstream.avail_out;
594 */ 347
595 output_len -= png_ptr->zstream.avail_out; 348 return((int)text_len);
596 png_ptr->zstream.avail_out = 0; /* safety */
597 comp->output_len = output_len;
598
599 /* Now double check the output length, put in a custom message if it is
600 * too long. Otherwise ensure the z_stream::msg pointer is set to
601 * something.
602 */
603 if (output_len + prefix_len >= PNG_UINT_31_MAX)
604 {
605 png_ptr->zstream.msg = PNGZ_MSG_CAST("compressed data too long");
606 ret = Z_MEM_ERROR;
607 }
608
609 else
610 png_zstream_error(png_ptr, ret);
611
612 /* Reset zlib for another zTXt/iTXt or image data */
613 png_ptr->zowner = 0;
614
615 /* The only success case is Z_STREAM_END, input_len must be 0, if not this
616 * is an internal error.
617 */
618 if (ret == Z_STREAM_END && input_len == 0)
619 {
620 /* Fix up the deflate header, if required */
621 optimize_cmf(comp->output, comp->input_len);
622
623 /* But Z_OK is returned, not Z_STREAM_END; this allows the claim
624 * function above to return Z_STREAM_END on an error (though it never
625 * does in the current versions of zlib.)
626 */
627 return Z_OK;
628 }
629
630 else
631 return ret;
632 }
633 } 349 }
634 350
635 /* Ship the compressed text out via chunk writes */ 351 /* Ship the compressed text out via chunk writes */
636 static void 352 static void /* PRIVATE */
637 png_write_compressed_data_out(png_structrp png_ptr, compression_state *comp) 353 png_write_compressed_data_out(png_structp png_ptr, compression_state *comp)
638 { 354 {
639 png_uint_32 output_len = comp->output_len; 355 int i;
640 png_const_bytep output = comp->output; 356
641 png_uint_32 avail = (sizeof comp->output); 357 /* Handle the no-compression case */
642 png_compression_buffer *next = png_ptr->zbuffer_list; 358 if (comp->input)
643 359 {
644 for (;;) 360 png_write_chunk_data(png_ptr, (png_bytep)comp->input,
645 { 361 (png_size_t)comp->input_len);
646 if (avail > output_len) 362 return;
647 avail = output_len; 363 }
648 364
649 png_write_chunk_data(png_ptr, output, avail); 365 /* Write saved output buffers, if any */
650 366 for (i = 0; i < comp->num_output_ptr; i++)
651 output_len -= avail; 367 {
652 368 png_write_chunk_data(png_ptr, (png_bytep)comp->output_ptr[i],
653 if (output_len == 0 || next == NULL) 369 (png_size_t)png_ptr->zbuf_size);
654 break; 370 png_free(png_ptr, comp->output_ptr[i]);
655 371 comp->output_ptr[i]=NULL;
656 avail = png_ptr->zbuffer_size; 372 }
657 output = next->output; 373 if (comp->max_output_ptr != 0)
658 next = next->next; 374 png_free(png_ptr, comp->output_ptr);
659 } 375 comp->output_ptr=NULL;
660 376 /* Write anything left in zbuf */
661 /* This is an internal error; 'next' must have been NULL! */ 377 if (png_ptr->zstream.avail_out < (png_uint_32)png_ptr->zbuf_size)
662 if (output_len > 0) 378 png_write_chunk_data(png_ptr, png_ptr->zbuf,
663 png_error(png_ptr, "error writing ancillary chunked compressed data"); 379 (png_size_t)(png_ptr->zbuf_size - png_ptr->zstream.avail_out));
664 } 380
665 #endif /* PNG_WRITE_COMPRESSED_TEXT_SUPPORTED */ 381 /* Reset zlib for another zTXt/iTXt or image data */
666 382 deflateReset(&png_ptr->zstream);
667 #if defined(PNG_WRITE_TEXT_SUPPORTED) || defined(PNG_WRITE_pCAL_SUPPORTED) || \ 383 png_ptr->zstream.data_type = Z_BINARY;
668 defined(PNG_WRITE_iCCP_SUPPORTED) || defined(PNG_WRITE_sPLT_SUPPORTED)
669 /* Check that the tEXt or zTXt keyword is valid per PNG 1.0 specification,
670 * and if invalid, correct the keyword rather than discarding the entire
671 * chunk. The PNG 1.0 specification requires keywords 1-79 characters in
672 * length, forbids leading or trailing whitespace, multiple internal spaces,
673 * and the non-break space (0x80) from ISO 8859-1. Returns keyword length.
674 *
675 * The 'new_key' buffer must be 80 characters in size (for the keyword plus a
676 * trailing '\0'). If this routine returns 0 then there was no keyword, or a
677 * valid one could not be generated, and the caller must png_error.
678 */
679 static png_uint_32
680 png_check_keyword(png_structrp png_ptr, png_const_charp key, png_bytep new_key)
681 {
682 png_const_charp orig_key = key;
683 png_uint_32 key_len = 0;
684 int bad_character = 0;
685 int space = 1;
686
687 png_debug(1, "in png_check_keyword");
688
689 if (key == NULL)
690 {
691 *new_key = 0;
692 return 0;
693 }
694
695 while (*key && key_len < 79)
696 {
697 png_byte ch = (png_byte)(0xff & *key++);
698
699 if ((ch > 32 && ch <= 126) || (ch >= 161 /*&& ch <= 255*/))
700 *new_key++ = ch, ++key_len, space = 0;
701
702 else if (!space)
703 {
704 /* A space or an invalid character when one wasn't seen immediately
705 * before; output just a space.
706 */
707 *new_key++ = 32, ++key_len, space = 1;
708
709 /* If the character was not a space then it is invalid. */
710 if (ch != 32)
711 bad_character = ch;
712 }
713
714 else if (!bad_character)
715 bad_character = ch; /* just skip it, record the first error */
716 }
717
718 if (key_len > 0 && space) /* trailing space */
719 {
720 --key_len, --new_key;
721 if (!bad_character)
722 bad_character = 32;
723 }
724
725 /* Terminate the keyword */
726 *new_key = 0;
727
728 if (key_len == 0)
729 return 0;
730
731 /* Try to only output one warning per keyword: */
732 if (*key) /* keyword too long */
733 png_warning(png_ptr, "keyword truncated");
734
735 else if (bad_character)
736 {
737 PNG_WARNING_PARAMETERS(p)
738
739 png_warning_parameter(p, 1, orig_key);
740 png_warning_parameter_signed(p, 2, PNG_NUMBER_FORMAT_02x, bad_character);
741
742 png_formatted_warning(png_ptr, p, "keyword \"@1\": bad character '0x@2'");
743 }
744
745 return key_len;
746 } 384 }
747 #endif 385 #endif
748 386
749 /* Write the IHDR chunk, and update the png_struct with the necessary 387 /* Write the IHDR chunk, and update the png_struct with the necessary
750 * information. Note that the rest of this code depends upon this 388 * information. Note that the rest of this code depends upon this
751 * information being correct. 389 * information being correct.
752 */ 390 */
753 void /* PRIVATE */ 391 void /* PRIVATE */
754 png_write_IHDR(png_structrp png_ptr, png_uint_32 width, png_uint_32 height, 392 png_write_IHDR(png_structp png_ptr, png_uint_32 width, png_uint_32 height,
755 int bit_depth, int color_type, int compression_type, int filter_type, 393 int bit_depth, int color_type, int compression_type, int filter_type,
756 int interlace_type) 394 int interlace_type)
757 { 395 {
396 #ifdef PNG_USE_LOCAL_ARRAYS
397 PNG_IHDR;
398 #endif
399 int ret;
400
758 png_byte buf[13]; /* Buffer to store the IHDR info */ 401 png_byte buf[13]; /* Buffer to store the IHDR info */
759 402
760 png_debug(1, "in png_write_IHDR"); 403 png_debug(1, "in png_write_IHDR");
761 404
762 /* Check that we have valid input data from the application info */ 405 /* Check that we have valid input data from the application info */
763 switch (color_type) 406 switch (color_type)
764 { 407 {
765 case PNG_COLOR_TYPE_GRAY: 408 case PNG_COLOR_TYPE_GRAY:
766 switch (bit_depth) 409 switch (bit_depth)
767 { 410 {
768 case 1: 411 case 1:
769 case 2: 412 case 2:
770 case 4: 413 case 4:
771 case 8: 414 case 8:
772 #ifdef PNG_WRITE_16BIT_SUPPORTED 415 case 16: png_ptr->channels = 1; break;
773 case 16: 416 default: png_error(png_ptr,
774 #endif 417 "Invalid bit depth for grayscale image");
775 png_ptr->channels = 1; break;
776
777 default:
778 png_error(png_ptr,
779 "Invalid bit depth for grayscale image");
780 } 418 }
781 break; 419 break;
782
783 case PNG_COLOR_TYPE_RGB: 420 case PNG_COLOR_TYPE_RGB:
784 #ifdef PNG_WRITE_16BIT_SUPPORTED
785 if (bit_depth != 8 && bit_depth != 16) 421 if (bit_depth != 8 && bit_depth != 16)
786 #else
787 if (bit_depth != 8)
788 #endif
789 png_error(png_ptr, "Invalid bit depth for RGB image"); 422 png_error(png_ptr, "Invalid bit depth for RGB image");
790
791 png_ptr->channels = 3; 423 png_ptr->channels = 3;
792 break; 424 break;
793
794 case PNG_COLOR_TYPE_PALETTE: 425 case PNG_COLOR_TYPE_PALETTE:
795 switch (bit_depth) 426 switch (bit_depth)
796 { 427 {
797 case 1: 428 case 1:
798 case 2: 429 case 2:
799 case 4: 430 case 4:
800 case 8: 431 case 8: png_ptr->channels = 1; break;
801 png_ptr->channels = 1; 432 default: png_error(png_ptr, "Invalid bit depth for paletted image");
802 break;
803
804 default:
805 png_error(png_ptr, "Invalid bit depth for paletted image");
806 } 433 }
807 break; 434 break;
808
809 case PNG_COLOR_TYPE_GRAY_ALPHA: 435 case PNG_COLOR_TYPE_GRAY_ALPHA:
810 if (bit_depth != 8 && bit_depth != 16) 436 if (bit_depth != 8 && bit_depth != 16)
811 png_error(png_ptr, "Invalid bit depth for grayscale+alpha image"); 437 png_error(png_ptr, "Invalid bit depth for grayscale+alpha image");
812
813 png_ptr->channels = 2; 438 png_ptr->channels = 2;
814 break; 439 break;
815
816 case PNG_COLOR_TYPE_RGB_ALPHA: 440 case PNG_COLOR_TYPE_RGB_ALPHA:
817 #ifdef PNG_WRITE_16BIT_SUPPORTED
818 if (bit_depth != 8 && bit_depth != 16) 441 if (bit_depth != 8 && bit_depth != 16)
819 #else
820 if (bit_depth != 8)
821 #endif
822 png_error(png_ptr, "Invalid bit depth for RGBA image"); 442 png_error(png_ptr, "Invalid bit depth for RGBA image");
823
824 png_ptr->channels = 4; 443 png_ptr->channels = 4;
825 break; 444 break;
826
827 default: 445 default:
828 png_error(png_ptr, "Invalid image color type specified"); 446 png_error(png_ptr, "Invalid image color type specified");
829 } 447 }
830 448
831 if (compression_type != PNG_COMPRESSION_TYPE_BASE) 449 if (compression_type != PNG_COMPRESSION_TYPE_BASE)
832 { 450 {
833 png_warning(png_ptr, "Invalid compression type specified"); 451 png_warning(png_ptr, "Invalid compression type specified");
834 compression_type = PNG_COMPRESSION_TYPE_BASE; 452 compression_type = PNG_COMPRESSION_TYPE_BASE;
835 } 453 }
836 454
837 /* Write filter_method 64 (intrapixel differencing) only if 455 /* Write filter_method 64 (intrapixel differencing) only if
838 * 1. Libpng was compiled with PNG_MNG_FEATURES_SUPPORTED and 456 * 1. Libpng was compiled with PNG_MNG_FEATURES_SUPPORTED and
839 * 2. Libpng did not write a PNG signature (this filter_method is only 457 * 2. Libpng did not write a PNG signature (this filter_method is only
840 * used in PNG datastreams that are embedded in MNG datastreams) and 458 * used in PNG datastreams that are embedded in MNG datastreams) and
841 * 3. The application called png_permit_mng_features with a mask that 459 * 3. The application called png_permit_mng_features with a mask that
842 * included PNG_FLAG_MNG_FILTER_64 and 460 * included PNG_FLAG_MNG_FILTER_64 and
843 * 4. The filter_method is 64 and 461 * 4. The filter_method is 64 and
844 * 5. The color_type is RGB or RGBA 462 * 5. The color_type is RGB or RGBA
845 */ 463 */
846 if ( 464 if (
847 #ifdef PNG_MNG_FEATURES_SUPPORTED 465 #ifdef PNG_MNG_FEATURES_SUPPORTED
848 !((png_ptr->mng_features_permitted & PNG_FLAG_MNG_FILTER_64) && 466 !((png_ptr->mng_features_permitted & PNG_FLAG_MNG_FILTER_64) &&
849 ((png_ptr->mode&PNG_HAVE_PNG_SIGNATURE) == 0) && 467 ((png_ptr->mode&PNG_HAVE_PNG_SIGNATURE) == 0) &&
850 (color_type == PNG_COLOR_TYPE_RGB || 468 (color_type == PNG_COLOR_TYPE_RGB ||
851 color_type == PNG_COLOR_TYPE_RGB_ALPHA) && 469 color_type == PNG_COLOR_TYPE_RGB_ALPHA) &&
852 (filter_type == PNG_INTRAPIXEL_DIFFERENCING)) && 470 (filter_type == PNG_INTRAPIXEL_DIFFERENCING)) &&
853 #endif 471 #endif
854 filter_type != PNG_FILTER_TYPE_BASE) 472 filter_type != PNG_FILTER_TYPE_BASE)
855 { 473 {
856 png_warning(png_ptr, "Invalid filter type specified"); 474 png_warning(png_ptr, "Invalid filter type specified");
857 filter_type = PNG_FILTER_TYPE_BASE; 475 filter_type = PNG_FILTER_TYPE_BASE;
858 } 476 }
859 477
860 #ifdef PNG_WRITE_INTERLACING_SUPPORTED 478 #ifdef PNG_WRITE_INTERLACING_SUPPORTED
861 if (interlace_type != PNG_INTERLACE_NONE && 479 if (interlace_type != PNG_INTERLACE_NONE &&
862 interlace_type != PNG_INTERLACE_ADAM7) 480 interlace_type != PNG_INTERLACE_ADAM7)
863 { 481 {
864 png_warning(png_ptr, "Invalid interlace type specified"); 482 png_warning(png_ptr, "Invalid interlace type specified");
865 interlace_type = PNG_INTERLACE_ADAM7; 483 interlace_type = PNG_INTERLACE_ADAM7;
866 } 484 }
867 #else 485 #else
868 interlace_type=PNG_INTERLACE_NONE; 486 interlace_type=PNG_INTERLACE_NONE;
869 #endif 487 #endif
870 488
871 /* Save the relevent information */ 489 /* Save the relevent information */
872 png_ptr->bit_depth = (png_byte)bit_depth; 490 png_ptr->bit_depth = (png_byte)bit_depth;
(...skipping 16 matching lines...) Expand all
889 /* Pack the header information into the buffer */ 507 /* Pack the header information into the buffer */
890 png_save_uint_32(buf, width); 508 png_save_uint_32(buf, width);
891 png_save_uint_32(buf + 4, height); 509 png_save_uint_32(buf + 4, height);
892 buf[8] = (png_byte)bit_depth; 510 buf[8] = (png_byte)bit_depth;
893 buf[9] = (png_byte)color_type; 511 buf[9] = (png_byte)color_type;
894 buf[10] = (png_byte)compression_type; 512 buf[10] = (png_byte)compression_type;
895 buf[11] = (png_byte)filter_type; 513 buf[11] = (png_byte)filter_type;
896 buf[12] = (png_byte)interlace_type; 514 buf[12] = (png_byte)interlace_type;
897 515
898 /* Write the chunk */ 516 /* Write the chunk */
899 png_write_complete_chunk(png_ptr, png_IHDR, buf, (png_size_t)13); 517 png_write_chunk(png_ptr, (png_bytep)png_IHDR, buf, (png_size_t)13);
900 518
519 /* Initialize zlib with PNG info */
520 png_ptr->zstream.zalloc = png_zalloc;
521 png_ptr->zstream.zfree = png_zfree;
522 png_ptr->zstream.opaque = (voidpf)png_ptr;
901 if (!(png_ptr->do_filter)) 523 if (!(png_ptr->do_filter))
902 { 524 {
903 if (png_ptr->color_type == PNG_COLOR_TYPE_PALETTE || 525 if (png_ptr->color_type == PNG_COLOR_TYPE_PALETTE ||
904 png_ptr->bit_depth < 8) 526 png_ptr->bit_depth < 8)
905 png_ptr->do_filter = PNG_FILTER_NONE; 527 png_ptr->do_filter = PNG_FILTER_NONE;
906
907 else 528 else
908 png_ptr->do_filter = PNG_ALL_FILTERS; 529 png_ptr->do_filter = PNG_ALL_FILTERS;
909 } 530 }
531 if (!(png_ptr->flags & PNG_FLAG_ZLIB_CUSTOM_STRATEGY))
532 {
533 if (png_ptr->do_filter != PNG_FILTER_NONE)
534 png_ptr->zlib_strategy = Z_FILTERED;
535 else
536 png_ptr->zlib_strategy = Z_DEFAULT_STRATEGY;
537 }
538 if (!(png_ptr->flags & PNG_FLAG_ZLIB_CUSTOM_LEVEL))
539 png_ptr->zlib_level = Z_DEFAULT_COMPRESSION;
540 if (!(png_ptr->flags & PNG_FLAG_ZLIB_CUSTOM_MEM_LEVEL))
541 png_ptr->zlib_mem_level = 8;
542 if (!(png_ptr->flags & PNG_FLAG_ZLIB_CUSTOM_WINDOW_BITS))
543 png_ptr->zlib_window_bits = 15;
544 if (!(png_ptr->flags & PNG_FLAG_ZLIB_CUSTOM_METHOD))
545 png_ptr->zlib_method = 8;
546 ret = deflateInit2(&png_ptr->zstream, png_ptr->zlib_level,
547 png_ptr->zlib_method, png_ptr->zlib_window_bits,
548 png_ptr->zlib_mem_level, png_ptr->zlib_strategy);
549 if (ret != Z_OK)
550 {
551 if (ret == Z_VERSION_ERROR) png_error(png_ptr,
552 "zlib failed to initialize compressor -- version error");
553 if (ret == Z_STREAM_ERROR) png_error(png_ptr,
554 "zlib failed to initialize compressor -- stream error");
555 if (ret == Z_MEM_ERROR) png_error(png_ptr,
556 "zlib failed to initialize compressor -- mem error");
557 png_error(png_ptr, "zlib failed to initialize compressor");
558 }
559 png_ptr->zstream.next_out = png_ptr->zbuf;
560 png_ptr->zstream.avail_out = (uInt)png_ptr->zbuf_size;
561 /* libpng is not interested in zstream.data_type */
562 /* Set it to a predefined value, to avoid its evaluation inside zlib */
563 png_ptr->zstream.data_type = Z_BINARY;
910 564
911 png_ptr->mode = PNG_HAVE_IHDR; /* not READY_FOR_ZTXT */ 565 png_ptr->mode = PNG_HAVE_IHDR;
912 } 566 }
913 567
914 /* Write the palette. We are careful not to trust png_color to be in the 568 /* Write the palette. We are careful not to trust png_color to be in the
915 * correct order for PNG, so people can redefine it to any convenient 569 * correct order for PNG, so people can redefine it to any convenient
916 * structure. 570 * structure.
917 */ 571 */
918 void /* PRIVATE */ 572 void /* PRIVATE */
919 png_write_PLTE(png_structrp png_ptr, png_const_colorp palette, 573 png_write_PLTE(png_structp png_ptr, png_colorp palette, png_uint_32 num_pal)
920 png_uint_32 num_pal)
921 { 574 {
575 #ifdef PNG_USE_LOCAL_ARRAYS
576 PNG_PLTE;
577 #endif
922 png_uint_32 i; 578 png_uint_32 i;
923 png_const_colorp pal_ptr; 579 png_colorp pal_ptr;
924 png_byte buf[3]; 580 png_byte buf[3];
925 581
926 png_debug(1, "in png_write_PLTE"); 582 png_debug(1, "in png_write_PLTE");
927 583
928 if (( 584 if ((
929 #ifdef PNG_MNG_FEATURES_SUPPORTED 585 #ifdef PNG_MNG_FEATURES_SUPPORTED
930 !(png_ptr->mng_features_permitted & PNG_FLAG_MNG_EMPTY_PLTE) && 586 !(png_ptr->mng_features_permitted & PNG_FLAG_MNG_EMPTY_PLTE) &&
931 #endif 587 #endif
932 num_pal == 0) || num_pal > 256) 588 num_pal == 0) || num_pal > 256)
933 { 589 {
934 if (png_ptr->color_type == PNG_COLOR_TYPE_PALETTE) 590 if (png_ptr->color_type == PNG_COLOR_TYPE_PALETTE)
935 { 591 {
936 png_error(png_ptr, "Invalid number of colors in palette"); 592 png_error(png_ptr, "Invalid number of colors in palette");
937 } 593 }
938 594 else
939 else 595 {
940 { 596 png_warning(png_ptr, "Invalid number of colors in palette");
941 png_warning(png_ptr, "Invalid number of colors in palette"); 597 return;
942 return; 598 }
943 }
944 } 599 }
945 600
946 if (!(png_ptr->color_type&PNG_COLOR_MASK_COLOR)) 601 if (!(png_ptr->color_type&PNG_COLOR_MASK_COLOR))
947 { 602 {
948 png_warning(png_ptr, 603 png_warning(png_ptr,
949 "Ignoring request to write a PLTE chunk in grayscale PNG"); 604 "Ignoring request to write a PLTE chunk in grayscale PNG");
950
951 return; 605 return;
952 } 606 }
953 607
954 png_ptr->num_palette = (png_uint_16)num_pal; 608 png_ptr->num_palette = (png_uint_16)num_pal;
955 png_debug1(3, "num_palette = %d", png_ptr->num_palette); 609 png_debug1(3, "num_palette = %d", png_ptr->num_palette);
956 610
957 png_write_chunk_header(png_ptr, png_PLTE, (png_uint_32)(num_pal * 3)); 611 png_write_chunk_start(png_ptr, (png_bytep)png_PLTE,
612 (png_uint_32)(num_pal * 3));
958 #ifdef PNG_POINTER_INDEXING_SUPPORTED 613 #ifdef PNG_POINTER_INDEXING_SUPPORTED
959
960 for (i = 0, pal_ptr = palette; i < num_pal; i++, pal_ptr++) 614 for (i = 0, pal_ptr = palette; i < num_pal; i++, pal_ptr++)
961 { 615 {
962 buf[0] = pal_ptr->red; 616 buf[0] = pal_ptr->red;
963 buf[1] = pal_ptr->green; 617 buf[1] = pal_ptr->green;
964 buf[2] = pal_ptr->blue; 618 buf[2] = pal_ptr->blue;
965 png_write_chunk_data(png_ptr, buf, (png_size_t)3); 619 png_write_chunk_data(png_ptr, buf, (png_size_t)3);
966 } 620 }
967
968 #else 621 #else
969 /* This is a little slower but some buggy compilers need to do this 622 /* This is a little slower but some buggy compilers need to do this
970 * instead 623 * instead
971 */ 624 */
972 pal_ptr=palette; 625 pal_ptr=palette;
973
974 for (i = 0; i < num_pal; i++) 626 for (i = 0; i < num_pal; i++)
975 { 627 {
976 buf[0] = pal_ptr[i].red; 628 buf[0] = pal_ptr[i].red;
977 buf[1] = pal_ptr[i].green; 629 buf[1] = pal_ptr[i].green;
978 buf[2] = pal_ptr[i].blue; 630 buf[2] = pal_ptr[i].blue;
979 png_write_chunk_data(png_ptr, buf, (png_size_t)3); 631 png_write_chunk_data(png_ptr, buf, (png_size_t)3);
980 } 632 }
981
982 #endif 633 #endif
983 png_write_chunk_end(png_ptr); 634 png_write_chunk_end(png_ptr);
984 png_ptr->mode |= PNG_HAVE_PLTE; 635 png_ptr->mode |= PNG_HAVE_PLTE;
985 } 636 }
986 637
987 /* This is similar to png_text_compress, above, except that it does not require 638 /* Write an IDAT chunk */
988 * all of the data at once and, instead of buffering the compressed result, 639 void /* PRIVATE */
989 * writes it as IDAT chunks. Unlike png_text_compress it *can* png_error out 640 png_write_IDAT(png_structp png_ptr, png_bytep data, png_size_t length)
990 * because it calls the write interface. As a result it does its own error 641 {
991 * reporting and does not return an error code. In the event of error it will 642 #ifdef PNG_USE_LOCAL_ARRAYS
992 * just call png_error. The input data length may exceed 32-bits. The 'flush' 643 PNG_IDAT;
993 * parameter is exactly the same as that to deflate, with the following 644 #endif
994 * meanings: 645
995 * 646 png_debug(1, "in png_write_IDAT");
996 * Z_NO_FLUSH: normal incremental output of compressed data 647
997 * Z_SYNC_FLUSH: do a SYNC_FLUSH, used by png_write_flush 648 /* Optimize the CMF field in the zlib stream. */
998 * Z_FINISH: this is the end of the input, do a Z_FINISH and clean up 649 /* This hack of the zlib stream is compliant to the stream specification. */
999 * 650 if (!(png_ptr->mode & PNG_HAVE_IDAT) &&
1000 * The routine manages the acquire and release of the png_ptr->zstream by 651 png_ptr->compression_type == PNG_COMPRESSION_TYPE_BASE)
1001 * checking and (at the end) clearing png_ptr->zowner, it does some sanity 652 {
1002 * checks on the 'mode' flags while doing this. 653 unsigned int z_cmf = data[0]; /* zlib compression method and flags */
1003 */ 654 if ((z_cmf & 0x0f) == 8 && (z_cmf & 0xf0) <= 0x70)
1004 void /* PRIVATE */
1005 png_compress_IDAT(png_structrp png_ptr, png_const_bytep input,
1006 png_alloc_size_t input_len, int flush)
1007 {
1008 if (png_ptr->zowner != png_IDAT)
1009 {
1010 /* First time. Ensure we have a temporary buffer for compression and
1011 * trim the buffer list if it has more than one entry to free memory.
1012 * If 'WRITE_COMPRESSED_TEXT' is not set the list will never have been
1013 * created at this point, but the check here is quick and safe.
1014 */
1015 if (png_ptr->zbuffer_list == NULL)
1016 { 655 {
1017 png_ptr->zbuffer_list = png_voidcast(png_compression_bufferp, 656 /* Avoid memory underflows and multiplication overflows.
1018 png_malloc(png_ptr, PNG_COMPRESSION_BUFFER_SIZE(png_ptr))); 657 *
1019 png_ptr->zbuffer_list->next = NULL; 658 * The conditions below are practically always satisfied;
1020 } 659 * however, they still must be checked.
1021
1022 else
1023 png_free_buffer_list(png_ptr, &png_ptr->zbuffer_list->next);
1024
1025 /* It is a terminal error if we can't claim the zstream. */
1026 if (png_deflate_claim(png_ptr, png_IDAT, png_image_size(png_ptr)) != Z_OK)
1027 png_error(png_ptr, png_ptr->zstream.msg);
1028
1029 /* The output state is maintained in png_ptr->zstream, so it must be
1030 * initialized here after the claim.
1031 */
1032 png_ptr->zstream.next_out = png_ptr->zbuffer_list->output;
1033 png_ptr->zstream.avail_out = png_ptr->zbuffer_size;
1034 }
1035
1036 /* Now loop reading and writing until all the input is consumed or an error
1037 * terminates the operation. The _out values are maintained across calls to
1038 * this function, but the input must be reset each time.
1039 */
1040 png_ptr->zstream.next_in = PNGZ_INPUT_CAST(input);
1041 png_ptr->zstream.avail_in = 0; /* set below */
1042 for (;;)
1043 {
1044 int ret;
1045
1046 /* INPUT: from the row data */
1047 uInt avail = ZLIB_IO_MAX;
1048
1049 if (avail > input_len)
1050 avail = (uInt)input_len; /* safe because of the check */
1051
1052 png_ptr->zstream.avail_in = avail;
1053 input_len -= avail;
1054
1055 ret = deflate(&png_ptr->zstream, input_len > 0 ? Z_NO_FLUSH : flush);
1056
1057 /* Include as-yet unconsumed input */
1058 input_len += png_ptr->zstream.avail_in;
1059 png_ptr->zstream.avail_in = 0;
1060
1061 /* OUTPUT: write complete IDAT chunks when avail_out drops to zero, note
1062 * that these two zstream fields are preserved across the calls, therefore
1063 * there is no need to set these up on entry to the loop.
1064 */
1065 if (png_ptr->zstream.avail_out == 0)
1066 {
1067 png_bytep data = png_ptr->zbuffer_list->output;
1068 uInt size = png_ptr->zbuffer_size;
1069
1070 /* Write an IDAT containing the data then reset the buffer. The
1071 * first IDAT may need deflate header optimization.
1072 */ 660 */
1073 # ifdef PNG_WRITE_OPTIMIZE_CMF_SUPPORTED 661 if (length >= 2 &&
1074 if (!(png_ptr->mode & PNG_HAVE_IDAT) && 662 png_ptr->height < 16384 && png_ptr->width < 16384)
1075 png_ptr->compression_type == PNG_COMPRESSION_TYPE_BASE)
1076 optimize_cmf(data, png_image_size(png_ptr));
1077 # endif
1078
1079 png_write_complete_chunk(png_ptr, png_IDAT, data, size);
1080 png_ptr->mode |= PNG_HAVE_IDAT;
1081
1082 png_ptr->zstream.next_out = data;
1083 png_ptr->zstream.avail_out = size;
1084
1085 /* For SYNC_FLUSH or FINISH it is essential to keep calling zlib with
1086 * the same flush parameter until it has finished output, for NO_FLUSH
1087 * it doesn't matter.
1088 */
1089 if (ret == Z_OK && flush != Z_NO_FLUSH)
1090 continue;
1091 }
1092
1093 /* The order of these checks doesn't matter much; it just effect which
1094 * possible error might be detected if multiple things go wrong at once.
1095 */
1096 if (ret == Z_OK) /* most likely return code! */
1097 {
1098 /* If all the input has been consumed then just return. If Z_FINISH
1099 * was used as the flush parameter something has gone wrong if we get
1100 * here.
1101 */
1102 if (input_len == 0)
1103 { 663 {
1104 if (flush == Z_FINISH) 664 png_uint_32 uncompressed_idat_size = png_ptr->height *
1105 png_error(png_ptr, "Z_OK on Z_FINISH with output space"); 665 ((png_ptr->width *
1106 666 png_ptr->channels * png_ptr->bit_depth + 15) >> 3);
1107 return; 667 unsigned int z_cinfo = z_cmf >> 4;
668 unsigned int half_z_window_size = 1 << (z_cinfo + 7);
669 while (uncompressed_idat_size <= half_z_window_size &&
670 half_z_window_size >= 256)
671 {
672 z_cinfo--;
673 half_z_window_size >>= 1;
674 }
675 z_cmf = (z_cmf & 0x0f) | (z_cinfo << 4);
676 if (data[0] != (png_byte)z_cmf)
677 {
678 data[0] = (png_byte)z_cmf;
679 data[1] &= 0xe0;
680 data[1] += (png_byte)(0x1f - ((z_cmf << 8) + data[1]) % 0x1f);
681 }
1108 } 682 }
1109 } 683 }
1110
1111 else if (ret == Z_STREAM_END && flush == Z_FINISH)
1112 {
1113 /* This is the end of the IDAT data; any pending output must be
1114 * flushed. For small PNG files we may still be at the beginning.
1115 */
1116 png_bytep data = png_ptr->zbuffer_list->output;
1117 uInt size = png_ptr->zbuffer_size - png_ptr->zstream.avail_out;
1118
1119 # ifdef PNG_WRITE_OPTIMIZE_CMF_SUPPORTED
1120 if (!(png_ptr->mode & PNG_HAVE_IDAT) &&
1121 png_ptr->compression_type == PNG_COMPRESSION_TYPE_BASE)
1122 optimize_cmf(data, png_image_size(png_ptr));
1123 # endif
1124
1125 png_write_complete_chunk(png_ptr, png_IDAT, data, size);
1126 png_ptr->zstream.avail_out = 0;
1127 png_ptr->zstream.next_out = NULL;
1128 png_ptr->mode |= PNG_HAVE_IDAT | PNG_AFTER_IDAT;
1129
1130 png_ptr->zowner = 0; /* Release the stream */
1131 return;
1132 }
1133
1134 else 684 else
1135 { 685 png_error(png_ptr,
1136 /* This is an error condition. */ 686 "Invalid zlib compression method or flags in IDAT");
1137 png_zstream_error(png_ptr, ret); 687 }
1138 png_error(png_ptr, png_ptr->zstream.msg); 688
1139 } 689 png_write_chunk(png_ptr, (png_bytep)png_IDAT, data, length);
1140 } 690 png_ptr->mode |= PNG_HAVE_IDAT;
1141 } 691 }
1142 692
1143 /* Write an IEND chunk */ 693 /* Write an IEND chunk */
1144 void /* PRIVATE */ 694 void /* PRIVATE */
1145 png_write_IEND(png_structrp png_ptr) 695 png_write_IEND(png_structp png_ptr)
1146 { 696 {
697 #ifdef PNG_USE_LOCAL_ARRAYS
698 PNG_IEND;
699 #endif
700
1147 png_debug(1, "in png_write_IEND"); 701 png_debug(1, "in png_write_IEND");
1148 702
1149 png_write_complete_chunk(png_ptr, png_IEND, NULL, (png_size_t)0); 703 png_write_chunk(png_ptr, (png_bytep)png_IEND, png_bytep_NULL,
704 (png_size_t)0);
1150 png_ptr->mode |= PNG_HAVE_IEND; 705 png_ptr->mode |= PNG_HAVE_IEND;
1151 } 706 }
1152 707
1153 #ifdef PNG_WRITE_gAMA_SUPPORTED 708 #ifdef PNG_WRITE_gAMA_SUPPORTED
1154 /* Write a gAMA chunk */ 709 /* Write a gAMA chunk */
1155 void /* PRIVATE */ 710 #ifdef PNG_FLOATING_POINT_SUPPORTED
1156 png_write_gAMA_fixed(png_structrp png_ptr, png_fixed_point file_gamma) 711 void /* PRIVATE */
1157 { 712 png_write_gAMA(png_structp png_ptr, double file_gamma)
713 {
714 #ifdef PNG_USE_LOCAL_ARRAYS
715 PNG_gAMA;
716 #endif
717 png_uint_32 igamma;
718 png_byte buf[4];
719
720 png_debug(1, "in png_write_gAMA");
721
722 /* file_gamma is saved in 1/100,000ths */
723 igamma = (png_uint_32)(file_gamma * 100000.0 + 0.5);
724 png_save_uint_32(buf, igamma);
725 png_write_chunk(png_ptr, (png_bytep)png_gAMA, buf, (png_size_t)4);
726 }
727 #endif
728 #ifdef PNG_FIXED_POINT_SUPPORTED
729 void /* PRIVATE */
730 png_write_gAMA_fixed(png_structp png_ptr, png_fixed_point file_gamma)
731 {
732 #ifdef PNG_USE_LOCAL_ARRAYS
733 PNG_gAMA;
734 #endif
1158 png_byte buf[4]; 735 png_byte buf[4];
1159 736
1160 png_debug(1, "in png_write_gAMA"); 737 png_debug(1, "in png_write_gAMA");
1161 738
1162 /* file_gamma is saved in 1/100,000ths */ 739 /* file_gamma is saved in 1/100,000ths */
1163 png_save_uint_32(buf, (png_uint_32)file_gamma); 740 png_save_uint_32(buf, (png_uint_32)file_gamma);
1164 png_write_complete_chunk(png_ptr, png_gAMA, buf, (png_size_t)4); 741 png_write_chunk(png_ptr, (png_bytep)png_gAMA, buf, (png_size_t)4);
1165 } 742 }
743 #endif
1166 #endif 744 #endif
1167 745
1168 #ifdef PNG_WRITE_sRGB_SUPPORTED 746 #ifdef PNG_WRITE_sRGB_SUPPORTED
1169 /* Write a sRGB chunk */ 747 /* Write a sRGB chunk */
1170 void /* PRIVATE */ 748 void /* PRIVATE */
1171 png_write_sRGB(png_structrp png_ptr, int srgb_intent) 749 png_write_sRGB(png_structp png_ptr, int srgb_intent)
1172 { 750 {
751 #ifdef PNG_USE_LOCAL_ARRAYS
752 PNG_sRGB;
753 #endif
1173 png_byte buf[1]; 754 png_byte buf[1];
1174 755
1175 png_debug(1, "in png_write_sRGB"); 756 png_debug(1, "in png_write_sRGB");
1176 757
1177 if (srgb_intent >= PNG_sRGB_INTENT_LAST) 758 if (srgb_intent >= PNG_sRGB_INTENT_LAST)
1178 png_warning(png_ptr, 759 png_warning(png_ptr,
1179 "Invalid sRGB rendering intent specified"); 760 "Invalid sRGB rendering intent specified");
1180
1181 buf[0]=(png_byte)srgb_intent; 761 buf[0]=(png_byte)srgb_intent;
1182 png_write_complete_chunk(png_ptr, png_sRGB, buf, (png_size_t)1); 762 png_write_chunk(png_ptr, (png_bytep)png_sRGB, buf, (png_size_t)1);
1183 } 763 }
1184 #endif 764 #endif
1185 765
1186 #ifdef PNG_WRITE_iCCP_SUPPORTED 766 #ifdef PNG_WRITE_iCCP_SUPPORTED
1187 /* Write an iCCP chunk */ 767 /* Write an iCCP chunk */
1188 void /* PRIVATE */ 768 void /* PRIVATE */
1189 png_write_iCCP(png_structrp png_ptr, png_const_charp name, 769 png_write_iCCP(png_structp png_ptr, png_charp name, int compression_type,
1190 png_const_bytep profile) 770 png_charp profile, int profile_len)
1191 { 771 {
1192 png_uint_32 name_len; 772 #ifdef PNG_USE_LOCAL_ARRAYS
1193 png_uint_32 profile_len; 773 PNG_iCCP;
1194 png_byte new_name[81]; /* 1 byte for the compression byte */ 774 #endif
775 png_size_t name_len;
776 png_charp new_name;
1195 compression_state comp; 777 compression_state comp;
778 int embedded_profile_len = 0;
1196 779
1197 png_debug(1, "in png_write_iCCP"); 780 png_debug(1, "in png_write_iCCP");
1198 781
1199 /* These are all internal problems: the profile should have been checked 782 comp.num_output_ptr = 0;
1200 * before when it was stored. 783 comp.max_output_ptr = 0;
1201 */ 784 comp.output_ptr = NULL;
785 comp.input = NULL;
786 comp.input_len = 0;
787
788 if ((name_len = png_check_keyword(png_ptr, name,
789 &new_name)) == 0)
790 return;
791
792 if (compression_type != PNG_COMPRESSION_TYPE_BASE)
793 png_warning(png_ptr, "Unknown compression type in iCCP chunk");
794
1202 if (profile == NULL) 795 if (profile == NULL)
1203 png_error(png_ptr, "No profile for iCCP chunk"); /* internal error */ 796 profile_len = 0;
1204 797
1205 profile_len = png_get_uint_32(profile); 798 if (profile_len > 3)
1206 799 embedded_profile_len =
1207 if (profile_len < 132) 800 ((*( (png_bytep)profile ))<<24) |
1208 png_error(png_ptr, "ICC profile too short"); 801 ((*( (png_bytep)profile + 1))<<16) |
1209 802 ((*( (png_bytep)profile + 2))<< 8) |
1210 if (profile_len & 0x03) 803 ((*( (png_bytep)profile + 3)) );
1211 png_error(png_ptr, "ICC profile length invalid (not a multiple of 4)"); 804
1212 805 if (embedded_profile_len < 0)
1213 { 806 {
1214 png_uint_32 embedded_profile_len = png_get_uint_32(profile); 807 png_warning(png_ptr,
1215 808 "Embedded profile length in iCCP chunk is negative");
1216 if (profile_len != embedded_profile_len) 809 png_free(png_ptr, new_name);
1217 png_error(png_ptr, "Profile length does not match profile"); 810 return;
1218 } 811 }
1219 812
1220 name_len = png_check_keyword(png_ptr, name, new_name); 813 if (profile_len < embedded_profile_len)
1221 814 {
1222 if (name_len == 0) 815 png_warning(png_ptr,
1223 png_error(png_ptr, "iCCP: invalid keyword"); 816 "Embedded profile length too large in iCCP chunk");
1224 817 png_free(png_ptr, new_name);
1225 new_name[++name_len] = PNG_COMPRESSION_TYPE_BASE; 818 return;
819 }
820
821 if (profile_len > embedded_profile_len)
822 {
823 png_warning(png_ptr,
824 "Truncating profile to actual length in iCCP chunk");
825 profile_len = embedded_profile_len;
826 }
827
828 if (profile_len)
829 profile_len = png_text_compress(png_ptr, profile,
830 (png_size_t)profile_len, PNG_COMPRESSION_TYPE_BASE, &comp);
1226 831
1227 /* Make sure we include the NULL after the name and the compression type */ 832 /* Make sure we include the NULL after the name and the compression type */
1228 ++name_len; 833 png_write_chunk_start(png_ptr, (png_bytep)png_iCCP,
1229 834 (png_uint_32)(name_len + profile_len + 2));
1230 png_text_compress_init(&comp, profile, profile_len); 835 new_name[name_len + 1] = 0x00;
1231 836 png_write_chunk_data(png_ptr, (png_bytep)new_name,
1232 /* Allow for keyword terminator and compression byte */ 837 (png_size_t)(name_len + 2));
1233 if (png_text_compress(png_ptr, png_iCCP, &comp, name_len) != Z_OK) 838
1234 png_error(png_ptr, png_ptr->zstream.msg); 839 if (profile_len)
1235 840 png_write_compressed_data_out(png_ptr, &comp);
1236 png_write_chunk_header(png_ptr, png_iCCP, name_len + comp.output_len);
1237
1238 png_write_chunk_data(png_ptr, new_name, name_len);
1239
1240 png_write_compressed_data_out(png_ptr, &comp);
1241 841
1242 png_write_chunk_end(png_ptr); 842 png_write_chunk_end(png_ptr);
843 png_free(png_ptr, new_name);
1243 } 844 }
1244 #endif 845 #endif
1245 846
1246 #ifdef PNG_WRITE_sPLT_SUPPORTED 847 #ifdef PNG_WRITE_sPLT_SUPPORTED
1247 /* Write a sPLT chunk */ 848 /* Write a sPLT chunk */
1248 void /* PRIVATE */ 849 void /* PRIVATE */
1249 png_write_sPLT(png_structrp png_ptr, png_const_sPLT_tp spalette) 850 png_write_sPLT(png_structp png_ptr, png_sPLT_tp spalette)
1250 { 851 {
1251 png_uint_32 name_len; 852 #ifdef PNG_USE_LOCAL_ARRAYS
1252 png_byte new_name[80]; 853 PNG_sPLT;
854 #endif
855 png_size_t name_len;
856 png_charp new_name;
1253 png_byte entrybuf[10]; 857 png_byte entrybuf[10];
1254 png_size_t entry_size = (spalette->depth == 8 ? 6 : 10); 858 int entry_size = (spalette->depth == 8 ? 6 : 10);
1255 png_size_t palette_size = entry_size * spalette->nentries; 859 int palette_size = entry_size * spalette->nentries;
1256 png_sPLT_entryp ep; 860 png_sPLT_entryp ep;
1257 #ifndef PNG_POINTER_INDEXING_SUPPORTED 861 #ifndef PNG_POINTER_INDEXING_SUPPORTED
1258 int i; 862 int i;
1259 #endif 863 #endif
1260 864
1261 png_debug(1, "in png_write_sPLT"); 865 png_debug(1, "in png_write_sPLT");
1262 866
1263 name_len = png_check_keyword(png_ptr, spalette->name, new_name); 867 if ((name_len = png_check_keyword(png_ptr,spalette->name, &new_name))==0)
1264 868 return;
1265 if (name_len == 0)
1266 png_error(png_ptr, "sPLT: invalid keyword");
1267 869
1268 /* Make sure we include the NULL after the name */ 870 /* Make sure we include the NULL after the name */
1269 png_write_chunk_header(png_ptr, png_sPLT, 871 png_write_chunk_start(png_ptr, (png_bytep)png_sPLT,
1270 (png_uint_32)(name_len + 2 + palette_size)); 872 (png_uint_32)(name_len + 2 + palette_size));
1271
1272 png_write_chunk_data(png_ptr, (png_bytep)new_name, 873 png_write_chunk_data(png_ptr, (png_bytep)new_name,
1273 (png_size_t)(name_len + 1)); 874 (png_size_t)(name_len + 1));
1274 875 png_write_chunk_data(png_ptr, (png_bytep)&spalette->depth, (png_size_t)1);
1275 png_write_chunk_data(png_ptr, &spalette->depth, (png_size_t)1);
1276 876
1277 /* Loop through each palette entry, writing appropriately */ 877 /* Loop through each palette entry, writing appropriately */
1278 #ifdef PNG_POINTER_INDEXING_SUPPORTED 878 #ifdef PNG_POINTER_INDEXING_SUPPORTED
1279 for (ep = spalette->entries; ep<spalette->entries + spalette->nentries; ep++) 879 for (ep = spalette->entries; ep<spalette->entries + spalette->nentries; ep++)
1280 { 880 {
1281 if (spalette->depth == 8) 881 if (spalette->depth == 8)
1282 { 882 {
1283 entrybuf[0] = (png_byte)ep->red; 883 entrybuf[0] = (png_byte)ep->red;
1284 entrybuf[1] = (png_byte)ep->green; 884 entrybuf[1] = (png_byte)ep->green;
1285 entrybuf[2] = (png_byte)ep->blue; 885 entrybuf[2] = (png_byte)ep->blue;
1286 entrybuf[3] = (png_byte)ep->alpha; 886 entrybuf[3] = (png_byte)ep->alpha;
1287 png_save_uint_16(entrybuf + 4, ep->frequency); 887 png_save_uint_16(entrybuf + 4, ep->frequency);
1288 } 888 }
1289
1290 else 889 else
1291 { 890 {
1292 png_save_uint_16(entrybuf + 0, ep->red); 891 png_save_uint_16(entrybuf + 0, ep->red);
1293 png_save_uint_16(entrybuf + 2, ep->green); 892 png_save_uint_16(entrybuf + 2, ep->green);
1294 png_save_uint_16(entrybuf + 4, ep->blue); 893 png_save_uint_16(entrybuf + 4, ep->blue);
1295 png_save_uint_16(entrybuf + 6, ep->alpha); 894 png_save_uint_16(entrybuf + 6, ep->alpha);
1296 png_save_uint_16(entrybuf + 8, ep->frequency); 895 png_save_uint_16(entrybuf + 8, ep->frequency);
1297 } 896 }
1298 897 png_write_chunk_data(png_ptr, entrybuf, (png_size_t)entry_size);
1299 png_write_chunk_data(png_ptr, entrybuf, entry_size);
1300 } 898 }
1301 #else 899 #else
1302 ep=spalette->entries; 900 ep=spalette->entries;
1303 for (i = 0; i>spalette->nentries; i++) 901 for (i=0; i>spalette->nentries; i++)
1304 { 902 {
1305 if (spalette->depth == 8) 903 if (spalette->depth == 8)
1306 { 904 {
1307 entrybuf[0] = (png_byte)ep[i].red; 905 entrybuf[0] = (png_byte)ep[i].red;
1308 entrybuf[1] = (png_byte)ep[i].green; 906 entrybuf[1] = (png_byte)ep[i].green;
1309 entrybuf[2] = (png_byte)ep[i].blue; 907 entrybuf[2] = (png_byte)ep[i].blue;
1310 entrybuf[3] = (png_byte)ep[i].alpha; 908 entrybuf[3] = (png_byte)ep[i].alpha;
1311 png_save_uint_16(entrybuf + 4, ep[i].frequency); 909 png_save_uint_16(entrybuf + 4, ep[i].frequency);
1312 } 910 }
1313
1314 else 911 else
1315 { 912 {
1316 png_save_uint_16(entrybuf + 0, ep[i].red); 913 png_save_uint_16(entrybuf + 0, ep[i].red);
1317 png_save_uint_16(entrybuf + 2, ep[i].green); 914 png_save_uint_16(entrybuf + 2, ep[i].green);
1318 png_save_uint_16(entrybuf + 4, ep[i].blue); 915 png_save_uint_16(entrybuf + 4, ep[i].blue);
1319 png_save_uint_16(entrybuf + 6, ep[i].alpha); 916 png_save_uint_16(entrybuf + 6, ep[i].alpha);
1320 png_save_uint_16(entrybuf + 8, ep[i].frequency); 917 png_save_uint_16(entrybuf + 8, ep[i].frequency);
1321 } 918 }
1322 919 png_write_chunk_data(png_ptr, entrybuf, (png_size_t)entry_size);
1323 png_write_chunk_data(png_ptr, entrybuf, entry_size);
1324 } 920 }
1325 #endif 921 #endif
1326 922
1327 png_write_chunk_end(png_ptr); 923 png_write_chunk_end(png_ptr);
924 png_free(png_ptr, new_name);
1328 } 925 }
1329 #endif 926 #endif
1330 927
1331 #ifdef PNG_WRITE_sBIT_SUPPORTED 928 #ifdef PNG_WRITE_sBIT_SUPPORTED
1332 /* Write the sBIT chunk */ 929 /* Write the sBIT chunk */
1333 void /* PRIVATE */ 930 void /* PRIVATE */
1334 png_write_sBIT(png_structrp png_ptr, png_const_color_8p sbit, int color_type) 931 png_write_sBIT(png_structp png_ptr, png_color_8p sbit, int color_type)
1335 { 932 {
933 #ifdef PNG_USE_LOCAL_ARRAYS
934 PNG_sBIT;
935 #endif
1336 png_byte buf[4]; 936 png_byte buf[4];
1337 png_size_t size; 937 png_size_t size;
1338 938
1339 png_debug(1, "in png_write_sBIT"); 939 png_debug(1, "in png_write_sBIT");
1340 940
1341 /* Make sure we don't depend upon the order of PNG_COLOR_8 */ 941 /* Make sure we don't depend upon the order of PNG_COLOR_8 */
1342 if (color_type & PNG_COLOR_MASK_COLOR) 942 if (color_type & PNG_COLOR_MASK_COLOR)
1343 { 943 {
1344 png_byte maxbits; 944 png_byte maxbits;
1345 945
1346 maxbits = (png_byte)(color_type==PNG_COLOR_TYPE_PALETTE ? 8 : 946 maxbits = (png_byte)(color_type==PNG_COLOR_TYPE_PALETTE ? 8 :
1347 png_ptr->usr_bit_depth); 947 png_ptr->usr_bit_depth);
1348
1349 if (sbit->red == 0 || sbit->red > maxbits || 948 if (sbit->red == 0 || sbit->red > maxbits ||
1350 sbit->green == 0 || sbit->green > maxbits || 949 sbit->green == 0 || sbit->green > maxbits ||
1351 sbit->blue == 0 || sbit->blue > maxbits) 950 sbit->blue == 0 || sbit->blue > maxbits)
1352 { 951 {
1353 png_warning(png_ptr, "Invalid sBIT depth specified"); 952 png_warning(png_ptr, "Invalid sBIT depth specified");
1354 return; 953 return;
1355 } 954 }
1356
1357 buf[0] = sbit->red; 955 buf[0] = sbit->red;
1358 buf[1] = sbit->green; 956 buf[1] = sbit->green;
1359 buf[2] = sbit->blue; 957 buf[2] = sbit->blue;
1360 size = 3; 958 size = 3;
1361 } 959 }
1362
1363 else 960 else
1364 { 961 {
1365 if (sbit->gray == 0 || sbit->gray > png_ptr->usr_bit_depth) 962 if (sbit->gray == 0 || sbit->gray > png_ptr->usr_bit_depth)
1366 { 963 {
1367 png_warning(png_ptr, "Invalid sBIT depth specified"); 964 png_warning(png_ptr, "Invalid sBIT depth specified");
1368 return; 965 return;
1369 } 966 }
1370
1371 buf[0] = sbit->gray; 967 buf[0] = sbit->gray;
1372 size = 1; 968 size = 1;
1373 } 969 }
1374 970
1375 if (color_type & PNG_COLOR_MASK_ALPHA) 971 if (color_type & PNG_COLOR_MASK_ALPHA)
1376 { 972 {
1377 if (sbit->alpha == 0 || sbit->alpha > png_ptr->usr_bit_depth) 973 if (sbit->alpha == 0 || sbit->alpha > png_ptr->usr_bit_depth)
1378 { 974 {
1379 png_warning(png_ptr, "Invalid sBIT depth specified"); 975 png_warning(png_ptr, "Invalid sBIT depth specified");
1380 return; 976 return;
1381 } 977 }
1382
1383 buf[size++] = sbit->alpha; 978 buf[size++] = sbit->alpha;
1384 } 979 }
1385 980
1386 png_write_complete_chunk(png_ptr, png_sBIT, buf, size); 981 png_write_chunk(png_ptr, (png_bytep)png_sBIT, buf, size);
1387 } 982 }
1388 #endif 983 #endif
1389 984
1390 #ifdef PNG_WRITE_cHRM_SUPPORTED 985 #ifdef PNG_WRITE_cHRM_SUPPORTED
1391 /* Write the cHRM chunk */ 986 /* Write the cHRM chunk */
987 #ifdef PNG_FLOATING_POINT_SUPPORTED
1392 void /* PRIVATE */ 988 void /* PRIVATE */
1393 png_write_cHRM_fixed(png_structrp png_ptr, const png_xy *xy) 989 png_write_cHRM(png_structp png_ptr, double white_x, double white_y,
990 double red_x, double red_y, double green_x, double green_y,
991 double blue_x, double blue_y)
1394 { 992 {
993 #ifdef PNG_USE_LOCAL_ARRAYS
994 PNG_cHRM;
995 #endif
996 png_byte buf[32];
997
998 png_fixed_point int_white_x, int_white_y, int_red_x, int_red_y,
999 int_green_x, int_green_y, int_blue_x, int_blue_y;
1000
1001 png_debug(1, "in png_write_cHRM");
1002
1003 int_white_x = (png_uint_32)(white_x * 100000.0 + 0.5);
1004 int_white_y = (png_uint_32)(white_y * 100000.0 + 0.5);
1005 int_red_x = (png_uint_32)(red_x * 100000.0 + 0.5);
1006 int_red_y = (png_uint_32)(red_y * 100000.0 + 0.5);
1007 int_green_x = (png_uint_32)(green_x * 100000.0 + 0.5);
1008 int_green_y = (png_uint_32)(green_y * 100000.0 + 0.5);
1009 int_blue_x = (png_uint_32)(blue_x * 100000.0 + 0.5);
1010 int_blue_y = (png_uint_32)(blue_y * 100000.0 + 0.5);
1011
1012 #ifdef PNG_CHECK_cHRM_SUPPORTED
1013 if (png_check_cHRM_fixed(png_ptr, int_white_x, int_white_y,
1014 int_red_x, int_red_y, int_green_x, int_green_y, int_blue_x, int_blue_y))
1015 #endif
1016 {
1017 /* Each value is saved in 1/100,000ths */
1018
1019 png_save_uint_32(buf, int_white_x);
1020 png_save_uint_32(buf + 4, int_white_y);
1021
1022 png_save_uint_32(buf + 8, int_red_x);
1023 png_save_uint_32(buf + 12, int_red_y);
1024
1025 png_save_uint_32(buf + 16, int_green_x);
1026 png_save_uint_32(buf + 20, int_green_y);
1027
1028 png_save_uint_32(buf + 24, int_blue_x);
1029 png_save_uint_32(buf + 28, int_blue_y);
1030
1031 png_write_chunk(png_ptr, (png_bytep)png_cHRM, buf, (png_size_t)32);
1032 }
1033 }
1034 #endif
1035 #ifdef PNG_FIXED_POINT_SUPPORTED
1036 void /* PRIVATE */
1037 png_write_cHRM_fixed(png_structp png_ptr, png_fixed_point white_x,
1038 png_fixed_point white_y, png_fixed_point red_x, png_fixed_point red_y,
1039 png_fixed_point green_x, png_fixed_point green_y, png_fixed_point blue_x,
1040 png_fixed_point blue_y)
1041 {
1042 #ifdef PNG_USE_LOCAL_ARRAYS
1043 PNG_cHRM;
1044 #endif
1395 png_byte buf[32]; 1045 png_byte buf[32];
1396 1046
1397 png_debug(1, "in png_write_cHRM"); 1047 png_debug(1, "in png_write_cHRM");
1398 1048
1399 /* Each value is saved in 1/100,000ths */ 1049 /* Each value is saved in 1/100,000ths */
1400 png_save_int_32(buf, xy->whitex); 1050 #ifdef PNG_CHECK_cHRM_SUPPORTED
1401 png_save_int_32(buf + 4, xy->whitey); 1051 if (png_check_cHRM_fixed(png_ptr, white_x, white_y, red_x, red_y,
1052 green_x, green_y, blue_x, blue_y))
1053 #endif
1054 {
1055 png_save_uint_32(buf, (png_uint_32)white_x);
1056 png_save_uint_32(buf + 4, (png_uint_32)white_y);
1402 1057
1403 png_save_int_32(buf + 8, xy->redx); 1058 png_save_uint_32(buf + 8, (png_uint_32)red_x);
1404 png_save_int_32(buf + 12, xy->redy); 1059 png_save_uint_32(buf + 12, (png_uint_32)red_y);
1405 1060
1406 png_save_int_32(buf + 16, xy->greenx); 1061 png_save_uint_32(buf + 16, (png_uint_32)green_x);
1407 png_save_int_32(buf + 20, xy->greeny); 1062 png_save_uint_32(buf + 20, (png_uint_32)green_y);
1408 1063
1409 png_save_int_32(buf + 24, xy->bluex); 1064 png_save_uint_32(buf + 24, (png_uint_32)blue_x);
1410 png_save_int_32(buf + 28, xy->bluey); 1065 png_save_uint_32(buf + 28, (png_uint_32)blue_y);
1411 1066
1412 png_write_complete_chunk(png_ptr, png_cHRM, buf, 32); 1067 png_write_chunk(png_ptr, (png_bytep)png_cHRM, buf, (png_size_t)32);
1068 }
1413 } 1069 }
1414 #endif 1070 #endif
1071 #endif
1415 1072
1416 #ifdef PNG_WRITE_tRNS_SUPPORTED 1073 #ifdef PNG_WRITE_tRNS_SUPPORTED
1417 /* Write the tRNS chunk */ 1074 /* Write the tRNS chunk */
1418 void /* PRIVATE */ 1075 void /* PRIVATE */
1419 png_write_tRNS(png_structrp png_ptr, png_const_bytep trans_alpha, 1076 png_write_tRNS(png_structp png_ptr, png_bytep trans, png_color_16p tran,
1420 png_const_color_16p tran, int num_trans, int color_type) 1077 int num_trans, int color_type)
1421 { 1078 {
1079 #ifdef PNG_USE_LOCAL_ARRAYS
1080 PNG_tRNS;
1081 #endif
1422 png_byte buf[6]; 1082 png_byte buf[6];
1423 1083
1424 png_debug(1, "in png_write_tRNS"); 1084 png_debug(1, "in png_write_tRNS");
1425 1085
1426 if (color_type == PNG_COLOR_TYPE_PALETTE) 1086 if (color_type == PNG_COLOR_TYPE_PALETTE)
1427 { 1087 {
1428 if (num_trans <= 0 || num_trans > (int)png_ptr->num_palette) 1088 if (num_trans <= 0 || num_trans > (int)png_ptr->num_palette)
1429 { 1089 {
1430 png_app_warning(png_ptr, 1090 png_warning(png_ptr, "Invalid number of transparent colors specified");
1431 "Invalid number of transparent colors specified");
1432 return; 1091 return;
1433 } 1092 }
1434
1435 /* Write the chunk out as it is */ 1093 /* Write the chunk out as it is */
1436 png_write_complete_chunk(png_ptr, png_tRNS, trans_alpha, 1094 png_write_chunk(png_ptr, (png_bytep)png_tRNS, trans,
1437 (png_size_t)num_trans); 1095 (png_size_t)num_trans);
1438 } 1096 }
1439
1440 else if (color_type == PNG_COLOR_TYPE_GRAY) 1097 else if (color_type == PNG_COLOR_TYPE_GRAY)
1441 { 1098 {
1442 /* One 16 bit value */ 1099 /* One 16 bit value */
1443 if (tran->gray >= (1 << png_ptr->bit_depth)) 1100 if (tran->gray >= (1 << png_ptr->bit_depth))
1444 { 1101 {
1445 png_app_warning(png_ptr, 1102 png_warning(png_ptr,
1446 "Ignoring attempt to write tRNS chunk out-of-range for bit_depth"); 1103 "Ignoring attempt to write tRNS chunk out-of-range for bit_depth");
1447
1448 return; 1104 return;
1449 } 1105 }
1450
1451 png_save_uint_16(buf, tran->gray); 1106 png_save_uint_16(buf, tran->gray);
1452 png_write_complete_chunk(png_ptr, png_tRNS, buf, (png_size_t)2); 1107 png_write_chunk(png_ptr, (png_bytep)png_tRNS, buf, (png_size_t)2);
1453 } 1108 }
1454
1455 else if (color_type == PNG_COLOR_TYPE_RGB) 1109 else if (color_type == PNG_COLOR_TYPE_RGB)
1456 { 1110 {
1457 /* Three 16 bit values */ 1111 /* Three 16 bit values */
1458 png_save_uint_16(buf, tran->red); 1112 png_save_uint_16(buf, tran->red);
1459 png_save_uint_16(buf + 2, tran->green); 1113 png_save_uint_16(buf + 2, tran->green);
1460 png_save_uint_16(buf + 4, tran->blue); 1114 png_save_uint_16(buf + 4, tran->blue);
1461 #ifdef PNG_WRITE_16BIT_SUPPORTED
1462 if (png_ptr->bit_depth == 8 && (buf[0] | buf[2] | buf[4])) 1115 if (png_ptr->bit_depth == 8 && (buf[0] | buf[2] | buf[4]))
1463 #else
1464 if (buf[0] | buf[2] | buf[4])
1465 #endif
1466 { 1116 {
1467 png_app_warning(png_ptr, 1117 png_warning(png_ptr,
1468 "Ignoring attempt to write 16-bit tRNS chunk when bit_depth is 8"); 1118 "Ignoring attempt to write 16-bit tRNS chunk when bit_depth is 8");
1469 return; 1119 return;
1470 } 1120 }
1471 1121 png_write_chunk(png_ptr, (png_bytep)png_tRNS, buf, (png_size_t)6);
1472 png_write_complete_chunk(png_ptr, png_tRNS, buf, (png_size_t)6);
1473 } 1122 }
1474
1475 else 1123 else
1476 { 1124 {
1477 png_app_warning(png_ptr, "Can't write tRNS with an alpha channel"); 1125 png_warning(png_ptr, "Can't write tRNS with an alpha channel");
1478 } 1126 }
1479 } 1127 }
1480 #endif 1128 #endif
1481 1129
1482 #ifdef PNG_WRITE_bKGD_SUPPORTED 1130 #ifdef PNG_WRITE_bKGD_SUPPORTED
1483 /* Write the background chunk */ 1131 /* Write the background chunk */
1484 void /* PRIVATE */ 1132 void /* PRIVATE */
1485 png_write_bKGD(png_structrp png_ptr, png_const_color_16p back, int color_type) 1133 png_write_bKGD(png_structp png_ptr, png_color_16p back, int color_type)
1486 { 1134 {
1135 #ifdef PNG_USE_LOCAL_ARRAYS
1136 PNG_bKGD;
1137 #endif
1487 png_byte buf[6]; 1138 png_byte buf[6];
1488 1139
1489 png_debug(1, "in png_write_bKGD"); 1140 png_debug(1, "in png_write_bKGD");
1490 1141
1491 if (color_type == PNG_COLOR_TYPE_PALETTE) 1142 if (color_type == PNG_COLOR_TYPE_PALETTE)
1492 { 1143 {
1493 if ( 1144 if (
1494 #ifdef PNG_MNG_FEATURES_SUPPORTED 1145 #ifdef PNG_MNG_FEATURES_SUPPORTED
1495 (png_ptr->num_palette || 1146 (png_ptr->num_palette ||
1496 (!(png_ptr->mng_features_permitted & PNG_FLAG_MNG_EMPTY_PLTE))) && 1147 (!(png_ptr->mng_features_permitted & PNG_FLAG_MNG_EMPTY_PLTE))) &&
1497 #endif 1148 #endif
1498 back->index >= png_ptr->num_palette) 1149 back->index >= png_ptr->num_palette)
1499 { 1150 {
1500 png_warning(png_ptr, "Invalid background palette index"); 1151 png_warning(png_ptr, "Invalid background palette index");
1501 return; 1152 return;
1502 } 1153 }
1503
1504 buf[0] = back->index; 1154 buf[0] = back->index;
1505 png_write_complete_chunk(png_ptr, png_bKGD, buf, (png_size_t)1); 1155 png_write_chunk(png_ptr, (png_bytep)png_bKGD, buf, (png_size_t)1);
1506 } 1156 }
1507
1508 else if (color_type & PNG_COLOR_MASK_COLOR) 1157 else if (color_type & PNG_COLOR_MASK_COLOR)
1509 { 1158 {
1510 png_save_uint_16(buf, back->red); 1159 png_save_uint_16(buf, back->red);
1511 png_save_uint_16(buf + 2, back->green); 1160 png_save_uint_16(buf + 2, back->green);
1512 png_save_uint_16(buf + 4, back->blue); 1161 png_save_uint_16(buf + 4, back->blue);
1513 #ifdef PNG_WRITE_16BIT_SUPPORTED
1514 if (png_ptr->bit_depth == 8 && (buf[0] | buf[2] | buf[4])) 1162 if (png_ptr->bit_depth == 8 && (buf[0] | buf[2] | buf[4]))
1515 #else
1516 if (buf[0] | buf[2] | buf[4])
1517 #endif
1518 { 1163 {
1519 png_warning(png_ptr, 1164 png_warning(png_ptr,
1520 "Ignoring attempt to write 16-bit bKGD chunk when bit_depth is 8"); 1165 "Ignoring attempt to write 16-bit bKGD chunk when bit_depth is 8");
1521
1522 return; 1166 return;
1523 } 1167 }
1524 1168 png_write_chunk(png_ptr, (png_bytep)png_bKGD, buf, (png_size_t)6);
1525 png_write_complete_chunk(png_ptr, png_bKGD, buf, (png_size_t)6); 1169 }
1526 }
1527
1528 else 1170 else
1529 { 1171 {
1530 if (back->gray >= (1 << png_ptr->bit_depth)) 1172 if (back->gray >= (1 << png_ptr->bit_depth))
1531 { 1173 {
1532 png_warning(png_ptr, 1174 png_warning(png_ptr,
1533 "Ignoring attempt to write bKGD chunk out-of-range for bit_depth"); 1175 "Ignoring attempt to write bKGD chunk out-of-range for bit_depth");
1534
1535 return; 1176 return;
1536 } 1177 }
1537
1538 png_save_uint_16(buf, back->gray); 1178 png_save_uint_16(buf, back->gray);
1539 png_write_complete_chunk(png_ptr, png_bKGD, buf, (png_size_t)2); 1179 png_write_chunk(png_ptr, (png_bytep)png_bKGD, buf, (png_size_t)2);
1540 } 1180 }
1541 } 1181 }
1542 #endif 1182 #endif
1543 1183
1544 #ifdef PNG_WRITE_hIST_SUPPORTED 1184 #ifdef PNG_WRITE_hIST_SUPPORTED
1545 /* Write the histogram */ 1185 /* Write the histogram */
1546 void /* PRIVATE */ 1186 void /* PRIVATE */
1547 png_write_hIST(png_structrp png_ptr, png_const_uint_16p hist, int num_hist) 1187 png_write_hIST(png_structp png_ptr, png_uint_16p hist, int num_hist)
1548 { 1188 {
1189 #ifdef PNG_USE_LOCAL_ARRAYS
1190 PNG_hIST;
1191 #endif
1549 int i; 1192 int i;
1550 png_byte buf[3]; 1193 png_byte buf[3];
1551 1194
1552 png_debug(1, "in png_write_hIST"); 1195 png_debug(1, "in png_write_hIST");
1553 1196
1554 if (num_hist > (int)png_ptr->num_palette) 1197 if (num_hist > (int)png_ptr->num_palette)
1555 { 1198 {
1556 png_debug2(3, "num_hist = %d, num_palette = %d", num_hist, 1199 png_debug2(3, "num_hist = %d, num_palette = %d", num_hist,
1557 png_ptr->num_palette); 1200 png_ptr->num_palette);
1558
1559 png_warning(png_ptr, "Invalid number of histogram entries specified"); 1201 png_warning(png_ptr, "Invalid number of histogram entries specified");
1560 return; 1202 return;
1561 } 1203 }
1562 1204
1563 png_write_chunk_header(png_ptr, png_hIST, (png_uint_32)(num_hist * 2)); 1205 png_write_chunk_start(png_ptr, (png_bytep)png_hIST,
1564 1206 (png_uint_32)(num_hist * 2));
1565 for (i = 0; i < num_hist; i++) 1207 for (i = 0; i < num_hist; i++)
1566 { 1208 {
1567 png_save_uint_16(buf, hist[i]); 1209 png_save_uint_16(buf, hist[i]);
1568 png_write_chunk_data(png_ptr, buf, (png_size_t)2); 1210 png_write_chunk_data(png_ptr, buf, (png_size_t)2);
1569 } 1211 }
1570
1571 png_write_chunk_end(png_ptr); 1212 png_write_chunk_end(png_ptr);
1572 } 1213 }
1573 #endif 1214 #endif
1574 1215
1216 #if defined(PNG_WRITE_TEXT_SUPPORTED) || defined(PNG_WRITE_pCAL_SUPPORTED) || \
1217 defined(PNG_WRITE_iCCP_SUPPORTED) || defined(PNG_WRITE_sPLT_SUPPORTED)
1218 /* Check that the tEXt or zTXt keyword is valid per PNG 1.0 specification,
1219 * and if invalid, correct the keyword rather than discarding the entire
1220 * chunk. The PNG 1.0 specification requires keywords 1-79 characters in
1221 * length, forbids leading or trailing whitespace, multiple internal spaces,
1222 * and the non-break space (0x80) from ISO 8859-1. Returns keyword length.
1223 *
1224 * The new_key is allocated to hold the corrected keyword and must be freed
1225 * by the calling routine. This avoids problems with trying to write to
1226 * static keywords without having to have duplicate copies of the strings.
1227 */
1228 png_size_t /* PRIVATE */
1229 png_check_keyword(png_structp png_ptr, png_charp key, png_charpp new_key)
1230 {
1231 png_size_t key_len;
1232 png_charp kp, dp;
1233 int kflag;
1234 int kwarn=0;
1235
1236 png_debug(1, "in png_check_keyword");
1237
1238 *new_key = NULL;
1239
1240 if (key == NULL || (key_len = png_strlen(key)) == 0)
1241 {
1242 png_warning(png_ptr, "zero length keyword");
1243 return ((png_size_t)0);
1244 }
1245
1246 png_debug1(2, "Keyword to be checked is '%s'", key);
1247
1248 *new_key = (png_charp)png_malloc_warn(png_ptr, (png_uint_32)(key_len + 2));
1249 if (*new_key == NULL)
1250 {
1251 png_warning(png_ptr, "Out of memory while procesing keyword");
1252 return ((png_size_t)0);
1253 }
1254
1255 /* Replace non-printing characters with a blank and print a warning */
1256 for (kp = key, dp = *new_key; *kp != '\0'; kp++, dp++)
1257 {
1258 if ((png_byte)*kp < 0x20 ||
1259 ((png_byte)*kp > 0x7E && (png_byte)*kp < 0xA1))
1260 {
1261 #if defined(PNG_STDIO_SUPPORTED) && !defined(_WIN32_WCE)
1262 char msg[40];
1263
1264 png_snprintf(msg, 40,
1265 "invalid keyword character 0x%02X", (png_byte)*kp);
1266 png_warning(png_ptr, msg);
1267 #else
1268 png_warning(png_ptr, "invalid character in keyword");
1269 #endif
1270 *dp = ' ';
1271 }
1272 else
1273 {
1274 *dp = *kp;
1275 }
1276 }
1277 *dp = '\0';
1278
1279 /* Remove any trailing white space. */
1280 kp = *new_key + key_len - 1;
1281 if (*kp == ' ')
1282 {
1283 png_warning(png_ptr, "trailing spaces removed from keyword");
1284
1285 while (*kp == ' ')
1286 {
1287 *(kp--) = '\0';
1288 key_len--;
1289 }
1290 }
1291
1292 /* Remove any leading white space. */
1293 kp = *new_key;
1294 if (*kp == ' ')
1295 {
1296 png_warning(png_ptr, "leading spaces removed from keyword");
1297
1298 while (*kp == ' ')
1299 {
1300 kp++;
1301 key_len--;
1302 }
1303 }
1304
1305 png_debug1(2, "Checking for multiple internal spaces in '%s'", kp);
1306
1307 /* Remove multiple internal spaces. */
1308 for (kflag = 0, dp = *new_key; *kp != '\0'; kp++)
1309 {
1310 if (*kp == ' ' && kflag == 0)
1311 {
1312 *(dp++) = *kp;
1313 kflag = 1;
1314 }
1315 else if (*kp == ' ')
1316 {
1317 key_len--;
1318 kwarn=1;
1319 }
1320 else
1321 {
1322 *(dp++) = *kp;
1323 kflag = 0;
1324 }
1325 }
1326 *dp = '\0';
1327 if (kwarn)
1328 png_warning(png_ptr, "extra interior spaces removed from keyword");
1329
1330 if (key_len == 0)
1331 {
1332 png_free(png_ptr, *new_key);
1333 *new_key=NULL;
1334 png_warning(png_ptr, "Zero length keyword");
1335 }
1336
1337 if (key_len > 79)
1338 {
1339 png_warning(png_ptr, "keyword length must be 1 - 79 characters");
1340 (*new_key)[79] = '\0';
1341 key_len = 79;
1342 }
1343
1344 return (key_len);
1345 }
1346 #endif
1347
1575 #ifdef PNG_WRITE_tEXt_SUPPORTED 1348 #ifdef PNG_WRITE_tEXt_SUPPORTED
1576 /* Write a tEXt chunk */ 1349 /* Write a tEXt chunk */
1577 void /* PRIVATE */ 1350 void /* PRIVATE */
1578 png_write_tEXt(png_structrp png_ptr, png_const_charp key, png_const_charp text, 1351 png_write_tEXt(png_structp png_ptr, png_charp key, png_charp text,
1579 png_size_t text_len) 1352 png_size_t text_len)
1580 { 1353 {
1581 png_uint_32 key_len; 1354 #ifdef PNG_USE_LOCAL_ARRAYS
1582 png_byte new_key[80]; 1355 PNG_tEXt;
1356 #endif
1357 png_size_t key_len;
1358 png_charp new_key;
1583 1359
1584 png_debug(1, "in png_write_tEXt"); 1360 png_debug(1, "in png_write_tEXt");
1585 1361
1586 key_len = png_check_keyword(png_ptr, key, new_key); 1362 if ((key_len = png_check_keyword(png_ptr, key, &new_key))==0)
1587 1363 return;
1588 if (key_len == 0)
1589 png_error(png_ptr, "tEXt: invalid keyword");
1590 1364
1591 if (text == NULL || *text == '\0') 1365 if (text == NULL || *text == '\0')
1592 text_len = 0; 1366 text_len = 0;
1593
1594 else 1367 else
1595 text_len = strlen(text); 1368 text_len = png_strlen(text);
1596
1597 if (text_len > PNG_UINT_31_MAX - (key_len+1))
1598 png_error(png_ptr, "tEXt: text too long");
1599 1369
1600 /* Make sure we include the 0 after the key */ 1370 /* Make sure we include the 0 after the key */
1601 png_write_chunk_header(png_ptr, png_tEXt, 1371 png_write_chunk_start(png_ptr, (png_bytep)png_tEXt,
1602 (png_uint_32)/*checked above*/(key_len + text_len + 1)); 1372 (png_uint_32)(key_len + text_len + 1));
1603 /* 1373 /*
1604 * We leave it to the application to meet PNG-1.0 requirements on the 1374 * We leave it to the application to meet PNG-1.0 requirements on the
1605 * contents of the text. PNG-1.0 through PNG-1.2 discourage the use of 1375 * contents of the text. PNG-1.0 through PNG-1.2 discourage the use of
1606 * any non-Latin-1 characters except for NEWLINE. ISO PNG will forbid them. 1376 * any non-Latin-1 characters except for NEWLINE. ISO PNG will forbid them.
1607 * The NUL character is forbidden by PNG-1.0 through PNG-1.2 and ISO PNG. 1377 * The NUL character is forbidden by PNG-1.0 through PNG-1.2 and ISO PNG.
1608 */ 1378 */
1609 png_write_chunk_data(png_ptr, new_key, key_len + 1); 1379 png_write_chunk_data(png_ptr, (png_bytep)new_key,
1610 1380 (png_size_t)(key_len + 1));
1611 if (text_len) 1381 if (text_len)
1612 png_write_chunk_data(png_ptr, (png_const_bytep)text, text_len); 1382 png_write_chunk_data(png_ptr, (png_bytep)text, (png_size_t)text_len);
1613 1383
1614 png_write_chunk_end(png_ptr); 1384 png_write_chunk_end(png_ptr);
1385 png_free(png_ptr, new_key);
1615 } 1386 }
1616 #endif 1387 #endif
1617 1388
1618 #ifdef PNG_WRITE_zTXt_SUPPORTED 1389 #ifdef PNG_WRITE_zTXt_SUPPORTED
1619 /* Write a compressed text chunk */ 1390 /* Write a compressed text chunk */
1620 void /* PRIVATE */ 1391 void /* PRIVATE */
1621 png_write_zTXt(png_structrp png_ptr, png_const_charp key, png_const_charp text, 1392 png_write_zTXt(png_structp png_ptr, png_charp key, png_charp text,
1622 png_size_t text_len, int compression) 1393 png_size_t text_len, int compression)
1623 { 1394 {
1624 png_uint_32 key_len; 1395 #ifdef PNG_USE_LOCAL_ARRAYS
1625 png_byte new_key[81]; 1396 PNG_zTXt;
1397 #endif
1398 png_size_t key_len;
1399 char buf[1];
1400 png_charp new_key;
1626 compression_state comp; 1401 compression_state comp;
1627 1402
1628 png_debug(1, "in png_write_zTXt"); 1403 png_debug(1, "in png_write_zTXt");
1629 PNG_UNUSED(text_len) /* Always use strlen */ 1404
1630 1405 comp.num_output_ptr = 0;
1631 if (compression == PNG_TEXT_COMPRESSION_NONE) 1406 comp.max_output_ptr = 0;
1632 { 1407 comp.output_ptr = NULL;
1633 png_write_tEXt(png_ptr, key, text, 0); 1408 comp.input = NULL;
1634 return; 1409 comp.input_len = 0;
1635 } 1410
1636 1411 if ((key_len = png_check_keyword(png_ptr, key, &new_key))==0)
1637 if (compression != PNG_TEXT_COMPRESSION_zTXt) 1412 {
1638 png_error(png_ptr, "zTXt: invalid compression type"); 1413 png_free(png_ptr, new_key);
1639 1414 return;
1640 key_len = png_check_keyword(png_ptr, key, new_key); 1415 }
1641 1416
1642 if (key_len == 0) 1417 if (text == NULL || *text == '\0' || compression==PNG_TEXT_COMPRESSION_NONE)
1643 png_error(png_ptr, "zTXt: invalid keyword"); 1418 {
1644 1419 png_write_tEXt(png_ptr, new_key, text, (png_size_t)0);
1645 /* Add the compression method and 1 for the keyword separator. */ 1420 png_free(png_ptr, new_key);
1646 new_key[++key_len] = PNG_COMPRESSION_TYPE_BASE; 1421 return;
1647 ++key_len; 1422 }
1423
1424 text_len = png_strlen(text);
1648 1425
1649 /* Compute the compressed data; do it now for the length */ 1426 /* Compute the compressed data; do it now for the length */
1650 png_text_compress_init(&comp, (png_const_bytep)text, 1427 text_len = png_text_compress(png_ptr, text, text_len, compression,
1651 text == NULL ? 0 : strlen(text)); 1428 &comp);
1652
1653 if (png_text_compress(png_ptr, png_zTXt, &comp, key_len) != Z_OK)
1654 png_error(png_ptr, png_ptr->zstream.msg);
1655 1429
1656 /* Write start of chunk */ 1430 /* Write start of chunk */
1657 png_write_chunk_header(png_ptr, png_zTXt, key_len + comp.output_len); 1431 png_write_chunk_start(png_ptr, (png_bytep)png_zTXt,
1658 1432 (png_uint_32)(key_len+text_len + 2));
1659 /* Write key */ 1433 /* Write key */
1660 png_write_chunk_data(png_ptr, new_key, key_len); 1434 png_write_chunk_data(png_ptr, (png_bytep)new_key,
1661 1435 (png_size_t)(key_len + 1));
1436 png_free(png_ptr, new_key);
1437
1438 buf[0] = (png_byte)compression;
1439 /* Write compression */
1440 png_write_chunk_data(png_ptr, (png_bytep)buf, (png_size_t)1);
1662 /* Write the compressed data */ 1441 /* Write the compressed data */
1663 png_write_compressed_data_out(png_ptr, &comp); 1442 png_write_compressed_data_out(png_ptr, &comp);
1664 1443
1665 /* Close the chunk */ 1444 /* Close the chunk */
1666 png_write_chunk_end(png_ptr); 1445 png_write_chunk_end(png_ptr);
1667 } 1446 }
1668 #endif 1447 #endif
1669 1448
1670 #ifdef PNG_WRITE_iTXt_SUPPORTED 1449 #ifdef PNG_WRITE_iTXt_SUPPORTED
1671 /* Write an iTXt chunk */ 1450 /* Write an iTXt chunk */
1672 void /* PRIVATE */ 1451 void /* PRIVATE */
1673 png_write_iTXt(png_structrp png_ptr, int compression, png_const_charp key, 1452 png_write_iTXt(png_structp png_ptr, int compression, png_charp key,
1674 png_const_charp lang, png_const_charp lang_key, png_const_charp text) 1453 png_charp lang, png_charp lang_key, png_charp text)
1675 { 1454 {
1676 png_uint_32 key_len, prefix_len; 1455 #ifdef PNG_USE_LOCAL_ARRAYS
1677 png_size_t lang_len, lang_key_len; 1456 PNG_iTXt;
1678 png_byte new_key[82]; 1457 #endif
1458 png_size_t lang_len, key_len, lang_key_len, text_len;
1459 png_charp new_lang;
1460 png_charp new_key = NULL;
1461 png_byte cbuf[2];
1679 compression_state comp; 1462 compression_state comp;
1680 1463
1681 png_debug(1, "in png_write_iTXt"); 1464 png_debug(1, "in png_write_iTXt");
1682 1465
1683 key_len = png_check_keyword(png_ptr, key, new_key); 1466 comp.num_output_ptr = 0;
1467 comp.max_output_ptr = 0;
1468 comp.output_ptr = NULL;
1469 comp.input = NULL;
1684 1470
1685 if (key_len == 0) 1471 if ((key_len = png_check_keyword(png_ptr, key, &new_key))==0)
1686 png_error(png_ptr, "iTXt: invalid keyword"); 1472 return;
1687 1473
1688 /* Set the compression flag */ 1474 if ((lang_len = png_check_keyword(png_ptr, lang, &new_lang))==0)
1689 switch (compression)
1690 { 1475 {
1691 case PNG_ITXT_COMPRESSION_NONE: 1476 png_warning(png_ptr, "Empty language field in iTXt chunk");
1692 case PNG_TEXT_COMPRESSION_NONE: 1477 new_lang = NULL;
1693 compression = new_key[++key_len] = 0; /* no compression */ 1478 lang_len = 0;
1694 break;
1695
1696 case PNG_TEXT_COMPRESSION_zTXt:
1697 case PNG_ITXT_COMPRESSION_zTXt:
1698 compression = new_key[++key_len] = 1; /* compressed */
1699 break;
1700
1701 default:
1702 png_error(png_ptr, "iTXt: invalid compression");
1703 } 1479 }
1704 1480
1705 new_key[++key_len] = PNG_COMPRESSION_TYPE_BASE; 1481 if (lang_key == NULL)
1706 ++key_len; /* for the keywod separator */ 1482 lang_key_len = 0;
1483 else
1484 lang_key_len = png_strlen(lang_key);
1485
1486 if (text == NULL)
1487 text_len = 0;
1488 else
1489 text_len = png_strlen(text);
1490
1491 /* Compute the compressed data; do it now for the length */
1492 text_len = png_text_compress(png_ptr, text, text_len, compression-2,
1493 &comp);
1494
1495
1496 /* Make sure we include the compression flag, the compression byte,
1497 * and the NULs after the key, lang, and lang_key parts */
1498
1499 png_write_chunk_start(png_ptr, (png_bytep)png_iTXt,
1500 (png_uint_32)(
1501 5 /* comp byte, comp flag, terminators for key, lang and lang_key */
1502 + key_len
1503 + lang_len
1504 + lang_key_len
1505 + text_len));
1707 1506
1708 /* We leave it to the application to meet PNG-1.0 requirements on the 1507 /* We leave it to the application to meet PNG-1.0 requirements on the
1709 * contents of the text. PNG-1.0 through PNG-1.2 discourage the use of 1508 * contents of the text. PNG-1.0 through PNG-1.2 discourage the use of
1710 * any non-Latin-1 characters except for NEWLINE. ISO PNG, however, 1509 * any non-Latin-1 characters except for NEWLINE. ISO PNG will forbid them.
1711 * specifies that the text is UTF-8 and this really doesn't require any
1712 * checking.
1713 *
1714 * The NUL character is forbidden by PNG-1.0 through PNG-1.2 and ISO PNG. 1510 * The NUL character is forbidden by PNG-1.0 through PNG-1.2 and ISO PNG.
1715 *
1716 * TODO: validate the language tag correctly (see the spec.)
1717 */ 1511 */
1718 if (lang == NULL) lang = ""; /* empty language is valid */ 1512 png_write_chunk_data(png_ptr, (png_bytep)new_key,
1719 lang_len = strlen(lang)+1; 1513 (png_size_t)(key_len + 1));
1720 if (lang_key == NULL) lang_key = ""; /* may be empty */
1721 lang_key_len = strlen(lang_key)+1;
1722 if (text == NULL) text = ""; /* may be empty */
1723 1514
1724 prefix_len = key_len; 1515 /* Set the compression flag */
1725 if (lang_len > PNG_UINT_31_MAX-prefix_len) 1516 if (compression == PNG_ITXT_COMPRESSION_NONE || \
1726 prefix_len = PNG_UINT_31_MAX; 1517 compression == PNG_TEXT_COMPRESSION_NONE)
1727 else 1518 cbuf[0] = 0;
1728 prefix_len = (png_uint_32)(prefix_len + lang_len); 1519 else /* compression == PNG_ITXT_COMPRESSION_zTXt */
1520 cbuf[0] = 1;
1521 /* Set the compression method */
1522 cbuf[1] = 0;
1523 png_write_chunk_data(png_ptr, cbuf, (png_size_t)2);
1729 1524
1730 if (lang_key_len > PNG_UINT_31_MAX-prefix_len) 1525 cbuf[0] = 0;
1731 prefix_len = PNG_UINT_31_MAX; 1526 png_write_chunk_data(png_ptr, (new_lang ? (png_bytep)new_lang : cbuf),
1732 else 1527 (png_size_t)(lang_len + 1));
1733 prefix_len = (png_uint_32)(prefix_len + lang_key_len); 1528 png_write_chunk_data(png_ptr, (lang_key ? (png_bytep)lang_key : cbuf),
1734 1529 (png_size_t)(lang_key_len + 1));
1735 png_text_compress_init(&comp, (png_const_bytep)text, strlen(text)); 1530 png_write_compressed_data_out(png_ptr, &comp);
1736
1737 if (compression)
1738 {
1739 if (png_text_compress(png_ptr, png_iTXt, &comp, prefix_len) != Z_OK)
1740 png_error(png_ptr, png_ptr->zstream.msg);
1741 }
1742
1743 else
1744 {
1745 if (comp.input_len > PNG_UINT_31_MAX-prefix_len)
1746 png_error(png_ptr, "iTXt: uncompressed text too long");
1747
1748 /* So the string will fit in a chunk: */
1749 comp.output_len = (png_uint_32)/*SAFE*/comp.input_len;
1750 }
1751
1752 png_write_chunk_header(png_ptr, png_iTXt, comp.output_len + prefix_len);
1753
1754 png_write_chunk_data(png_ptr, new_key, key_len);
1755
1756 png_write_chunk_data(png_ptr, (png_const_bytep)lang, lang_len);
1757
1758 png_write_chunk_data(png_ptr, (png_const_bytep)lang_key, lang_key_len);
1759
1760 if (compression)
1761 png_write_compressed_data_out(png_ptr, &comp);
1762
1763 else
1764 png_write_chunk_data(png_ptr, (png_const_bytep)text, comp.input_len);
1765 1531
1766 png_write_chunk_end(png_ptr); 1532 png_write_chunk_end(png_ptr);
1533 png_free(png_ptr, new_key);
1534 png_free(png_ptr, new_lang);
1767 } 1535 }
1768 #endif 1536 #endif
1769 1537
1770 #ifdef PNG_WRITE_oFFs_SUPPORTED 1538 #ifdef PNG_WRITE_oFFs_SUPPORTED
1771 /* Write the oFFs chunk */ 1539 /* Write the oFFs chunk */
1772 void /* PRIVATE */ 1540 void /* PRIVATE */
1773 png_write_oFFs(png_structrp png_ptr, png_int_32 x_offset, png_int_32 y_offset, 1541 png_write_oFFs(png_structp png_ptr, png_int_32 x_offset, png_int_32 y_offset,
1774 int unit_type) 1542 int unit_type)
1775 { 1543 {
1544 #ifdef PNG_USE_LOCAL_ARRAYS
1545 PNG_oFFs;
1546 #endif
1776 png_byte buf[9]; 1547 png_byte buf[9];
1777 1548
1778 png_debug(1, "in png_write_oFFs"); 1549 png_debug(1, "in png_write_oFFs");
1779 1550
1780 if (unit_type >= PNG_OFFSET_LAST) 1551 if (unit_type >= PNG_OFFSET_LAST)
1781 png_warning(png_ptr, "Unrecognized unit type for oFFs chunk"); 1552 png_warning(png_ptr, "Unrecognized unit type for oFFs chunk");
1782 1553
1783 png_save_int_32(buf, x_offset); 1554 png_save_int_32(buf, x_offset);
1784 png_save_int_32(buf + 4, y_offset); 1555 png_save_int_32(buf + 4, y_offset);
1785 buf[8] = (png_byte)unit_type; 1556 buf[8] = (png_byte)unit_type;
1786 1557
1787 png_write_complete_chunk(png_ptr, png_oFFs, buf, (png_size_t)9); 1558 png_write_chunk(png_ptr, (png_bytep)png_oFFs, buf, (png_size_t)9);
1788 } 1559 }
1789 #endif 1560 #endif
1790 #ifdef PNG_WRITE_pCAL_SUPPORTED 1561 #ifdef PNG_WRITE_pCAL_SUPPORTED
1791 /* Write the pCAL chunk (described in the PNG extensions document) */ 1562 /* Write the pCAL chunk (described in the PNG extensions document) */
1792 void /* PRIVATE */ 1563 void /* PRIVATE */
1793 png_write_pCAL(png_structrp png_ptr, png_charp purpose, png_int_32 X0, 1564 png_write_pCAL(png_structp png_ptr, png_charp purpose, png_int_32 X0,
1794 png_int_32 X1, int type, int nparams, png_const_charp units, 1565 png_int_32 X1, int type, int nparams, png_charp units, png_charpp params)
1795 png_charpp params)
1796 { 1566 {
1797 png_uint_32 purpose_len; 1567 #ifdef PNG_USE_LOCAL_ARRAYS
1798 png_size_t units_len, total_len; 1568 PNG_pCAL;
1799 png_size_tp params_len; 1569 #endif
1570 png_size_t purpose_len, units_len, total_len;
1571 png_uint_32p params_len;
1800 png_byte buf[10]; 1572 png_byte buf[10];
1801 png_byte new_purpose[80]; 1573 png_charp new_purpose;
1802 int i; 1574 int i;
1803 1575
1804 png_debug1(1, "in png_write_pCAL (%d parameters)", nparams); 1576 png_debug1(1, "in png_write_pCAL (%d parameters)", nparams);
1805 1577
1806 if (type >= PNG_EQUATION_LAST) 1578 if (type >= PNG_EQUATION_LAST)
1807 png_error(png_ptr, "Unrecognized equation type for pCAL chunk"); 1579 png_warning(png_ptr, "Unrecognized equation type for pCAL chunk");
1808 1580
1809 purpose_len = png_check_keyword(png_ptr, purpose, new_purpose); 1581 purpose_len = png_check_keyword(png_ptr, purpose, &new_purpose) + 1;
1810
1811 if (purpose_len == 0)
1812 png_error(png_ptr, "pCAL: invalid keyword");
1813
1814 ++purpose_len; /* terminator */
1815
1816 png_debug1(3, "pCAL purpose length = %d", (int)purpose_len); 1582 png_debug1(3, "pCAL purpose length = %d", (int)purpose_len);
1817 units_len = strlen(units) + (nparams == 0 ? 0 : 1); 1583 units_len = png_strlen(units) + (nparams == 0 ? 0 : 1);
1818 png_debug1(3, "pCAL units length = %d", (int)units_len); 1584 png_debug1(3, "pCAL units length = %d", (int)units_len);
1819 total_len = purpose_len + units_len + 10; 1585 total_len = purpose_len + units_len + 10;
1820 1586
1821 params_len = (png_size_tp)png_malloc(png_ptr, 1587 params_len = (png_uint_32p)png_malloc(png_ptr,
1822 (png_alloc_size_t)(nparams * (sizeof (png_size_t)))); 1588 (png_uint_32)(nparams * png_sizeof(png_uint_32)));
1823 1589
1824 /* Find the length of each parameter, making sure we don't count the 1590 /* Find the length of each parameter, making sure we don't count the
1825 * null terminator for the last parameter. 1591 null terminator for the last parameter. */
1826 */
1827 for (i = 0; i < nparams; i++) 1592 for (i = 0; i < nparams; i++)
1828 { 1593 {
1829 params_len[i] = strlen(params[i]) + (i == nparams - 1 ? 0 : 1); 1594 params_len[i] = png_strlen(params[i]) + (i == nparams - 1 ? 0 : 1);
1830 png_debug2(3, "pCAL parameter %d length = %lu", i, 1595 png_debug2(3, "pCAL parameter %d length = %lu", i,
1831 (unsigned long)params_len[i]); 1596 (unsigned long) params_len[i]);
1832 total_len += params_len[i]; 1597 total_len += (png_size_t)params_len[i];
1833 } 1598 }
1834 1599
1835 png_debug1(3, "pCAL total length = %d", (int)total_len); 1600 png_debug1(3, "pCAL total length = %d", (int)total_len);
1836 png_write_chunk_header(png_ptr, png_pCAL, (png_uint_32)total_len); 1601 png_write_chunk_start(png_ptr, (png_bytep)png_pCAL, (png_uint_32)total_len);
1837 png_write_chunk_data(png_ptr, new_purpose, purpose_len); 1602 png_write_chunk_data(png_ptr, (png_bytep)new_purpose,
1603 (png_size_t)purpose_len);
1838 png_save_int_32(buf, X0); 1604 png_save_int_32(buf, X0);
1839 png_save_int_32(buf + 4, X1); 1605 png_save_int_32(buf + 4, X1);
1840 buf[8] = (png_byte)type; 1606 buf[8] = (png_byte)type;
1841 buf[9] = (png_byte)nparams; 1607 buf[9] = (png_byte)nparams;
1842 png_write_chunk_data(png_ptr, buf, (png_size_t)10); 1608 png_write_chunk_data(png_ptr, buf, (png_size_t)10);
1843 png_write_chunk_data(png_ptr, (png_const_bytep)units, (png_size_t)units_len); 1609 png_write_chunk_data(png_ptr, (png_bytep)units, (png_size_t)units_len);
1610
1611 png_free(png_ptr, new_purpose);
1844 1612
1845 for (i = 0; i < nparams; i++) 1613 for (i = 0; i < nparams; i++)
1846 { 1614 {
1847 png_write_chunk_data(png_ptr, (png_const_bytep)params[i], params_len[i]); 1615 png_write_chunk_data(png_ptr, (png_bytep)params[i],
1616 (png_size_t)params_len[i]);
1848 } 1617 }
1849 1618
1850 png_free(png_ptr, params_len); 1619 png_free(png_ptr, params_len);
1851 png_write_chunk_end(png_ptr); 1620 png_write_chunk_end(png_ptr);
1852 } 1621 }
1853 #endif 1622 #endif
1854 1623
1855 #ifdef PNG_WRITE_sCAL_SUPPORTED 1624 #ifdef PNG_WRITE_sCAL_SUPPORTED
1856 /* Write the sCAL chunk */ 1625 /* Write the sCAL chunk */
1626 #if defined(PNG_FLOATING_POINT_SUPPORTED) && defined(PNG_STDIO_SUPPORTED)
1857 void /* PRIVATE */ 1627 void /* PRIVATE */
1858 png_write_sCAL_s(png_structrp png_ptr, int unit, png_const_charp width, 1628 png_write_sCAL(png_structp png_ptr, int unit, double width, double height)
1859 png_const_charp height)
1860 { 1629 {
1630 #ifdef PNG_USE_LOCAL_ARRAYS
1631 PNG_sCAL;
1632 #endif
1633 char buf[64];
1634 png_size_t total_len;
1635
1636 png_debug(1, "in png_write_sCAL");
1637
1638 buf[0] = (char)unit;
1639 #ifdef _WIN32_WCE
1640 /* sprintf() function is not supported on WindowsCE */
1641 {
1642 wchar_t wc_buf[32];
1643 size_t wc_len;
1644 swprintf(wc_buf, TEXT("%12.12e"), width);
1645 wc_len = wcslen(wc_buf);
1646 WideCharToMultiByte(CP_ACP, 0, wc_buf, -1, buf + 1, wc_len, NULL,
1647 NULL);
1648 total_len = wc_len + 2;
1649 swprintf(wc_buf, TEXT("%12.12e"), height);
1650 wc_len = wcslen(wc_buf);
1651 WideCharToMultiByte(CP_ACP, 0, wc_buf, -1, buf + total_len, wc_len,
1652 NULL, NULL);
1653 total_len += wc_len;
1654 }
1655 #else
1656 png_snprintf(buf + 1, 63, "%12.12e", width);
1657 total_len = 1 + png_strlen(buf + 1) + 1;
1658 png_snprintf(buf + total_len, 64-total_len, "%12.12e", height);
1659 total_len += png_strlen(buf + total_len);
1660 #endif
1661
1662 png_debug1(3, "sCAL total length = %u", (unsigned int)total_len);
1663 png_write_chunk(png_ptr, (png_bytep)png_sCAL, (png_bytep)buf, total_len);
1664 }
1665 #else
1666 #ifdef PNG_FIXED_POINT_SUPPORTED
1667 void /* PRIVATE */
1668 png_write_sCAL_s(png_structp png_ptr, int unit, png_charp width,
1669 png_charp height)
1670 {
1671 #ifdef PNG_USE_LOCAL_ARRAYS
1672 PNG_sCAL;
1673 #endif
1861 png_byte buf[64]; 1674 png_byte buf[64];
1862 png_size_t wlen, hlen, total_len; 1675 png_size_t wlen, hlen, total_len;
1863 1676
1864 png_debug(1, "in png_write_sCAL_s"); 1677 png_debug(1, "in png_write_sCAL_s");
1865 1678
1866 wlen = strlen(width); 1679 wlen = png_strlen(width);
1867 hlen = strlen(height); 1680 hlen = png_strlen(height);
1868 total_len = wlen + hlen + 2; 1681 total_len = wlen + hlen + 2;
1869
1870 if (total_len > 64) 1682 if (total_len > 64)
1871 { 1683 {
1872 png_warning(png_ptr, "Can't write sCAL (buffer too small)"); 1684 png_warning(png_ptr, "Can't write sCAL (buffer too small)");
1873 return; 1685 return;
1874 } 1686 }
1875 1687
1876 buf[0] = (png_byte)unit; 1688 buf[0] = (png_byte)unit;
1877 memcpy(buf + 1, width, wlen + 1); /* Append the '\0' here */ 1689 png_memcpy(buf + 1, width, wlen + 1); /* Append the '\0' here */
1878 memcpy(buf + wlen + 2, height, hlen); /* Do NOT append the '\0' here */ 1690 png_memcpy(buf + wlen + 2, height, hlen); /* Do NOT append the '\0' here */
1879 1691
1880 png_debug1(3, "sCAL total length = %u", (unsigned int)total_len); 1692 png_debug1(3, "sCAL total length = %u", (unsigned int)total_len);
1881 png_write_complete_chunk(png_ptr, png_sCAL, buf, total_len); 1693 png_write_chunk(png_ptr, (png_bytep)png_sCAL, buf, total_len);
1882 } 1694 }
1883 #endif 1695 #endif
1696 #endif
1697 #endif
1884 1698
1885 #ifdef PNG_WRITE_pHYs_SUPPORTED 1699 #ifdef PNG_WRITE_pHYs_SUPPORTED
1886 /* Write the pHYs chunk */ 1700 /* Write the pHYs chunk */
1887 void /* PRIVATE */ 1701 void /* PRIVATE */
1888 png_write_pHYs(png_structrp png_ptr, png_uint_32 x_pixels_per_unit, 1702 png_write_pHYs(png_structp png_ptr, png_uint_32 x_pixels_per_unit,
1889 png_uint_32 y_pixels_per_unit, 1703 png_uint_32 y_pixels_per_unit,
1890 int unit_type) 1704 int unit_type)
1891 { 1705 {
1706 #ifdef PNG_USE_LOCAL_ARRAYS
1707 PNG_pHYs;
1708 #endif
1892 png_byte buf[9]; 1709 png_byte buf[9];
1893 1710
1894 png_debug(1, "in png_write_pHYs"); 1711 png_debug(1, "in png_write_pHYs");
1895 1712
1896 if (unit_type >= PNG_RESOLUTION_LAST) 1713 if (unit_type >= PNG_RESOLUTION_LAST)
1897 png_warning(png_ptr, "Unrecognized unit type for pHYs chunk"); 1714 png_warning(png_ptr, "Unrecognized unit type for pHYs chunk");
1898 1715
1899 png_save_uint_32(buf, x_pixels_per_unit); 1716 png_save_uint_32(buf, x_pixels_per_unit);
1900 png_save_uint_32(buf + 4, y_pixels_per_unit); 1717 png_save_uint_32(buf + 4, y_pixels_per_unit);
1901 buf[8] = (png_byte)unit_type; 1718 buf[8] = (png_byte)unit_type;
1902 1719
1903 png_write_complete_chunk(png_ptr, png_pHYs, buf, (png_size_t)9); 1720 png_write_chunk(png_ptr, (png_bytep)png_pHYs, buf, (png_size_t)9);
1904 } 1721 }
1905 #endif 1722 #endif
1906 1723
1907 #ifdef PNG_WRITE_tIME_SUPPORTED 1724 #ifdef PNG_WRITE_tIME_SUPPORTED
1908 /* Write the tIME chunk. Use either png_convert_from_struct_tm() 1725 /* Write the tIME chunk. Use either png_convert_from_struct_tm()
1909 * or png_convert_from_time_t(), or fill in the structure yourself. 1726 * or png_convert_from_time_t(), or fill in the structure yourself.
1910 */ 1727 */
1911 void /* PRIVATE */ 1728 void /* PRIVATE */
1912 png_write_tIME(png_structrp png_ptr, png_const_timep mod_time) 1729 png_write_tIME(png_structp png_ptr, png_timep mod_time)
1913 { 1730 {
1731 #ifdef PNG_USE_LOCAL_ARRAYS
1732 PNG_tIME;
1733 #endif
1914 png_byte buf[7]; 1734 png_byte buf[7];
1915 1735
1916 png_debug(1, "in png_write_tIME"); 1736 png_debug(1, "in png_write_tIME");
1917 1737
1918 if (mod_time->month > 12 || mod_time->month < 1 || 1738 if (mod_time->month > 12 || mod_time->month < 1 ||
1919 mod_time->day > 31 || mod_time->day < 1 || 1739 mod_time->day > 31 || mod_time->day < 1 ||
1920 mod_time->hour > 23 || mod_time->second > 60) 1740 mod_time->hour > 23 || mod_time->second > 60)
1921 { 1741 {
1922 png_warning(png_ptr, "Invalid time specified for tIME chunk"); 1742 png_warning(png_ptr, "Invalid time specified for tIME chunk");
1923 return; 1743 return;
1924 } 1744 }
1925 1745
1926 png_save_uint_16(buf, mod_time->year); 1746 png_save_uint_16(buf, mod_time->year);
1927 buf[2] = mod_time->month; 1747 buf[2] = mod_time->month;
1928 buf[3] = mod_time->day; 1748 buf[3] = mod_time->day;
1929 buf[4] = mod_time->hour; 1749 buf[4] = mod_time->hour;
1930 buf[5] = mod_time->minute; 1750 buf[5] = mod_time->minute;
1931 buf[6] = mod_time->second; 1751 buf[6] = mod_time->second;
1932 1752
1933 png_write_complete_chunk(png_ptr, png_tIME, buf, (png_size_t)7); 1753 png_write_chunk(png_ptr, (png_bytep)png_tIME, buf, (png_size_t)7);
1934 } 1754 }
1935 #endif 1755 #endif
1936 1756
1937 /* Initializes the row writing capability of libpng */ 1757 /* Initializes the row writing capability of libpng */
1938 void /* PRIVATE */ 1758 void /* PRIVATE */
1939 png_write_start_row(png_structrp png_ptr) 1759 png_write_start_row(png_structp png_ptr)
1940 { 1760 {
1941 #ifdef PNG_WRITE_INTERLACING_SUPPORTED 1761 #ifdef PNG_WRITE_INTERLACING_SUPPORTED
1942 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */ 1762 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */
1943 1763
1944 /* Start of interlace block */ 1764 /* Start of interlace block */
1945 static PNG_CONST png_byte png_pass_start[7] = {0, 4, 0, 2, 0, 1, 0}; 1765 int png_pass_start[7] = {0, 4, 0, 2, 0, 1, 0};
1946 1766
1947 /* Offset to next interlace block */ 1767 /* Offset to next interlace block */
1948 static PNG_CONST png_byte png_pass_inc[7] = {8, 8, 4, 4, 2, 2, 1}; 1768 int png_pass_inc[7] = {8, 8, 4, 4, 2, 2, 1};
1949 1769
1950 /* Start of interlace block in the y direction */ 1770 /* Start of interlace block in the y direction */
1951 static PNG_CONST png_byte png_pass_ystart[7] = {0, 0, 4, 0, 2, 0, 1}; 1771 int png_pass_ystart[7] = {0, 0, 4, 0, 2, 0, 1};
1952 1772
1953 /* Offset to next interlace block in the y direction */ 1773 /* Offset to next interlace block in the y direction */
1954 static PNG_CONST png_byte png_pass_yinc[7] = {8, 8, 8, 4, 4, 2, 2}; 1774 int png_pass_yinc[7] = {8, 8, 8, 4, 4, 2, 2};
1955 #endif 1775 #endif
1956 1776
1957 png_alloc_size_t buf_size; 1777 png_size_t buf_size;
1958 int usr_pixel_depth;
1959 1778
1960 png_debug(1, "in png_write_start_row"); 1779 png_debug(1, "in png_write_start_row");
1961 1780
1962 usr_pixel_depth = png_ptr->usr_channels * png_ptr->usr_bit_depth; 1781 buf_size = (png_size_t)(PNG_ROWBYTES(
1963 buf_size = PNG_ROWBYTES(usr_pixel_depth, png_ptr->width) + 1; 1782 png_ptr->usr_channels*png_ptr->usr_bit_depth, png_ptr->width) + 1);
1964
1965 /* 1.5.6: added to allow checking in the row write code. */
1966 png_ptr->transformed_pixel_depth = png_ptr->pixel_depth;
1967 png_ptr->maximum_pixel_depth = (png_byte)usr_pixel_depth;
1968 1783
1969 /* Set up row buffer */ 1784 /* Set up row buffer */
1970 png_ptr->row_buf = (png_bytep)png_malloc(png_ptr, buf_size); 1785 png_ptr->row_buf = (png_bytep)png_malloc(png_ptr,
1971 1786 (png_uint_32)buf_size);
1972 png_ptr->row_buf[0] = PNG_FILTER_VALUE_NONE; 1787 png_ptr->row_buf[0] = PNG_FILTER_VALUE_NONE;
1973 1788
1974 #ifdef PNG_WRITE_FILTER_SUPPORTED 1789 #ifdef PNG_WRITE_FILTER_SUPPORTED
1975 /* Set up filtering buffer, if using this filter */ 1790 /* Set up filtering buffer, if using this filter */
1976 if (png_ptr->do_filter & PNG_FILTER_SUB) 1791 if (png_ptr->do_filter & PNG_FILTER_SUB)
1977 { 1792 {
1978 png_ptr->sub_row = (png_bytep)png_malloc(png_ptr, png_ptr->rowbytes + 1); 1793 png_ptr->sub_row = (png_bytep)png_malloc(png_ptr,
1979 1794 (png_uint_32)(png_ptr->rowbytes + 1));
1980 png_ptr->sub_row[0] = PNG_FILTER_VALUE_SUB; 1795 png_ptr->sub_row[0] = PNG_FILTER_VALUE_SUB;
1981 } 1796 }
1982 1797
1983 /* We only need to keep the previous row if we are using one of these. */ 1798 /* We only need to keep the previous row if we are using one of these. */
1984 if (png_ptr->do_filter & (PNG_FILTER_AVG | PNG_FILTER_UP | PNG_FILTER_PAETH)) 1799 if (png_ptr->do_filter & (PNG_FILTER_AVG | PNG_FILTER_UP | PNG_FILTER_PAETH))
1985 { 1800 {
1986 /* Set up previous row buffer */ 1801 /* Set up previous row buffer */
1987 png_ptr->prev_row = (png_bytep)png_calloc(png_ptr, buf_size); 1802 png_ptr->prev_row = (png_bytep)png_calloc(png_ptr,
1803 (png_uint_32)buf_size);
1988 1804
1989 if (png_ptr->do_filter & PNG_FILTER_UP) 1805 if (png_ptr->do_filter & PNG_FILTER_UP)
1990 { 1806 {
1991 png_ptr->up_row = (png_bytep)png_malloc(png_ptr, 1807 png_ptr->up_row = (png_bytep)png_malloc(png_ptr,
1992 png_ptr->rowbytes + 1); 1808 (png_uint_32)(png_ptr->rowbytes + 1));
1993
1994 png_ptr->up_row[0] = PNG_FILTER_VALUE_UP; 1809 png_ptr->up_row[0] = PNG_FILTER_VALUE_UP;
1995 } 1810 }
1996 1811
1997 if (png_ptr->do_filter & PNG_FILTER_AVG) 1812 if (png_ptr->do_filter & PNG_FILTER_AVG)
1998 { 1813 {
1999 png_ptr->avg_row = (png_bytep)png_malloc(png_ptr, 1814 png_ptr->avg_row = (png_bytep)png_malloc(png_ptr,
2000 png_ptr->rowbytes + 1); 1815 (png_uint_32)(png_ptr->rowbytes + 1));
2001
2002 png_ptr->avg_row[0] = PNG_FILTER_VALUE_AVG; 1816 png_ptr->avg_row[0] = PNG_FILTER_VALUE_AVG;
2003 } 1817 }
2004 1818
2005 if (png_ptr->do_filter & PNG_FILTER_PAETH) 1819 if (png_ptr->do_filter & PNG_FILTER_PAETH)
2006 { 1820 {
2007 png_ptr->paeth_row = (png_bytep)png_malloc(png_ptr, 1821 png_ptr->paeth_row = (png_bytep)png_malloc(png_ptr,
2008 png_ptr->rowbytes + 1); 1822 (png_uint_32)(png_ptr->rowbytes + 1));
2009
2010 png_ptr->paeth_row[0] = PNG_FILTER_VALUE_PAETH; 1823 png_ptr->paeth_row[0] = PNG_FILTER_VALUE_PAETH;
2011 } 1824 }
2012 } 1825 }
2013 #endif /* PNG_WRITE_FILTER_SUPPORTED */ 1826 #endif /* PNG_WRITE_FILTER_SUPPORTED */
2014 1827
2015 #ifdef PNG_WRITE_INTERLACING_SUPPORTED 1828 #ifdef PNG_WRITE_INTERLACING_SUPPORTED
2016 /* If interlaced, we need to set up width and height of pass */ 1829 /* If interlaced, we need to set up width and height of pass */
2017 if (png_ptr->interlaced) 1830 if (png_ptr->interlaced)
2018 { 1831 {
2019 if (!(png_ptr->transformations & PNG_INTERLACE)) 1832 if (!(png_ptr->transformations & PNG_INTERLACE))
2020 { 1833 {
2021 png_ptr->num_rows = (png_ptr->height + png_pass_yinc[0] - 1 - 1834 png_ptr->num_rows = (png_ptr->height + png_pass_yinc[0] - 1 -
2022 png_pass_ystart[0]) / png_pass_yinc[0]; 1835 png_pass_ystart[0]) / png_pass_yinc[0];
2023
2024 png_ptr->usr_width = (png_ptr->width + png_pass_inc[0] - 1 - 1836 png_ptr->usr_width = (png_ptr->width + png_pass_inc[0] - 1 -
2025 png_pass_start[0]) / png_pass_inc[0]; 1837 png_pass_start[0]) / png_pass_inc[0];
2026 } 1838 }
2027
2028 else 1839 else
2029 { 1840 {
2030 png_ptr->num_rows = png_ptr->height; 1841 png_ptr->num_rows = png_ptr->height;
2031 png_ptr->usr_width = png_ptr->width; 1842 png_ptr->usr_width = png_ptr->width;
2032 } 1843 }
2033 } 1844 }
2034
2035 else 1845 else
2036 #endif 1846 #endif
2037 { 1847 {
2038 png_ptr->num_rows = png_ptr->height; 1848 png_ptr->num_rows = png_ptr->height;
2039 png_ptr->usr_width = png_ptr->width; 1849 png_ptr->usr_width = png_ptr->width;
2040 } 1850 }
1851 png_ptr->zstream.avail_out = (uInt)png_ptr->zbuf_size;
1852 png_ptr->zstream.next_out = png_ptr->zbuf;
2041 } 1853 }
2042 1854
2043 /* Internal use only. Called when finished processing a row of data. */ 1855 /* Internal use only. Called when finished processing a row of data. */
2044 void /* PRIVATE */ 1856 void /* PRIVATE */
2045 png_write_finish_row(png_structrp png_ptr) 1857 png_write_finish_row(png_structp png_ptr)
2046 { 1858 {
2047 #ifdef PNG_WRITE_INTERLACING_SUPPORTED 1859 #ifdef PNG_WRITE_INTERLACING_SUPPORTED
2048 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */ 1860 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */
2049 1861
2050 /* Start of interlace block */ 1862 /* Start of interlace block */
2051 static PNG_CONST png_byte png_pass_start[7] = {0, 4, 0, 2, 0, 1, 0}; 1863 int png_pass_start[7] = {0, 4, 0, 2, 0, 1, 0};
2052 1864
2053 /* Offset to next interlace block */ 1865 /* Offset to next interlace block */
2054 static PNG_CONST png_byte png_pass_inc[7] = {8, 8, 4, 4, 2, 2, 1}; 1866 int png_pass_inc[7] = {8, 8, 4, 4, 2, 2, 1};
2055 1867
2056 /* Start of interlace block in the y direction */ 1868 /* Start of interlace block in the y direction */
2057 static PNG_CONST png_byte png_pass_ystart[7] = {0, 0, 4, 0, 2, 0, 1}; 1869 int png_pass_ystart[7] = {0, 0, 4, 0, 2, 0, 1};
2058 1870
2059 /* Offset to next interlace block in the y direction */ 1871 /* Offset to next interlace block in the y direction */
2060 static PNG_CONST png_byte png_pass_yinc[7] = {8, 8, 8, 4, 4, 2, 2}; 1872 int png_pass_yinc[7] = {8, 8, 8, 4, 4, 2, 2};
2061 #endif 1873 #endif
2062 1874
1875 int ret;
1876
2063 png_debug(1, "in png_write_finish_row"); 1877 png_debug(1, "in png_write_finish_row");
2064 1878
2065 /* Next row */ 1879 /* Next row */
2066 png_ptr->row_number++; 1880 png_ptr->row_number++;
2067 1881
2068 /* See if we are done */ 1882 /* See if we are done */
2069 if (png_ptr->row_number < png_ptr->num_rows) 1883 if (png_ptr->row_number < png_ptr->num_rows)
2070 return; 1884 return;
2071 1885
2072 #ifdef PNG_WRITE_INTERLACING_SUPPORTED 1886 #ifdef PNG_WRITE_INTERLACING_SUPPORTED
2073 /* If interlaced, go to next pass */ 1887 /* If interlaced, go to next pass */
2074 if (png_ptr->interlaced) 1888 if (png_ptr->interlaced)
2075 { 1889 {
2076 png_ptr->row_number = 0; 1890 png_ptr->row_number = 0;
2077 if (png_ptr->transformations & PNG_INTERLACE) 1891 if (png_ptr->transformations & PNG_INTERLACE)
2078 { 1892 {
2079 png_ptr->pass++; 1893 png_ptr->pass++;
2080 } 1894 }
2081
2082 else 1895 else
2083 { 1896 {
2084 /* Loop until we find a non-zero width or height pass */ 1897 /* Loop until we find a non-zero width or height pass */
2085 do 1898 do
2086 { 1899 {
2087 png_ptr->pass++; 1900 png_ptr->pass++;
2088
2089 if (png_ptr->pass >= 7) 1901 if (png_ptr->pass >= 7)
2090 break; 1902 break;
2091
2092 png_ptr->usr_width = (png_ptr->width + 1903 png_ptr->usr_width = (png_ptr->width +
2093 png_pass_inc[png_ptr->pass] - 1 - 1904 png_pass_inc[png_ptr->pass] - 1 -
2094 png_pass_start[png_ptr->pass]) / 1905 png_pass_start[png_ptr->pass]) /
2095 png_pass_inc[png_ptr->pass]; 1906 png_pass_inc[png_ptr->pass];
2096
2097 png_ptr->num_rows = (png_ptr->height + 1907 png_ptr->num_rows = (png_ptr->height +
2098 png_pass_yinc[png_ptr->pass] - 1 - 1908 png_pass_yinc[png_ptr->pass] - 1 -
2099 png_pass_ystart[png_ptr->pass]) / 1909 png_pass_ystart[png_ptr->pass]) /
2100 png_pass_yinc[png_ptr->pass]; 1910 png_pass_yinc[png_ptr->pass];
2101
2102 if (png_ptr->transformations & PNG_INTERLACE) 1911 if (png_ptr->transformations & PNG_INTERLACE)
2103 break; 1912 break;
2104
2105 } while (png_ptr->usr_width == 0 || png_ptr->num_rows == 0); 1913 } while (png_ptr->usr_width == 0 || png_ptr->num_rows == 0);
2106 1914
2107 } 1915 }
2108 1916
2109 /* Reset the row above the image for the next pass */ 1917 /* Reset the row above the image for the next pass */
2110 if (png_ptr->pass < 7) 1918 if (png_ptr->pass < 7)
2111 { 1919 {
2112 if (png_ptr->prev_row != NULL) 1920 if (png_ptr->prev_row != NULL)
2113 memset(png_ptr->prev_row, 0, 1921 png_memset(png_ptr->prev_row, 0,
2114 (png_size_t)(PNG_ROWBYTES(png_ptr->usr_channels* 1922 (png_size_t)(PNG_ROWBYTES(png_ptr->usr_channels*
2115 png_ptr->usr_bit_depth, png_ptr->width)) + 1); 1923 png_ptr->usr_bit_depth, png_ptr->width)) + 1);
2116
2117 return; 1924 return;
2118 } 1925 }
2119 } 1926 }
2120 #endif 1927 #endif
2121 1928
2122 /* If we get here, we've just written the last row, so we need 1929 /* If we get here, we've just written the last row, so we need
2123 to flush the compressor */ 1930 to flush the compressor */
2124 png_compress_IDAT(png_ptr, NULL, 0, Z_FINISH); 1931 do
1932 {
1933 /* Tell the compressor we are done */
1934 ret = deflate(&png_ptr->zstream, Z_FINISH);
1935 /* Check for an error */
1936 if (ret == Z_OK)
1937 {
1938 /* Check to see if we need more room */
1939 if (!(png_ptr->zstream.avail_out))
1940 {
1941 png_write_IDAT(png_ptr, png_ptr->zbuf, png_ptr->zbuf_size);
1942 png_ptr->zstream.next_out = png_ptr->zbuf;
1943 png_ptr->zstream.avail_out = (uInt)png_ptr->zbuf_size;
1944 }
1945 }
1946 else if (ret != Z_STREAM_END)
1947 {
1948 if (png_ptr->zstream.msg != NULL)
1949 png_error(png_ptr, png_ptr->zstream.msg);
1950 else
1951 png_error(png_ptr, "zlib error");
1952 }
1953 } while (ret != Z_STREAM_END);
1954
1955 /* Write any extra space */
1956 if (png_ptr->zstream.avail_out < png_ptr->zbuf_size)
1957 {
1958 png_write_IDAT(png_ptr, png_ptr->zbuf, png_ptr->zbuf_size -
1959 png_ptr->zstream.avail_out);
1960 }
1961
1962 deflateReset(&png_ptr->zstream);
1963 png_ptr->zstream.data_type = Z_BINARY;
2125 } 1964 }
2126 1965
2127 #ifdef PNG_WRITE_INTERLACING_SUPPORTED 1966 #ifdef PNG_WRITE_INTERLACING_SUPPORTED
2128 /* Pick out the correct pixels for the interlace pass. 1967 /* Pick out the correct pixels for the interlace pass.
2129 * The basic idea here is to go through the row with a source 1968 * The basic idea here is to go through the row with a source
2130 * pointer and a destination pointer (sp and dp), and copy the 1969 * pointer and a destination pointer (sp and dp), and copy the
2131 * correct pixels for the pass. As the row gets compacted, 1970 * correct pixels for the pass. As the row gets compacted,
2132 * sp will always be >= dp, so we should never overwrite anything. 1971 * sp will always be >= dp, so we should never overwrite anything.
2133 * See the default: case for the easiest code to understand. 1972 * See the default: case for the easiest code to understand.
2134 */ 1973 */
2135 void /* PRIVATE */ 1974 void /* PRIVATE */
2136 png_do_write_interlace(png_row_infop row_info, png_bytep row, int pass) 1975 png_do_write_interlace(png_row_infop row_info, png_bytep row, int pass)
2137 { 1976 {
2138 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */ 1977 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */
2139 1978
2140 /* Start of interlace block */ 1979 /* Start of interlace block */
2141 static PNG_CONST png_byte png_pass_start[7] = {0, 4, 0, 2, 0, 1, 0}; 1980 int png_pass_start[7] = {0, 4, 0, 2, 0, 1, 0};
2142 1981
2143 /* Offset to next interlace block */ 1982 /* Offset to next interlace block */
2144 static PNG_CONST png_byte png_pass_inc[7] = {8, 8, 4, 4, 2, 2, 1}; 1983 int png_pass_inc[7] = {8, 8, 4, 4, 2, 2, 1};
2145 1984
2146 png_debug(1, "in png_do_write_interlace"); 1985 png_debug(1, "in png_do_write_interlace");
2147 1986
2148 /* We don't have to do anything on the last pass (6) */ 1987 /* We don't have to do anything on the last pass (6) */
1988 #ifdef PNG_USELESS_TESTS_SUPPORTED
1989 if (row != NULL && row_info != NULL && pass < 6)
1990 #else
2149 if (pass < 6) 1991 if (pass < 6)
1992 #endif
2150 { 1993 {
2151 /* Each pixel depth is handled separately */ 1994 /* Each pixel depth is handled separately */
2152 switch (row_info->pixel_depth) 1995 switch (row_info->pixel_depth)
2153 { 1996 {
2154 case 1: 1997 case 1:
2155 { 1998 {
2156 png_bytep sp; 1999 png_bytep sp;
2157 png_bytep dp; 2000 png_bytep dp;
2158 int shift; 2001 int shift;
2159 int d; 2002 int d;
2160 int value; 2003 int value;
2161 png_uint_32 i; 2004 png_uint_32 i;
2162 png_uint_32 row_width = row_info->width; 2005 png_uint_32 row_width = row_info->width;
2163 2006
2164 dp = row; 2007 dp = row;
2165 d = 0; 2008 d = 0;
2166 shift = 7; 2009 shift = 7;
2167
2168 for (i = png_pass_start[pass]; i < row_width; 2010 for (i = png_pass_start[pass]; i < row_width;
2169 i += png_pass_inc[pass]) 2011 i += png_pass_inc[pass])
2170 { 2012 {
2171 sp = row + (png_size_t)(i >> 3); 2013 sp = row + (png_size_t)(i >> 3);
2172 value = (int)(*sp >> (7 - (int)(i & 0x07))) & 0x01; 2014 value = (int)(*sp >> (7 - (int)(i & 0x07))) & 0x01;
2173 d |= (value << shift); 2015 d |= (value << shift);
2174 2016
2175 if (shift == 0) 2017 if (shift == 0)
2176 { 2018 {
2177 shift = 7; 2019 shift = 7;
2178 *dp++ = (png_byte)d; 2020 *dp++ = (png_byte)d;
2179 d = 0; 2021 d = 0;
2180 } 2022 }
2181
2182 else 2023 else
2183 shift--; 2024 shift--;
2184 2025
2185 } 2026 }
2186 if (shift != 7) 2027 if (shift != 7)
2187 *dp = (png_byte)d; 2028 *dp = (png_byte)d;
2188
2189 break; 2029 break;
2190 } 2030 }
2191
2192 case 2: 2031 case 2:
2193 { 2032 {
2194 png_bytep sp; 2033 png_bytep sp;
2195 png_bytep dp; 2034 png_bytep dp;
2196 int shift; 2035 int shift;
2197 int d; 2036 int d;
2198 int value; 2037 int value;
2199 png_uint_32 i; 2038 png_uint_32 i;
2200 png_uint_32 row_width = row_info->width; 2039 png_uint_32 row_width = row_info->width;
2201 2040
2202 dp = row; 2041 dp = row;
2203 shift = 6; 2042 shift = 6;
2204 d = 0; 2043 d = 0;
2205
2206 for (i = png_pass_start[pass]; i < row_width; 2044 for (i = png_pass_start[pass]; i < row_width;
2207 i += png_pass_inc[pass]) 2045 i += png_pass_inc[pass])
2208 { 2046 {
2209 sp = row + (png_size_t)(i >> 2); 2047 sp = row + (png_size_t)(i >> 2);
2210 value = (*sp >> ((3 - (int)(i & 0x03)) << 1)) & 0x03; 2048 value = (*sp >> ((3 - (int)(i & 0x03)) << 1)) & 0x03;
2211 d |= (value << shift); 2049 d |= (value << shift);
2212 2050
2213 if (shift == 0) 2051 if (shift == 0)
2214 { 2052 {
2215 shift = 6; 2053 shift = 6;
2216 *dp++ = (png_byte)d; 2054 *dp++ = (png_byte)d;
2217 d = 0; 2055 d = 0;
2218 } 2056 }
2219
2220 else 2057 else
2221 shift -= 2; 2058 shift -= 2;
2222 } 2059 }
2223 if (shift != 6) 2060 if (shift != 6)
2224 *dp = (png_byte)d; 2061 *dp = (png_byte)d;
2225
2226 break; 2062 break;
2227 } 2063 }
2228
2229 case 4: 2064 case 4:
2230 { 2065 {
2231 png_bytep sp; 2066 png_bytep sp;
2232 png_bytep dp; 2067 png_bytep dp;
2233 int shift; 2068 int shift;
2234 int d; 2069 int d;
2235 int value; 2070 int value;
2236 png_uint_32 i; 2071 png_uint_32 i;
2237 png_uint_32 row_width = row_info->width; 2072 png_uint_32 row_width = row_info->width;
2238 2073
2239 dp = row; 2074 dp = row;
2240 shift = 4; 2075 shift = 4;
2241 d = 0; 2076 d = 0;
2242 for (i = png_pass_start[pass]; i < row_width; 2077 for (i = png_pass_start[pass]; i < row_width;
2243 i += png_pass_inc[pass]) 2078 i += png_pass_inc[pass])
2244 { 2079 {
2245 sp = row + (png_size_t)(i >> 1); 2080 sp = row + (png_size_t)(i >> 1);
2246 value = (*sp >> ((1 - (int)(i & 0x01)) << 2)) & 0x0f; 2081 value = (*sp >> ((1 - (int)(i & 0x01)) << 2)) & 0x0f;
2247 d |= (value << shift); 2082 d |= (value << shift);
2248 2083
2249 if (shift == 0) 2084 if (shift == 0)
2250 { 2085 {
2251 shift = 4; 2086 shift = 4;
2252 *dp++ = (png_byte)d; 2087 *dp++ = (png_byte)d;
2253 d = 0; 2088 d = 0;
2254 } 2089 }
2255
2256 else 2090 else
2257 shift -= 4; 2091 shift -= 4;
2258 } 2092 }
2259 if (shift != 4) 2093 if (shift != 4)
2260 *dp = (png_byte)d; 2094 *dp = (png_byte)d;
2261
2262 break; 2095 break;
2263 } 2096 }
2264
2265 default: 2097 default:
2266 { 2098 {
2267 png_bytep sp; 2099 png_bytep sp;
2268 png_bytep dp; 2100 png_bytep dp;
2269 png_uint_32 i; 2101 png_uint_32 i;
2270 png_uint_32 row_width = row_info->width; 2102 png_uint_32 row_width = row_info->width;
2271 png_size_t pixel_bytes; 2103 png_size_t pixel_bytes;
2272 2104
2273 /* Start at the beginning */ 2105 /* Start at the beginning */
2274 dp = row; 2106 dp = row;
2275
2276 /* Find out how many bytes each pixel takes up */ 2107 /* Find out how many bytes each pixel takes up */
2277 pixel_bytes = (row_info->pixel_depth >> 3); 2108 pixel_bytes = (row_info->pixel_depth >> 3);
2278 2109 /* Loop through the row, only looking at the pixels that
2279 /* Loop through the row, only looking at the pixels that matter */ 2110 matter */
2280 for (i = png_pass_start[pass]; i < row_width; 2111 for (i = png_pass_start[pass]; i < row_width;
2281 i += png_pass_inc[pass]) 2112 i += png_pass_inc[pass])
2282 { 2113 {
2283 /* Find out where the original pixel is */ 2114 /* Find out where the original pixel is */
2284 sp = row + (png_size_t)i * pixel_bytes; 2115 sp = row + (png_size_t)i * pixel_bytes;
2285
2286 /* Move the pixel */ 2116 /* Move the pixel */
2287 if (dp != sp) 2117 if (dp != sp)
2288 memcpy(dp, sp, pixel_bytes); 2118 png_memcpy(dp, sp, pixel_bytes);
2289
2290 /* Next pixel */ 2119 /* Next pixel */
2291 dp += pixel_bytes; 2120 dp += pixel_bytes;
2292 } 2121 }
2293 break; 2122 break;
2294 } 2123 }
2295 } 2124 }
2296 /* Set new row width */ 2125 /* Set new row width */
2297 row_info->width = (row_info->width + 2126 row_info->width = (row_info->width +
2298 png_pass_inc[pass] - 1 - 2127 png_pass_inc[pass] - 1 -
2299 png_pass_start[pass]) / 2128 png_pass_start[pass]) /
2300 png_pass_inc[pass]; 2129 png_pass_inc[pass];
2301 2130 row_info->rowbytes = PNG_ROWBYTES(row_info->pixel_depth,
2302 row_info->rowbytes = PNG_ROWBYTES(row_info->pixel_depth, 2131 row_info->width);
2303 row_info->width);
2304 } 2132 }
2305 } 2133 }
2306 #endif 2134 #endif
2307 2135
2308 /* This filters the row, chooses which filter to use, if it has not already 2136 /* This filters the row, chooses which filter to use, if it has not already
2309 * been specified by the application, and then writes the row out with the 2137 * been specified by the application, and then writes the row out with the
2310 * chosen filter. 2138 * chosen filter.
2311 */ 2139 */
2312 static void png_write_filtered_row(png_structrp png_ptr, png_bytep filtered_row,
2313 png_size_t row_bytes);
2314
2315 #define PNG_MAXSUM (((png_uint_32)(-1)) >> 1) 2140 #define PNG_MAXSUM (((png_uint_32)(-1)) >> 1)
2316 #define PNG_HISHIFT 10 2141 #define PNG_HISHIFT 10
2317 #define PNG_LOMASK ((png_uint_32)0xffffL) 2142 #define PNG_LOMASK ((png_uint_32)0xffffL)
2318 #define PNG_HIMASK ((png_uint_32)(~PNG_LOMASK >> PNG_HISHIFT)) 2143 #define PNG_HIMASK ((png_uint_32)(~PNG_LOMASK >> PNG_HISHIFT))
2319 void /* PRIVATE */ 2144 void /* PRIVATE */
2320 png_write_find_filter(png_structrp png_ptr, png_row_infop row_info) 2145 png_write_find_filter(png_structp png_ptr, png_row_infop row_info)
2321 { 2146 {
2322 png_bytep best_row; 2147 png_bytep best_row;
2323 #ifdef PNG_WRITE_FILTER_SUPPORTED 2148 #ifdef PNG_WRITE_FILTER_SUPPORTED
2324 png_bytep prev_row, row_buf; 2149 png_bytep prev_row, row_buf;
2325 png_uint_32 mins, bpp; 2150 png_uint_32 mins, bpp;
2326 png_byte filter_to_do = png_ptr->do_filter; 2151 png_byte filter_to_do = png_ptr->do_filter;
2327 png_size_t row_bytes = row_info->rowbytes; 2152 png_uint_32 row_bytes = row_info->rowbytes;
2328 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2153 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2329 int num_p_filters = png_ptr->num_prev_filters; 2154 int num_p_filters = (int)png_ptr->num_prev_filters;
2330 #endif 2155 #endif
2331 2156
2332 png_debug(1, "in png_write_find_filter"); 2157 png_debug(1, "in png_write_find_filter");
2333 2158
2334 #ifndef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2159 #ifndef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2335 if (png_ptr->row_number == 0 && filter_to_do == PNG_ALL_FILTERS) 2160 if (png_ptr->row_number == 0 && filter_to_do == PNG_ALL_FILTERS)
2336 { 2161 {
2337 /* These will never be selected so we need not test them. */ 2162 /* These will never be selected so we need not test them. */
2338 filter_to_do &= ~(PNG_FILTER_UP | PNG_FILTER_PAETH); 2163 filter_to_do &= ~(PNG_FILTER_UP | PNG_FILTER_PAETH);
2339 } 2164 }
2340 #endif 2165 #endif
2341 2166
2342 /* Find out how many bytes offset each pixel is */ 2167 /* Find out how many bytes offset each pixel is */
2343 bpp = (row_info->pixel_depth + 7) >> 3; 2168 bpp = (row_info->pixel_depth + 7) >> 3;
2344 2169
2345 prev_row = png_ptr->prev_row; 2170 prev_row = png_ptr->prev_row;
2346 #endif 2171 #endif
2347 best_row = png_ptr->row_buf; 2172 best_row = png_ptr->row_buf;
2348 #ifdef PNG_WRITE_FILTER_SUPPORTED 2173 #ifdef PNG_WRITE_FILTER_SUPPORTED
2349 row_buf = best_row; 2174 row_buf = best_row;
2350 mins = PNG_MAXSUM; 2175 mins = PNG_MAXSUM;
2351 2176
2352 /* The prediction method we use is to find which method provides the 2177 /* The prediction method we use is to find which method provides the
2353 * smallest value when summing the absolute values of the distances 2178 * smallest value when summing the absolute values of the distances
2354 * from zero, using anything >= 128 as negative numbers. This is known 2179 * from zero, using anything >= 128 as negative numbers. This is known
2355 * as the "minimum sum of absolute differences" heuristic. Other 2180 * as the "minimum sum of absolute differences" heuristic. Other
2356 * heuristics are the "weighted minimum sum of absolute differences" 2181 * heuristics are the "weighted minimum sum of absolute differences"
2357 * (experimental and can in theory improve compression), and the "zlib 2182 * (experimental and can in theory improve compression), and the "zlib
2358 * predictive" method (not implemented yet), which does test compressions 2183 * predictive" method (not implemented yet), which does test compressions
2359 * of lines using different filter methods, and then chooses the 2184 * of lines using different filter methods, and then chooses the
2360 * (series of) filter(s) that give minimum compressed data size (VERY 2185 * (series of) filter(s) that give minimum compressed data size (VERY
2361 * computationally expensive). 2186 * computationally expensive).
2362 * 2187 *
2363 * GRR 980525: consider also 2188 * GRR 980525: consider also
2364 *
2365 * (1) minimum sum of absolute differences from running average (i.e., 2189 * (1) minimum sum of absolute differences from running average (i.e.,
2366 * keep running sum of non-absolute differences & count of bytes) 2190 * keep running sum of non-absolute differences & count of bytes)
2367 * [track dispersion, too? restart average if dispersion too large?] 2191 * [track dispersion, too? restart average if dispersion too large?]
2368 *
2369 * (1b) minimum sum of absolute differences from sliding average, probably 2192 * (1b) minimum sum of absolute differences from sliding average, probably
2370 * with window size <= deflate window (usually 32K) 2193 * with window size <= deflate window (usually 32K)
2371 *
2372 * (2) minimum sum of squared differences from zero or running average 2194 * (2) minimum sum of squared differences from zero or running average
2373 * (i.e., ~ root-mean-square approach) 2195 * (i.e., ~ root-mean-square approach)
2374 */ 2196 */
2375 2197
2376 2198
2377 /* We don't need to test the 'no filter' case if this is the only filter 2199 /* We don't need to test the 'no filter' case if this is the only filter
2378 * that has been chosen, as it doesn't actually do anything to the data. 2200 * that has been chosen, as it doesn't actually do anything to the data.
2379 */ 2201 */
2380 if ((filter_to_do & PNG_FILTER_NONE) && filter_to_do != PNG_FILTER_NONE) 2202 if ((filter_to_do & PNG_FILTER_NONE) &&
2203 filter_to_do != PNG_FILTER_NONE)
2381 { 2204 {
2382 png_bytep rp; 2205 png_bytep rp;
2383 png_uint_32 sum = 0; 2206 png_uint_32 sum = 0;
2384 png_size_t i; 2207 png_uint_32 i;
2385 int v; 2208 int v;
2386 2209
2387 for (i = 0, rp = row_buf + 1; i < row_bytes; i++, rp++) 2210 for (i = 0, rp = row_buf + 1; i < row_bytes; i++, rp++)
2388 { 2211 {
2389 v = *rp; 2212 v = *rp;
2390 sum += (v < 128) ? v : 256 - v; 2213 sum += (v < 128) ? v : 256 - v;
2391 } 2214 }
2392 2215
2393 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2216 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2394 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2217 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2395 { 2218 {
2396 png_uint_32 sumhi, sumlo; 2219 png_uint_32 sumhi, sumlo;
2397 int j; 2220 int j;
2398 sumlo = sum & PNG_LOMASK; 2221 sumlo = sum & PNG_LOMASK;
2399 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK; /* Gives us some footroom */ 2222 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK; /* Gives us some footroom */
2400 2223
2401 /* Reduce the sum if we match any of the previous rows */ 2224 /* Reduce the sum if we match any of the previous rows */
2402 for (j = 0; j < num_p_filters; j++) 2225 for (j = 0; j < num_p_filters; j++)
2403 { 2226 {
2404 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_NONE) 2227 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_NONE)
2405 { 2228 {
2406 sumlo = (sumlo * png_ptr->filter_weights[j]) >> 2229 sumlo = (sumlo * png_ptr->filter_weights[j]) >>
2407 PNG_WEIGHT_SHIFT; 2230 PNG_WEIGHT_SHIFT;
2408
2409 sumhi = (sumhi * png_ptr->filter_weights[j]) >> 2231 sumhi = (sumhi * png_ptr->filter_weights[j]) >>
2410 PNG_WEIGHT_SHIFT; 2232 PNG_WEIGHT_SHIFT;
2411 } 2233 }
2412 } 2234 }
2413 2235
2414 /* Factor in the cost of this filter (this is here for completeness, 2236 /* Factor in the cost of this filter (this is here for completeness,
2415 * but it makes no sense to have a "cost" for the NONE filter, as 2237 * but it makes no sense to have a "cost" for the NONE filter, as
2416 * it has the minimum possible computational cost - none). 2238 * it has the minimum possible computational cost - none).
2417 */ 2239 */
2418 sumlo = (sumlo * png_ptr->filter_costs[PNG_FILTER_VALUE_NONE]) >> 2240 sumlo = (sumlo * png_ptr->filter_costs[PNG_FILTER_VALUE_NONE]) >>
2419 PNG_COST_SHIFT; 2241 PNG_COST_SHIFT;
2420
2421 sumhi = (sumhi * png_ptr->filter_costs[PNG_FILTER_VALUE_NONE]) >> 2242 sumhi = (sumhi * png_ptr->filter_costs[PNG_FILTER_VALUE_NONE]) >>
2422 PNG_COST_SHIFT; 2243 PNG_COST_SHIFT;
2423 2244
2424 if (sumhi > PNG_HIMASK) 2245 if (sumhi > PNG_HIMASK)
2425 sum = PNG_MAXSUM; 2246 sum = PNG_MAXSUM;
2426
2427 else 2247 else
2428 sum = (sumhi << PNG_HISHIFT) + sumlo; 2248 sum = (sumhi << PNG_HISHIFT) + sumlo;
2429 } 2249 }
2430 #endif 2250 #endif
2431 mins = sum; 2251 mins = sum;
2432 } 2252 }
2433 2253
2434 /* Sub filter */ 2254 /* Sub filter */
2435 if (filter_to_do == PNG_FILTER_SUB) 2255 if (filter_to_do == PNG_FILTER_SUB)
2436 /* It's the only filter so no testing is needed */ 2256 /* It's the only filter so no testing is needed */
2437 { 2257 {
2438 png_bytep rp, lp, dp; 2258 png_bytep rp, lp, dp;
2439 png_size_t i; 2259 png_uint_32 i;
2440
2441 for (i = 0, rp = row_buf + 1, dp = png_ptr->sub_row + 1; i < bpp; 2260 for (i = 0, rp = row_buf + 1, dp = png_ptr->sub_row + 1; i < bpp;
2442 i++, rp++, dp++) 2261 i++, rp++, dp++)
2443 { 2262 {
2444 *dp = *rp; 2263 *dp = *rp;
2445 } 2264 }
2446
2447 for (lp = row_buf + 1; i < row_bytes; 2265 for (lp = row_buf + 1; i < row_bytes;
2448 i++, rp++, lp++, dp++) 2266 i++, rp++, lp++, dp++)
2449 { 2267 {
2450 *dp = (png_byte)(((int)*rp - (int)*lp) & 0xff); 2268 *dp = (png_byte)(((int)*rp - (int)*lp) & 0xff);
2451 } 2269 }
2452
2453 best_row = png_ptr->sub_row; 2270 best_row = png_ptr->sub_row;
2454 } 2271 }
2455 2272
2456 else if (filter_to_do & PNG_FILTER_SUB) 2273 else if (filter_to_do & PNG_FILTER_SUB)
2457 { 2274 {
2458 png_bytep rp, dp, lp; 2275 png_bytep rp, dp, lp;
2459 png_uint_32 sum = 0, lmins = mins; 2276 png_uint_32 sum = 0, lmins = mins;
2460 png_size_t i; 2277 png_uint_32 i;
2461 int v; 2278 int v;
2462 2279
2463 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2280 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2464 /* We temporarily increase the "minimum sum" by the factor we 2281 /* We temporarily increase the "minimum sum" by the factor we
2465 * would reduce the sum of this filter, so that we can do the 2282 * would reduce the sum of this filter, so that we can do the
2466 * early exit comparison without scaling the sum each time. 2283 * early exit comparison without scaling the sum each time.
2467 */ 2284 */
2468 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2285 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2469 { 2286 {
2470 int j; 2287 int j;
2471 png_uint_32 lmhi, lmlo; 2288 png_uint_32 lmhi, lmlo;
2472 lmlo = lmins & PNG_LOMASK; 2289 lmlo = lmins & PNG_LOMASK;
2473 lmhi = (lmins >> PNG_HISHIFT) & PNG_HIMASK; 2290 lmhi = (lmins >> PNG_HISHIFT) & PNG_HIMASK;
2474 2291
2475 for (j = 0; j < num_p_filters; j++) 2292 for (j = 0; j < num_p_filters; j++)
2476 { 2293 {
2477 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_SUB) 2294 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_SUB)
2478 { 2295 {
2479 lmlo = (lmlo * png_ptr->inv_filter_weights[j]) >> 2296 lmlo = (lmlo * png_ptr->inv_filter_weights[j]) >>
2480 PNG_WEIGHT_SHIFT; 2297 PNG_WEIGHT_SHIFT;
2481
2482 lmhi = (lmhi * png_ptr->inv_filter_weights[j]) >> 2298 lmhi = (lmhi * png_ptr->inv_filter_weights[j]) >>
2483 PNG_WEIGHT_SHIFT; 2299 PNG_WEIGHT_SHIFT;
2484 } 2300 }
2485 } 2301 }
2486 2302
2487 lmlo = (lmlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_SUB]) >> 2303 lmlo = (lmlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_SUB]) >>
2488 PNG_COST_SHIFT; 2304 PNG_COST_SHIFT;
2489
2490 lmhi = (lmhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_SUB]) >> 2305 lmhi = (lmhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_SUB]) >>
2491 PNG_COST_SHIFT; 2306 PNG_COST_SHIFT;
2492 2307
2493 if (lmhi > PNG_HIMASK) 2308 if (lmhi > PNG_HIMASK)
2494 lmins = PNG_MAXSUM; 2309 lmins = PNG_MAXSUM;
2495
2496 else 2310 else
2497 lmins = (lmhi << PNG_HISHIFT) + lmlo; 2311 lmins = (lmhi << PNG_HISHIFT) + lmlo;
2498 } 2312 }
2499 #endif 2313 #endif
2500 2314
2501 for (i = 0, rp = row_buf + 1, dp = png_ptr->sub_row + 1; i < bpp; 2315 for (i = 0, rp = row_buf + 1, dp = png_ptr->sub_row + 1; i < bpp;
2502 i++, rp++, dp++) 2316 i++, rp++, dp++)
2503 { 2317 {
2504 v = *dp = *rp; 2318 v = *dp = *rp;
2505 2319
2506 sum += (v < 128) ? v : 256 - v; 2320 sum += (v < 128) ? v : 256 - v;
2507 } 2321 }
2508
2509 for (lp = row_buf + 1; i < row_bytes; 2322 for (lp = row_buf + 1; i < row_bytes;
2510 i++, rp++, lp++, dp++) 2323 i++, rp++, lp++, dp++)
2511 { 2324 {
2512 v = *dp = (png_byte)(((int)*rp - (int)*lp) & 0xff); 2325 v = *dp = (png_byte)(((int)*rp - (int)*lp) & 0xff);
2513 2326
2514 sum += (v < 128) ? v : 256 - v; 2327 sum += (v < 128) ? v : 256 - v;
2515 2328
2516 if (sum > lmins) /* We are already worse, don't continue. */ 2329 if (sum > lmins) /* We are already worse, don't continue. */
2517 break; 2330 break;
2518 } 2331 }
2519 2332
2520 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2333 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2521 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2334 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2522 { 2335 {
2523 int j; 2336 int j;
2524 png_uint_32 sumhi, sumlo; 2337 png_uint_32 sumhi, sumlo;
2525 sumlo = sum & PNG_LOMASK; 2338 sumlo = sum & PNG_LOMASK;
2526 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK; 2339 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK;
2527 2340
2528 for (j = 0; j < num_p_filters; j++) 2341 for (j = 0; j < num_p_filters; j++)
2529 { 2342 {
2530 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_SUB) 2343 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_SUB)
2531 { 2344 {
2532 sumlo = (sumlo * png_ptr->inv_filter_weights[j]) >> 2345 sumlo = (sumlo * png_ptr->inv_filter_weights[j]) >>
2533 PNG_WEIGHT_SHIFT; 2346 PNG_WEIGHT_SHIFT;
2534
2535 sumhi = (sumhi * png_ptr->inv_filter_weights[j]) >> 2347 sumhi = (sumhi * png_ptr->inv_filter_weights[j]) >>
2536 PNG_WEIGHT_SHIFT; 2348 PNG_WEIGHT_SHIFT;
2537 } 2349 }
2538 } 2350 }
2539 2351
2540 sumlo = (sumlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_SUB]) >> 2352 sumlo = (sumlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_SUB]) >>
2541 PNG_COST_SHIFT; 2353 PNG_COST_SHIFT;
2542
2543 sumhi = (sumhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_SUB]) >> 2354 sumhi = (sumhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_SUB]) >>
2544 PNG_COST_SHIFT; 2355 PNG_COST_SHIFT;
2545 2356
2546 if (sumhi > PNG_HIMASK) 2357 if (sumhi > PNG_HIMASK)
2547 sum = PNG_MAXSUM; 2358 sum = PNG_MAXSUM;
2548
2549 else 2359 else
2550 sum = (sumhi << PNG_HISHIFT) + sumlo; 2360 sum = (sumhi << PNG_HISHIFT) + sumlo;
2551 } 2361 }
2552 #endif 2362 #endif
2553 2363
2554 if (sum < mins) 2364 if (sum < mins)
2555 { 2365 {
2556 mins = sum; 2366 mins = sum;
2557 best_row = png_ptr->sub_row; 2367 best_row = png_ptr->sub_row;
2558 } 2368 }
2559 } 2369 }
2560 2370
2561 /* Up filter */ 2371 /* Up filter */
2562 if (filter_to_do == PNG_FILTER_UP) 2372 if (filter_to_do == PNG_FILTER_UP)
2563 { 2373 {
2564 png_bytep rp, dp, pp; 2374 png_bytep rp, dp, pp;
2565 png_size_t i; 2375 png_uint_32 i;
2566 2376
2567 for (i = 0, rp = row_buf + 1, dp = png_ptr->up_row + 1, 2377 for (i = 0, rp = row_buf + 1, dp = png_ptr->up_row + 1,
2568 pp = prev_row + 1; i < row_bytes; 2378 pp = prev_row + 1; i < row_bytes;
2569 i++, rp++, pp++, dp++) 2379 i++, rp++, pp++, dp++)
2570 { 2380 {
2571 *dp = (png_byte)(((int)*rp - (int)*pp) & 0xff); 2381 *dp = (png_byte)(((int)*rp - (int)*pp) & 0xff);
2572 } 2382 }
2573
2574 best_row = png_ptr->up_row; 2383 best_row = png_ptr->up_row;
2575 } 2384 }
2576 2385
2577 else if (filter_to_do & PNG_FILTER_UP) 2386 else if (filter_to_do & PNG_FILTER_UP)
2578 { 2387 {
2579 png_bytep rp, dp, pp; 2388 png_bytep rp, dp, pp;
2580 png_uint_32 sum = 0, lmins = mins; 2389 png_uint_32 sum = 0, lmins = mins;
2581 png_size_t i; 2390 png_uint_32 i;
2582 int v; 2391 int v;
2583 2392
2584 2393
2585 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2394 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2586 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2395 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2587 { 2396 {
2588 int j; 2397 int j;
2589 png_uint_32 lmhi, lmlo; 2398 png_uint_32 lmhi, lmlo;
2590 lmlo = lmins & PNG_LOMASK; 2399 lmlo = lmins & PNG_LOMASK;
2591 lmhi = (lmins >> PNG_HISHIFT) & PNG_HIMASK; 2400 lmhi = (lmins >> PNG_HISHIFT) & PNG_HIMASK;
2592 2401
2593 for (j = 0; j < num_p_filters; j++) 2402 for (j = 0; j < num_p_filters; j++)
2594 { 2403 {
2595 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_UP) 2404 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_UP)
2596 { 2405 {
2597 lmlo = (lmlo * png_ptr->inv_filter_weights[j]) >> 2406 lmlo = (lmlo * png_ptr->inv_filter_weights[j]) >>
2598 PNG_WEIGHT_SHIFT; 2407 PNG_WEIGHT_SHIFT;
2599
2600 lmhi = (lmhi * png_ptr->inv_filter_weights[j]) >> 2408 lmhi = (lmhi * png_ptr->inv_filter_weights[j]) >>
2601 PNG_WEIGHT_SHIFT; 2409 PNG_WEIGHT_SHIFT;
2602 } 2410 }
2603 } 2411 }
2604 2412
2605 lmlo = (lmlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_UP]) >> 2413 lmlo = (lmlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_UP]) >>
2606 PNG_COST_SHIFT; 2414 PNG_COST_SHIFT;
2607
2608 lmhi = (lmhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_UP]) >> 2415 lmhi = (lmhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_UP]) >>
2609 PNG_COST_SHIFT; 2416 PNG_COST_SHIFT;
2610 2417
2611 if (lmhi > PNG_HIMASK) 2418 if (lmhi > PNG_HIMASK)
2612 lmins = PNG_MAXSUM; 2419 lmins = PNG_MAXSUM;
2613
2614 else 2420 else
2615 lmins = (lmhi << PNG_HISHIFT) + lmlo; 2421 lmins = (lmhi << PNG_HISHIFT) + lmlo;
2616 } 2422 }
2617 #endif 2423 #endif
2618 2424
2619 for (i = 0, rp = row_buf + 1, dp = png_ptr->up_row + 1, 2425 for (i = 0, rp = row_buf + 1, dp = png_ptr->up_row + 1,
2620 pp = prev_row + 1; i < row_bytes; i++) 2426 pp = prev_row + 1; i < row_bytes; i++)
2621 { 2427 {
2622 v = *dp++ = (png_byte)(((int)*rp++ - (int)*pp++) & 0xff); 2428 v = *dp++ = (png_byte)(((int)*rp++ - (int)*pp++) & 0xff);
2623 2429
2624 sum += (v < 128) ? v : 256 - v; 2430 sum += (v < 128) ? v : 256 - v;
2625 2431
2626 if (sum > lmins) /* We are already worse, don't continue. */ 2432 if (sum > lmins) /* We are already worse, don't continue. */
2627 break; 2433 break;
2628 } 2434 }
2629 2435
2630 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2436 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2631 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2437 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2632 { 2438 {
2633 int j; 2439 int j;
2634 png_uint_32 sumhi, sumlo; 2440 png_uint_32 sumhi, sumlo;
2635 sumlo = sum & PNG_LOMASK; 2441 sumlo = sum & PNG_LOMASK;
2636 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK; 2442 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK;
2637 2443
2638 for (j = 0; j < num_p_filters; j++) 2444 for (j = 0; j < num_p_filters; j++)
2639 { 2445 {
2640 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_UP) 2446 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_UP)
2641 { 2447 {
2642 sumlo = (sumlo * png_ptr->filter_weights[j]) >> 2448 sumlo = (sumlo * png_ptr->filter_weights[j]) >>
2643 PNG_WEIGHT_SHIFT; 2449 PNG_WEIGHT_SHIFT;
2644
2645 sumhi = (sumhi * png_ptr->filter_weights[j]) >> 2450 sumhi = (sumhi * png_ptr->filter_weights[j]) >>
2646 PNG_WEIGHT_SHIFT; 2451 PNG_WEIGHT_SHIFT;
2647 } 2452 }
2648 } 2453 }
2649 2454
2650 sumlo = (sumlo * png_ptr->filter_costs[PNG_FILTER_VALUE_UP]) >> 2455 sumlo = (sumlo * png_ptr->filter_costs[PNG_FILTER_VALUE_UP]) >>
2651 PNG_COST_SHIFT; 2456 PNG_COST_SHIFT;
2652
2653 sumhi = (sumhi * png_ptr->filter_costs[PNG_FILTER_VALUE_UP]) >> 2457 sumhi = (sumhi * png_ptr->filter_costs[PNG_FILTER_VALUE_UP]) >>
2654 PNG_COST_SHIFT; 2458 PNG_COST_SHIFT;
2655 2459
2656 if (sumhi > PNG_HIMASK) 2460 if (sumhi > PNG_HIMASK)
2657 sum = PNG_MAXSUM; 2461 sum = PNG_MAXSUM;
2658
2659 else 2462 else
2660 sum = (sumhi << PNG_HISHIFT) + sumlo; 2463 sum = (sumhi << PNG_HISHIFT) + sumlo;
2661 } 2464 }
2662 #endif 2465 #endif
2663 2466
2664 if (sum < mins) 2467 if (sum < mins)
2665 { 2468 {
2666 mins = sum; 2469 mins = sum;
2667 best_row = png_ptr->up_row; 2470 best_row = png_ptr->up_row;
2668 } 2471 }
2669 } 2472 }
2670 2473
2671 /* Avg filter */ 2474 /* Avg filter */
2672 if (filter_to_do == PNG_FILTER_AVG) 2475 if (filter_to_do == PNG_FILTER_AVG)
2673 { 2476 {
2674 png_bytep rp, dp, pp, lp; 2477 png_bytep rp, dp, pp, lp;
2675 png_uint_32 i; 2478 png_uint_32 i;
2676
2677 for (i = 0, rp = row_buf + 1, dp = png_ptr->avg_row + 1, 2479 for (i = 0, rp = row_buf + 1, dp = png_ptr->avg_row + 1,
2678 pp = prev_row + 1; i < bpp; i++) 2480 pp = prev_row + 1; i < bpp; i++)
2679 { 2481 {
2680 *dp++ = (png_byte)(((int)*rp++ - ((int)*pp++ / 2)) & 0xff); 2482 *dp++ = (png_byte)(((int)*rp++ - ((int)*pp++ / 2)) & 0xff);
2681 } 2483 }
2682
2683 for (lp = row_buf + 1; i < row_bytes; i++) 2484 for (lp = row_buf + 1; i < row_bytes; i++)
2684 { 2485 {
2685 *dp++ = (png_byte)(((int)*rp++ - (((int)*pp++ + (int)*lp++) / 2)) 2486 *dp++ = (png_byte)(((int)*rp++ - (((int)*pp++ + (int)*lp++) / 2))
2686 & 0xff); 2487 & 0xff);
2687 } 2488 }
2688 best_row = png_ptr->avg_row; 2489 best_row = png_ptr->avg_row;
2689 } 2490 }
2690 2491
2691 else if (filter_to_do & PNG_FILTER_AVG) 2492 else if (filter_to_do & PNG_FILTER_AVG)
2692 { 2493 {
2693 png_bytep rp, dp, pp, lp; 2494 png_bytep rp, dp, pp, lp;
2694 png_uint_32 sum = 0, lmins = mins; 2495 png_uint_32 sum = 0, lmins = mins;
2695 png_size_t i; 2496 png_uint_32 i;
2696 int v; 2497 int v;
2697 2498
2698 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2499 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2699 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2500 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2700 { 2501 {
2701 int j; 2502 int j;
2702 png_uint_32 lmhi, lmlo; 2503 png_uint_32 lmhi, lmlo;
2703 lmlo = lmins & PNG_LOMASK; 2504 lmlo = lmins & PNG_LOMASK;
2704 lmhi = (lmins >> PNG_HISHIFT) & PNG_HIMASK; 2505 lmhi = (lmins >> PNG_HISHIFT) & PNG_HIMASK;
2705 2506
2706 for (j = 0; j < num_p_filters; j++) 2507 for (j = 0; j < num_p_filters; j++)
2707 { 2508 {
2708 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_AVG) 2509 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_AVG)
2709 { 2510 {
2710 lmlo = (lmlo * png_ptr->inv_filter_weights[j]) >> 2511 lmlo = (lmlo * png_ptr->inv_filter_weights[j]) >>
2711 PNG_WEIGHT_SHIFT; 2512 PNG_WEIGHT_SHIFT;
2712
2713 lmhi = (lmhi * png_ptr->inv_filter_weights[j]) >> 2513 lmhi = (lmhi * png_ptr->inv_filter_weights[j]) >>
2714 PNG_WEIGHT_SHIFT; 2514 PNG_WEIGHT_SHIFT;
2715 } 2515 }
2716 } 2516 }
2717 2517
2718 lmlo = (lmlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_AVG]) >> 2518 lmlo = (lmlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_AVG]) >>
2719 PNG_COST_SHIFT; 2519 PNG_COST_SHIFT;
2720
2721 lmhi = (lmhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_AVG]) >> 2520 lmhi = (lmhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_AVG]) >>
2722 PNG_COST_SHIFT; 2521 PNG_COST_SHIFT;
2723 2522
2724 if (lmhi > PNG_HIMASK) 2523 if (lmhi > PNG_HIMASK)
2725 lmins = PNG_MAXSUM; 2524 lmins = PNG_MAXSUM;
2726
2727 else 2525 else
2728 lmins = (lmhi << PNG_HISHIFT) + lmlo; 2526 lmins = (lmhi << PNG_HISHIFT) + lmlo;
2729 } 2527 }
2730 #endif 2528 #endif
2731 2529
2732 for (i = 0, rp = row_buf + 1, dp = png_ptr->avg_row + 1, 2530 for (i = 0, rp = row_buf + 1, dp = png_ptr->avg_row + 1,
2733 pp = prev_row + 1; i < bpp; i++) 2531 pp = prev_row + 1; i < bpp; i++)
2734 { 2532 {
2735 v = *dp++ = (png_byte)(((int)*rp++ - ((int)*pp++ / 2)) & 0xff); 2533 v = *dp++ = (png_byte)(((int)*rp++ - ((int)*pp++ / 2)) & 0xff);
2736 2534
2737 sum += (v < 128) ? v : 256 - v; 2535 sum += (v < 128) ? v : 256 - v;
2738 } 2536 }
2739
2740 for (lp = row_buf + 1; i < row_bytes; i++) 2537 for (lp = row_buf + 1; i < row_bytes; i++)
2741 { 2538 {
2742 v = *dp++ = 2539 v = *dp++ =
2743 (png_byte)(((int)*rp++ - (((int)*pp++ + (int)*lp++) / 2)) & 0xff); 2540 (png_byte)(((int)*rp++ - (((int)*pp++ + (int)*lp++) / 2)) & 0xff);
2744 2541
2745 sum += (v < 128) ? v : 256 - v; 2542 sum += (v < 128) ? v : 256 - v;
2746 2543
2747 if (sum > lmins) /* We are already worse, don't continue. */ 2544 if (sum > lmins) /* We are already worse, don't continue. */
2748 break; 2545 break;
2749 } 2546 }
2750 2547
2751 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2548 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2752 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2549 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2753 { 2550 {
2754 int j; 2551 int j;
2755 png_uint_32 sumhi, sumlo; 2552 png_uint_32 sumhi, sumlo;
2756 sumlo = sum & PNG_LOMASK; 2553 sumlo = sum & PNG_LOMASK;
2757 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK; 2554 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK;
2758 2555
2759 for (j = 0; j < num_p_filters; j++) 2556 for (j = 0; j < num_p_filters; j++)
2760 { 2557 {
2761 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_NONE) 2558 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_NONE)
2762 { 2559 {
2763 sumlo = (sumlo * png_ptr->filter_weights[j]) >> 2560 sumlo = (sumlo * png_ptr->filter_weights[j]) >>
2764 PNG_WEIGHT_SHIFT; 2561 PNG_WEIGHT_SHIFT;
2765
2766 sumhi = (sumhi * png_ptr->filter_weights[j]) >> 2562 sumhi = (sumhi * png_ptr->filter_weights[j]) >>
2767 PNG_WEIGHT_SHIFT; 2563 PNG_WEIGHT_SHIFT;
2768 } 2564 }
2769 } 2565 }
2770 2566
2771 sumlo = (sumlo * png_ptr->filter_costs[PNG_FILTER_VALUE_AVG]) >> 2567 sumlo = (sumlo * png_ptr->filter_costs[PNG_FILTER_VALUE_AVG]) >>
2772 PNG_COST_SHIFT; 2568 PNG_COST_SHIFT;
2773
2774 sumhi = (sumhi * png_ptr->filter_costs[PNG_FILTER_VALUE_AVG]) >> 2569 sumhi = (sumhi * png_ptr->filter_costs[PNG_FILTER_VALUE_AVG]) >>
2775 PNG_COST_SHIFT; 2570 PNG_COST_SHIFT;
2776 2571
2777 if (sumhi > PNG_HIMASK) 2572 if (sumhi > PNG_HIMASK)
2778 sum = PNG_MAXSUM; 2573 sum = PNG_MAXSUM;
2779
2780 else 2574 else
2781 sum = (sumhi << PNG_HISHIFT) + sumlo; 2575 sum = (sumhi << PNG_HISHIFT) + sumlo;
2782 } 2576 }
2783 #endif 2577 #endif
2784 2578
2785 if (sum < mins) 2579 if (sum < mins)
2786 { 2580 {
2787 mins = sum; 2581 mins = sum;
2788 best_row = png_ptr->avg_row; 2582 best_row = png_ptr->avg_row;
2789 } 2583 }
2790 } 2584 }
2791 2585
2792 /* Paeth filter */ 2586 /* Paeth filter */
2793 if (filter_to_do == PNG_FILTER_PAETH) 2587 if (filter_to_do == PNG_FILTER_PAETH)
2794 { 2588 {
2795 png_bytep rp, dp, pp, cp, lp; 2589 png_bytep rp, dp, pp, cp, lp;
2796 png_size_t i; 2590 png_uint_32 i;
2797
2798 for (i = 0, rp = row_buf + 1, dp = png_ptr->paeth_row + 1, 2591 for (i = 0, rp = row_buf + 1, dp = png_ptr->paeth_row + 1,
2799 pp = prev_row + 1; i < bpp; i++) 2592 pp = prev_row + 1; i < bpp; i++)
2800 { 2593 {
2801 *dp++ = (png_byte)(((int)*rp++ - (int)*pp++) & 0xff); 2594 *dp++ = (png_byte)(((int)*rp++ - (int)*pp++) & 0xff);
2802 } 2595 }
2803 2596
2804 for (lp = row_buf + 1, cp = prev_row + 1; i < row_bytes; i++) 2597 for (lp = row_buf + 1, cp = prev_row + 1; i < row_bytes; i++)
2805 { 2598 {
2806 int a, b, c, pa, pb, pc, p; 2599 int a, b, c, pa, pb, pc, p;
2807 2600
2808 b = *pp++; 2601 b = *pp++;
2809 c = *cp++; 2602 c = *cp++;
(...skipping 16 matching lines...) Expand all
2826 2619
2827 *dp++ = (png_byte)(((int)*rp++ - p) & 0xff); 2620 *dp++ = (png_byte)(((int)*rp++ - p) & 0xff);
2828 } 2621 }
2829 best_row = png_ptr->paeth_row; 2622 best_row = png_ptr->paeth_row;
2830 } 2623 }
2831 2624
2832 else if (filter_to_do & PNG_FILTER_PAETH) 2625 else if (filter_to_do & PNG_FILTER_PAETH)
2833 { 2626 {
2834 png_bytep rp, dp, pp, cp, lp; 2627 png_bytep rp, dp, pp, cp, lp;
2835 png_uint_32 sum = 0, lmins = mins; 2628 png_uint_32 sum = 0, lmins = mins;
2836 png_size_t i; 2629 png_uint_32 i;
2837 int v; 2630 int v;
2838 2631
2839 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2632 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2840 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2633 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2841 { 2634 {
2842 int j; 2635 int j;
2843 png_uint_32 lmhi, lmlo; 2636 png_uint_32 lmhi, lmlo;
2844 lmlo = lmins & PNG_LOMASK; 2637 lmlo = lmins & PNG_LOMASK;
2845 lmhi = (lmins >> PNG_HISHIFT) & PNG_HIMASK; 2638 lmhi = (lmins >> PNG_HISHIFT) & PNG_HIMASK;
2846 2639
2847 for (j = 0; j < num_p_filters; j++) 2640 for (j = 0; j < num_p_filters; j++)
2848 { 2641 {
2849 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_PAETH) 2642 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_PAETH)
2850 { 2643 {
2851 lmlo = (lmlo * png_ptr->inv_filter_weights[j]) >> 2644 lmlo = (lmlo * png_ptr->inv_filter_weights[j]) >>
2852 PNG_WEIGHT_SHIFT; 2645 PNG_WEIGHT_SHIFT;
2853
2854 lmhi = (lmhi * png_ptr->inv_filter_weights[j]) >> 2646 lmhi = (lmhi * png_ptr->inv_filter_weights[j]) >>
2855 PNG_WEIGHT_SHIFT; 2647 PNG_WEIGHT_SHIFT;
2856 } 2648 }
2857 } 2649 }
2858 2650
2859 lmlo = (lmlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_PAETH]) >> 2651 lmlo = (lmlo * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_PAETH]) >>
2860 PNG_COST_SHIFT; 2652 PNG_COST_SHIFT;
2861
2862 lmhi = (lmhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_PAETH]) >> 2653 lmhi = (lmhi * png_ptr->inv_filter_costs[PNG_FILTER_VALUE_PAETH]) >>
2863 PNG_COST_SHIFT; 2654 PNG_COST_SHIFT;
2864 2655
2865 if (lmhi > PNG_HIMASK) 2656 if (lmhi > PNG_HIMASK)
2866 lmins = PNG_MAXSUM; 2657 lmins = PNG_MAXSUM;
2867
2868 else 2658 else
2869 lmins = (lmhi << PNG_HISHIFT) + lmlo; 2659 lmins = (lmhi << PNG_HISHIFT) + lmlo;
2870 } 2660 }
2871 #endif 2661 #endif
2872 2662
2873 for (i = 0, rp = row_buf + 1, dp = png_ptr->paeth_row + 1, 2663 for (i = 0, rp = row_buf + 1, dp = png_ptr->paeth_row + 1,
2874 pp = prev_row + 1; i < bpp; i++) 2664 pp = prev_row + 1; i < bpp; i++)
2875 { 2665 {
2876 v = *dp++ = (png_byte)(((int)*rp++ - (int)*pp++) & 0xff); 2666 v = *dp++ = (png_byte)(((int)*rp++ - (int)*pp++) & 0xff);
2877 2667
2878 sum += (v < 128) ? v : 256 - v; 2668 sum += (v < 128) ? v : 256 - v;
2879 } 2669 }
2880 2670
2881 for (lp = row_buf + 1, cp = prev_row + 1; i < row_bytes; i++) 2671 for (lp = row_buf + 1, cp = prev_row + 1; i < row_bytes; i++)
2882 { 2672 {
2883 int a, b, c, pa, pb, pc, p; 2673 int a, b, c, pa, pb, pc, p;
2884 2674
(...skipping 12 matching lines...) Expand all
2897 pa = p < 0 ? -p : p; 2687 pa = p < 0 ? -p : p;
2898 pb = pc < 0 ? -pc : pc; 2688 pb = pc < 0 ? -pc : pc;
2899 pc = (p + pc) < 0 ? -(p + pc) : p + pc; 2689 pc = (p + pc) < 0 ? -(p + pc) : p + pc;
2900 #endif 2690 #endif
2901 p = (pa <= pb && pa <=pc) ? a : (pb <= pc) ? b : c; 2691 p = (pa <= pb && pa <=pc) ? a : (pb <= pc) ? b : c;
2902 #else /* PNG_SLOW_PAETH */ 2692 #else /* PNG_SLOW_PAETH */
2903 p = a + b - c; 2693 p = a + b - c;
2904 pa = abs(p - a); 2694 pa = abs(p - a);
2905 pb = abs(p - b); 2695 pb = abs(p - b);
2906 pc = abs(p - c); 2696 pc = abs(p - c);
2907
2908 if (pa <= pb && pa <= pc) 2697 if (pa <= pb && pa <= pc)
2909 p = a; 2698 p = a;
2910
2911 else if (pb <= pc) 2699 else if (pb <= pc)
2912 p = b; 2700 p = b;
2913
2914 else 2701 else
2915 p = c; 2702 p = c;
2916 #endif /* PNG_SLOW_PAETH */ 2703 #endif /* PNG_SLOW_PAETH */
2917 2704
2918 v = *dp++ = (png_byte)(((int)*rp++ - p) & 0xff); 2705 v = *dp++ = (png_byte)(((int)*rp++ - p) & 0xff);
2919 2706
2920 sum += (v < 128) ? v : 256 - v; 2707 sum += (v < 128) ? v : 256 - v;
2921 2708
2922 if (sum > lmins) /* We are already worse, don't continue. */ 2709 if (sum > lmins) /* We are already worse, don't continue. */
2923 break; 2710 break;
2924 } 2711 }
2925 2712
2926 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2713 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2927 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED) 2714 if (png_ptr->heuristic_method == PNG_FILTER_HEURISTIC_WEIGHTED)
2928 { 2715 {
2929 int j; 2716 int j;
2930 png_uint_32 sumhi, sumlo; 2717 png_uint_32 sumhi, sumlo;
2931 sumlo = sum & PNG_LOMASK; 2718 sumlo = sum & PNG_LOMASK;
2932 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK; 2719 sumhi = (sum >> PNG_HISHIFT) & PNG_HIMASK;
2933 2720
2934 for (j = 0; j < num_p_filters; j++) 2721 for (j = 0; j < num_p_filters; j++)
2935 { 2722 {
2936 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_PAETH) 2723 if (png_ptr->prev_filters[j] == PNG_FILTER_VALUE_PAETH)
2937 { 2724 {
2938 sumlo = (sumlo * png_ptr->filter_weights[j]) >> 2725 sumlo = (sumlo * png_ptr->filter_weights[j]) >>
2939 PNG_WEIGHT_SHIFT; 2726 PNG_WEIGHT_SHIFT;
2940
2941 sumhi = (sumhi * png_ptr->filter_weights[j]) >> 2727 sumhi = (sumhi * png_ptr->filter_weights[j]) >>
2942 PNG_WEIGHT_SHIFT; 2728 PNG_WEIGHT_SHIFT;
2943 } 2729 }
2944 } 2730 }
2945 2731
2946 sumlo = (sumlo * png_ptr->filter_costs[PNG_FILTER_VALUE_PAETH]) >> 2732 sumlo = (sumlo * png_ptr->filter_costs[PNG_FILTER_VALUE_PAETH]) >>
2947 PNG_COST_SHIFT; 2733 PNG_COST_SHIFT;
2948
2949 sumhi = (sumhi * png_ptr->filter_costs[PNG_FILTER_VALUE_PAETH]) >> 2734 sumhi = (sumhi * png_ptr->filter_costs[PNG_FILTER_VALUE_PAETH]) >>
2950 PNG_COST_SHIFT; 2735 PNG_COST_SHIFT;
2951 2736
2952 if (sumhi > PNG_HIMASK) 2737 if (sumhi > PNG_HIMASK)
2953 sum = PNG_MAXSUM; 2738 sum = PNG_MAXSUM;
2954
2955 else 2739 else
2956 sum = (sumhi << PNG_HISHIFT) + sumlo; 2740 sum = (sumhi << PNG_HISHIFT) + sumlo;
2957 } 2741 }
2958 #endif 2742 #endif
2959 2743
2960 if (sum < mins) 2744 if (sum < mins)
2961 { 2745 {
2962 best_row = png_ptr->paeth_row; 2746 best_row = png_ptr->paeth_row;
2963 } 2747 }
2964 } 2748 }
2965 #endif /* PNG_WRITE_FILTER_SUPPORTED */ 2749 #endif /* PNG_WRITE_FILTER_SUPPORTED */
2750 /* Do the actual writing of the filtered row data from the chosen filter. */
2966 2751
2967 /* Do the actual writing of the filtered row data from the chosen filter. */ 2752 png_write_filtered_row(png_ptr, best_row);
2968 png_write_filtered_row(png_ptr, best_row, row_info->rowbytes+1);
2969 2753
2970 #ifdef PNG_WRITE_FILTER_SUPPORTED 2754 #ifdef PNG_WRITE_FILTER_SUPPORTED
2971 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED 2755 #ifdef PNG_WRITE_WEIGHTED_FILTER_SUPPORTED
2972 /* Save the type of filter we picked this time for future calculations */ 2756 /* Save the type of filter we picked this time for future calculations */
2973 if (png_ptr->num_prev_filters > 0) 2757 if (png_ptr->num_prev_filters > 0)
2974 { 2758 {
2975 int j; 2759 int j;
2976
2977 for (j = 1; j < num_p_filters; j++) 2760 for (j = 1; j < num_p_filters; j++)
2978 { 2761 {
2979 png_ptr->prev_filters[j] = png_ptr->prev_filters[j - 1]; 2762 png_ptr->prev_filters[j] = png_ptr->prev_filters[j - 1];
2980 } 2763 }
2981
2982 png_ptr->prev_filters[j] = best_row[0]; 2764 png_ptr->prev_filters[j] = best_row[0];
2983 } 2765 }
2984 #endif 2766 #endif
2985 #endif /* PNG_WRITE_FILTER_SUPPORTED */ 2767 #endif /* PNG_WRITE_FILTER_SUPPORTED */
2986 } 2768 }
2987 2769
2988 2770
2989 /* Do the actual writing of a previously filtered row. */ 2771 /* Do the actual writing of a previously filtered row. */
2990 static void 2772 void /* PRIVATE */
2991 png_write_filtered_row(png_structrp png_ptr, png_bytep filtered_row, 2773 png_write_filtered_row(png_structp png_ptr, png_bytep filtered_row)
2992 png_size_t full_row_length/*includes filter byte*/)
2993 { 2774 {
2994 png_debug(1, "in png_write_filtered_row"); 2775 png_debug(1, "in png_write_filtered_row");
2995 2776
2996 png_debug1(2, "filter = %d", filtered_row[0]); 2777 png_debug1(2, "filter = %d", filtered_row[0]);
2778 /* Set up the zlib input buffer */
2997 2779
2998 png_compress_IDAT(png_ptr, filtered_row, full_row_length, Z_NO_FLUSH); 2780 png_ptr->zstream.next_in = filtered_row;
2781 png_ptr->zstream.avail_in = (uInt)png_ptr->row_info.rowbytes + 1;
2782 /* Repeat until we have compressed all the data */
2783 do
2784 {
2785 int ret; /* Return of zlib */
2786
2787 /* Compress the data */
2788 ret = deflate(&png_ptr->zstream, Z_NO_FLUSH);
2789 /* Check for compression errors */
2790 if (ret != Z_OK)
2791 {
2792 if (png_ptr->zstream.msg != NULL)
2793 png_error(png_ptr, png_ptr->zstream.msg);
2794 else
2795 png_error(png_ptr, "zlib error");
2796 }
2797
2798 /* See if it is time to write another IDAT */
2799 if (!(png_ptr->zstream.avail_out))
2800 {
2801 /* Write the IDAT and reset the zlib output buffer */
2802 png_write_IDAT(png_ptr, png_ptr->zbuf, png_ptr->zbuf_size);
2803 png_ptr->zstream.next_out = png_ptr->zbuf;
2804 png_ptr->zstream.avail_out = (uInt)png_ptr->zbuf_size;
2805 }
2806 /* Repeat until all data has been compressed */
2807 } while (png_ptr->zstream.avail_in);
2999 2808
3000 /* Swap the current and previous rows */ 2809 /* Swap the current and previous rows */
3001 if (png_ptr->prev_row != NULL) 2810 if (png_ptr->prev_row != NULL)
3002 { 2811 {
3003 png_bytep tptr; 2812 png_bytep tptr;
3004 2813
3005 tptr = png_ptr->prev_row; 2814 tptr = png_ptr->prev_row;
3006 png_ptr->prev_row = png_ptr->row_buf; 2815 png_ptr->prev_row = png_ptr->row_buf;
3007 png_ptr->row_buf = tptr; 2816 png_ptr->row_buf = tptr;
3008 } 2817 }
3009 2818
3010 /* Finish row - updates counters and flushes zlib if last row */ 2819 /* Finish row - updates counters and flushes zlib if last row */
3011 png_write_finish_row(png_ptr); 2820 png_write_finish_row(png_ptr);
3012 2821
3013 #ifdef PNG_WRITE_FLUSH_SUPPORTED 2822 #ifdef PNG_WRITE_FLUSH_SUPPORTED
3014 png_ptr->flush_rows++; 2823 png_ptr->flush_rows++;
3015 2824
3016 if (png_ptr->flush_dist > 0 && 2825 if (png_ptr->flush_dist > 0 &&
3017 png_ptr->flush_rows >= png_ptr->flush_dist) 2826 png_ptr->flush_rows >= png_ptr->flush_dist)
3018 { 2827 {
3019 png_write_flush(png_ptr); 2828 png_write_flush(png_ptr);
3020 } 2829 }
3021 #endif 2830 #endif
3022 } 2831 }
3023 #endif /* PNG_WRITE_SUPPORTED */ 2832 #endif /* PNG_WRITE_SUPPORTED */
OLDNEW
« no previous file with comments | « third_party/libpng/pngwtran.c ('k') | third_party/zlib/zlib.gyp » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698