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
|
/* pnmtosgi.c - convert portable anymap to SGI image
**
** Copyright (C) 1994 by Ingo Wilken (Ingo.Wilken@informatik.uni-oldenburg.de)
**
** Based on the SGI image description v0.9 by Paul Haeberli (paul@sgi.comp)
** Available via ftp from sgi.com:graphics/SGIIMAGESPEC
**
** Permission to use, copy, modify, and distribute this software and its
** documentation for any purpose and without fee is hereby granted, provided
** that the above copyright notice appear in all copies and that both that
** copyright notice and this permission notice appear in supporting
** documentation. This software is provided "as is" without express or
** implied warranty.
**
** 29Jan94: first version
** Feb 2010 afu
** Added dimension check to prevent short int from overflowing
*/
#include <assert.h>
#include "pnm.h"
#include "sgi.h"
#include "mallocvar.h"
#include "runlength.h"
/*#define DEBUG*/
typedef uint16_t ScanElem;
typedef struct {
ScanElem * data;
long length;
} ScanLine;
#define MAXVAL_BYTE 255
#define MAXVAL_WORD 65535
#define INT16MAX 32767
static char storage = STORAGE_RLE;
static ScanLine * channel[3];
static xel * pnmrow;
#define putByte(b) (void)(putc((unsigned char)(b), stdout))
static void
putBigShort(short const s) {
if (pm_writebigshort(stdout, s ) == -1)
pm_error( "write error" );
}
static void
putBigLong(long const l) {
if (pm_writebiglong( stdout, l ) == -1)
pm_error( "write error" );
}
static void
putShortAsByte(short const s) {
putByte((unsigned char)s);
}
static void
writeTable(long * const table,
unsigned int const tabsize) {
unsigned int i;
unsigned long offset;
offset = HeaderSize + tabsize * 8;
for (i = 0; i < tabsize; ++i) {
putBigLong(offset);
offset += table[i];
}
for (i = 0; i < tabsize; ++i)
putBigLong(table[i]);
}
static void
writeChannels(unsigned int const cols,
unsigned int const rows,
unsigned int const channels,
void (*put) (short)) {
unsigned int i;
for (i = 0; i < channels; ++i) {
unsigned int row;
for (row = 0; row < rows; ++row) {
unsigned int col;
for (col = 0; col < channel[i][row].length; ++col) {
(*put)(channel[i][row].data[col]);
}
pm_rlenc_freebuf((unsigned char *) channel[i][row].data);
}
}
}
static ScanElem *
compress(ScanElem * const tempArg,
unsigned int const row,
unsigned int const rows,
unsigned int const cols,
unsigned int const chanNum,
long * const table,
unsigned int const bpc) {
/*----------------------------------------------------------------------------
Compress a row, putting results in global 'channel' array, in newly
allocated storage (which Caller must free).
Except that if the compression is null compression, we make 'channel'
point to existing storage, which Caller must not free. Yuck.
-----------------------------------------------------------------------------*/
ScanElem * retval;
switch (storage) {
case STORAGE_VERBATIM:
channel[chanNum][row].length = cols;
channel[chanNum][row].data = tempArg;
MALLOCARRAY_NOFAIL(retval, cols);
break;
case STORAGE_RLE: {
unsigned int const tabrow = chanNum * rows + row;
unsigned int len;
size_t lenBytes;
ScanElem * p;
pm_rlenc_allocoutbuf((unsigned char **) &p, cols, PM_RLE_SGI16);
pm_rlenc_compressword(tempArg,(unsigned char *) p, PM_RLE_SGI16,
cols, &lenBytes);
assert((unsigned)lenBytes == lenBytes);
/* Guaranteed by pm_rlenc_compressword() */
len = lenBytes / 2; /* sizeof(ScanElem) */
channel[chanNum][row].length = len;
REALLOCARRAY(p, len); /* reclaim some space */
if (p == NULL)
pm_error("realloc failure while reclaiming memory space "
"for output");
channel[chanNum][row].data = p;
table[tabrow] = len * bpc;
retval = tempArg;
} break;
default:
pm_error("unknown storage type - can't happen");
}
return retval;
}
static long *
buildChannels(FILE * const ifP,
unsigned int const cols,
unsigned int const rows,
xelval const maxval,
int const format,
unsigned int const bpc,
unsigned int const channels) {
unsigned int row;
unsigned int sgirow;
long * table;
ScanElem * temp;
if (storage != STORAGE_VERBATIM) {
MALLOCARRAY_NOFAIL(table, channels * rows);
} else
table = NULL;
MALLOCARRAY_NOFAIL(temp, cols);
{
unsigned int i;
for (i = 0; i < channels; ++i)
MALLOCARRAY_NOFAIL(channel[i], rows);
}
for (row = 0, sgirow = rows-1; row < rows; ++row, --sgirow) {
pnm_readpnmrow(ifP, pnmrow, cols, maxval, format);
if (channels == 1) {
unsigned int col;
for (col = 0; col < cols; ++col)
temp[col] = (ScanElem)PNM_GET1(pnmrow[col]);
temp = compress(temp, sgirow, rows, cols, 0, table, bpc);
} else {
unsigned int col;
for (col = 0; col < cols; ++col)
temp[col] = (ScanElem)PPM_GETR(pnmrow[col]);
temp = compress(temp, sgirow, rows, cols, 0, table, bpc);
for (col = 0; col < cols; ++col)
temp[col] = (ScanElem)PPM_GETG(pnmrow[col]);
temp = compress(temp, sgirow, rows, cols, 1, table, bpc);
for (col = 0; col < cols; ++col)
temp[col] = (ScanElem)PPM_GETB(pnmrow[col]);
temp = compress(temp, sgirow, rows, cols, 2, table, bpc);
}
}
free(temp);
return table;
}
static void
writeHeader(unsigned int const cols,
unsigned int const rows,
xelval const maxval,
unsigned int const bpc,
unsigned int const dimensions,
unsigned int const channels,
const char * const imagename) {
unsigned int i;
putBigShort(SGI_MAGIC);
putByte(storage);
putByte((char)bpc);
putBigShort(dimensions);
putBigShort(cols);
putBigShort(rows);
putBigShort(channels);
putBigLong(0); /* PIXMIN */
putBigLong(maxval); /* PIXMAX */
for(i = 0; i < 4; ++i)
putByte(0);
for (i = 0; i < 79 && imagename[i] != '\0'; ++i)
putByte(imagename[i]);
for(; i < 80; ++i)
putByte(0);
putBigLong(CMAP_NORMAL);
for (i = 0; i < 404; ++i)
putByte(0);
}
int
main(int argc,char * argv[]) {
FILE * ifP;
int argn;
const char * const usage = "[-verbatim|-rle] [-imagename <name>] [pnmfile]";
int cols, rows;
int format;
xelval maxval, newmaxval;
const char * imagename;
unsigned int bpc;
unsigned int dimensions;
unsigned int channels;
long * table;
pnm_init(&argc, argv);
imagename = "no name"; /* default value */
argn = 1;
while( argn < argc && argv[argn][0] == '-' && argv[argn][1] != '\0' ) {
if( pm_keymatch(argv[argn], "-verbatim", 2) )
storage = STORAGE_VERBATIM;
else
if( pm_keymatch(argv[argn], "-rle", 2) )
storage = STORAGE_RLE;
else
if( pm_keymatch(argv[argn], "-imagename", 2) ) {
if( ++argn >= argc )
pm_usage(usage);
imagename = argv[argn];
}
else
pm_usage(usage);
++argn;
}
if( argn < argc ) {
ifP = pm_openr( argv[argn] );
argn++;
}
else
ifP = stdin;
if( argn != argc )
pm_usage(usage);
pnm_readpnminit(ifP, &cols, &rows, &maxval, &format);
if (rows > INT16MAX || cols > INT16MAX)
pm_error ("Input image is too large.");
pnmrow = pnm_allocrow(cols);
switch (PNM_FORMAT_TYPE(format)) {
case PBM_TYPE:
pm_message("promoting PBM to PGM");
newmaxval = PGM_MAXMAXVAL;
case PGM_TYPE:
newmaxval = maxval;
dimensions = 2;
channels = 1;
break;
case PPM_TYPE:
newmaxval = maxval;
dimensions = 3;
channels = 3;
break;
default:
pm_error("can\'t happen");
}
if (newmaxval <= MAXVAL_BYTE)
bpc = 1;
else if (newmaxval <= MAXVAL_WORD)
bpc = 2;
else
pm_error("maxval too large - try using \"pnmdepth %u\"", MAXVAL_WORD);
table = buildChannels(ifP, cols, rows, newmaxval, format, bpc, channels);
pnm_freerow(pnmrow);
pm_close(ifP);
writeHeader(cols, rows, newmaxval, bpc, dimensions, channels, imagename);
if (table)
writeTable(table, rows * channels);
if (bpc == 1)
writeChannels(cols, rows, channels, putShortAsByte);
else
writeChannels(cols, rows, channels, putBigShort);
return 0;
}
|