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
|
/* pbmpscale.c - pixel scaling with jagged edge smoothing.
* AJCD 13/8/90
*/
#include <stdio.h>
#include "pbm.h"
#include "mallocvar.h"
/* prototypes */
void nextrow_pscale ARGS((FILE *ifd, int row));
int corner ARGS((int pat));
/* input bitmap size and storage */
int rows, columns, format ;
bit *inrow[3] ;
#define thisrow (1)
/* compass directions from west clockwise */
int xd_pscale[] = { -1, -1, 0, 1, 1, 1, 0, -1 } ;
int yd_pscale[] = { 0, -1, -1, -1, 0, 1, 1, 1 } ;
/* starting positions for corners */
#define NE(f) ((f) & 3)
#define SE(f) (((f) >> 2) & 3)
#define SW(f) (((f) >> 4) & 3)
#define NW(f) (((f) >> 6) & 3)
typedef unsigned short sixteenbits ;
/* list of corner patterns; bit 7 is current color, bits 0-6 are squares
* around (excluding square behind), going clockwise.
* The high byte of the patterns is a mask, which determines which bits are
* not ignored.
*/
sixteenbits patterns[] = { 0x0000, 0xd555, /* no corner */
0x0001, 0xffc1, 0xd514, /* normal corner */
0x0002, 0xd554, 0xd515, /* reduced corners */
0xbea2, 0xdfc0, 0xfd81,
0xfd80, 0xdf80,
0x0003, 0xbfa1, 0xfec2 /* reduced if > 1 */
};
/* search for corner patterns, return type of corner found:
* 0 = no corner,
* 1 = normal corner,
* 2 = reduced corner,
* 3 = reduced if cutoff > 1
*/
int corner(pat)
int pat;
{
register int i, r=0;
for (i = 0; i < sizeof(patterns)/sizeof(sixteenbits); i++)
if (patterns[i] < 0x100)
r = patterns[i];
else if ((pat & (patterns[i] >> 8)) ==
(patterns[i] & (patterns[i] >> 8)))
return r;
return 0;
}
/* get a new row
*/
void nextrow_pscale(ifd, row)
FILE *ifd;
int row;
{
bit *shuffle = inrow[0] ;
inrow[0] = inrow[1];
inrow[1] = inrow[2];
inrow[2] = shuffle ;
if (row < rows) {
if (shuffle == NULL)
inrow[2] = shuffle = pbm_allocrow(columns);
pbm_readpbmrow(ifd, inrow[2], columns, format) ;
} else inrow[2] = NULL; /* discard storage */
}
int
main(int argc, char ** argv) {
FILE * ifP;
bit * outrow;
unsigned int row;
int scale, cutoff, ucutoff ;
unsigned char *flags;
pbm_init( &argc, argv );
if (argc < 2)
pm_usage("scale [pbmfile]");
scale = atoi(argv[1]);
if (scale < 1)
pm_error("Scale argument must be at least one. You specified '%s'",
argv[1]);
if (argc == 3)
ifP = pm_openr(argv[2]);
else
ifP = stdin ;
inrow[0] = inrow[1] = inrow[2] = NULL;
pbm_readpbminit(ifP, &columns, &rows, &format) ;
outrow = pbm_allocrow(columns*scale) ;
MALLOCARRAY(flags, columns);
if (flags == NULL)
pm_error("out of memory") ;
pbm_writepbminit(stdout, columns*scale, rows*scale, 0) ;
cutoff = scale / 2;
ucutoff = scale - 1 - cutoff;
nextrow_pscale(ifP, 0);
for (row = 0; row < rows; ++row) {
unsigned int col;
unsigned int i;
nextrow_pscale(ifP, row+1);
for (col = 0; col < columns; ++col) {
unsigned int i;
flags[col] = 0 ;
for (i = 0; i != 8; i += 2) {
int vec = inrow[thisrow][col] != PBM_WHITE;
unsigned int k;
for (k = 0; k < 7; ++k) {
int x = col + xd_pscale[(k+i)&7] ;
int y = thisrow + yd_pscale[(k+i)&7] ;
vec <<= 1;
if (x >=0 && x < columns && inrow[y])
vec |= (inrow[y][x] != PBM_WHITE) ;
}
flags[col] |= corner(vec)<<i ;
}
}
for (i = 0; i < scale; i++) {
bit *ptr = outrow ;
int zone = (i > ucutoff) - (i < cutoff) ;
int cut = (zone < 0) ? (cutoff - i) :
(zone > 0) ? (i - ucutoff) : 0 ;
for (col = 0; col < columns; ++col) {
int pix = inrow[thisrow][col] ;
int flag = flags[col] ;
int cutl, cutr;
unsigned int k;
switch (zone) {
case -1:
switch (NW(flag)) {
case 0: cutl = 0; break;
case 1: cutl = cut; break;
case 2: cutl = cut ? cut-1 : 0; break;
case 3: cutl = (cut && cutoff > 1) ? cut-1 : cut; break;
default: cutl = 0; /* Should never reach here */
}
switch (NE(flag)) {
case 0: cutr = 0; break;
case 1: cutr = cut; break;
case 2: cutr = cut ? cut-1 : 0; break;
case 3: cutr = (cut && cutoff > 1) ? cut-1 : cut; break;
default: cutr = 0; /* Should never reach here */
}
break;
case 0:
cutl = cutr = 0;
break ;
case 1:
switch (SW(flag)) {
case 0: cutl = 0; break;
case 1: cutl = cut; break;
case 2: cutl = cut ? cut-1 : 0; break;
case 3: cutl = (cut && cutoff > 1) ? cut-1 : cut; break;
default: cutl = 0; /* should never reach here */
}
switch (SE(flag)) {
case 0: cutr = 0; break;
case 1: cutr = cut; break;
case 2: cutr = cut ? cut-1 : 0; break;
case 3: cutr = (cut && cutoff > 1) ? cut-1 : cut; break;
default: cutr = 0; /* should never reach here */
}
break;
default: cutl = 0; cutr = 0; /* Should never reach here */
}
for (k = 0; k < cutl; ++k) /* left part */
*ptr++ = !pix ;
for (k = 0; k < scale-cutl-cutr; ++k) /* center part */
*ptr++ = pix ;
for (k = 0; k < cutr; ++k) /* right part */
*ptr++ = !pix ;
}
pbm_writepbmrow(stdout, outrow, scale*columns, 0) ;
}
}
pm_close(ifP);
return 0;
}
|
