Coverage Report

Created: 2024-06-18 06:05

/src/libjpeg-turbo/jdsample.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * jdsample.c
3
 *
4
 * This file was part of the Independent JPEG Group's software:
5
 * Copyright (C) 1991-1996, Thomas G. Lane.
6
 * libjpeg-turbo Modifications:
7
 * Copyright 2009 Pierre Ossman <ossman@cendio.se> for Cendio AB
8
 * Copyright (C) 2010, 2015-2016, 2022, D. R. Commander.
9
 * Copyright (C) 2014, MIPS Technologies, Inc., California.
10
 * Copyright (C) 2015, Google, Inc.
11
 * Copyright (C) 2019-2020, Arm Limited.
12
 * For conditions of distribution and use, see the accompanying README.ijg
13
 * file.
14
 *
15
 * This file contains upsampling routines.
16
 *
17
 * Upsampling input data is counted in "row groups".  A row group
18
 * is defined to be (v_samp_factor * DCT_scaled_size / min_DCT_scaled_size)
19
 * sample rows of each component.  Upsampling will normally produce
20
 * max_v_samp_factor pixel rows from each row group (but this could vary
21
 * if the upsampler is applying a scale factor of its own).
22
 *
23
 * An excellent reference for image resampling is
24
 *   Digital Image Warping, George Wolberg, 1990.
25
 *   Pub. by IEEE Computer Society Press, Los Alamitos, CA. ISBN 0-8186-8944-7.
26
 */
27
28
#include "jinclude.h"
29
#include "jdsample.h"
30
#include "jsimd.h"
31
#include "jpegapicomp.h"
32
33
34
35
#if BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED)
36
37
/*
38
 * Initialize for an upsampling pass.
39
 */
40
41
METHODDEF(void)
42
start_pass_upsample(j_decompress_ptr cinfo)
43
0
{
44
0
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
45
46
  /* Mark the conversion buffer empty */
47
0
  upsample->next_row_out = cinfo->max_v_samp_factor;
48
  /* Initialize total-height counter for detecting bottom of image */
49
0
  upsample->rows_to_go = cinfo->output_height;
50
0
}
51
52
53
/*
54
 * Control routine to do upsampling (and color conversion).
55
 *
56
 * In this version we upsample each component independently.
57
 * We upsample one row group into the conversion buffer, then apply
58
 * color conversion a row at a time.
59
 */
60
61
METHODDEF(void)
62
sep_upsample(j_decompress_ptr cinfo, _JSAMPIMAGE input_buf,
63
             JDIMENSION *in_row_group_ctr, JDIMENSION in_row_groups_avail,
64
             _JSAMPARRAY output_buf, JDIMENSION *out_row_ctr,
65
             JDIMENSION out_rows_avail)
66
0
{
67
0
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
68
0
  int ci;
69
0
  jpeg_component_info *compptr;
70
0
  JDIMENSION num_rows;
71
72
  /* Fill the conversion buffer, if it's empty */
73
0
  if (upsample->next_row_out >= cinfo->max_v_samp_factor) {
74
0
    for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
75
0
         ci++, compptr++) {
76
      /* Invoke per-component upsample method.  Notice we pass a POINTER
77
       * to color_buf[ci], so that fullsize_upsample can change it.
78
       */
79
0
      (*upsample->methods[ci]) (cinfo, compptr,
80
0
        input_buf[ci] + (*in_row_group_ctr * upsample->rowgroup_height[ci]),
81
0
        upsample->color_buf + ci);
82
0
    }
83
0
    upsample->next_row_out = 0;
84
0
  }
85
86
  /* Color-convert and emit rows */
87
88
  /* How many we have in the buffer: */
89
0
  num_rows = (JDIMENSION)(cinfo->max_v_samp_factor - upsample->next_row_out);
90
  /* Not more than the distance to the end of the image.  Need this test
91
   * in case the image height is not a multiple of max_v_samp_factor:
92
   */
93
0
  if (num_rows > upsample->rows_to_go)
94
0
    num_rows = upsample->rows_to_go;
95
  /* And not more than what the client can accept: */
96
0
  out_rows_avail -= *out_row_ctr;
97
0
  if (num_rows > out_rows_avail)
98
0
    num_rows = out_rows_avail;
99
100
0
  (*cinfo->cconvert->_color_convert) (cinfo, upsample->color_buf,
101
0
                                      (JDIMENSION)upsample->next_row_out,
102
0
                                      output_buf + *out_row_ctr,
103
0
                                      (int)num_rows);
104
105
  /* Adjust counts */
106
0
  *out_row_ctr += num_rows;
107
0
  upsample->rows_to_go -= num_rows;
108
0
  upsample->next_row_out += num_rows;
109
  /* When the buffer is emptied, declare this input row group consumed */
110
0
  if (upsample->next_row_out >= cinfo->max_v_samp_factor)
111
0
    (*in_row_group_ctr)++;
112
0
}
113
114
115
/*
116
 * These are the routines invoked by sep_upsample to upsample pixel values
117
 * of a single component.  One row group is processed per call.
118
 */
119
120
121
/*
122
 * For full-size components, we just make color_buf[ci] point at the
123
 * input buffer, and thus avoid copying any data.  Note that this is
124
 * safe only because sep_upsample doesn't declare the input row group
125
 * "consumed" until we are done color converting and emitting it.
126
 */
127
128
METHODDEF(void)
129
fullsize_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr,
130
                  _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr)
131
0
{
132
0
  *output_data_ptr = input_data;
133
0
}
134
135
136
/*
137
 * This is a no-op version used for "uninteresting" components.
138
 * These components will not be referenced by color conversion.
139
 */
140
141
METHODDEF(void)
142
noop_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr,
143
              _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr)
144
0
{
145
0
  *output_data_ptr = NULL;      /* safety check */
146
0
}
147
148
149
/*
150
 * This version handles any integral sampling ratios.
151
 * This is not used for typical JPEG files, so it need not be fast.
152
 * Nor, for that matter, is it particularly accurate: the algorithm is
153
 * simple replication of the input pixel onto the corresponding output
154
 * pixels.  The hi-falutin sampling literature refers to this as a
155
 * "box filter".  A box filter tends to introduce visible artifacts,
156
 * so if you are actually going to use 3:1 or 4:1 sampling ratios
157
 * you would be well advised to improve this code.
158
 */
159
160
METHODDEF(void)
161
int_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr,
162
             _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr)
163
0
{
164
0
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
165
0
  _JSAMPARRAY output_data = *output_data_ptr;
166
0
  register _JSAMPROW inptr, outptr;
167
0
  register _JSAMPLE invalue;
168
0
  register int h;
169
0
  _JSAMPROW outend;
170
0
  int h_expand, v_expand;
171
0
  int inrow, outrow;
172
173
0
  h_expand = upsample->h_expand[compptr->component_index];
174
0
  v_expand = upsample->v_expand[compptr->component_index];
175
176
0
  inrow = outrow = 0;
177
0
  while (outrow < cinfo->max_v_samp_factor) {
178
    /* Generate one output row with proper horizontal expansion */
179
0
    inptr = input_data[inrow];
180
0
    outptr = output_data[outrow];
181
0
    outend = outptr + cinfo->output_width;
182
0
    while (outptr < outend) {
183
0
      invalue = *inptr++;
184
0
      for (h = h_expand; h > 0; h--) {
185
0
        *outptr++ = invalue;
186
0
      }
187
0
    }
188
    /* Generate any additional output rows by duplicating the first one */
189
0
    if (v_expand > 1) {
190
0
      _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1,
191
0
                         v_expand - 1, cinfo->output_width);
192
0
    }
193
0
    inrow++;
194
0
    outrow += v_expand;
195
0
  }
196
0
}
197
198
199
/*
200
 * Fast processing for the common case of 2:1 horizontal and 1:1 vertical.
201
 * It's still a box filter.
202
 */
203
204
METHODDEF(void)
205
h2v1_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr,
206
              _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr)
207
0
{
208
0
  _JSAMPARRAY output_data = *output_data_ptr;
209
0
  register _JSAMPROW inptr, outptr;
210
0
  register _JSAMPLE invalue;
211
0
  _JSAMPROW outend;
212
0
  int inrow;
213
214
0
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
215
0
    inptr = input_data[inrow];
216
0
    outptr = output_data[inrow];
217
0
    outend = outptr + cinfo->output_width;
218
0
    while (outptr < outend) {
219
0
      invalue = *inptr++;
220
0
      *outptr++ = invalue;
221
0
      *outptr++ = invalue;
222
0
    }
223
0
  }
224
0
}
225
226
227
/*
228
 * Fast processing for the common case of 2:1 horizontal and 2:1 vertical.
229
 * It's still a box filter.
230
 */
231
232
METHODDEF(void)
233
h2v2_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr,
234
              _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr)
235
0
{
236
0
  _JSAMPARRAY output_data = *output_data_ptr;
237
0
  register _JSAMPROW inptr, outptr;
238
0
  register _JSAMPLE invalue;
239
0
  _JSAMPROW outend;
240
0
  int inrow, outrow;
241
242
0
  inrow = outrow = 0;
243
0
  while (outrow < cinfo->max_v_samp_factor) {
244
0
    inptr = input_data[inrow];
245
0
    outptr = output_data[outrow];
246
0
    outend = outptr + cinfo->output_width;
247
0
    while (outptr < outend) {
248
0
      invalue = *inptr++;
249
0
      *outptr++ = invalue;
250
0
      *outptr++ = invalue;
251
0
    }
252
0
    _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1, 1,
253
0
                       cinfo->output_width);
254
0
    inrow++;
255
0
    outrow += 2;
256
0
  }
257
0
}
258
259
260
/*
261
 * Fancy processing for the common case of 2:1 horizontal and 1:1 vertical.
262
 *
263
 * The upsampling algorithm is linear interpolation between pixel centers,
264
 * also known as a "triangle filter".  This is a good compromise between
265
 * speed and visual quality.  The centers of the output pixels are 1/4 and 3/4
266
 * of the way between input pixel centers.
267
 *
268
 * A note about the "bias" calculations: when rounding fractional values to
269
 * integer, we do not want to always round 0.5 up to the next integer.
270
 * If we did that, we'd introduce a noticeable bias towards larger values.
271
 * Instead, this code is arranged so that 0.5 will be rounded up or down at
272
 * alternate pixel locations (a simple ordered dither pattern).
273
 */
274
275
METHODDEF(void)
276
h2v1_fancy_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr,
277
                    _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr)
278
0
{
279
0
  _JSAMPARRAY output_data = *output_data_ptr;
280
0
  register _JSAMPROW inptr, outptr;
281
0
  register int invalue;
282
0
  register JDIMENSION colctr;
283
0
  int inrow;
284
285
0
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
286
0
    inptr = input_data[inrow];
287
0
    outptr = output_data[inrow];
288
    /* Special case for first column */
289
0
    invalue = *inptr++;
290
0
    *outptr++ = (_JSAMPLE)invalue;
291
0
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[0] + 2) >> 2);
292
293
0
    for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
294
      /* General case: 3/4 * nearer pixel + 1/4 * further pixel */
295
0
      invalue = (*inptr++) * 3;
296
0
      *outptr++ = (_JSAMPLE)((invalue + inptr[-2] + 1) >> 2);
297
0
      *outptr++ = (_JSAMPLE)((invalue + inptr[0] + 2) >> 2);
298
0
    }
299
300
    /* Special case for last column */
301
0
    invalue = *inptr;
302
0
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[-1] + 1) >> 2);
303
0
    *outptr++ = (_JSAMPLE)invalue;
304
0
  }
305
0
}
306
307
308
/*
309
 * Fancy processing for 1:1 horizontal and 2:1 vertical (4:4:0 subsampling).
310
 *
311
 * This is a less common case, but it can be encountered when losslessly
312
 * rotating/transposing a JPEG file that uses 4:2:2 chroma subsampling.
313
 */
314
315
METHODDEF(void)
316
h1v2_fancy_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr,
317
                    _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr)
318
0
{
319
0
  _JSAMPARRAY output_data = *output_data_ptr;
320
0
  _JSAMPROW inptr0, inptr1, outptr;
321
0
#if BITS_IN_JSAMPLE == 8
322
0
  int thiscolsum, bias;
323
#else
324
  JLONG thiscolsum, bias;
325
#endif
326
0
  JDIMENSION colctr;
327
0
  int inrow, outrow, v;
328
329
0
  inrow = outrow = 0;
330
0
  while (outrow < cinfo->max_v_samp_factor) {
331
0
    for (v = 0; v < 2; v++) {
332
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
333
0
      inptr0 = input_data[inrow];
334
0
      if (v == 0) {             /* next nearest is row above */
335
0
        inptr1 = input_data[inrow - 1];
336
0
        bias = 1;
337
0
      } else {                  /* next nearest is row below */
338
0
        inptr1 = input_data[inrow + 1];
339
0
        bias = 2;
340
0
      }
341
0
      outptr = output_data[outrow++];
342
343
0
      for (colctr = 0; colctr < compptr->downsampled_width; colctr++) {
344
0
        thiscolsum = (*inptr0++) * 3 + (*inptr1++);
345
0
        *outptr++ = (_JSAMPLE)((thiscolsum + bias) >> 2);
346
0
      }
347
0
    }
348
0
    inrow++;
349
0
  }
350
0
}
351
352
353
/*
354
 * Fancy processing for the common case of 2:1 horizontal and 2:1 vertical.
355
 * Again a triangle filter; see comments for h2v1 case, above.
356
 *
357
 * It is OK for us to reference the adjacent input rows because we demanded
358
 * context from the main buffer controller (see initialization code).
359
 */
360
361
METHODDEF(void)
362
h2v2_fancy_upsample(j_decompress_ptr cinfo, jpeg_component_info *compptr,
363
                    _JSAMPARRAY input_data, _JSAMPARRAY *output_data_ptr)
364
0
{
365
0
  _JSAMPARRAY output_data = *output_data_ptr;
366
0
  register _JSAMPROW inptr0, inptr1, outptr;
367
0
#if BITS_IN_JSAMPLE == 8
368
0
  register int thiscolsum, lastcolsum, nextcolsum;
369
#else
370
  register JLONG thiscolsum, lastcolsum, nextcolsum;
371
#endif
372
0
  register JDIMENSION colctr;
373
0
  int inrow, outrow, v;
374
375
0
  inrow = outrow = 0;
376
0
  while (outrow < cinfo->max_v_samp_factor) {
377
0
    for (v = 0; v < 2; v++) {
378
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
379
0
      inptr0 = input_data[inrow];
380
0
      if (v == 0)               /* next nearest is row above */
381
0
        inptr1 = input_data[inrow - 1];
382
0
      else                      /* next nearest is row below */
383
0
        inptr1 = input_data[inrow + 1];
384
0
      outptr = output_data[outrow++];
385
386
      /* Special case for first column */
387
0
      thiscolsum = (*inptr0++) * 3 + (*inptr1++);
388
0
      nextcolsum = (*inptr0++) * 3 + (*inptr1++);
389
0
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 8) >> 4);
390
0
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
391
0
      lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
392
393
0
      for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
394
        /* General case: 3/4 * nearer pixel + 1/4 * further pixel in each */
395
        /* dimension, thus 9/16, 3/16, 3/16, 1/16 overall */
396
0
        nextcolsum = (*inptr0++) * 3 + (*inptr1++);
397
0
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
398
0
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
399
0
        lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
400
0
      }
401
402
      /* Special case for last column */
403
0
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
404
0
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 7) >> 4);
405
0
    }
406
0
    inrow++;
407
0
  }
408
0
}
409
410
411
/*
412
 * Module initialization routine for upsampling.
413
 */
414
415
GLOBAL(void)
416
_jinit_upsampler(j_decompress_ptr cinfo)
417
0
{
418
0
  my_upsample_ptr upsample;
419
0
  int ci;
420
0
  jpeg_component_info *compptr;
421
0
  boolean need_buffer, do_fancy;
422
0
  int h_in_group, v_in_group, h_out_group, v_out_group;
423
424
0
  if (cinfo->data_precision != BITS_IN_JSAMPLE)
425
0
    ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
426
427
0
  if (!cinfo->master->jinit_upsampler_no_alloc) {
428
0
    upsample = (my_upsample_ptr)
429
0
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
430
0
                                  sizeof(my_upsampler));
431
0
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
432
0
    upsample->pub.start_pass = start_pass_upsample;
433
0
    upsample->pub._upsample = sep_upsample;
434
0
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
435
0
  } else
436
0
    upsample = (my_upsample_ptr)cinfo->upsample;
437
438
0
  if (cinfo->CCIR601_sampling)  /* this isn't supported */
439
0
    ERREXIT(cinfo, JERR_CCIR601_NOTIMPL);
440
441
  /* jdmainct.c doesn't support context rows when min_DCT_scaled_size = 1,
442
   * so don't ask for it.
443
   */
444
0
  do_fancy = cinfo->do_fancy_upsampling && cinfo->_min_DCT_scaled_size > 1;
445
446
  /* Verify we can handle the sampling factors, select per-component methods,
447
   * and create storage as needed.
448
   */
449
0
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
450
0
       ci++, compptr++) {
451
    /* Compute size of an "input group" after IDCT scaling.  This many samples
452
     * are to be converted to max_h_samp_factor * max_v_samp_factor pixels.
453
     */
454
0
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
455
0
                 cinfo->_min_DCT_scaled_size;
456
0
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
457
0
                 cinfo->_min_DCT_scaled_size;
458
0
    h_out_group = cinfo->max_h_samp_factor;
459
0
    v_out_group = cinfo->max_v_samp_factor;
460
0
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
461
0
    need_buffer = TRUE;
462
0
    if (!compptr->component_needed) {
463
      /* Don't bother to upsample an uninteresting component. */
464
0
      upsample->methods[ci] = noop_upsample;
465
0
      need_buffer = FALSE;
466
0
    } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
467
      /* Fullsize components can be processed without any work. */
468
0
      upsample->methods[ci] = fullsize_upsample;
469
0
      need_buffer = FALSE;
470
0
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
471
      /* Special cases for 2h1v upsampling */
472
0
      if (do_fancy && compptr->downsampled_width > 2) {
473
#ifdef WITH_SIMD
474
0
        if (jsimd_can_h2v1_fancy_upsample())
475
0
          upsample->methods[ci] = jsimd_h2v1_fancy_upsample;
476
0
        else
477
0
#endif
478
0
          upsample->methods[ci] = h2v1_fancy_upsample;
479
0
      } else {
480
#ifdef WITH_SIMD
481
0
        if (jsimd_can_h2v1_upsample())
482
0
          upsample->methods[ci] = jsimd_h2v1_upsample;
483
0
        else
484
0
#endif
485
0
          upsample->methods[ci] = h2v1_upsample;
486
0
      }
487
0
    } else if (h_in_group == h_out_group &&
488
0
               v_in_group * 2 == v_out_group && do_fancy) {
489
      /* Non-fancy upsampling is handled by the generic method */
490
#if defined(WITH_SIMD) && (defined(__arm__) || defined(__aarch64__) || \
491
                           defined(_M_ARM) || defined(_M_ARM64))
492
      if (jsimd_can_h1v2_fancy_upsample())
493
        upsample->methods[ci] = jsimd_h1v2_fancy_upsample;
494
      else
495
#endif
496
0
        upsample->methods[ci] = h1v2_fancy_upsample;
497
0
      upsample->pub.need_context_rows = TRUE;
498
0
    } else if (h_in_group * 2 == h_out_group &&
499
0
               v_in_group * 2 == v_out_group) {
500
      /* Special cases for 2h2v upsampling */
501
0
      if (do_fancy && compptr->downsampled_width > 2) {
502
#ifdef WITH_SIMD
503
0
        if (jsimd_can_h2v2_fancy_upsample())
504
0
          upsample->methods[ci] = jsimd_h2v2_fancy_upsample;
505
0
        else
506
0
#endif
507
0
          upsample->methods[ci] = h2v2_fancy_upsample;
508
0
        upsample->pub.need_context_rows = TRUE;
509
0
      } else {
510
#ifdef WITH_SIMD
511
0
        if (jsimd_can_h2v2_upsample())
512
0
          upsample->methods[ci] = jsimd_h2v2_upsample;
513
0
        else
514
0
#endif
515
0
          upsample->methods[ci] = h2v2_upsample;
516
0
      }
517
0
    } else if ((h_out_group % h_in_group) == 0 &&
518
0
               (v_out_group % v_in_group) == 0) {
519
      /* Generic integral-factors upsampling method */
520
#if defined(WITH_SIMD) && defined(__mips__)
521
      if (jsimd_can_int_upsample())
522
        upsample->methods[ci] = jsimd_int_upsample;
523
      else
524
#endif
525
0
        upsample->methods[ci] = int_upsample;
526
0
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
527
0
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
528
0
    } else
529
0
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
530
0
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
531
0
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
532
0
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
533
0
         (JDIMENSION)jround_up((long)cinfo->output_width,
534
0
                               (long)cinfo->max_h_samp_factor),
535
0
         (JDIMENSION)cinfo->max_v_samp_factor);
536
0
    }
537
0
  }
538
0
}
Unexecuted instantiation: jinit_upsampler
Unexecuted instantiation: j12init_upsampler
Unexecuted instantiation: j16init_upsampler
539
540
#endif /* BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) */