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
|
/* Copyright (C) 2001-2023 Artifex Software, Inc.
All Rights Reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied,
modified or distributed except as expressly authorized under the terms
of the license contained in the file LICENSE in this distribution.
Refer to licensing information at http://www.artifex.com or contact
Artifex Software, Inc., 39 Mesa Street, Suite 108A, San Francisco,
CA 94129, USA, for further information.
*/
/* $Id */
/* Support functions for 1bpp Fax/Tiff devices */
#include "minftrsz.h"
#include "gserrors.h"
#include "gsmalloc.h"
#include "memory_.h"
/************************************************************************
*
* These functions implement raster data processing to ensure that the
* dot size and line width are at least some minimum number of pixels.
* This is needed for some printing technologies that cannot image pixels
* (or small groups of pixels) but that rasterize at full resolution to
* give better quality. The effect is to 'thicken' lines and expand
* independent pixels (which sets a minimum on the lightest halftoned
* gray value).
*
* While some of this can be done by setting a minimum on linewidth, this
* would have no effect on features painted with narrow fills or with
* monochrome images (sometimes pre-halftoned).
*
************************************************************************/
typedef struct min_feature_data_s {
gs_memory_t *memory;
int min_size;
int width; /* Pixels per line */
int height;
int cur_line;
int bytes_per_line;
byte *lines; /* vertical history lines */
byte *lines_prev[8]; /* pointers to previous lines */
/* lines_prev[0] is most recent */
byte remap_mid8[65536]; /* Horizontal pixel expansion map */
/* The h_remap array is indexed by the data byte with the 'extra' */
/* min_size bits to the left and right of the byte. Thus 16 bits */
/* needed for 8 bits plus the preceding and following 4 bits needed */
/* for min_size of 4. This is probably adequate for current users */
/* the beginning and end of a line are special since they need */
/* to darken extra pixels within the line bounds */
byte remap_first4[256];
byte remap_last4[256];
} min_feature_data_t;
static int
next_zero(int startbit, int val)
{
int i;
for (i=startbit-1; i>=0; i--)
if ((val & 1<<i) == 0)
return i;
return -1;
}
static int
next_one(int startbit, int val)
{
int i;
for (i=startbit-1; i>=0; i--)
if ((val & 1<<i) != 0)
return i;
return -1;
}
/* Note linewidth is number of pixels -- needed for the end of line */
int
min_feature_size_init(gs_memory_t *mem, int min_feature_size,
int width, int height, void **min_feature_data)
{
min_feature_data_t *data;
int i, bytes_per_line;
if (min_feature_size > 4)
return_error(gs_error_limitcheck);
/* allocate our data structure and vertical tracking buffer */
if ((data = (min_feature_data_t *)gs_malloc(mem, 1, sizeof(min_feature_data_t),
"mem_feature_size(data)")) == NULL)
return_error(gs_error_VMerror);
bytes_per_line = (width+7)/8;
if ((data->lines = (byte *)gs_malloc(mem, bytes_per_line, 2 * min_feature_size,
"mem_feature_size(lines)")) == NULL) {
gs_free(mem, data, 1, sizeof(min_feature_data_t),
"mem_feature_size(data)");
return_error(gs_error_VMerror);
}
data->memory = mem;
data->width = width;
data->height = height;
data->cur_line = -1;
data->min_size = min_feature_size;
data->bytes_per_line = bytes_per_line;
memset(data->lines, 0, bytes_per_line * 2 * min_feature_size);
for(i=0; i<2*min_feature_size; i++)
data->lines_prev[i] = data->lines + (bytes_per_line * i);
#define bm(b) /* bitmask(b) 0 is lsb */\
(1<<(b))
/* build the 'remap' data for the min_feature_size */
for (i=0; i<256; i++) {
int f = i, l = i, fd = 8, fw;
do {
fd = next_one(fd, f); /* value == -1 if past bit_0 */
if (fd < 0)
break;
fw = next_zero(fd, f); /* value == -1 if past bit_0 */
if ((fd - fw) < min_feature_size) {
/* darken (set to 0) bits needed depending on min_feature_size */
/* 'first' and 'last' are different because we need to expand */
/* within the bits, i.e., right of bit 7 for first and left of */
/* bit 0 for last */
/* Note that we will only be using the left most bits of first */
/* and the right most bits of last. */
switch (min_feature_size) {
case 2:
/* current feature size is 1, darken bit to the right */
/* unless it is past the end of the byte in 'last' */
if (fd > 0 && fw > 0) {
f |= bm(fw);
l |= bm(fw);
} else /* fd == 0 */
l |= 0x03; /* darken to the left of lsb */
break;
case 3:
/* This case is more complicated -- we want to darken about */
/* the center if the current size is 1, else darken a bit */
/* to the right, with the constraints of staying within the */
/* byte (bits 7::0). (fd-1) is to the right. */
if ((fd < 7) && (fd > 1)) {
/* within byte, left and right */
/* darkening is referenced from 'fw' since that is the */
/* white bit to the right of the 1 or 2 pixel wide area */
f |= bm(fw+2) | bm(fd-2);
l |= bm(fw+2) | bm(fd-2);
} else if (fd == 7) {
f |= 0xe0; /* darken top three pixels */
} else { /* fd == 0 */
f |= 0x07; /* darken bottom three pixels */
l |= 0x07;
}
break;
case 4:
/* like case 3, except we prefer to darken one to the left */
/* and two to the right. */
if ((fd < 7) && (fd > 1)) {
/* within byte, left and right */
f |= bm(fw+2) | bm(fd-1) | bm(fd-2);
l |= bm(fw+2) | bm(fd-1) | bm(fd-2);
} else if (fd == 7) {
/* darken high 4 bits */
f |= 0xfd;
} else { /* fd <= 1 */
/* darken final 4 bits */
f |= 0x0f;
l |= 0x0f;
}
break;
default: /* don't change the data (shouldn't be here) */
break;
}
}
fd = next_zero(fd, f); /* advance past this group of '1' bits */
/* we 'seek' again because data may */
/* have changed due to darkening right */
} while (fd >= 0);
/* finished with the whole byte. Save the results */
data->remap_first4[i] = f;
data->remap_last4[i] = l;
}
for (i=0; i<65536; i++) {
int d = i, fd = 16, fw;
do {
fd = next_one(fd, d); /* value == -1 if past bit_0 */
if (fd < 0)
break;
fw = next_zero(fd, d); /* value == -1 if past bit_0 */
if ((fd - fw) < min_feature_size) {
/* darken (set to 0) bits needed depending on min_feature_size */
/* 'first' and 'last' are different because we need to expand */
/* within the bits, i.e., right of bit 7 for first and left of */
/* bit 0 for last */
/* Note that we will only be using the left most bits of first */
/* and the right most bits of last. */
switch (min_feature_size) {
case 2:
/* current feature size is 1, darken bit to the right */
if (fd > 0 && fw >= 0) {
d |= bm(fw);
} else /* fd == 0 */
d |= 0x0003; /* two lsb's darkened */
break;
case 3:
/* This case is more complicated -- we want to darken about */
/* the center but bias darkening to the right */
if ((fd < 15) && (fd > 0)) {
/* within value, left and right */
d |= bm(fw+2) | bm(fd-1);
} else if (fd == 15) {
d |= 0xe000; /* darken top three */
} else { /* fd == 0 */
d |= 0x0007; /* darken three lsb's */
}
break;
case 4:
/* like case 3, except we prefer to darken one to the left */
/* and two to the right. */
if ((fd < 15) && (fd > 1)) {
/* within byte, left and right */
d |= bm(fw+2) | bm(fd-1) | bm(fd-2);
} else if (fd == 15) {
d &= 0xf000; /* darken top 4 pixels */
} else { /* fd <= 1 */
d &= 0x000f; /* darken last 4 pixels */
}
break;
default: /* don't change the data (shouldn't be here) */
break;
}
}
fd = next_zero(fd, d); /* advance past this group of '1' bits */
/* we 'seek' again because data may */
/* have changed due to darkening right */
} while (fd >= 0);
/* finished with the whole short. Save the byte in the middle */
data->remap_mid8[i] = (d >> 4) & 0xff;
}
*min_feature_data = data; /* give the caller our pointer */
return 0;
}
int
min_feature_size_dnit(void *min_feature_data)
{
min_feature_data_t *data = min_feature_data;
if (data != NULL) {
if (data->lines != NULL)
gs_free(data->memory, data->lines, data->bytes_per_line,
2*data->min_size, "mem_feature_size(lines)");
gs_free(data->memory, data, 1, sizeof(min_feature_data_t),
"mem_feature_size(data)");
}
return 0;
}
/* Return number of byte available */
int
min_feature_size_process(byte *line, void *min_feature_data)
{
min_feature_data_t *data = min_feature_data;
ushort d;
byte n, m, *btmp;
int i, pad_bits = (8 - (data->width & 7)) & 7; /* range 0 to 7 */
int bytes_per_line = (data->width+7)/8, end = bytes_per_line - 2;
int count_out = 0; /* bytes_per_line if line is output */
data->cur_line++;
d = data->remap_first4[line[0]]; /* darken bits toward the right */
d <<= 4; /* shift up to enter loop */
for (i=0; i<=end; i++) { /* stop short of 'end' */
n = line[i+1];
d |= n >> 4;
m = data->remap_mid8[d]; /* middle byte with bits darkened */
line[i] = m;
d |= m << 4;
d = ((d<<4) | n) << 4;
}
/* Final bits require alignment for the last 4 bits */
d = (((line[i-1] << 8) | line[i]) >> pad_bits) & 0xff;
m = data->remap_last4[d];
line[i-1] |= m >> (8 - pad_bits);
line[i] |= m << pad_bits;
/* Now handle the vertical darkening */
/* shift lines up by adjusting pointers */
btmp = data->lines_prev[2*(data->min_size)-1]; /* oldest line */
for (i=2*(data->min_size)-1; i>0; i--)
data->lines_prev[i] = data->lines_prev[i-1];
data->lines_prev[0] = btmp;
/* Copy this input line into the most recent lines_prev: lines_prev[0] */
memcpy(data->lines_prev[0], line, bytes_per_line);
switch (data->min_size) {
case 4:
/**** TBI ****/
case 3:
/**** TBI ****/
case 2:
if (data->cur_line >= data->height - 1) {
if (data->cur_line == data->height - 1) {
/* end of page must darken next to last line*/
for (i=0; i<bytes_per_line; i++)
line[i] = data->lines_prev[1][i] |= data->lines_prev[0][i];
} else {
/* very last line is unchanged, ignore input line in lines_prev[0] */
for (i=0; i<bytes_per_line; i++)
line[i] = data->lines_prev[1][i];
}
} else {
/* darken bits in lines_prev[1] */
/* Since we are darkening in following lines, we only really need 3 lines */
for (i=0; i<bytes_per_line; i++) {
data->lines_prev[0][i] |= data->lines_prev[1][i] & ~(data->lines_prev[2][i]);
line[i] = data->lines_prev[1][i];
}
}
if (data->cur_line >= 1)
count_out = bytes_per_line;
break;
default:
break;
}
return count_out;
}
int
fax_adjusted_width(int width, int adjust_width)
{
if (adjust_width <= 0)
return width;
if (adjust_width == 1) {
/* Adjust the page width to a legal value for fax systems. */
if (width >= 1680 && width <= 1736)
/* Adjust width for A4 paper. */
return 1728;
else if (width >= 2000 && width <= 2056)
/* Adjust width for B4 paper. */
return 2048;
else
return width;
} else {
/* Adjust for the user-defined width. */
return adjust_width;
}
}
|