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