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