Coverage Report

Created: 2026-10-17 06:58

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
4.91k
{
48
4.91k
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
49
50
  /* Mark the conversion buffer empty */
51
4.91k
  upsample->next_row_out = cinfo->max_v_samp_factor;
52
  /* Initialize total-height counter for detecting bottom of image */
53
4.91k
  upsample->rows_to_go = cinfo->output_height;
54
4.91k
}
jdsample-8.c:start_pass_upsample
Line
Count
Source
47
4.62k
{
48
4.62k
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
49
50
  /* Mark the conversion buffer empty */
51
4.62k
  upsample->next_row_out = cinfo->max_v_samp_factor;
52
  /* Initialize total-height counter for detecting bottom of image */
53
4.62k
  upsample->rows_to_go = cinfo->output_height;
54
4.62k
}
jdsample-12.c:start_pass_upsample
Line
Count
Source
47
256
{
48
256
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
49
50
  /* Mark the conversion buffer empty */
51
256
  upsample->next_row_out = cinfo->max_v_samp_factor;
52
  /* Initialize total-height counter for detecting bottom of image */
53
256
  upsample->rows_to_go = cinfo->output_height;
54
256
}
jdsample-16.c:start_pass_upsample
Line
Count
Source
47
27
{
48
27
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
49
50
  /* Mark the conversion buffer empty */
51
27
  upsample->next_row_out = cinfo->max_v_samp_factor;
52
  /* Initialize total-height counter for detecting bottom of image */
53
27
  upsample->rows_to_go = cinfo->output_height;
54
27
}
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.57M
{
71
4.57M
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
72
4.57M
  int ci;
73
4.57M
  jpeg_component_info *compptr;
74
4.57M
  JDIMENSION num_rows;
75
76
  /* Fill the conversion buffer, if it's empty */
77
4.57M
  if (upsample->next_row_out >= cinfo->max_v_samp_factor) {
78
6.26M
    for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
79
3.82M
         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
3.82M
      (*upsample->methods[ci]) (cinfo, compptr,
87
3.82M
        input_buf[ci] + (*in_row_group_ctr * upsample->rowgroup_height[ci]),
88
3.82M
        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
3.82M
    }
95
2.44M
    upsample->next_row_out = 0;
96
2.44M
  }
97
98
  /* Color-convert and emit rows */
99
100
  /* How many we have in the buffer: */
101
4.57M
  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.57M
  if (num_rows > upsample->rows_to_go)
106
1.01k
    num_rows = upsample->rows_to_go;
107
  /* And not more than what the client can accept: */
108
4.57M
  out_rows_avail -= *out_row_ctr;
109
4.57M
  if (num_rows > out_rows_avail)
110
2.13M
    num_rows = out_rows_avail;
111
112
#ifdef WITH_PROFILE
113
  cinfo->master->start = getTime();
114
#endif
115
4.57M
  (*cinfo->cconvert->_color_convert) (cinfo, upsample->color_buf,
116
4.57M
                                      (JDIMENSION)upsample->next_row_out,
117
4.57M
                                      output_buf + *out_row_ctr,
118
4.57M
                                      (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.57M
  *out_row_ctr += num_rows;
127
4.57M
  upsample->rows_to_go -= num_rows;
128
4.57M
  upsample->next_row_out += num_rows;
129
  /* When the buffer is emptied, declare this input row group consumed */
130
4.57M
  if (upsample->next_row_out >= cinfo->max_v_samp_factor)
131
2.44M
    (*in_row_group_ctr)++;
132
4.57M
}
jdsample-8.c:sep_upsample
Line
Count
Source
70
4.57M
{
71
4.57M
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
72
4.57M
  int ci;
73
4.57M
  jpeg_component_info *compptr;
74
4.57M
  JDIMENSION num_rows;
75
76
  /* Fill the conversion buffer, if it's empty */
77
4.57M
  if (upsample->next_row_out >= cinfo->max_v_samp_factor) {
78
6.26M
    for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
79
3.82M
         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
3.82M
      (*upsample->methods[ci]) (cinfo, compptr,
87
3.82M
        input_buf[ci] + (*in_row_group_ctr * upsample->rowgroup_height[ci]),
88
3.82M
        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
3.82M
    }
95
2.44M
    upsample->next_row_out = 0;
96
2.44M
  }
97
98
  /* Color-convert and emit rows */
99
100
  /* How many we have in the buffer: */
101
4.57M
  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.57M
  if (num_rows > upsample->rows_to_go)
106
1.01k
    num_rows = upsample->rows_to_go;
107
  /* And not more than what the client can accept: */
108
4.57M
  out_rows_avail -= *out_row_ctr;
109
4.57M
  if (num_rows > out_rows_avail)
110
2.13M
    num_rows = out_rows_avail;
111
112
#ifdef WITH_PROFILE
113
  cinfo->master->start = getTime();
114
#endif
115
4.57M
  (*cinfo->cconvert->_color_convert) (cinfo, upsample->color_buf,
116
4.57M
                                      (JDIMENSION)upsample->next_row_out,
117
4.57M
                                      output_buf + *out_row_ctr,
118
4.57M
                                      (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.57M
  *out_row_ctr += num_rows;
127
4.57M
  upsample->rows_to_go -= num_rows;
128
4.57M
  upsample->next_row_out += num_rows;
129
  /* When the buffer is emptied, declare this input row group consumed */
130
4.57M
  if (upsample->next_row_out >= cinfo->max_v_samp_factor)
131
2.44M
    (*in_row_group_ctr)++;
132
4.57M
}
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.07M
{
152
2.07M
  *output_data_ptr = input_data;
153
2.07M
}
jdsample-8.c:fullsize_upsample
Line
Count
Source
151
2.07M
{
152
2.07M
  *output_data_ptr = input_data;
153
2.07M
}
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
463k
{
184
463k
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
185
463k
  _JSAMPARRAY output_data = *output_data_ptr;
186
463k
  register _JSAMPROW inptr, outptr;
187
463k
  register _JSAMPLE invalue;
188
463k
  register int h;
189
463k
  _JSAMPROW outend;
190
463k
  int h_expand, v_expand;
191
463k
  int inrow, outrow;
192
193
463k
  h_expand = upsample->h_expand[compptr->component_index];
194
463k
  v_expand = upsample->v_expand[compptr->component_index];
195
196
463k
  inrow = outrow = 0;
197
939k
  while (outrow < cinfo->max_v_samp_factor) {
198
    /* Generate one output row with proper horizontal expansion */
199
476k
    inptr = input_data[inrow];
200
476k
    outptr = output_data[outrow];
201
476k
    outend = outptr + cinfo->output_width;
202
11.7M
    while (outptr < outend) {
203
11.3M
      invalue = *inptr++;
204
32.2M
      for (h = h_expand; h > 0; h--) {
205
20.9M
        *outptr++ = invalue;
206
20.9M
      }
207
11.3M
    }
208
    /* Generate any additional output rows by duplicating the first one */
209
476k
    if (v_expand > 1) {
210
456k
      _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1,
211
456k
                         v_expand - 1, cinfo->output_width);
212
456k
    }
213
476k
    inrow++;
214
476k
    outrow += v_expand;
215
476k
  }
216
463k
}
jdsample-8.c:int_upsample
Line
Count
Source
183
463k
{
184
463k
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
185
463k
  _JSAMPARRAY output_data = *output_data_ptr;
186
463k
  register _JSAMPROW inptr, outptr;
187
463k
  register _JSAMPLE invalue;
188
463k
  register int h;
189
463k
  _JSAMPROW outend;
190
463k
  int h_expand, v_expand;
191
463k
  int inrow, outrow;
192
193
463k
  h_expand = upsample->h_expand[compptr->component_index];
194
463k
  v_expand = upsample->v_expand[compptr->component_index];
195
196
463k
  inrow = outrow = 0;
197
939k
  while (outrow < cinfo->max_v_samp_factor) {
198
    /* Generate one output row with proper horizontal expansion */
199
476k
    inptr = input_data[inrow];
200
476k
    outptr = output_data[outrow];
201
476k
    outend = outptr + cinfo->output_width;
202
11.7M
    while (outptr < outend) {
203
11.3M
      invalue = *inptr++;
204
32.2M
      for (h = h_expand; h > 0; h--) {
205
20.9M
        *outptr++ = invalue;
206
20.9M
      }
207
11.3M
    }
208
    /* Generate any additional output rows by duplicating the first one */
209
476k
    if (v_expand > 1) {
210
456k
      _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1,
211
456k
                         v_expand - 1, cinfo->output_width);
212
456k
    }
213
476k
    inrow++;
214
476k
    outrow += v_expand;
215
476k
  }
216
463k
}
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
32.0k
{
228
32.0k
  _JSAMPARRAY output_data = *output_data_ptr;
229
32.0k
  register _JSAMPROW inptr, outptr;
230
32.0k
  register _JSAMPLE invalue;
231
32.0k
  _JSAMPROW outend;
232
32.0k
  int inrow;
233
234
149k
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
235
117k
    inptr = input_data[inrow];
236
117k
    outptr = output_data[inrow];
237
117k
    outend = outptr + cinfo->output_width;
238
368k
    while (outptr < outend) {
239
251k
      invalue = *inptr++;
240
251k
      *outptr++ = invalue;
241
251k
      *outptr++ = invalue;
242
251k
    }
243
117k
  }
244
32.0k
}
jdsample-8.c:h2v1_upsample
Line
Count
Source
227
32.0k
{
228
32.0k
  _JSAMPARRAY output_data = *output_data_ptr;
229
32.0k
  register _JSAMPROW inptr, outptr;
230
32.0k
  register _JSAMPLE invalue;
231
32.0k
  _JSAMPROW outend;
232
32.0k
  int inrow;
233
234
149k
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
235
117k
    inptr = input_data[inrow];
236
117k
    outptr = output_data[inrow];
237
117k
    outend = outptr + cinfo->output_width;
238
368k
    while (outptr < outend) {
239
251k
      invalue = *inptr++;
240
251k
      *outptr++ = invalue;
241
251k
      *outptr++ = invalue;
242
251k
    }
243
117k
  }
244
32.0k
}
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
86.2k
{
256
86.2k
  _JSAMPARRAY output_data = *output_data_ptr;
257
86.2k
  register _JSAMPROW inptr, outptr;
258
86.2k
  register _JSAMPLE invalue;
259
86.2k
  _JSAMPROW outend;
260
86.2k
  int inrow, outrow;
261
262
86.2k
  inrow = outrow = 0;
263
199k
  while (outrow < cinfo->max_v_samp_factor) {
264
113k
    inptr = input_data[inrow];
265
113k
    outptr = output_data[outrow];
266
113k
    outend = outptr + cinfo->output_width;
267
318k
    while (outptr < outend) {
268
205k
      invalue = *inptr++;
269
205k
      *outptr++ = invalue;
270
205k
      *outptr++ = invalue;
271
205k
    }
272
113k
    _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1, 1,
273
113k
                       cinfo->output_width);
274
113k
    inrow++;
275
113k
    outrow += 2;
276
113k
  }
277
86.2k
}
jdsample-8.c:h2v2_upsample
Line
Count
Source
255
86.2k
{
256
86.2k
  _JSAMPARRAY output_data = *output_data_ptr;
257
86.2k
  register _JSAMPROW inptr, outptr;
258
86.2k
  register _JSAMPLE invalue;
259
86.2k
  _JSAMPROW outend;
260
86.2k
  int inrow, outrow;
261
262
86.2k
  inrow = outrow = 0;
263
199k
  while (outrow < cinfo->max_v_samp_factor) {
264
113k
    inptr = input_data[inrow];
265
113k
    outptr = output_data[outrow];
266
113k
    outend = outptr + cinfo->output_width;
267
318k
    while (outptr < outend) {
268
205k
      invalue = *inptr++;
269
205k
      *outptr++ = invalue;
270
205k
      *outptr++ = invalue;
271
205k
    }
272
113k
    _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1, 1,
273
113k
                       cinfo->output_width);
274
113k
    inrow++;
275
113k
    outrow += 2;
276
113k
  }
277
86.2k
}
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
460k
{
299
460k
  _JSAMPARRAY output_data = *output_data_ptr;
300
460k
  register _JSAMPROW inptr, outptr;
301
460k
  register int invalue;
302
460k
  register JDIMENSION colctr;
303
460k
  int inrow;
304
305
1.66M
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
306
1.20M
    inptr = input_data[inrow];
307
1.20M
    outptr = output_data[inrow];
308
    /* Special case for first column */
309
1.20M
    invalue = *inptr++;
310
1.20M
    *outptr++ = (_JSAMPLE)invalue;
311
1.20M
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[0] + 2) >> 2);
312
313
11.6M
    for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
314
      /* General case: 3/4 * nearer component + 1/4 * further component */
315
10.4M
      invalue = (*inptr++) * 3;
316
10.4M
      *outptr++ = (_JSAMPLE)((invalue + inptr[-2] + 1) >> 2);
317
10.4M
      *outptr++ = (_JSAMPLE)((invalue + inptr[0] + 2) >> 2);
318
10.4M
    }
319
320
    /* Special case for last column */
321
1.20M
    invalue = *inptr;
322
1.20M
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[-1] + 1) >> 2);
323
1.20M
    *outptr++ = (_JSAMPLE)invalue;
324
1.20M
  }
325
460k
}
jdsample-8.c:h2v1_fancy_upsample
Line
Count
Source
298
460k
{
299
460k
  _JSAMPARRAY output_data = *output_data_ptr;
300
460k
  register _JSAMPROW inptr, outptr;
301
460k
  register int invalue;
302
460k
  register JDIMENSION colctr;
303
460k
  int inrow;
304
305
1.66M
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
306
1.20M
    inptr = input_data[inrow];
307
1.20M
    outptr = output_data[inrow];
308
    /* Special case for first column */
309
1.20M
    invalue = *inptr++;
310
1.20M
    *outptr++ = (_JSAMPLE)invalue;
311
1.20M
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[0] + 2) >> 2);
312
313
11.6M
    for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
314
      /* General case: 3/4 * nearer component + 1/4 * further component */
315
10.4M
      invalue = (*inptr++) * 3;
316
10.4M
      *outptr++ = (_JSAMPLE)((invalue + inptr[-2] + 1) >> 2);
317
10.4M
      *outptr++ = (_JSAMPLE)((invalue + inptr[0] + 2) >> 2);
318
10.4M
    }
319
320
    /* Special case for last column */
321
1.20M
    invalue = *inptr;
322
1.20M
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[-1] + 1) >> 2);
323
1.20M
    *outptr++ = (_JSAMPLE)invalue;
324
1.20M
  }
325
460k
}
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
180k
{
339
180k
  _JSAMPARRAY output_data = *output_data_ptr;
340
180k
  _JSAMPROW inptr0, inptr1, outptr;
341
#if BITS_IN_JSAMPLE == 8
342
  int thiscolsum, bias;
343
#else
344
  JLONG thiscolsum, bias;
345
#endif
346
180k
  JDIMENSION colctr;
347
180k
  int inrow, outrow, v;
348
349
180k
  inrow = outrow = 0;
350
370k
  while (outrow < cinfo->max_v_samp_factor) {
351
568k
    for (v = 0; v < 2; v++) {
352
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
353
379k
      inptr0 = input_data[inrow];
354
379k
      if (v == 0) {             /* next nearest is row above */
355
189k
        inptr1 = input_data[inrow - 1];
356
189k
        bias = 1;
357
189k
      } else {                  /* next nearest is row below */
358
189k
        inptr1 = input_data[inrow + 1];
359
189k
        bias = 2;
360
189k
      }
361
379k
      outptr = output_data[outrow++];
362
363
9.08M
      for (colctr = 0; colctr < compptr->downsampled_width; colctr++) {
364
8.70M
        thiscolsum = (*inptr0++) * 3 + (*inptr1++);
365
8.70M
        *outptr++ = (_JSAMPLE)((thiscolsum + bias) >> 2);
366
8.70M
      }
367
379k
    }
368
189k
    inrow++;
369
189k
  }
370
180k
}
jdsample-8.c:h1v2_fancy_upsample
Line
Count
Source
338
180k
{
339
180k
  _JSAMPARRAY output_data = *output_data_ptr;
340
180k
  _JSAMPROW inptr0, inptr1, outptr;
341
180k
#if BITS_IN_JSAMPLE == 8
342
180k
  int thiscolsum, bias;
343
#else
344
  JLONG thiscolsum, bias;
345
#endif
346
180k
  JDIMENSION colctr;
347
180k
  int inrow, outrow, v;
348
349
180k
  inrow = outrow = 0;
350
370k
  while (outrow < cinfo->max_v_samp_factor) {
351
568k
    for (v = 0; v < 2; v++) {
352
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
353
379k
      inptr0 = input_data[inrow];
354
379k
      if (v == 0) {             /* next nearest is row above */
355
189k
        inptr1 = input_data[inrow - 1];
356
189k
        bias = 1;
357
189k
      } else {                  /* next nearest is row below */
358
189k
        inptr1 = input_data[inrow + 1];
359
189k
        bias = 2;
360
189k
      }
361
379k
      outptr = output_data[outrow++];
362
363
9.08M
      for (colctr = 0; colctr < compptr->downsampled_width; colctr++) {
364
8.70M
        thiscolsum = (*inptr0++) * 3 + (*inptr1++);
365
8.70M
        *outptr++ = (_JSAMPLE)((thiscolsum + bias) >> 2);
366
8.70M
      }
367
379k
    }
368
189k
    inrow++;
369
189k
  }
370
180k
}
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
522k
{
385
522k
  _JSAMPARRAY output_data = *output_data_ptr;
386
522k
  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
522k
  register JDIMENSION colctr;
393
522k
  int inrow, outrow, v;
394
395
522k
  inrow = outrow = 0;
396
1.21M
  while (outrow < cinfo->max_v_samp_factor) {
397
2.08M
    for (v = 0; v < 2; v++) {
398
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
399
1.39M
      inptr0 = input_data[inrow];
400
1.39M
      if (v == 0)               /* next nearest is row above */
401
696k
        inptr1 = input_data[inrow - 1];
402
696k
      else                      /* next nearest is row below */
403
696k
        inptr1 = input_data[inrow + 1];
404
1.39M
      outptr = output_data[outrow++];
405
406
      /* Special case for first column */
407
1.39M
      thiscolsum = (*inptr0++) * 3 + (*inptr1++);
408
1.39M
      nextcolsum = (*inptr0++) * 3 + (*inptr1++);
409
1.39M
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 8) >> 4);
410
1.39M
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
411
1.39M
      lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
412
413
30.2M
      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
28.8M
        nextcolsum = (*inptr0++) * 3 + (*inptr1++);
418
28.8M
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
419
28.8M
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
420
28.8M
        lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
421
28.8M
      }
422
423
      /* Special case for last column */
424
1.39M
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
425
1.39M
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 7) >> 4);
426
1.39M
    }
427
696k
    inrow++;
428
696k
  }
429
522k
}
jdsample-8.c:h2v2_fancy_upsample
Line
Count
Source
384
522k
{
385
522k
  _JSAMPARRAY output_data = *output_data_ptr;
386
522k
  register _JSAMPROW inptr0, inptr1, outptr;
387
522k
#if BITS_IN_JSAMPLE == 8
388
522k
  register int thiscolsum, lastcolsum, nextcolsum;
389
#else
390
  register JLONG thiscolsum, lastcolsum, nextcolsum;
391
#endif
392
522k
  register JDIMENSION colctr;
393
522k
  int inrow, outrow, v;
394
395
522k
  inrow = outrow = 0;
396
1.21M
  while (outrow < cinfo->max_v_samp_factor) {
397
2.08M
    for (v = 0; v < 2; v++) {
398
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
399
1.39M
      inptr0 = input_data[inrow];
400
1.39M
      if (v == 0)               /* next nearest is row above */
401
696k
        inptr1 = input_data[inrow - 1];
402
696k
      else                      /* next nearest is row below */
403
696k
        inptr1 = input_data[inrow + 1];
404
1.39M
      outptr = output_data[outrow++];
405
406
      /* Special case for first column */
407
1.39M
      thiscolsum = (*inptr0++) * 3 + (*inptr1++);
408
1.39M
      nextcolsum = (*inptr0++) * 3 + (*inptr1++);
409
1.39M
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 8) >> 4);
410
1.39M
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
411
1.39M
      lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
412
413
30.2M
      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
28.8M
        nextcolsum = (*inptr0++) * 3 + (*inptr1++);
418
28.8M
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
419
28.8M
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
420
28.8M
        lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
421
28.8M
      }
422
423
      /* Special case for last column */
424
1.39M
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
425
1.39M
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 7) >> 4);
426
1.39M
    }
427
696k
    inrow++;
428
696k
  }
429
522k
}
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
8.20k
{
439
8.20k
  my_upsample_ptr upsample;
440
8.20k
  int ci;
441
8.20k
  jpeg_component_info *compptr;
442
8.20k
  boolean need_buffer, do_fancy;
443
8.20k
  int h_in_group, v_in_group, h_out_group, v_out_group;
444
445
8.20k
#ifdef D_LOSSLESS_SUPPORTED
446
8.20k
  if (cinfo->master->lossless) {
447
#if BITS_IN_JSAMPLE == 8
448
991
    if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2)
449
#else
450
1.45k
    if (cinfo->data_precision > BITS_IN_JSAMPLE ||
451
1.45k
        cinfo->data_precision < BITS_IN_JSAMPLE - 3)
452
0
#endif
453
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
454
2.44k
  } else
455
5.75k
#endif
456
5.75k
  {
457
5.75k
    if (cinfo->data_precision != BITS_IN_JSAMPLE)
458
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
459
5.75k
  }
460
461
8.20k
  if (!cinfo->master->jinit_upsampler_no_alloc) {
462
8.20k
    upsample = (my_upsample_ptr)
463
8.20k
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
464
8.20k
                                  sizeof(my_upsampler));
465
8.20k
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
466
8.20k
    upsample->pub.start_pass = start_pass_upsample;
467
8.20k
    upsample->pub._upsample = sep_upsample;
468
8.20k
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
469
8.20k
  } else
470
0
    upsample = (my_upsample_ptr)cinfo->upsample;
471
472
8.20k
  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
8.20k
  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
27.9k
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
484
19.7k
       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
19.7k
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
489
19.7k
                 cinfo->_min_DCT_scaled_size;
490
19.7k
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
491
19.7k
                 cinfo->_min_DCT_scaled_size;
492
19.7k
    h_out_group = cinfo->max_h_samp_factor;
493
19.7k
    v_out_group = cinfo->max_v_samp_factor;
494
19.7k
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
495
19.7k
    need_buffer = TRUE;
496
19.7k
    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
19.7k
    } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
501
      /* Fullsize components can be processed without any work. */
502
8.65k
      upsample->methods[ci] = fullsize_upsample;
503
8.65k
      need_buffer = FALSE;
504
11.1k
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
505
      /* Special cases for 2h1v upsampling */
506
1.76k
      if (do_fancy && compptr->downsampled_width > 2) {
507
#ifdef WITH_SIMD
508
401
        if (jsimd_set_h2v1_fancy_upsample(cinfo))
509
0
          upsample->methods[ci] = jsimd_h2v1_fancy_upsample;
510
401
        else
511
401
#endif
512
401
          upsample->methods[ci] = h2v1_fancy_upsample;
513
1.30k
      } else {
514
#ifdef WITH_SIMD
515
603
        if (jsimd_set_h2v1_upsample(cinfo))
516
0
          upsample->methods[ci] = jsimd_h2v1_upsample;
517
603
        else
518
603
#endif
519
603
          upsample->methods[ci] = h2v1_upsample;
520
1.30k
      }
521
9.37k
    } else if (h_in_group == h_out_group &&
522
1.83k
               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
381
        upsample->methods[ci] = h1v2_fancy_upsample;
530
381
      upsample->pub.need_context_rows = TRUE;
531
8.99k
    } else if (h_in_group * 2 == h_out_group &&
532
6.20k
               v_in_group * 2 == v_out_group) {
533
      /* Special cases for 2h2v upsampling */
534
5.06k
      if (do_fancy && compptr->downsampled_width > 2) {
535
#ifdef WITH_SIMD
536
2.80k
        if (jsimd_set_h2v2_fancy_upsample(cinfo))
537
0
          upsample->methods[ci] = jsimd_h2v2_fancy_upsample;
538
2.80k
        else
539
2.80k
#endif
540
2.80k
          upsample->methods[ci] = h2v2_fancy_upsample;
541
2.95k
        upsample->pub.need_context_rows = TRUE;
542
2.95k
      } else {
543
#ifdef WITH_SIMD
544
923
        if (jsimd_set_h2v2_upsample(cinfo))
545
0
          upsample->methods[ci] = jsimd_h2v2_upsample;
546
923
        else
547
923
#endif
548
923
          upsample->methods[ci] = h2v2_upsample;
549
2.11k
      }
550
5.06k
    } else if ((h_out_group % h_in_group) == 0 &&
551
3.89k
               (v_out_group % v_in_group) == 0) {
552
      /* Generic integral-factors upsampling method */
553
3.86k
      upsample->methods[ci] = int_upsample;
554
3.86k
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
555
3.86k
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
556
3.86k
    } else
557
64
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
558
19.7k
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
559
11.0k
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
560
11.0k
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
561
11.0k
         (JDIMENSION)jround_up((long)cinfo->output_width,
562
11.0k
                               (long)cinfo->max_h_samp_factor),
563
11.0k
         (JDIMENSION)cinfo->max_v_samp_factor);
564
11.0k
    }
565
19.7k
  }
566
8.20k
}
jinit_upsampler
Line
Count
Source
438
5.96k
{
439
5.96k
  my_upsample_ptr upsample;
440
5.96k
  int ci;
441
5.96k
  jpeg_component_info *compptr;
442
5.96k
  boolean need_buffer, do_fancy;
443
5.96k
  int h_in_group, v_in_group, h_out_group, v_out_group;
444
445
5.96k
#ifdef D_LOSSLESS_SUPPORTED
446
5.96k
  if (cinfo->master->lossless) {
447
991
#if BITS_IN_JSAMPLE == 8
448
991
    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
991
  } else
455
4.97k
#endif
456
4.97k
  {
457
4.97k
    if (cinfo->data_precision != BITS_IN_JSAMPLE)
458
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
459
4.97k
  }
460
461
5.96k
  if (!cinfo->master->jinit_upsampler_no_alloc) {
462
5.96k
    upsample = (my_upsample_ptr)
463
5.96k
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
464
5.96k
                                  sizeof(my_upsampler));
465
5.96k
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
466
5.96k
    upsample->pub.start_pass = start_pass_upsample;
467
5.96k
    upsample->pub._upsample = sep_upsample;
468
5.96k
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
469
5.96k
  } else
470
0
    upsample = (my_upsample_ptr)cinfo->upsample;
471
472
5.96k
  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
5.96k
  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
19.1k
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
484
13.1k
       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
13.1k
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
489
13.1k
                 cinfo->_min_DCT_scaled_size;
490
13.1k
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
491
13.1k
                 cinfo->_min_DCT_scaled_size;
492
13.1k
    h_out_group = cinfo->max_h_samp_factor;
493
13.1k
    v_out_group = cinfo->max_v_samp_factor;
494
13.1k
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
495
13.1k
    need_buffer = TRUE;
496
13.1k
    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
13.1k
    } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
501
      /* Fullsize components can be processed without any work. */
502
6.15k
      upsample->methods[ci] = fullsize_upsample;
503
6.15k
      need_buffer = FALSE;
504
7.03k
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
505
      /* Special cases for 2h1v upsampling */
506
1.00k
      if (do_fancy && compptr->downsampled_width > 2) {
507
401
#ifdef WITH_SIMD
508
401
        if (jsimd_set_h2v1_fancy_upsample(cinfo))
509
0
          upsample->methods[ci] = jsimd_h2v1_fancy_upsample;
510
401
        else
511
401
#endif
512
401
          upsample->methods[ci] = h2v1_fancy_upsample;
513
603
      } else {
514
603
#ifdef WITH_SIMD
515
603
        if (jsimd_set_h2v1_upsample(cinfo))
516
0
          upsample->methods[ci] = jsimd_h2v1_upsample;
517
603
        else
518
603
#endif
519
603
          upsample->methods[ci] = h2v1_upsample;
520
603
      }
521
6.02k
    } else if (h_in_group == h_out_group &&
522
1.19k
               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
209
        upsample->methods[ci] = h1v2_fancy_upsample;
530
209
      upsample->pub.need_context_rows = TRUE;
531
5.81k
    } else if (h_in_group * 2 == h_out_group &&
532
4.16k
               v_in_group * 2 == v_out_group) {
533
      /* Special cases for 2h2v upsampling */
534
3.73k
      if (do_fancy && compptr->downsampled_width > 2) {
535
2.80k
#ifdef WITH_SIMD
536
2.80k
        if (jsimd_set_h2v2_fancy_upsample(cinfo))
537
0
          upsample->methods[ci] = jsimd_h2v2_fancy_upsample;
538
2.80k
        else
539
2.80k
#endif
540
2.80k
          upsample->methods[ci] = h2v2_fancy_upsample;
541
2.80k
        upsample->pub.need_context_rows = TRUE;
542
2.80k
      } else {
543
923
#ifdef WITH_SIMD
544
923
        if (jsimd_set_h2v2_upsample(cinfo))
545
0
          upsample->methods[ci] = jsimd_h2v2_upsample;
546
923
        else
547
923
#endif
548
923
          upsample->methods[ci] = h2v2_upsample;
549
923
      }
550
3.73k
    } else if ((h_out_group % h_in_group) == 0 &&
551
2.07k
               (v_out_group % v_in_group) == 0) {
552
      /* Generic integral-factors upsampling method */
553
2.06k
      upsample->methods[ci] = int_upsample;
554
2.06k
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
555
2.06k
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
556
2.06k
    } else
557
20
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
558
13.1k
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
559
7.01k
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
560
7.01k
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
561
7.01k
         (JDIMENSION)jround_up((long)cinfo->output_width,
562
7.01k
                               (long)cinfo->max_h_samp_factor),
563
7.01k
         (JDIMENSION)cinfo->max_v_samp_factor);
564
7.01k
    }
565
13.1k
  }
566
5.96k
}
j12init_upsampler
Line
Count
Source
438
1.51k
{
439
1.51k
  my_upsample_ptr upsample;
440
1.51k
  int ci;
441
1.51k
  jpeg_component_info *compptr;
442
1.51k
  boolean need_buffer, do_fancy;
443
1.51k
  int h_in_group, v_in_group, h_out_group, v_out_group;
444
445
1.51k
#ifdef D_LOSSLESS_SUPPORTED
446
1.51k
  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
740
    if (cinfo->data_precision > BITS_IN_JSAMPLE ||
451
740
        cinfo->data_precision < BITS_IN_JSAMPLE - 3)
452
0
#endif
453
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
454
740
  } else
455
777
#endif
456
777
  {
457
777
    if (cinfo->data_precision != BITS_IN_JSAMPLE)
458
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
459
777
  }
460
461
1.51k
  if (!cinfo->master->jinit_upsampler_no_alloc) {
462
1.51k
    upsample = (my_upsample_ptr)
463
1.51k
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
464
1.51k
                                  sizeof(my_upsampler));
465
1.51k
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
466
1.51k
    upsample->pub.start_pass = start_pass_upsample;
467
1.51k
    upsample->pub._upsample = sep_upsample;
468
1.51k
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
469
1.51k
  } else
470
0
    upsample = (my_upsample_ptr)cinfo->upsample;
471
472
1.51k
  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.51k
  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
5.96k
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
484
4.44k
       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
4.44k
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
489
4.44k
                 cinfo->_min_DCT_scaled_size;
490
4.44k
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
491
4.44k
                 cinfo->_min_DCT_scaled_size;
492
4.44k
    h_out_group = cinfo->max_h_samp_factor;
493
4.44k
    v_out_group = cinfo->max_v_samp_factor;
494
4.44k
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
495
4.44k
    need_buffer = TRUE;
496
4.44k
    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
4.44k
    } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
501
      /* Fullsize components can be processed without any work. */
502
1.78k
      upsample->methods[ci] = fullsize_upsample;
503
1.78k
      need_buffer = FALSE;
504
2.66k
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
505
      /* Special cases for 2h1v upsampling */
506
435
      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
59
          upsample->methods[ci] = h2v1_fancy_upsample;
513
376
      } else {
514
#ifdef WITH_SIMD
515
        if (jsimd_set_h2v1_upsample(cinfo))
516
          upsample->methods[ci] = jsimd_h2v1_upsample;
517
        else
518
#endif
519
376
          upsample->methods[ci] = h2v1_upsample;
520
376
      }
521
2.22k
    } else if (h_in_group == h_out_group &&
522
473
               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
172
        upsample->methods[ci] = h1v2_fancy_upsample;
530
172
      upsample->pub.need_context_rows = TRUE;
531
2.05k
    } else if (h_in_group * 2 == h_out_group &&
532
1.16k
               v_in_group * 2 == v_out_group) {
533
      /* Special cases for 2h2v upsampling */
534
718
      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
146
          upsample->methods[ci] = h2v2_fancy_upsample;
541
146
        upsample->pub.need_context_rows = TRUE;
542
572
      } else {
543
#ifdef WITH_SIMD
544
        if (jsimd_set_h2v2_upsample(cinfo))
545
          upsample->methods[ci] = jsimd_h2v2_upsample;
546
        else
547
#endif
548
572
          upsample->methods[ci] = h2v2_upsample;
549
572
      }
550
1.33k
    } else if ((h_out_group % h_in_group) == 0 &&
551
1.31k
               (v_out_group % v_in_group) == 0) {
552
      /* Generic integral-factors upsampling method */
553
1.30k
      upsample->methods[ci] = int_upsample;
554
1.30k
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
555
1.30k
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
556
1.30k
    } else
557
29
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
558
4.44k
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
559
2.63k
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
560
2.63k
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
561
2.63k
         (JDIMENSION)jround_up((long)cinfo->output_width,
562
2.63k
                               (long)cinfo->max_h_samp_factor),
563
2.63k
         (JDIMENSION)cinfo->max_v_samp_factor);
564
2.63k
    }
565
4.44k
  }
566
1.51k
}
j16init_upsampler
Line
Count
Source
438
716
{
439
716
  my_upsample_ptr upsample;
440
716
  int ci;
441
716
  jpeg_component_info *compptr;
442
716
  boolean need_buffer, do_fancy;
443
716
  int h_in_group, v_in_group, h_out_group, v_out_group;
444
445
716
#ifdef D_LOSSLESS_SUPPORTED
446
716
  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
716
    if (cinfo->data_precision > BITS_IN_JSAMPLE ||
451
716
        cinfo->data_precision < BITS_IN_JSAMPLE - 3)
452
0
#endif
453
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
454
716
  } 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
716
  if (!cinfo->master->jinit_upsampler_no_alloc) {
462
716
    upsample = (my_upsample_ptr)
463
716
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
464
716
                                  sizeof(my_upsampler));
465
716
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
466
716
    upsample->pub.start_pass = start_pass_upsample;
467
716
    upsample->pub._upsample = sep_upsample;
468
716
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
469
716
  } else
470
0
    upsample = (my_upsample_ptr)cinfo->upsample;
471
472
716
  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
716
  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
2.88k
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
484
2.16k
       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.16k
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
489
2.16k
                 cinfo->_min_DCT_scaled_size;
490
2.16k
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
491
2.16k
                 cinfo->_min_DCT_scaled_size;
492
2.16k
    h_out_group = cinfo->max_h_samp_factor;
493
2.16k
    v_out_group = cinfo->max_v_samp_factor;
494
2.16k
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
495
2.16k
    need_buffer = TRUE;
496
2.16k
    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.16k
    } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
501
      /* Fullsize components can be processed without any work. */
502
718
      upsample->methods[ci] = fullsize_upsample;
503
718
      need_buffer = FALSE;
504
1.44k
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
505
      /* Special cases for 2h1v upsampling */
506
328
      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
328
      } else {
514
#ifdef WITH_SIMD
515
        if (jsimd_set_h2v1_upsample(cinfo))
516
          upsample->methods[ci] = jsimd_h2v1_upsample;
517
        else
518
#endif
519
328
          upsample->methods[ci] = h2v1_upsample;
520
328
      }
521
1.11k
    } else if (h_in_group == h_out_group &&
522
170
               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.11k
    } else if (h_in_group * 2 == h_out_group &&
532
878
               v_in_group * 2 == v_out_group) {
533
      /* Special cases for 2h2v upsampling */
534
615
      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
615
      } else {
543
#ifdef WITH_SIMD
544
        if (jsimd_set_h2v2_upsample(cinfo))
545
          upsample->methods[ci] = jsimd_h2v2_upsample;
546
        else
547
#endif
548
615
          upsample->methods[ci] = h2v2_upsample;
549
615
      }
550
615
    } else if ((h_out_group % h_in_group) == 0 &&
551
496
               (v_out_group % v_in_group) == 0) {
552
      /* Generic integral-factors upsampling method */
553
488
      upsample->methods[ci] = int_upsample;
554
488
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
555
488
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
556
488
    } else
557
15
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
558
2.16k
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
559
1.43k
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
560
1.43k
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
561
1.43k
         (JDIMENSION)jround_up((long)cinfo->output_width,
562
1.43k
                               (long)cinfo->max_h_samp_factor),
563
1.43k
         (JDIMENSION)cinfo->max_v_samp_factor);
564
1.43k
    }
565
2.16k
  }
566
716
}
567
568
#endif /* BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) */