vrshoot

annotate libs/libjpeg/jquant1.c @ 0:b2f14e535253

find changesets by author, revision, files, or words in the commit message
initial commit
author John Tsiombikas <nuclear@member.fsf.org>
date Sat, 01 Feb 2014 19:58:19 +0200
parents
children
rev   line source
nuclear@0 1 /*
nuclear@0 2 * jquant1.c
nuclear@0 3 *
nuclear@0 4 * Copyright (C) 1991-1996, Thomas G. Lane.
nuclear@0 5 * This file is part of the Independent JPEG Group's software.
nuclear@0 6 * For conditions of distribution and use, see the accompanying README file.
nuclear@0 7 *
nuclear@0 8 * This file contains 1-pass color quantization (color mapping) routines.
nuclear@0 9 * These routines provide mapping to a fixed color map using equally spaced
nuclear@0 10 * color values. Optional Floyd-Steinberg or ordered dithering is available.
nuclear@0 11 */
nuclear@0 12
nuclear@0 13 #define JPEG_INTERNALS
nuclear@0 14 #include "jinclude.h"
nuclear@0 15 #include "jpeglib.h"
nuclear@0 16
nuclear@0 17 #ifdef QUANT_1PASS_SUPPORTED
nuclear@0 18
nuclear@0 19
nuclear@0 20 /*
nuclear@0 21 * The main purpose of 1-pass quantization is to provide a fast, if not very
nuclear@0 22 * high quality, colormapped output capability. A 2-pass quantizer usually
nuclear@0 23 * gives better visual quality; however, for quantized grayscale output this
nuclear@0 24 * quantizer is perfectly adequate. Dithering is highly recommended with this
nuclear@0 25 * quantizer, though you can turn it off if you really want to.
nuclear@0 26 *
nuclear@0 27 * In 1-pass quantization the colormap must be chosen in advance of seeing the
nuclear@0 28 * image. We use a map consisting of all combinations of Ncolors[i] color
nuclear@0 29 * values for the i'th component. The Ncolors[] values are chosen so that
nuclear@0 30 * their product, the total number of colors, is no more than that requested.
nuclear@0 31 * (In most cases, the product will be somewhat less.)
nuclear@0 32 *
nuclear@0 33 * Since the colormap is orthogonal, the representative value for each color
nuclear@0 34 * component can be determined without considering the other components;
nuclear@0 35 * then these indexes can be combined into a colormap index by a standard
nuclear@0 36 * N-dimensional-array-subscript calculation. Most of the arithmetic involved
nuclear@0 37 * can be precalculated and stored in the lookup table colorindex[].
nuclear@0 38 * colorindex[i][j] maps pixel value j in component i to the nearest
nuclear@0 39 * representative value (grid plane) for that component; this index is
nuclear@0 40 * multiplied by the array stride for component i, so that the
nuclear@0 41 * index of the colormap entry closest to a given pixel value is just
nuclear@0 42 * sum( colorindex[component-number][pixel-component-value] )
nuclear@0 43 * Aside from being fast, this scheme allows for variable spacing between
nuclear@0 44 * representative values with no additional lookup cost.
nuclear@0 45 *
nuclear@0 46 * If gamma correction has been applied in color conversion, it might be wise
nuclear@0 47 * to adjust the color grid spacing so that the representative colors are
nuclear@0 48 * equidistant in linear space. At this writing, gamma correction is not
nuclear@0 49 * implemented by jdcolor, so nothing is done here.
nuclear@0 50 */
nuclear@0 51
nuclear@0 52
nuclear@0 53 /* Declarations for ordered dithering.
nuclear@0 54 *
nuclear@0 55 * We use a standard 16x16 ordered dither array. The basic concept of ordered
nuclear@0 56 * dithering is described in many references, for instance Dale Schumacher's
nuclear@0 57 * chapter II.2 of Graphics Gems II (James Arvo, ed. Academic Press, 1991).
nuclear@0 58 * In place of Schumacher's comparisons against a "threshold" value, we add a
nuclear@0 59 * "dither" value to the input pixel and then round the result to the nearest
nuclear@0 60 * output value. The dither value is equivalent to (0.5 - threshold) times
nuclear@0 61 * the distance between output values. For ordered dithering, we assume that
nuclear@0 62 * the output colors are equally spaced; if not, results will probably be
nuclear@0 63 * worse, since the dither may be too much or too little at a given point.
nuclear@0 64 *
nuclear@0 65 * The normal calculation would be to form pixel value + dither, range-limit
nuclear@0 66 * this to 0..MAXJSAMPLE, and then index into the colorindex table as usual.
nuclear@0 67 * We can skip the separate range-limiting step by extending the colorindex
nuclear@0 68 * table in both directions.
nuclear@0 69 */
nuclear@0 70
nuclear@0 71 #define ODITHER_SIZE 16 /* dimension of dither matrix */
nuclear@0 72 /* NB: if ODITHER_SIZE is not a power of 2, ODITHER_MASK uses will break */
nuclear@0 73 #define ODITHER_CELLS (ODITHER_SIZE*ODITHER_SIZE) /* # cells in matrix */
nuclear@0 74 #define ODITHER_MASK (ODITHER_SIZE-1) /* mask for wrapping around counters */
nuclear@0 75
nuclear@0 76 typedef int ODITHER_MATRIX[ODITHER_SIZE][ODITHER_SIZE];
nuclear@0 77 typedef int (*ODITHER_MATRIX_PTR)[ODITHER_SIZE];
nuclear@0 78
nuclear@0 79 static const UINT8 base_dither_matrix[ODITHER_SIZE][ODITHER_SIZE] = {
nuclear@0 80 /* Bayer's order-4 dither array. Generated by the code given in
nuclear@0 81 * Stephen Hawley's article "Ordered Dithering" in Graphics Gems I.
nuclear@0 82 * The values in this array must range from 0 to ODITHER_CELLS-1.
nuclear@0 83 */
nuclear@0 84 { 0,192, 48,240, 12,204, 60,252, 3,195, 51,243, 15,207, 63,255 },
nuclear@0 85 { 128, 64,176,112,140, 76,188,124,131, 67,179,115,143, 79,191,127 },
nuclear@0 86 { 32,224, 16,208, 44,236, 28,220, 35,227, 19,211, 47,239, 31,223 },
nuclear@0 87 { 160, 96,144, 80,172,108,156, 92,163, 99,147, 83,175,111,159, 95 },
nuclear@0 88 { 8,200, 56,248, 4,196, 52,244, 11,203, 59,251, 7,199, 55,247 },
nuclear@0 89 { 136, 72,184,120,132, 68,180,116,139, 75,187,123,135, 71,183,119 },
nuclear@0 90 { 40,232, 24,216, 36,228, 20,212, 43,235, 27,219, 39,231, 23,215 },
nuclear@0 91 { 168,104,152, 88,164,100,148, 84,171,107,155, 91,167,103,151, 87 },
nuclear@0 92 { 2,194, 50,242, 14,206, 62,254, 1,193, 49,241, 13,205, 61,253 },
nuclear@0 93 { 130, 66,178,114,142, 78,190,126,129, 65,177,113,141, 77,189,125 },
nuclear@0 94 { 34,226, 18,210, 46,238, 30,222, 33,225, 17,209, 45,237, 29,221 },
nuclear@0 95 { 162, 98,146, 82,174,110,158, 94,161, 97,145, 81,173,109,157, 93 },
nuclear@0 96 { 10,202, 58,250, 6,198, 54,246, 9,201, 57,249, 5,197, 53,245 },
nuclear@0 97 { 138, 74,186,122,134, 70,182,118,137, 73,185,121,133, 69,181,117 },
nuclear@0 98 { 42,234, 26,218, 38,230, 22,214, 41,233, 25,217, 37,229, 21,213 },
nuclear@0 99 { 170,106,154, 90,166,102,150, 86,169,105,153, 89,165,101,149, 85 }
nuclear@0 100 };
nuclear@0 101
nuclear@0 102
nuclear@0 103 /* Declarations for Floyd-Steinberg dithering.
nuclear@0 104 *
nuclear@0 105 * Errors are accumulated into the array fserrors[], at a resolution of
nuclear@0 106 * 1/16th of a pixel count. The error at a given pixel is propagated
nuclear@0 107 * to its not-yet-processed neighbors using the standard F-S fractions,
nuclear@0 108 * ... (here) 7/16
nuclear@0 109 * 3/16 5/16 1/16
nuclear@0 110 * We work left-to-right on even rows, right-to-left on odd rows.
nuclear@0 111 *
nuclear@0 112 * We can get away with a single array (holding one row's worth of errors)
nuclear@0 113 * by using it to store the current row's errors at pixel columns not yet
nuclear@0 114 * processed, but the next row's errors at columns already processed. We
nuclear@0 115 * need only a few extra variables to hold the errors immediately around the
nuclear@0 116 * current column. (If we are lucky, those variables are in registers, but
nuclear@0 117 * even if not, they're probably cheaper to access than array elements are.)
nuclear@0 118 *
nuclear@0 119 * The fserrors[] array is indexed [component#][position].
nuclear@0 120 * We provide (#columns + 2) entries per component; the extra entry at each
nuclear@0 121 * end saves us from special-casing the first and last pixels.
nuclear@0 122 *
nuclear@0 123 * Note: on a wide image, we might not have enough room in a PC's near data
nuclear@0 124 * segment to hold the error array; so it is allocated with alloc_large.
nuclear@0 125 */
nuclear@0 126
nuclear@0 127 #if BITS_IN_JSAMPLE == 8
nuclear@0 128 typedef INT16 FSERROR; /* 16 bits should be enough */
nuclear@0 129 typedef int LOCFSERROR; /* use 'int' for calculation temps */
nuclear@0 130 #else
nuclear@0 131 typedef INT32 FSERROR; /* may need more than 16 bits */
nuclear@0 132 typedef INT32 LOCFSERROR; /* be sure calculation temps are big enough */
nuclear@0 133 #endif
nuclear@0 134
nuclear@0 135 typedef FSERROR FAR *FSERRPTR; /* pointer to error array (in FAR storage!) */
nuclear@0 136
nuclear@0 137
nuclear@0 138 /* Private subobject */
nuclear@0 139
nuclear@0 140 #define MAX_Q_COMPS 4 /* max components I can handle */
nuclear@0 141
nuclear@0 142 typedef struct {
nuclear@0 143 struct jpeg_color_quantizer pub; /* public fields */
nuclear@0 144
nuclear@0 145 /* Initially allocated colormap is saved here */
nuclear@0 146 JSAMPARRAY sv_colormap; /* The color map as a 2-D pixel array */
nuclear@0 147 int sv_actual; /* number of entries in use */
nuclear@0 148
nuclear@0 149 JSAMPARRAY colorindex; /* Precomputed mapping for speed */
nuclear@0 150 /* colorindex[i][j] = index of color closest to pixel value j in component i,
nuclear@0 151 * premultiplied as described above. Since colormap indexes must fit into
nuclear@0 152 * JSAMPLEs, the entries of this array will too.
nuclear@0 153 */
nuclear@0 154 boolean is_padded; /* is the colorindex padded for odither? */
nuclear@0 155
nuclear@0 156 int Ncolors[MAX_Q_COMPS]; /* # of values alloced to each component */
nuclear@0 157
nuclear@0 158 /* Variables for ordered dithering */
nuclear@0 159 int row_index; /* cur row's vertical index in dither matrix */
nuclear@0 160 ODITHER_MATRIX_PTR odither[MAX_Q_COMPS]; /* one dither array per component */
nuclear@0 161
nuclear@0 162 /* Variables for Floyd-Steinberg dithering */
nuclear@0 163 FSERRPTR fserrors[MAX_Q_COMPS]; /* accumulated errors */
nuclear@0 164 boolean on_odd_row; /* flag to remember which row we are on */
nuclear@0 165 } my_cquantizer;
nuclear@0 166
nuclear@0 167 typedef my_cquantizer * my_cquantize_ptr;
nuclear@0 168
nuclear@0 169
nuclear@0 170 /*
nuclear@0 171 * Policy-making subroutines for create_colormap and create_colorindex.
nuclear@0 172 * These routines determine the colormap to be used. The rest of the module
nuclear@0 173 * only assumes that the colormap is orthogonal.
nuclear@0 174 *
nuclear@0 175 * * select_ncolors decides how to divvy up the available colors
nuclear@0 176 * among the components.
nuclear@0 177 * * output_value defines the set of representative values for a component.
nuclear@0 178 * * largest_input_value defines the mapping from input values to
nuclear@0 179 * representative values for a component.
nuclear@0 180 * Note that the latter two routines may impose different policies for
nuclear@0 181 * different components, though this is not currently done.
nuclear@0 182 */
nuclear@0 183
nuclear@0 184
nuclear@0 185 LOCAL(int)
nuclear@0 186 select_ncolors (j_decompress_ptr cinfo, int Ncolors[])
nuclear@0 187 /* Determine allocation of desired colors to components, */
nuclear@0 188 /* and fill in Ncolors[] array to indicate choice. */
nuclear@0 189 /* Return value is total number of colors (product of Ncolors[] values). */
nuclear@0 190 {
nuclear@0 191 int nc = cinfo->out_color_components; /* number of color components */
nuclear@0 192 int max_colors = cinfo->desired_number_of_colors;
nuclear@0 193 int total_colors, iroot, i, j;
nuclear@0 194 boolean changed;
nuclear@0 195 long temp;
nuclear@0 196 static const int RGB_order[3] = { RGB_GREEN, RGB_RED, RGB_BLUE };
nuclear@0 197
nuclear@0 198 /* We can allocate at least the nc'th root of max_colors per component. */
nuclear@0 199 /* Compute floor(nc'th root of max_colors). */
nuclear@0 200 iroot = 1;
nuclear@0 201 do {
nuclear@0 202 iroot++;
nuclear@0 203 temp = iroot; /* set temp = iroot ** nc */
nuclear@0 204 for (i = 1; i < nc; i++)
nuclear@0 205 temp *= iroot;
nuclear@0 206 } while (temp <= (long) max_colors); /* repeat till iroot exceeds root */
nuclear@0 207 iroot--; /* now iroot = floor(root) */
nuclear@0 208
nuclear@0 209 /* Must have at least 2 color values per component */
nuclear@0 210 if (iroot < 2)
nuclear@0 211 ERREXIT1(cinfo, JERR_QUANT_FEW_COLORS, (int) temp);
nuclear@0 212
nuclear@0 213 /* Initialize to iroot color values for each component */
nuclear@0 214 total_colors = 1;
nuclear@0 215 for (i = 0; i < nc; i++) {
nuclear@0 216 Ncolors[i] = iroot;
nuclear@0 217 total_colors *= iroot;
nuclear@0 218 }
nuclear@0 219 /* We may be able to increment the count for one or more components without
nuclear@0 220 * exceeding max_colors, though we know not all can be incremented.
nuclear@0 221 * Sometimes, the first component can be incremented more than once!
nuclear@0 222 * (Example: for 16 colors, we start at 2*2*2, go to 3*2*2, then 4*2*2.)
nuclear@0 223 * In RGB colorspace, try to increment G first, then R, then B.
nuclear@0 224 */
nuclear@0 225 do {
nuclear@0 226 changed = FALSE;
nuclear@0 227 for (i = 0; i < nc; i++) {
nuclear@0 228 j = (cinfo->out_color_space == JCS_RGB ? RGB_order[i] : i);
nuclear@0 229 /* calculate new total_colors if Ncolors[j] is incremented */
nuclear@0 230 temp = total_colors / Ncolors[j];
nuclear@0 231 temp *= Ncolors[j]+1; /* done in long arith to avoid oflo */
nuclear@0 232 if (temp > (long) max_colors)
nuclear@0 233 break; /* won't fit, done with this pass */
nuclear@0 234 Ncolors[j]++; /* OK, apply the increment */
nuclear@0 235 total_colors = (int) temp;
nuclear@0 236 changed = TRUE;
nuclear@0 237 }
nuclear@0 238 } while (changed);
nuclear@0 239
nuclear@0 240 return total_colors;
nuclear@0 241 }
nuclear@0 242
nuclear@0 243
nuclear@0 244 LOCAL(int)
nuclear@0 245 output_value (j_decompress_ptr cinfo, int ci, int j, int maxj)
nuclear@0 246 /* Return j'th output value, where j will range from 0 to maxj */
nuclear@0 247 /* The output values must fall in 0..MAXJSAMPLE in increasing order */
nuclear@0 248 {
nuclear@0 249 /* We always provide values 0 and MAXJSAMPLE for each component;
nuclear@0 250 * any additional values are equally spaced between these limits.
nuclear@0 251 * (Forcing the upper and lower values to the limits ensures that
nuclear@0 252 * dithering can't produce a color outside the selected gamut.)
nuclear@0 253 */
nuclear@0 254 return (int) (((INT32) j * MAXJSAMPLE + maxj/2) / maxj);
nuclear@0 255 }
nuclear@0 256
nuclear@0 257
nuclear@0 258 LOCAL(int)
nuclear@0 259 largest_input_value (j_decompress_ptr cinfo, int ci, int j, int maxj)
nuclear@0 260 /* Return largest input value that should map to j'th output value */
nuclear@0 261 /* Must have largest(j=0) >= 0, and largest(j=maxj) >= MAXJSAMPLE */
nuclear@0 262 {
nuclear@0 263 /* Breakpoints are halfway between values returned by output_value */
nuclear@0 264 return (int) (((INT32) (2*j + 1) * MAXJSAMPLE + maxj) / (2*maxj));
nuclear@0 265 }
nuclear@0 266
nuclear@0 267
nuclear@0 268 /*
nuclear@0 269 * Create the colormap.
nuclear@0 270 */
nuclear@0 271
nuclear@0 272 LOCAL(void)
nuclear@0 273 create_colormap (j_decompress_ptr cinfo)
nuclear@0 274 {
nuclear@0 275 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 276 JSAMPARRAY colormap; /* Created colormap */
nuclear@0 277 int total_colors; /* Number of distinct output colors */
nuclear@0 278 int i,j,k, nci, blksize, blkdist, ptr, val;
nuclear@0 279
nuclear@0 280 /* Select number of colors for each component */
nuclear@0 281 total_colors = select_ncolors(cinfo, cquantize->Ncolors);
nuclear@0 282
nuclear@0 283 /* Report selected color counts */
nuclear@0 284 if (cinfo->out_color_components == 3)
nuclear@0 285 TRACEMS4(cinfo, 1, JTRC_QUANT_3_NCOLORS,
nuclear@0 286 total_colors, cquantize->Ncolors[0],
nuclear@0 287 cquantize->Ncolors[1], cquantize->Ncolors[2]);
nuclear@0 288 else
nuclear@0 289 TRACEMS1(cinfo, 1, JTRC_QUANT_NCOLORS, total_colors);
nuclear@0 290
nuclear@0 291 /* Allocate and fill in the colormap. */
nuclear@0 292 /* The colors are ordered in the map in standard row-major order, */
nuclear@0 293 /* i.e. rightmost (highest-indexed) color changes most rapidly. */
nuclear@0 294
nuclear@0 295 colormap = (*cinfo->mem->alloc_sarray)
nuclear@0 296 ((j_common_ptr) cinfo, JPOOL_IMAGE,
nuclear@0 297 (JDIMENSION) total_colors, (JDIMENSION) cinfo->out_color_components);
nuclear@0 298
nuclear@0 299 /* blksize is number of adjacent repeated entries for a component */
nuclear@0 300 /* blkdist is distance between groups of identical entries for a component */
nuclear@0 301 blkdist = total_colors;
nuclear@0 302
nuclear@0 303 for (i = 0; i < cinfo->out_color_components; i++) {
nuclear@0 304 /* fill in colormap entries for i'th color component */
nuclear@0 305 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
nuclear@0 306 blksize = blkdist / nci;
nuclear@0 307 for (j = 0; j < nci; j++) {
nuclear@0 308 /* Compute j'th output value (out of nci) for component */
nuclear@0 309 val = output_value(cinfo, i, j, nci-1);
nuclear@0 310 /* Fill in all colormap entries that have this value of this component */
nuclear@0 311 for (ptr = j * blksize; ptr < total_colors; ptr += blkdist) {
nuclear@0 312 /* fill in blksize entries beginning at ptr */
nuclear@0 313 for (k = 0; k < blksize; k++)
nuclear@0 314 colormap[i][ptr+k] = (JSAMPLE) val;
nuclear@0 315 }
nuclear@0 316 }
nuclear@0 317 blkdist = blksize; /* blksize of this color is blkdist of next */
nuclear@0 318 }
nuclear@0 319
nuclear@0 320 /* Save the colormap in private storage,
nuclear@0 321 * where it will survive color quantization mode changes.
nuclear@0 322 */
nuclear@0 323 cquantize->sv_colormap = colormap;
nuclear@0 324 cquantize->sv_actual = total_colors;
nuclear@0 325 }
nuclear@0 326
nuclear@0 327
nuclear@0 328 /*
nuclear@0 329 * Create the color index table.
nuclear@0 330 */
nuclear@0 331
nuclear@0 332 LOCAL(void)
nuclear@0 333 create_colorindex (j_decompress_ptr cinfo)
nuclear@0 334 {
nuclear@0 335 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 336 JSAMPROW indexptr;
nuclear@0 337 int i,j,k, nci, blksize, val, pad;
nuclear@0 338
nuclear@0 339 /* For ordered dither, we pad the color index tables by MAXJSAMPLE in
nuclear@0 340 * each direction (input index values can be -MAXJSAMPLE .. 2*MAXJSAMPLE).
nuclear@0 341 * This is not necessary in the other dithering modes. However, we
nuclear@0 342 * flag whether it was done in case user changes dithering mode.
nuclear@0 343 */
nuclear@0 344 if (cinfo->dither_mode == JDITHER_ORDERED) {
nuclear@0 345 pad = MAXJSAMPLE*2;
nuclear@0 346 cquantize->is_padded = TRUE;
nuclear@0 347 } else {
nuclear@0 348 pad = 0;
nuclear@0 349 cquantize->is_padded = FALSE;
nuclear@0 350 }
nuclear@0 351
nuclear@0 352 cquantize->colorindex = (*cinfo->mem->alloc_sarray)
nuclear@0 353 ((j_common_ptr) cinfo, JPOOL_IMAGE,
nuclear@0 354 (JDIMENSION) (MAXJSAMPLE+1 + pad),
nuclear@0 355 (JDIMENSION) cinfo->out_color_components);
nuclear@0 356
nuclear@0 357 /* blksize is number of adjacent repeated entries for a component */
nuclear@0 358 blksize = cquantize->sv_actual;
nuclear@0 359
nuclear@0 360 for (i = 0; i < cinfo->out_color_components; i++) {
nuclear@0 361 /* fill in colorindex entries for i'th color component */
nuclear@0 362 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
nuclear@0 363 blksize = blksize / nci;
nuclear@0 364
nuclear@0 365 /* adjust colorindex pointers to provide padding at negative indexes. */
nuclear@0 366 if (pad)
nuclear@0 367 cquantize->colorindex[i] += MAXJSAMPLE;
nuclear@0 368
nuclear@0 369 /* in loop, val = index of current output value, */
nuclear@0 370 /* and k = largest j that maps to current val */
nuclear@0 371 indexptr = cquantize->colorindex[i];
nuclear@0 372 val = 0;
nuclear@0 373 k = largest_input_value(cinfo, i, 0, nci-1);
nuclear@0 374 for (j = 0; j <= MAXJSAMPLE; j++) {
nuclear@0 375 while (j > k) /* advance val if past boundary */
nuclear@0 376 k = largest_input_value(cinfo, i, ++val, nci-1);
nuclear@0 377 /* premultiply so that no multiplication needed in main processing */
nuclear@0 378 indexptr[j] = (JSAMPLE) (val * blksize);
nuclear@0 379 }
nuclear@0 380 /* Pad at both ends if necessary */
nuclear@0 381 if (pad)
nuclear@0 382 for (j = 1; j <= MAXJSAMPLE; j++) {
nuclear@0 383 indexptr[-j] = indexptr[0];
nuclear@0 384 indexptr[MAXJSAMPLE+j] = indexptr[MAXJSAMPLE];
nuclear@0 385 }
nuclear@0 386 }
nuclear@0 387 }
nuclear@0 388
nuclear@0 389
nuclear@0 390 /*
nuclear@0 391 * Create an ordered-dither array for a component having ncolors
nuclear@0 392 * distinct output values.
nuclear@0 393 */
nuclear@0 394
nuclear@0 395 LOCAL(ODITHER_MATRIX_PTR)
nuclear@0 396 make_odither_array (j_decompress_ptr cinfo, int ncolors)
nuclear@0 397 {
nuclear@0 398 ODITHER_MATRIX_PTR odither;
nuclear@0 399 int j,k;
nuclear@0 400 INT32 num,den;
nuclear@0 401
nuclear@0 402 odither = (ODITHER_MATRIX_PTR)
nuclear@0 403 (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
nuclear@0 404 SIZEOF(ODITHER_MATRIX));
nuclear@0 405 /* The inter-value distance for this color is MAXJSAMPLE/(ncolors-1).
nuclear@0 406 * Hence the dither value for the matrix cell with fill order f
nuclear@0 407 * (f=0..N-1) should be (N-1-2*f)/(2*N) * MAXJSAMPLE/(ncolors-1).
nuclear@0 408 * On 16-bit-int machine, be careful to avoid overflow.
nuclear@0 409 */
nuclear@0 410 den = 2 * ODITHER_CELLS * ((INT32) (ncolors - 1));
nuclear@0 411 for (j = 0; j < ODITHER_SIZE; j++) {
nuclear@0 412 for (k = 0; k < ODITHER_SIZE; k++) {
nuclear@0 413 num = ((INT32) (ODITHER_CELLS-1 - 2*((int)base_dither_matrix[j][k])))
nuclear@0 414 * MAXJSAMPLE;
nuclear@0 415 /* Ensure round towards zero despite C's lack of consistency
nuclear@0 416 * about rounding negative values in integer division...
nuclear@0 417 */
nuclear@0 418 odither[j][k] = (int) (num<0 ? -((-num)/den) : num/den);
nuclear@0 419 }
nuclear@0 420 }
nuclear@0 421 return odither;
nuclear@0 422 }
nuclear@0 423
nuclear@0 424
nuclear@0 425 /*
nuclear@0 426 * Create the ordered-dither tables.
nuclear@0 427 * Components having the same number of representative colors may
nuclear@0 428 * share a dither table.
nuclear@0 429 */
nuclear@0 430
nuclear@0 431 LOCAL(void)
nuclear@0 432 create_odither_tables (j_decompress_ptr cinfo)
nuclear@0 433 {
nuclear@0 434 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 435 ODITHER_MATRIX_PTR odither;
nuclear@0 436 int i, j, nci;
nuclear@0 437
nuclear@0 438 for (i = 0; i < cinfo->out_color_components; i++) {
nuclear@0 439 nci = cquantize->Ncolors[i]; /* # of distinct values for this color */
nuclear@0 440 odither = NULL; /* search for matching prior component */
nuclear@0 441 for (j = 0; j < i; j++) {
nuclear@0 442 if (nci == cquantize->Ncolors[j]) {
nuclear@0 443 odither = cquantize->odither[j];
nuclear@0 444 break;
nuclear@0 445 }
nuclear@0 446 }
nuclear@0 447 if (odither == NULL) /* need a new table? */
nuclear@0 448 odither = make_odither_array(cinfo, nci);
nuclear@0 449 cquantize->odither[i] = odither;
nuclear@0 450 }
nuclear@0 451 }
nuclear@0 452
nuclear@0 453
nuclear@0 454 /*
nuclear@0 455 * Map some rows of pixels to the output colormapped representation.
nuclear@0 456 */
nuclear@0 457
nuclear@0 458 METHODDEF(void)
nuclear@0 459 color_quantize (j_decompress_ptr cinfo, JSAMPARRAY input_buf,
nuclear@0 460 JSAMPARRAY output_buf, int num_rows)
nuclear@0 461 /* General case, no dithering */
nuclear@0 462 {
nuclear@0 463 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 464 JSAMPARRAY colorindex = cquantize->colorindex;
nuclear@0 465 register int pixcode, ci;
nuclear@0 466 register JSAMPROW ptrin, ptrout;
nuclear@0 467 int row;
nuclear@0 468 JDIMENSION col;
nuclear@0 469 JDIMENSION width = cinfo->output_width;
nuclear@0 470 register int nc = cinfo->out_color_components;
nuclear@0 471
nuclear@0 472 for (row = 0; row < num_rows; row++) {
nuclear@0 473 ptrin = input_buf[row];
nuclear@0 474 ptrout = output_buf[row];
nuclear@0 475 for (col = width; col > 0; col--) {
nuclear@0 476 pixcode = 0;
nuclear@0 477 for (ci = 0; ci < nc; ci++) {
nuclear@0 478 pixcode += GETJSAMPLE(colorindex[ci][GETJSAMPLE(*ptrin++)]);
nuclear@0 479 }
nuclear@0 480 *ptrout++ = (JSAMPLE) pixcode;
nuclear@0 481 }
nuclear@0 482 }
nuclear@0 483 }
nuclear@0 484
nuclear@0 485
nuclear@0 486 METHODDEF(void)
nuclear@0 487 color_quantize3 (j_decompress_ptr cinfo, JSAMPARRAY input_buf,
nuclear@0 488 JSAMPARRAY output_buf, int num_rows)
nuclear@0 489 /* Fast path for out_color_components==3, no dithering */
nuclear@0 490 {
nuclear@0 491 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 492 register int pixcode;
nuclear@0 493 register JSAMPROW ptrin, ptrout;
nuclear@0 494 JSAMPROW colorindex0 = cquantize->colorindex[0];
nuclear@0 495 JSAMPROW colorindex1 = cquantize->colorindex[1];
nuclear@0 496 JSAMPROW colorindex2 = cquantize->colorindex[2];
nuclear@0 497 int row;
nuclear@0 498 JDIMENSION col;
nuclear@0 499 JDIMENSION width = cinfo->output_width;
nuclear@0 500
nuclear@0 501 for (row = 0; row < num_rows; row++) {
nuclear@0 502 ptrin = input_buf[row];
nuclear@0 503 ptrout = output_buf[row];
nuclear@0 504 for (col = width; col > 0; col--) {
nuclear@0 505 pixcode = GETJSAMPLE(colorindex0[GETJSAMPLE(*ptrin++)]);
nuclear@0 506 pixcode += GETJSAMPLE(colorindex1[GETJSAMPLE(*ptrin++)]);
nuclear@0 507 pixcode += GETJSAMPLE(colorindex2[GETJSAMPLE(*ptrin++)]);
nuclear@0 508 *ptrout++ = (JSAMPLE) pixcode;
nuclear@0 509 }
nuclear@0 510 }
nuclear@0 511 }
nuclear@0 512
nuclear@0 513
nuclear@0 514 METHODDEF(void)
nuclear@0 515 quantize_ord_dither (j_decompress_ptr cinfo, JSAMPARRAY input_buf,
nuclear@0 516 JSAMPARRAY output_buf, int num_rows)
nuclear@0 517 /* General case, with ordered dithering */
nuclear@0 518 {
nuclear@0 519 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 520 register JSAMPROW input_ptr;
nuclear@0 521 register JSAMPROW output_ptr;
nuclear@0 522 JSAMPROW colorindex_ci;
nuclear@0 523 int * dither; /* points to active row of dither matrix */
nuclear@0 524 int row_index, col_index; /* current indexes into dither matrix */
nuclear@0 525 int nc = cinfo->out_color_components;
nuclear@0 526 int ci;
nuclear@0 527 int row;
nuclear@0 528 JDIMENSION col;
nuclear@0 529 JDIMENSION width = cinfo->output_width;
nuclear@0 530
nuclear@0 531 for (row = 0; row < num_rows; row++) {
nuclear@0 532 /* Initialize output values to 0 so can process components separately */
nuclear@0 533 jzero_far((void FAR *) output_buf[row],
nuclear@0 534 (size_t) (width * SIZEOF(JSAMPLE)));
nuclear@0 535 row_index = cquantize->row_index;
nuclear@0 536 for (ci = 0; ci < nc; ci++) {
nuclear@0 537 input_ptr = input_buf[row] + ci;
nuclear@0 538 output_ptr = output_buf[row];
nuclear@0 539 colorindex_ci = cquantize->colorindex[ci];
nuclear@0 540 dither = cquantize->odither[ci][row_index];
nuclear@0 541 col_index = 0;
nuclear@0 542
nuclear@0 543 for (col = width; col > 0; col--) {
nuclear@0 544 /* Form pixel value + dither, range-limit to 0..MAXJSAMPLE,
nuclear@0 545 * select output value, accumulate into output code for this pixel.
nuclear@0 546 * Range-limiting need not be done explicitly, as we have extended
nuclear@0 547 * the colorindex table to produce the right answers for out-of-range
nuclear@0 548 * inputs. The maximum dither is +- MAXJSAMPLE; this sets the
nuclear@0 549 * required amount of padding.
nuclear@0 550 */
nuclear@0 551 *output_ptr += colorindex_ci[GETJSAMPLE(*input_ptr)+dither[col_index]];
nuclear@0 552 input_ptr += nc;
nuclear@0 553 output_ptr++;
nuclear@0 554 col_index = (col_index + 1) & ODITHER_MASK;
nuclear@0 555 }
nuclear@0 556 }
nuclear@0 557 /* Advance row index for next row */
nuclear@0 558 row_index = (row_index + 1) & ODITHER_MASK;
nuclear@0 559 cquantize->row_index = row_index;
nuclear@0 560 }
nuclear@0 561 }
nuclear@0 562
nuclear@0 563
nuclear@0 564 METHODDEF(void)
nuclear@0 565 quantize3_ord_dither (j_decompress_ptr cinfo, JSAMPARRAY input_buf,
nuclear@0 566 JSAMPARRAY output_buf, int num_rows)
nuclear@0 567 /* Fast path for out_color_components==3, with ordered dithering */
nuclear@0 568 {
nuclear@0 569 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 570 register int pixcode;
nuclear@0 571 register JSAMPROW input_ptr;
nuclear@0 572 register JSAMPROW output_ptr;
nuclear@0 573 JSAMPROW colorindex0 = cquantize->colorindex[0];
nuclear@0 574 JSAMPROW colorindex1 = cquantize->colorindex[1];
nuclear@0 575 JSAMPROW colorindex2 = cquantize->colorindex[2];
nuclear@0 576 int * dither0; /* points to active row of dither matrix */
nuclear@0 577 int * dither1;
nuclear@0 578 int * dither2;
nuclear@0 579 int row_index, col_index; /* current indexes into dither matrix */
nuclear@0 580 int row;
nuclear@0 581 JDIMENSION col;
nuclear@0 582 JDIMENSION width = cinfo->output_width;
nuclear@0 583
nuclear@0 584 for (row = 0; row < num_rows; row++) {
nuclear@0 585 row_index = cquantize->row_index;
nuclear@0 586 input_ptr = input_buf[row];
nuclear@0 587 output_ptr = output_buf[row];
nuclear@0 588 dither0 = cquantize->odither[0][row_index];
nuclear@0 589 dither1 = cquantize->odither[1][row_index];
nuclear@0 590 dither2 = cquantize->odither[2][row_index];
nuclear@0 591 col_index = 0;
nuclear@0 592
nuclear@0 593 for (col = width; col > 0; col--) {
nuclear@0 594 pixcode = GETJSAMPLE(colorindex0[GETJSAMPLE(*input_ptr++) +
nuclear@0 595 dither0[col_index]]);
nuclear@0 596 pixcode += GETJSAMPLE(colorindex1[GETJSAMPLE(*input_ptr++) +
nuclear@0 597 dither1[col_index]]);
nuclear@0 598 pixcode += GETJSAMPLE(colorindex2[GETJSAMPLE(*input_ptr++) +
nuclear@0 599 dither2[col_index]]);
nuclear@0 600 *output_ptr++ = (JSAMPLE) pixcode;
nuclear@0 601 col_index = (col_index + 1) & ODITHER_MASK;
nuclear@0 602 }
nuclear@0 603 row_index = (row_index + 1) & ODITHER_MASK;
nuclear@0 604 cquantize->row_index = row_index;
nuclear@0 605 }
nuclear@0 606 }
nuclear@0 607
nuclear@0 608
nuclear@0 609 METHODDEF(void)
nuclear@0 610 quantize_fs_dither (j_decompress_ptr cinfo, JSAMPARRAY input_buf,
nuclear@0 611 JSAMPARRAY output_buf, int num_rows)
nuclear@0 612 /* General case, with Floyd-Steinberg dithering */
nuclear@0 613 {
nuclear@0 614 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 615 register LOCFSERROR cur; /* current error or pixel value */
nuclear@0 616 LOCFSERROR belowerr; /* error for pixel below cur */
nuclear@0 617 LOCFSERROR bpreverr; /* error for below/prev col */
nuclear@0 618 LOCFSERROR bnexterr; /* error for below/next col */
nuclear@0 619 LOCFSERROR delta;
nuclear@0 620 register FSERRPTR errorptr; /* => fserrors[] at column before current */
nuclear@0 621 register JSAMPROW input_ptr;
nuclear@0 622 register JSAMPROW output_ptr;
nuclear@0 623 JSAMPROW colorindex_ci;
nuclear@0 624 JSAMPROW colormap_ci;
nuclear@0 625 int pixcode;
nuclear@0 626 int nc = cinfo->out_color_components;
nuclear@0 627 int dir; /* 1 for left-to-right, -1 for right-to-left */
nuclear@0 628 int dirnc; /* dir * nc */
nuclear@0 629 int ci;
nuclear@0 630 int row;
nuclear@0 631 JDIMENSION col;
nuclear@0 632 JDIMENSION width = cinfo->output_width;
nuclear@0 633 JSAMPLE *range_limit = cinfo->sample_range_limit;
nuclear@0 634 SHIFT_TEMPS
nuclear@0 635
nuclear@0 636 for (row = 0; row < num_rows; row++) {
nuclear@0 637 /* Initialize output values to 0 so can process components separately */
nuclear@0 638 jzero_far((void FAR *) output_buf[row],
nuclear@0 639 (size_t) (width * SIZEOF(JSAMPLE)));
nuclear@0 640 for (ci = 0; ci < nc; ci++) {
nuclear@0 641 input_ptr = input_buf[row] + ci;
nuclear@0 642 output_ptr = output_buf[row];
nuclear@0 643 if (cquantize->on_odd_row) {
nuclear@0 644 /* work right to left in this row */
nuclear@0 645 input_ptr += (width-1) * nc; /* so point to rightmost pixel */
nuclear@0 646 output_ptr += width-1;
nuclear@0 647 dir = -1;
nuclear@0 648 dirnc = -nc;
nuclear@0 649 errorptr = cquantize->fserrors[ci] + (width+1); /* => entry after last column */
nuclear@0 650 } else {
nuclear@0 651 /* work left to right in this row */
nuclear@0 652 dir = 1;
nuclear@0 653 dirnc = nc;
nuclear@0 654 errorptr = cquantize->fserrors[ci]; /* => entry before first column */
nuclear@0 655 }
nuclear@0 656 colorindex_ci = cquantize->colorindex[ci];
nuclear@0 657 colormap_ci = cquantize->sv_colormap[ci];
nuclear@0 658 /* Preset error values: no error propagated to first pixel from left */
nuclear@0 659 cur = 0;
nuclear@0 660 /* and no error propagated to row below yet */
nuclear@0 661 belowerr = bpreverr = 0;
nuclear@0 662
nuclear@0 663 for (col = width; col > 0; col--) {
nuclear@0 664 /* cur holds the error propagated from the previous pixel on the
nuclear@0 665 * current line. Add the error propagated from the previous line
nuclear@0 666 * to form the complete error correction term for this pixel, and
nuclear@0 667 * round the error term (which is expressed * 16) to an integer.
nuclear@0 668 * RIGHT_SHIFT rounds towards minus infinity, so adding 8 is correct
nuclear@0 669 * for either sign of the error value.
nuclear@0 670 * Note: errorptr points to *previous* column's array entry.
nuclear@0 671 */
nuclear@0 672 cur = RIGHT_SHIFT(cur + errorptr[dir] + 8, 4);
nuclear@0 673 /* Form pixel value + error, and range-limit to 0..MAXJSAMPLE.
nuclear@0 674 * The maximum error is +- MAXJSAMPLE; this sets the required size
nuclear@0 675 * of the range_limit array.
nuclear@0 676 */
nuclear@0 677 cur += GETJSAMPLE(*input_ptr);
nuclear@0 678 cur = GETJSAMPLE(range_limit[cur]);
nuclear@0 679 /* Select output value, accumulate into output code for this pixel */
nuclear@0 680 pixcode = GETJSAMPLE(colorindex_ci[cur]);
nuclear@0 681 *output_ptr += (JSAMPLE) pixcode;
nuclear@0 682 /* Compute actual representation error at this pixel */
nuclear@0 683 /* Note: we can do this even though we don't have the final */
nuclear@0 684 /* pixel code, because the colormap is orthogonal. */
nuclear@0 685 cur -= GETJSAMPLE(colormap_ci[pixcode]);
nuclear@0 686 /* Compute error fractions to be propagated to adjacent pixels.
nuclear@0 687 * Add these into the running sums, and simultaneously shift the
nuclear@0 688 * next-line error sums left by 1 column.
nuclear@0 689 */
nuclear@0 690 bnexterr = cur;
nuclear@0 691 delta = cur * 2;
nuclear@0 692 cur += delta; /* form error * 3 */
nuclear@0 693 errorptr[0] = (FSERROR) (bpreverr + cur);
nuclear@0 694 cur += delta; /* form error * 5 */
nuclear@0 695 bpreverr = belowerr + cur;
nuclear@0 696 belowerr = bnexterr;
nuclear@0 697 cur += delta; /* form error * 7 */
nuclear@0 698 /* At this point cur contains the 7/16 error value to be propagated
nuclear@0 699 * to the next pixel on the current line, and all the errors for the
nuclear@0 700 * next line have been shifted over. We are therefore ready to move on.
nuclear@0 701 */
nuclear@0 702 input_ptr += dirnc; /* advance input ptr to next column */
nuclear@0 703 output_ptr += dir; /* advance output ptr to next column */
nuclear@0 704 errorptr += dir; /* advance errorptr to current column */
nuclear@0 705 }
nuclear@0 706 /* Post-loop cleanup: we must unload the final error value into the
nuclear@0 707 * final fserrors[] entry. Note we need not unload belowerr because
nuclear@0 708 * it is for the dummy column before or after the actual array.
nuclear@0 709 */
nuclear@0 710 errorptr[0] = (FSERROR) bpreverr; /* unload prev err into array */
nuclear@0 711 }
nuclear@0 712 cquantize->on_odd_row = (cquantize->on_odd_row ? FALSE : TRUE);
nuclear@0 713 }
nuclear@0 714 }
nuclear@0 715
nuclear@0 716
nuclear@0 717 /*
nuclear@0 718 * Allocate workspace for Floyd-Steinberg errors.
nuclear@0 719 */
nuclear@0 720
nuclear@0 721 LOCAL(void)
nuclear@0 722 alloc_fs_workspace (j_decompress_ptr cinfo)
nuclear@0 723 {
nuclear@0 724 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 725 size_t arraysize;
nuclear@0 726 int i;
nuclear@0 727
nuclear@0 728 arraysize = (size_t) ((cinfo->output_width + 2) * SIZEOF(FSERROR));
nuclear@0 729 for (i = 0; i < cinfo->out_color_components; i++) {
nuclear@0 730 cquantize->fserrors[i] = (FSERRPTR)
nuclear@0 731 (*cinfo->mem->alloc_large)((j_common_ptr) cinfo, JPOOL_IMAGE, arraysize);
nuclear@0 732 }
nuclear@0 733 }
nuclear@0 734
nuclear@0 735
nuclear@0 736 /*
nuclear@0 737 * Initialize for one-pass color quantization.
nuclear@0 738 */
nuclear@0 739
nuclear@0 740 METHODDEF(void)
nuclear@0 741 start_pass_1_quant (j_decompress_ptr cinfo, boolean is_pre_scan)
nuclear@0 742 {
nuclear@0 743 my_cquantize_ptr cquantize = (my_cquantize_ptr) cinfo->cquantize;
nuclear@0 744 size_t arraysize;
nuclear@0 745 int i;
nuclear@0 746
nuclear@0 747 /* Install my colormap. */
nuclear@0 748 cinfo->colormap = cquantize->sv_colormap;
nuclear@0 749 cinfo->actual_number_of_colors = cquantize->sv_actual;
nuclear@0 750
nuclear@0 751 /* Initialize for desired dithering mode. */
nuclear@0 752 switch (cinfo->dither_mode) {
nuclear@0 753 case JDITHER_NONE:
nuclear@0 754 if (cinfo->out_color_components == 3)
nuclear@0 755 cquantize->pub.color_quantize = color_quantize3;
nuclear@0 756 else
nuclear@0 757 cquantize->pub.color_quantize = color_quantize;
nuclear@0 758 break;
nuclear@0 759 case JDITHER_ORDERED:
nuclear@0 760 if (cinfo->out_color_components == 3)
nuclear@0 761 cquantize->pub.color_quantize = quantize3_ord_dither;
nuclear@0 762 else
nuclear@0 763 cquantize->pub.color_quantize = quantize_ord_dither;
nuclear@0 764 cquantize->row_index = 0; /* initialize state for ordered dither */
nuclear@0 765 /* If user changed to ordered dither from another mode,
nuclear@0 766 * we must recreate the color index table with padding.
nuclear@0 767 * This will cost extra space, but probably isn't very likely.
nuclear@0 768 */
nuclear@0 769 if (! cquantize->is_padded)
nuclear@0 770 create_colorindex(cinfo);
nuclear@0 771 /* Create ordered-dither tables if we didn't already. */
nuclear@0 772 if (cquantize->odither[0] == NULL)
nuclear@0 773 create_odither_tables(cinfo);
nuclear@0 774 break;
nuclear@0 775 case JDITHER_FS:
nuclear@0 776 cquantize->pub.color_quantize = quantize_fs_dither;
nuclear@0 777 cquantize->on_odd_row = FALSE; /* initialize state for F-S dither */
nuclear@0 778 /* Allocate Floyd-Steinberg workspace if didn't already. */
nuclear@0 779 if (cquantize->fserrors[0] == NULL)
nuclear@0 780 alloc_fs_workspace(cinfo);
nuclear@0 781 /* Initialize the propagated errors to zero. */
nuclear@0 782 arraysize = (size_t) ((cinfo->output_width + 2) * SIZEOF(FSERROR));
nuclear@0 783 for (i = 0; i < cinfo->out_color_components; i++)
nuclear@0 784 jzero_far((void FAR *) cquantize->fserrors[i], arraysize);
nuclear@0 785 break;
nuclear@0 786 default:
nuclear@0 787 ERREXIT(cinfo, JERR_NOT_COMPILED);
nuclear@0 788 break;
nuclear@0 789 }
nuclear@0 790 }
nuclear@0 791
nuclear@0 792
nuclear@0 793 /*
nuclear@0 794 * Finish up at the end of the pass.
nuclear@0 795 */
nuclear@0 796
nuclear@0 797 METHODDEF(void)
nuclear@0 798 finish_pass_1_quant (j_decompress_ptr cinfo)
nuclear@0 799 {
nuclear@0 800 /* no work in 1-pass case */
nuclear@0 801 }
nuclear@0 802
nuclear@0 803
nuclear@0 804 /*
nuclear@0 805 * Switch to a new external colormap between output passes.
nuclear@0 806 * Shouldn't get to this module!
nuclear@0 807 */
nuclear@0 808
nuclear@0 809 METHODDEF(void)
nuclear@0 810 new_color_map_1_quant (j_decompress_ptr cinfo)
nuclear@0 811 {
nuclear@0 812 ERREXIT(cinfo, JERR_MODE_CHANGE);
nuclear@0 813 }
nuclear@0 814
nuclear@0 815
nuclear@0 816 /*
nuclear@0 817 * Module initialization routine for 1-pass color quantization.
nuclear@0 818 */
nuclear@0 819
nuclear@0 820 GLOBAL(void)
nuclear@0 821 jinit_1pass_quantizer (j_decompress_ptr cinfo)
nuclear@0 822 {
nuclear@0 823 my_cquantize_ptr cquantize;
nuclear@0 824
nuclear@0 825 cquantize = (my_cquantize_ptr)
nuclear@0 826 (*cinfo->mem->alloc_small) ((j_common_ptr) cinfo, JPOOL_IMAGE,
nuclear@0 827 SIZEOF(my_cquantizer));
nuclear@0 828 cinfo->cquantize = (struct jpeg_color_quantizer *) cquantize;
nuclear@0 829 cquantize->pub.start_pass = start_pass_1_quant;
nuclear@0 830 cquantize->pub.finish_pass = finish_pass_1_quant;
nuclear@0 831 cquantize->pub.new_color_map = new_color_map_1_quant;
nuclear@0 832 cquantize->fserrors[0] = NULL; /* Flag FS workspace not allocated */
nuclear@0 833 cquantize->odither[0] = NULL; /* Also flag odither arrays not allocated */
nuclear@0 834
nuclear@0 835 /* Make sure my internal arrays won't overflow */
nuclear@0 836 if (cinfo->out_color_components > MAX_Q_COMPS)
nuclear@0 837 ERREXIT1(cinfo, JERR_QUANT_COMPONENTS, MAX_Q_COMPS);
nuclear@0 838 /* Make sure colormap indexes can be represented by JSAMPLEs */
nuclear@0 839 if (cinfo->desired_number_of_colors > (MAXJSAMPLE+1))
nuclear@0 840 ERREXIT1(cinfo, JERR_QUANT_MANY_COLORS, MAXJSAMPLE+1);
nuclear@0 841
nuclear@0 842 /* Create the colormap and color index table. */
nuclear@0 843 create_colormap(cinfo);
nuclear@0 844 create_colorindex(cinfo);
nuclear@0 845
nuclear@0 846 /* Allocate Floyd-Steinberg workspace now if requested.
nuclear@0 847 * We do this now since it is FAR storage and may affect the memory
nuclear@0 848 * manager's space calculations. If the user changes to FS dither
nuclear@0 849 * mode in a later pass, we will allocate the space then, and will
nuclear@0 850 * possibly overrun the max_memory_to_use setting.
nuclear@0 851 */
nuclear@0 852 if (cinfo->dither_mode == JDITHER_FS)
nuclear@0 853 alloc_fs_workspace(cinfo);
nuclear@0 854 }
nuclear@0 855
nuclear@0 856 #endif /* QUANT_1PASS_SUPPORTED */