1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
|
/* Copyright (c) 2018, June McEnroe <programble@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <arpa/inet.h>
#include <assert.h>
#include <err.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sysexits.h>
#include <unistd.h>
#include <zlib.h>
#define PACKED __attribute__((packed))
#define CRC_INIT (crc32(0, Z_NULL, 0))
static const char *path;
static FILE *file;
static uint32_t crc;
static void readExpect(void *ptr, size_t size, const char *expect) {
fread(ptr, size, 1, file);
if (ferror(file)) err(EX_IOERR, "%s", path);
if (feof(file)) errx(EX_DATAERR, "%s: missing %s", path, expect);
crc = crc32(crc, ptr, size);
}
static void writeExpect(const void *ptr, size_t size) {
fwrite(ptr, size, 1, file);
if (ferror(file)) err(EX_IOERR, "%s", path);
crc = crc32(crc, ptr, size);
}
static const uint8_t SIGNATURE[8] = {
0x89, 'P', 'N', 'G', '\r', '\n', 0x1A, '\n'
};
static void readSignature(void) {
uint8_t signature[8];
readExpect(signature, 8, "signature");
if (0 != memcmp(signature, SIGNATURE, 8)) {
errx(EX_DATAERR, "%s: invalid signature", path);
}
}
static void writeSignature(void) {
writeExpect(SIGNATURE, sizeof(SIGNATURE));
}
struct PACKED Chunk {
uint32_t size;
char type[4];
};
static const char *typeStr(struct Chunk chunk) {
static char buf[5];
memcpy(buf, chunk.type, 4);
return buf;
}
static struct Chunk readChunk(void) {
struct Chunk chunk;
readExpect(&chunk, sizeof(chunk), "chunk");
chunk.size = ntohl(chunk.size);
crc = crc32(CRC_INIT, (Byte *)chunk.type, sizeof(chunk.type));
return chunk;
}
static void writeChunk(struct Chunk chunk) {
chunk.size = htonl(chunk.size);
writeExpect(&chunk, sizeof(chunk));
crc = crc32(CRC_INIT, (Byte *)chunk.type, sizeof(chunk.type));
}
static void readCrc(void) {
uint32_t expected = crc;
uint32_t found;
readExpect(&found, sizeof(found), "CRC32");
found = ntohl(found);
if (found != expected) {
errx(
EX_DATAERR, "%s: expected CRC32 %08X, found %08X",
path, expected, found
);
}
}
static void writeCrc(void) {
uint32_t net = htonl(crc);
writeExpect(&net, sizeof(net));
}
static void skipChunk(struct Chunk chunk) {
uint8_t discard[chunk.size];
readExpect(discard, sizeof(discard), "chunk data");
readCrc();
}
static struct PACKED {
uint32_t width;
uint32_t height;
uint8_t depth;
enum PACKED {
GRAYSCALE = 0,
TRUECOLOR = 2,
INDEXED = 3,
GRAYSCALE_ALPHA = 4,
TRUECOLOR_ALPHA = 6,
} color;
uint8_t compression;
uint8_t filter;
uint8_t interlace;
} header;
static_assert(13 == sizeof(header), "header size");
static size_t lineSize(void) {
switch (header.color) {
case GRAYSCALE: return (header.width * 1 * header.depth + 7) / 8;
case TRUECOLOR: return (header.width * 3 * header.depth + 7) / 8;
case INDEXED: return (header.width * 1 * header.depth + 7) / 8;
case GRAYSCALE_ALPHA: return (header.width * 2 * header.depth + 7) / 8;
case TRUECOLOR_ALPHA: return (header.width * 4 * header.depth + 7) / 8;
default: abort();
}
}
static size_t dataSize(void) {
return (1 + lineSize()) * header.height;
}
static void (void) {
struct Chunk ihdr = readChunk();
if (0 != memcmp(ihdr.type, "IHDR", 4)) {
errx(EX_DATAERR, "%s: expected IHDR, found %s", path, typeStr(ihdr));
}
if (ihdr.size != sizeof(header)) {
errx(
EX_DATAERR, "%s: expected IHDR size %zu, found %u",
path, sizeof(header), ihdr.size
);
}
readExpect(&header, sizeof(header), "header");
readCrc();
header.width = ntohl(header.width);
header.height = ntohl(header.height);
if (!header.width) errx(EX_DATAERR, "%s: invalid width 0", path);
if (!header.height) errx(EX_DATAERR, "%s: invalid height 0", path);
}
static void (void) {
struct Chunk ihdr = { .size = sizeof(header), .type = "IHDR" };
writeChunk(ihdr);
header.width = htonl(header.width);
header.height = htonl(header.height);
writeExpect(&header, sizeof(header));
writeCrc();
header.width = ntohl(header.width);
header.height = ntohl(header.height);
}
static struct {
uint32_t len;
uint8_t entries[256][3];
} palette;
static void readPalette(void) {
struct Chunk chunk;
for (;;) {
chunk = readChunk();
if (0 == memcmp(chunk.type, "PLTE", 4)) break;
skipChunk(chunk);
}
palette.len = chunk.size / 3;
readExpect(palette.entries, chunk.size, "palette data");
readCrc();
}
static void writePalette(void) {
struct Chunk plte = { .size = 3 * palette.len, .type = "PLTE" };
writeChunk(plte);
writeExpect(palette.entries, plte.size);
writeCrc();
}
static uint8_t *data;
static void readData(void) {
data = malloc(dataSize());
if (!data) err(EX_OSERR, "malloc(%zu)", dataSize());
struct z_stream_s stream = { .next_out = data, .avail_out = dataSize() };
int error = inflateInit(&stream);
if (error != Z_OK) errx(EX_SOFTWARE, "%s: inflateInit: %s", path, stream.msg);
for (;;) {
struct Chunk chunk = readChunk();
if (0 == memcmp(chunk.type, "IDAT", 4)) {
uint8_t idat[chunk.size];
readExpect(idat, sizeof(idat), "image data");
readCrc();
stream.next_in = idat;
stream.avail_in = sizeof(idat);
int error = inflate(&stream, Z_SYNC_FLUSH);
if (error == Z_STREAM_END) break;
if (error != Z_OK) errx(EX_DATAERR, "%s: inflate: %s", path, stream.msg);
} else if (0 == memcmp(chunk.type, "IEND", 4)) {
errx(EX_DATAERR, "%s: missing IDAT chunk", path);
} else {
skipChunk(chunk);
}
}
inflateEnd(&stream);
if (stream.total_out != dataSize()) {
errx(
EX_DATAERR, "%s: expected data size %zu, found %lu",
path, dataSize(), stream.total_out
);
}
}
static void writeData(void) {
uLong size = compressBound(dataSize());
uint8_t deflate[size];
int error = compress2(deflate, &size, data, dataSize(), Z_BEST_SPEED);
if (error != Z_OK) errx(EX_SOFTWARE, "%s: compress2: %d", path, error);
struct Chunk idat = { .size = size, .type = "IDAT" };
writeChunk(idat);
writeExpect(deflate, size);
writeCrc();
}
static void writeEnd(void) {
struct Chunk iend = { .size = 0, .type = "IEND" };
writeChunk(iend);
writeCrc();
}
enum PACKED Filter {
NONE,
SUB,
UP,
AVERAGE,
PAETH,
FILTER_COUNT,
};
static struct {
bool brokenPaeth;
bool filt;
bool recon;
uint8_t declareFilter;
uint8_t applyFilter;
enum Filter declareFilters[255];
enum Filter applyFilters[255];
} options;
struct Bytes {
uint8_t x;
uint8_t a;
uint8_t b;
uint8_t c;
};
static uint8_t paethPredictor(struct Bytes f) {
int32_t p = (int32_t)f.a + (int32_t)f.b - (int32_t)f.c;
int32_t pa = abs(p - (int32_t)f.a);
int32_t pb = abs(p - (int32_t)f.b);
int32_t pc = abs(p - (int32_t)f.c);
if (pa <= pb && pa <= pc) return f.a;
if (options.brokenPaeth) {
if (pb < pc) return f.b;
} else {
if (pb <= pc) return f.b;
}
return f.c;
}
static uint8_t recon(enum Filter type, struct Bytes f) {
switch (type) {
case NONE: return f.x;
case SUB: return f.x + f.a;
case UP: return f.x + f.b;
case AVERAGE: return f.x + ((uint32_t)f.a + (uint32_t)f.b) / 2;
case PAETH: return f.x + paethPredictor(f);
default: abort();
}
}
static uint8_t filt(enum Filter type, struct Bytes f) {
switch (type) {
case NONE: return f.x;
case SUB: return f.x - f.a;
case UP: return f.x - f.b;
case AVERAGE: return f.x - ((uint32_t)f.a + (uint32_t)f.b) / 2;
case PAETH: return f.x - paethPredictor(f);
default: abort();
}
}
static struct Line {
enum Filter type;
uint8_t data[];
} **lines;
static void scanlines(void) {
lines = calloc(header.height, sizeof(*lines));
if (!lines) err(EX_OSERR, "calloc(%u, %zu)", header.height, sizeof(*lines));
size_t stride = 1 + lineSize();
for (uint32_t y = 0; y < header.height; ++y) {
lines[y] = (struct Line *)&data[y * stride];
if (lines[y]->type >= FILTER_COUNT) {
errx(EX_DATAERR, "%s: invalid filter type %hhu", path, lines[y]->type);
}
}
}
static struct Bytes origBytes(uint32_t y, size_t i) {
size_t pixelSize = lineSize() / header.width;
if (!pixelSize) pixelSize = 1;
bool a = (i >= pixelSize), b = (y > 0), c = (a && b);
return (struct Bytes) {
.x = lines[y]->data[i],
.a = a ? lines[y]->data[i - pixelSize] : 0,
.b = b ? lines[y - 1]->data[i] : 0,
.c = c ? lines[y - 1]->data[i - pixelSize] : 0,
};
}
static void reconData(void) {
for (uint32_t y = 0; y < header.height; ++y) {
for (size_t i = 0; i < lineSize(); ++i) {
if (options.filt) {
lines[y]->data[i] = filt(lines[y]->type, origBytes(y, i));
} else {
lines[y]->data[i] = recon(lines[y]->type, origBytes(y, i));
}
}
lines[y]->type = NONE;
}
}
static void filterData(void) {
for (uint32_t y = header.height - 1; y < header.height; --y) {
uint8_t filter[FILTER_COUNT][lineSize()];
uint32_t heuristic[FILTER_COUNT] = {0};
enum Filter minType = NONE;
for (enum Filter type = NONE; type < FILTER_COUNT; ++type) {
for (size_t i = 0; i < lineSize(); ++i) {
if (options.recon) {
filter[type][i] = recon(type, origBytes(y, i));
} else {
filter[type][i] = filt(type, origBytes(y, i));
}
heuristic[type] += abs((int8_t)filter[type][i]);
}
if (heuristic[type] < heuristic[minType]) minType = type;
}
if (options.declareFilter) {
lines[y]->type = options.declareFilters[y % options.declareFilter];
} else {
lines[y]->type = minType;
}
if (options.applyFilter) {
enum Filter type = options.applyFilters[y % options.applyFilter];
memcpy(lines[y]->data, filter[type], lineSize());
} else {
memcpy(lines[y]->data, filter[minType], lineSize());
}
}
}
static void glitch(const char *inPath, const char *outPath) {
if (inPath) {
path = inPath;
file = fopen(path, "r");
if (!file) err(EX_NOINPUT, "%s", path);
} else {
path = "(stdin)";
file = stdin;
}
readSignature();
readHeader();
if (header.color == INDEXED) readPalette();
readData();
fclose(file);
scanlines();
reconData();
filterData();
free(lines);
if (outPath) {
path = outPath;
file = fopen(path, "w");
if (!file) err(EX_CANTCREAT, "%s", path);
} else {
path = "(stdout)";
file = stdout;
}
writeSignature();
writeHeader();
if (header.color == INDEXED) writePalette();
writeData();
writeEnd();
free(data);
int error = fclose(file);
if (error) err(EX_IOERR, "%s", path);
}
static enum Filter parseFilter(const char *s) {
switch (s[0]) {
case 'N': case 'n': return NONE;
case 'S': case 's': return SUB;
case 'U': case 'u': return UP;
case 'A': case 'a': return AVERAGE;
case 'P': case 'p': return PAETH;
default: errx(EX_USAGE, "invalid filter type %s", s);
}
}
static uint8_t parseFilters(enum Filter *filters, const char *s) {
uint8_t len = 0;
do {
filters[len++] = parseFilter(s);
s = strchr(s, ',');
} while (s++);
return len;
}
int main(int argc, char *argv[]) {
bool stdio = false;
char *output = NULL;
int opt;
while (0 < (opt = getopt(argc, argv, "a:cd:fo:pr"))) {
switch (opt) {
case 'a': {
options.applyFilter = parseFilters(options.applyFilters, optarg);
} break;
case 'c': stdio = true; break;
case 'd': {
options.declareFilter = parseFilters(options.declareFilters, optarg);
} break;
case 'f': options.filt = true; break;
case 'o': output = optarg; break;
case 'p': options.brokenPaeth = true; break;
case 'r': options.recon = true; break;
default: return EX_USAGE;
}
}
if (argc - optind == 1 && (output || stdio)) {
glitch(argv[optind], output);
} else if (optind < argc) {
for (int i = optind; i < argc; ++i) {
glitch(argv[i], argv[i]);
}
} else {
glitch(NULL, output);
}
return EX_OK;
}
|