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
|
/******************************************************************************
pamfunc
*******************************************************************************
Apply one of various functions to each sample in a PAM image
By Bryan Henderson, San Jose CA 2002.06.16.
Contributed to the public domain
ENHANCEMENT IDEAS:
1) speed up by doing integer arithmetic instead of floating point for
multiply/divide where possible. Especially when multiplying by an
integer.
2) speed up by not transforming the raster in the idempotent cases
(e.g. multiply by one).
******************************************************************************/
#include "pm_c_util.h"
#include "mallocvar.h"
#include "nstring.h"
#include "shhopt.h"
#include "pam.h"
enum Function {
FN_MULTIPLY,
FN_DIVIDE,
FN_ADD,
FN_SUBTRACT,
FN_MIN,
FN_MAX,
FN_AND,
FN_OR,
FN_XOR,
FN_NOT,
FN_SHIFTLEFT,
FN_SHIFTRIGHT
};
/* Note that when the user specifies a minimum, that means he's requesting
a "max" function.
*/
struct CmdlineInfo {
/* All the information the user supplied in the command line,
in a form easy for the program to use.
*/
const char * inputFileName;
enum Function function;
union {
float multiplier;
float divisor;
int adder;
int subtractor;
unsigned int max;
unsigned int min;
unsigned int mask;
unsigned int shiftCount;
} u;
unsigned int changemaxval;
unsigned int verbose;
};
static unsigned int
parseHex(const char * const hexString) {
unsigned int retval;
char * tail;
retval = strtol(hexString, &tail, 16);
if (*tail != '\0')
pm_error("Invalid hex string '%s'. Junk: '%s'", hexString, tail);
return retval;
}
static void
parseCommandLine(int argc, const char ** const argv,
struct CmdlineInfo * const cmdlineP) {
/*----------------------------------------------------------------------------
Note that the file spec array we return is stored in the storage that
was passed to us as the argv array.
-----------------------------------------------------------------------------*/
optEntry * option_def;
/* Instructions to OptParseOptions3 on how to parse our options. */
optStruct3 opt;
unsigned int option_def_index;
unsigned int multiplierSpec, divisorSpec, adderSpec, subtractorSpec;
unsigned int maxSpec, minSpec;
unsigned int andmaskSpec, ormaskSpec, xormaskSpec, notSpec;
unsigned int shiftleftSpec, shiftrightSpec;
const char * mask;
MALLOCARRAY(option_def, 100);
option_def_index = 0; /* incremented by OPTENT3 */
OPTENT3(0, "multiplier", OPT_FLOAT, &cmdlineP->u.multiplier,
&multiplierSpec, 0);
OPTENT3(0, "divisor", OPT_FLOAT, &cmdlineP->u.divisor,
&divisorSpec, 0);
OPTENT3(0, "adder", OPT_INT, &cmdlineP->u.adder,
&adderSpec, 0);
OPTENT3(0, "subtractor", OPT_INT, &cmdlineP->u.subtractor,
&subtractorSpec, 0);
OPTENT3(0, "min", OPT_UINT, &cmdlineP->u.min,
&minSpec, 0);
OPTENT3(0, "max", OPT_UINT, &cmdlineP->u.max,
&maxSpec, 0);
OPTENT3(0, "andmask", OPT_STRING, &mask,
&andmaskSpec, 0);
OPTENT3(0, "ormask", OPT_STRING, &mask,
&ormaskSpec, 0);
OPTENT3(0, "xormask", OPT_STRING, &mask,
&xormaskSpec, 0);
OPTENT3(0, "not", OPT_FLAG, NULL,
¬Spec, 0);
OPTENT3(0, "shiftleft", OPT_UINT, &cmdlineP->u.shiftCount,
&shiftleftSpec, 0);
OPTENT3(0, "shiftright", OPT_UINT, &cmdlineP->u.shiftCount,
&shiftrightSpec, 0);
OPTENT3(0, "verbose", OPT_FLAG, NULL, &cmdlineP->verbose,
0);
OPTENT3(0, "changemaxval", OPT_FLAG, NULL, &cmdlineP->changemaxval,
0);
opt.opt_table = option_def;
opt.short_allowed = FALSE; /* We have no short (old-fashioned) options */
opt.allowNegNum = FALSE; /* We have no parms that are negative numbers */
pm_optParseOptions3(&argc, (char **)argv, opt, sizeof(opt), 0);
/* Uses and sets argc, argv, and some of *cmdlineP and others. */
if (multiplierSpec + divisorSpec + adderSpec + subtractorSpec +
minSpec + maxSpec + andmaskSpec + ormaskSpec + xormaskSpec + notSpec +
shiftleftSpec + shiftrightSpec > 1)
pm_error("You may specify at most one of -multiplier, -divisor,"
"-adder, -subtractor, -min, -max, "
"-andmask, -ormask, -xormask, -not, "
"-shiftleft, and -shiftright");
if (multiplierSpec) {
cmdlineP->function = FN_MULTIPLY;
if (cmdlineP->u.multiplier < 0)
pm_error("Multiplier must be nonnegative. You specified %f",
cmdlineP->u.multiplier);
} else if (divisorSpec) {
cmdlineP->function = FN_DIVIDE;
if (cmdlineP->u.divisor < 0)
pm_error("Divisor must be nonnegative. You specified %f",
cmdlineP->u.divisor);
} else if (adderSpec) {
cmdlineP->function = FN_ADD;
} else if (subtractorSpec) {
cmdlineP->function = FN_SUBTRACT;
} else if (minSpec) {
cmdlineP->function = FN_MAX;
} else if (maxSpec) {
cmdlineP->function = FN_MIN;
} else if (andmaskSpec) {
cmdlineP->function = FN_AND;
cmdlineP->u.mask = parseHex(mask);
} else if (ormaskSpec) {
cmdlineP->function = FN_OR;
cmdlineP->u.mask = parseHex(mask);
} else if (xormaskSpec) {
cmdlineP->function = FN_XOR;
cmdlineP->u.mask = parseHex(mask);
} else if (notSpec) {
cmdlineP->function = FN_NOT;
} else if (shiftleftSpec) {
cmdlineP->function = FN_SHIFTLEFT;
} else if (shiftrightSpec) {
cmdlineP->function = FN_SHIFTRIGHT;
} else
pm_error("You must specify one of -multiplier, -divisor, "
"-adder, -subtractor, -min, -max, "
"-and, -or, -xor, -not, -shiftleft, or -shiftright");
if (argc-1 > 1)
pm_error("Too many arguments (%d). File spec is the only argument.",
argc-1);
if (argc-1 < 1)
cmdlineP->inputFileName = "-";
else
cmdlineP->inputFileName = argv[1];
free(option_def);
}
static bool
isDyadicMaskFunction(enum Function const fn) {
return (fn == FN_AND || fn == FN_OR || fn == FN_XOR);
}
static bool
isMaskFunction(enum Function const fn) {
return (isDyadicMaskFunction(fn) || fn == FN_NOT);
}
static bool
isShiftFunction(enum Function const fn) {
return (fn == FN_SHIFTLEFT || fn == FN_SHIFTRIGHT);
}
static bool
isBitstringFunction(enum Function const fn) {
return isMaskFunction(fn) || isShiftFunction(fn);
}
static void
validateFunction(struct CmdlineInfo const cmdline,
const struct pam * const pamP) {
if (isBitstringFunction(cmdline.function)) {
if (pm_bitstomaxval(pm_maxvaltobits(pamP->maxval)) != pamP->maxval)
pm_error("For a bit string function, the maxval must be a full "
"binary count, i.e. a power of two minus one such as "
"0xff or 0x1. You have 0x%x",
(unsigned)pamP->maxval);
if (isDyadicMaskFunction(cmdline.function)) {
if ((cmdline.u.mask & pamP->maxval) != cmdline.u.mask)
pm_error("Your bit string mask 0x%x is wider than the samples "
"of the image (%u bits, according to the maxval %lu",
cmdline.u.mask, pm_maxvaltobits(pamP->maxval),
pamP->maxval);
}
if (isShiftFunction(cmdline.function)) {
if (cmdline.u.shiftCount > pm_maxvaltobits(pamP->maxval))
pm_error("Your shift count (%u) is greater than the width "
"of the samples of the image (%u bits, according "
"to the maxval %lu)",
cmdline.u.shiftCount, pm_maxvaltobits(pamP->maxval),
pamP->maxval);
}
}
}
static void
planTransform(struct CmdlineInfo const cmdline,
sample const inputMaxval,
int const outputFormat,
sample * const outputMaxvalP,
bool * const mustChangeRasterP) {
/*----------------------------------------------------------------------------
Plan the transform described by 'cmdline', given the maxval of the input
image is 'inputMaxval and the output format will be 'outputFormat'.
The plan just consists of whether to change the maxval or the raster.
Some multiplications and divisions can be achieved just by changing the
maxval and leaving the samples in the raster alone.
-----------------------------------------------------------------------------*/
if (cmdline.changemaxval) {
/* User allows us to change the maxval, if that makes it easier */
if (PNM_FORMAT_TYPE(outputFormat) == PBM_TYPE) {
*outputMaxvalP = inputMaxval;
*mustChangeRasterP = true;
} else {
if (cmdline.function == FN_MULTIPLY ||
cmdline.function == FN_DIVIDE) {
float const multiplier =
cmdline.function == FN_MULTIPLY ? cmdline.u.multiplier :
(1/cmdline.u.divisor);
float const neededMaxval = inputMaxval / multiplier;
if (neededMaxval + 0.5 < inputMaxval) {
/* Lowering the maxval might make some of the sample
values higher than the maxval, so we'd have to modify
the raster to clip them.
*/
*outputMaxvalP = inputMaxval;
*mustChangeRasterP = true;
} else if (neededMaxval > PAM_OVERALL_MAXVAL) {
*outputMaxvalP = inputMaxval;
*mustChangeRasterP = true;
} else {
*outputMaxvalP = ROUNDU(neededMaxval);
*mustChangeRasterP = false;
}
} else {
*outputMaxvalP = inputMaxval;
*mustChangeRasterP = true;
}
}
} else {
*outputMaxvalP = inputMaxval;
*mustChangeRasterP = true;
}
if (*outputMaxvalP != inputMaxval)
pm_message("Changing maxval to %u because of -changemaxval",
(unsigned)*outputMaxvalP);
}
static void
applyFunction(struct CmdlineInfo const cmdline,
struct pam const inpam,
struct pam const outpam,
tuple * const inputRow,
tuple * const outputRow) {
float const oneOverDivisor = 1/cmdline.u.divisor;
/* In my experiments, the compiler couldn't figure out that
1/cmdline.u.divisor is a constant and instead recomputed it
for each and every pixel. division is slower than
multiplication, so we want to multiply by
1/cmdline.u.divisor instead of divide by cmdline.u.divisor,
so we compute that here. Note that if the function isn't
divide, both cmdline.u.divisor and oneOverDivisor are
meaningless.
*/
unsigned int col;
for (col = 0; col < inpam.width; ++col) {
unsigned int plane;
for (plane = 0; plane < inpam.depth; ++plane) {
sample const inSample = inputRow[col][plane];
sample outSample; /* Could be > maxval */
switch (cmdline.function) {
case FN_MULTIPLY:
outSample = ROUNDU(inSample * cmdline.u.multiplier);
break;
case FN_DIVIDE:
outSample = ROUNDU(inSample * oneOverDivisor);
break;
case FN_ADD:
outSample = MAX(0, (long)inSample + cmdline.u.adder);
break;
case FN_SUBTRACT:
outSample = MAX(0, (long)inSample - cmdline.u.subtractor);
break;
case FN_MAX:
outSample = MAX(inSample, cmdline.u.min);
break;
case FN_MIN:
outSample = MIN(inSample, cmdline.u.max);
break;
case FN_AND:
outSample = inSample & cmdline.u.mask;
break;
case FN_OR:
outSample = inSample | cmdline.u.mask;
break;
case FN_XOR:
outSample = inSample ^ cmdline.u.mask;
break;
case FN_NOT:
outSample = ~inSample & outpam.maxval;
break;
case FN_SHIFTLEFT:
outSample =
(inSample << cmdline.u.shiftCount) & outpam.maxval;
break;
case FN_SHIFTRIGHT:
outSample = inSample >> cmdline.u.shiftCount;
break;
}
outputRow[col][plane] = MIN(outpam.maxval, outSample);
}
}
}
int
main(int argc, const char *argv[]) {
FILE * ifP;
tuple * inputRow; /* Row from input image */
tuple * outputRow; /* Row of output image */
unsigned int row;
struct CmdlineInfo cmdline;
struct pam inpam; /* Input PAM image */
struct pam outpam; /* Output PAM image */
bool mustChangeRaster;
pm_proginit(&argc, argv);
parseCommandLine(argc, argv, &cmdline);
ifP = pm_openr(cmdline.inputFileName);
pnm_readpaminit(ifP, &inpam, PAM_STRUCT_SIZE(tuple_type));
validateFunction(cmdline, &inpam);
inputRow = pnm_allocpamrow(&inpam);
outpam = inpam; /* Initial value -- most fields should be same */
outpam.file = stdout;
planTransform(cmdline, inpam.maxval, outpam.format,
&outpam.maxval, &mustChangeRaster);
if (outpam.maxval > 1 && strneq(outpam.tuple_type, "BLACKANDWHITE", 13))
strcpy(outpam.tuple_type, "");
pnm_writepaminit(&outpam);
outputRow = pnm_allocpamrow(&outpam);
for (row = 0; row < inpam.height; ++row) {
pnm_readpamrow(&inpam, inputRow);
if (mustChangeRaster) {
applyFunction(cmdline, inpam, outpam, inputRow, outputRow);
pnm_writepamrow(&outpam, outputRow);
} else
pnm_writepamrow(&outpam, inputRow);
}
pnm_freepamrow(outputRow);
pnm_freepamrow(inputRow);
pm_close(inpam.file);
pm_close(outpam.file);
return 0;
}
|