Coverage Report

Created: 2026-08-13 07:11

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