Coverage Report

Created: 2026-02-14 07:17

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