about summary refs log tree commit diff
path: root/editor/specialty/pammixinterlace.c
blob: 28dace2560c62cb3c939820cbb1d7bf1a6603395 (plain) (blame)
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
/******************************************************************************
                             pammixinterlace
*******************************************************************************
  De-interlace an image by merging adjacent rows.

  Copyright (C) 2007 Bruce Guenter, FutureQuest, Inc.

  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.

******************************************************************************/

#define _DEFAULT_SOURCE /* New name for SVID & BSD source defines */
#define _BSD_SOURCE    /* Make sure strcaseeq() is in nstring.h */

#include <string.h>

#include "pm_c_util.h"
#include "mallocvar.h"
#include "nstring.h"
#include "shhopt.h"
#include "pam.h"



static sample
clamp(sample const val,
      sample const maxval) {

    return val < 0 ? 0 : val > maxval ? maxval : val;
}



static bool
distant(int const above,
        int const mid,
        int const below) {

    return abs(mid - (above + below) / 2) > abs(above - below);
}



static void
filterLinearBlend(tuple *      const outputrow,
                  tuple **     const tuplerowWindow,
                  unsigned int const width,
                  unsigned int const depth,
                  bool         const adaptive,
                  sample       const maxval) {

    unsigned int col;

    for (col = 0; col < width; ++col) {
        unsigned int plane;

        for (plane = 0; plane < depth; ++plane) {
            int const above = tuplerowWindow[0][col][plane];
            int const mid   = tuplerowWindow[1][col][plane];
            int const below = tuplerowWindow[2][col][plane];

            sample out;

            if (!adaptive || distant(above, mid, below))
                out = (above + mid * 2 + below) / 4;
            else
                out = mid;

            outputrow[col][plane] = out;
        }
    }
}



static void
filterFfmpeg(tuple *      const outputrow,
             tuple **     const tuplerowWindow,
             unsigned int const width,
             unsigned int const depth,
             bool         const adaptive,
             sample       const maxval) {

    unsigned int col;

    for (col = 0; col < width; ++col) {
        unsigned int plane;

        for (plane = 0; plane < depth; ++plane) {
            int const above = tuplerowWindow[1][col][plane];
            int const mid   = tuplerowWindow[2][col][plane];
            int const below = tuplerowWindow[3][col][plane];

            sample out;

            if (!adaptive || distant(above, mid, below)) {
                int const a = (- (int)tuplerowWindow[0][col][plane]
                                + above * 4
                                + mid * 2
                                + below * 4
                                - (int)tuplerowWindow[4][col][plane]) / 8;
                out = clamp(a, maxval);
            } else
                out = mid;

            outputrow[col][plane] = out;
        }
    }
}



static void
filterFIR(tuple *      const outputrow,
          tuple **     const tuplerowWindow,
          unsigned int const width,
          unsigned int const depth,
          bool         const adaptive,
          sample       const maxval) {

    unsigned int col;

    for (col = 0; col < width; ++col) {
        unsigned int plane;

        for (plane = 0; plane < depth; ++plane) {

            int const above = tuplerowWindow[1][col][plane];
            int const mid   = tuplerowWindow[2][col][plane];
            int const below = tuplerowWindow[3][col][plane];

            sample out;

            if (!adaptive || distant(above, mid, below)) {
                int const a = (- (int)tuplerowWindow[0][col][plane]
                                + above * 2
                                + mid * 6
                                + below * 2
                                - (int)tuplerowWindow[4][col][plane]) / 8;
                out = clamp(a, maxval);
            } else
                out = mid;

            outputrow[col][plane] = out;
        }
    }
}



struct filter {
    const char * name;          /* The command-line name of the filter */
    unsigned int rows;   /* The number of rows the filter operates on */
    void (*filter)(tuple *, tuple **,
                   unsigned int width, unsigned int depth,
                   bool adaptive, sample maxval);
};

static struct filter filters[] = {
    { "fir", 5, filterFIR }, /* FIR is cleanest and default filter */
    { "ffmpeg", 5, filterFfmpeg },
    { "linear", 3, filterLinearBlend },
};

struct cmdlineInfo {
    /* All the information the user supplied in the command line,
       in a form easy for the program to use.
    */
    const char * inputFileName;  /* Names of input files */
    struct filter * filterP;
    unsigned int adaptive;
};



static void
parseCommandLine(int argc, char ** 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.
-----------------------------------------------------------------------------*/
    optStruct3 opt;  /* set by OPTENT3 */
    optEntry * option_def;
    unsigned int option_def_index;
    const char * filterName;
    unsigned int filterSpec;

    MALLOCARRAY_NOFAIL(option_def, 100);

    option_def_index = 0;   /* incremented by OPTENT3 */
    OPTENT3(0, "filter",   OPT_STRING, &filterName, &filterSpec, 0);
    OPTENT3(0, "adaptive", OPT_FLAG, NULL, &cmdlineP->adaptive, 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, argv, opt, sizeof(opt), 0);
    /* Uses and sets argc, argv, and some of *cmdlineP and others. */

    if (!filterSpec)
        cmdlineP->filterP = &filters[0];
    else {
        unsigned int i;
        cmdlineP->filterP = NULL;
        for (i = 0; i < sizeof filters / sizeof(struct filter); ++i) {
            if (strcaseeq(filterName, filters[i].name)) {
                cmdlineP->filterP = &filters[i];
                break;
            }
        }
        if (!cmdlineP->filterP)
            pm_error("The filter name '%s' is not known.", filterName);
    }

    if (argc-1 < 1)
        cmdlineP->inputFileName = "-";
    else if (argc-1 == 1)
        cmdlineP->inputFileName = argv[1];
    else
        pm_error("You specified too many arguments (%d).  The only "
                 "argument is the optional input file specification.",
                 argc-1);
}



static void
allocateRowWindowBuffer(struct pam * const pamP,
                        tuple **     const tuplerowWindow,
                        unsigned int const rows) {

    unsigned int row;

    for (row = 0; row < rows; ++row)
        tuplerowWindow[row] = pnm_allocpamrow(pamP);
}



static void
freeRowWindowBuffer(tuple **     const tuplerowWindow,
                    unsigned int const rows) {

    unsigned int row;

    for (row = 0; row < rows; ++row)
        pnm_freepamrow(tuplerowWindow[row]);
}



static void
slideWindowDown(tuple **     const tuplerowWindow,
                unsigned int const rows) {
/*----------------------------------------------------------------------------
  Slide the rows-line tuple row window tuplerowWindow[] down one by moving
  pointers.
-----------------------------------------------------------------------------*/
    tuple * const oldrow0 = tuplerowWindow[0];

    unsigned int i;

    for (i = 0; i < rows-1; ++i)
        tuplerowWindow[i] = tuplerowWindow[i+1];

    tuplerowWindow[i] = oldrow0;
}



int
main(int argc, char *argv[]) {

    FILE * ifP;
    struct cmdlineInfo cmdline;
    struct pam inpam;
    struct pam outpam;
    tuple * tuplerowWindow[5];
    tuple * outputrow;
    unsigned int rows;

    pnm_init(&argc, argv);

    parseCommandLine(argc, argv, &cmdline);

    rows = cmdline.filterP->rows;

    ifP = pm_openr(cmdline.inputFileName);

    pnm_readpaminit(ifP, &inpam, PAM_STRUCT_SIZE(tuple_type));

    outpam = inpam;    /* Initial value -- most fields should be same */
    outpam.file = stdout;

    pnm_writepaminit(&outpam);

    allocateRowWindowBuffer(&inpam, tuplerowWindow, rows);
    outputrow = pnm_allocpamrow(&outpam);

    if (inpam.height < rows) {
        unsigned int row;
        pm_message("WARNING: Image height less than %d.  No mixing done.",
                   rows);
        for (row = 0; row < inpam.height; ++row) {
            pnm_readpamrow(&inpam, tuplerowWindow[0]);
            pnm_writepamrow(&outpam, tuplerowWindow[0]);
        }
    } else {
        unsigned int row;

    for (row = 0; row < rows-1; ++row)
        pnm_readpamrow(&inpam, tuplerowWindow[row]);

    /* Pass through first unfilterable rows */
    for (row = 0; row < rows/2; ++row)
        pnm_writepamrow(&outpam, tuplerowWindow[row]);

    for (row = rows / 2 + 1; row < inpam.height - rows / 2 + 1; ++row) {
        pnm_readpamrow(&inpam, tuplerowWindow[rows-1]);
        cmdline.filterP->filter(outputrow, tuplerowWindow,
                                inpam.width, inpam.depth,
                                cmdline.adaptive, inpam.maxval);
        pnm_writepamrow(&outpam, outputrow);

        slideWindowDown(tuplerowWindow, rows);
    }

    /* Pass through last rows */
    for (row = rows/2; row < rows-1; ++row)
        pnm_writepamrow(&outpam, tuplerowWindow[row]);
    }

    freeRowWindowBuffer(tuplerowWindow, rows);
    pnm_freepamrow(outputrow);
    pm_close(inpam.file);
    pm_close(outpam.file);

    return 0;
}