VirtualBox

source: vbox/trunk/src/libs/libpng-1.6.45/pngwutil.c@ 107861

Last change on this file since 107861 was 107813, checked in by vboxsync, 5 weeks ago

libpng-1.6.45: Applied and adjusted our libpng changes to 1.6.45. bugref:8515

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

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette