Coverage Report

Created: 2026-07-16 06:55

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
5.14k
{
48
5.14k
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
49
50
  /* Mark the conversion buffer empty */
51
5.14k
  upsample->next_row_out = cinfo->max_v_samp_factor;
52
  /* Initialize total-height counter for detecting bottom of image */
53
5.14k
  upsample->rows_to_go = cinfo->output_height;
54
5.14k
}
jdsample-8.c:start_pass_upsample
Line
Count
Source
47
4.88k
{
48
4.88k
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
49
50
  /* Mark the conversion buffer empty */
51
4.88k
  upsample->next_row_out = cinfo->max_v_samp_factor;
52
  /* Initialize total-height counter for detecting bottom of image */
53
4.88k
  upsample->rows_to_go = cinfo->output_height;
54
4.88k
}
jdsample-12.c:start_pass_upsample
Line
Count
Source
47
230
{
48
230
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
49
50
  /* Mark the conversion buffer empty */
51
230
  upsample->next_row_out = cinfo->max_v_samp_factor;
52
  /* Initialize total-height counter for detecting bottom of image */
53
230
  upsample->rows_to_go = cinfo->output_height;
54
230
}
jdsample-16.c:start_pass_upsample
Line
Count
Source
47
29
{
48
29
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
49
50
  /* Mark the conversion buffer empty */
51
29
  upsample->next_row_out = cinfo->max_v_samp_factor;
52
  /* Initialize total-height counter for detecting bottom of image */
53
29
  upsample->rows_to_go = cinfo->output_height;
54
29
}
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
2.03M
{
71
2.03M
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
72
2.03M
  int ci;
73
2.03M
  jpeg_component_info *compptr;
74
2.03M
  JDIMENSION num_rows;
75
76
  /* Fill the conversion buffer, if it's empty */
77
2.03M
  if (upsample->next_row_out >= cinfo->max_v_samp_factor) {
78
2.98M
    for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
79
2.05M
         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.05M
      (*upsample->methods[ci]) (cinfo, compptr,
87
2.05M
        input_buf[ci] + (*in_row_group_ctr * upsample->rowgroup_height[ci]),
88
2.05M
        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.05M
    }
95
930k
    upsample->next_row_out = 0;
96
930k
  }
97
98
  /* Color-convert and emit rows */
99
100
  /* How many we have in the buffer: */
101
2.03M
  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
2.03M
  if (num_rows > upsample->rows_to_go)
106
1.31k
    num_rows = upsample->rows_to_go;
107
  /* And not more than what the client can accept: */
108
2.03M
  out_rows_avail -= *out_row_ctr;
109
2.03M
  if (num_rows > out_rows_avail)
110
1.10M
    num_rows = out_rows_avail;
111
112
#ifdef WITH_PROFILE
113
  cinfo->master->start = getTime();
114
#endif
115
2.03M
  (*cinfo->cconvert->_color_convert) (cinfo, upsample->color_buf,
116
2.03M
                                      (JDIMENSION)upsample->next_row_out,
117
2.03M
                                      output_buf + *out_row_ctr,
118
2.03M
                                      (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
2.03M
  *out_row_ctr += num_rows;
127
2.03M
  upsample->rows_to_go -= num_rows;
128
2.03M
  upsample->next_row_out += num_rows;
129
  /* When the buffer is emptied, declare this input row group consumed */
130
2.03M
  if (upsample->next_row_out >= cinfo->max_v_samp_factor)
131
929k
    (*in_row_group_ctr)++;
132
2.03M
}
jdsample-8.c:sep_upsample
Line
Count
Source
70
2.03M
{
71
2.03M
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
72
2.03M
  int ci;
73
2.03M
  jpeg_component_info *compptr;
74
2.03M
  JDIMENSION num_rows;
75
76
  /* Fill the conversion buffer, if it's empty */
77
2.03M
  if (upsample->next_row_out >= cinfo->max_v_samp_factor) {
78
2.98M
    for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
79
2.05M
         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.05M
      (*upsample->methods[ci]) (cinfo, compptr,
87
2.05M
        input_buf[ci] + (*in_row_group_ctr * upsample->rowgroup_height[ci]),
88
2.05M
        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.05M
    }
95
930k
    upsample->next_row_out = 0;
96
930k
  }
97
98
  /* Color-convert and emit rows */
99
100
  /* How many we have in the buffer: */
101
2.03M
  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
2.03M
  if (num_rows > upsample->rows_to_go)
106
1.31k
    num_rows = upsample->rows_to_go;
107
  /* And not more than what the client can accept: */
108
2.03M
  out_rows_avail -= *out_row_ctr;
109
2.03M
  if (num_rows > out_rows_avail)
110
1.10M
    num_rows = out_rows_avail;
111
112
#ifdef WITH_PROFILE
113
  cinfo->master->start = getTime();
114
#endif
115
2.03M
  (*cinfo->cconvert->_color_convert) (cinfo, upsample->color_buf,
116
2.03M
                                      (JDIMENSION)upsample->next_row_out,
117
2.03M
                                      output_buf + *out_row_ctr,
118
2.03M
                                      (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
2.03M
  *out_row_ctr += num_rows;
127
2.03M
  upsample->rows_to_go -= num_rows;
128
2.03M
  upsample->next_row_out += num_rows;
129
  /* When the buffer is emptied, declare this input row group consumed */
130
2.03M
  if (upsample->next_row_out >= cinfo->max_v_samp_factor)
131
929k
    (*in_row_group_ctr)++;
132
2.03M
}
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
840k
{
152
840k
  *output_data_ptr = input_data;
153
840k
}
jdsample-8.c:fullsize_upsample
Line
Count
Source
151
840k
{
152
840k
  *output_data_ptr = input_data;
153
840k
}
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
174k
{
184
174k
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
185
174k
  _JSAMPARRAY output_data = *output_data_ptr;
186
174k
  register _JSAMPROW inptr, outptr;
187
174k
  register _JSAMPLE invalue;
188
174k
  register int h;
189
174k
  _JSAMPROW outend;
190
174k
  int h_expand, v_expand;
191
174k
  int inrow, outrow;
192
193
174k
  h_expand = upsample->h_expand[compptr->component_index];
194
174k
  v_expand = upsample->v_expand[compptr->component_index];
195
196
174k
  inrow = outrow = 0;
197
459k
  while (outrow < cinfo->max_v_samp_factor) {
198
    /* Generate one output row with proper horizontal expansion */
199
284k
    inptr = input_data[inrow];
200
284k
    outptr = output_data[outrow];
201
284k
    outend = outptr + cinfo->output_width;
202
5.08M
    while (outptr < outend) {
203
4.80M
      invalue = *inptr++;
204
15.0M
      for (h = h_expand; h > 0; h--) {
205
10.2M
        *outptr++ = invalue;
206
10.2M
      }
207
4.80M
    }
208
    /* Generate any additional output rows by duplicating the first one */
209
284k
    if (v_expand > 1) {
210
138k
      _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1,
211
138k
                         v_expand - 1, cinfo->output_width);
212
138k
    }
213
284k
    inrow++;
214
284k
    outrow += v_expand;
215
284k
  }
216
174k
}
jdsample-8.c:int_upsample
Line
Count
Source
183
174k
{
184
174k
  my_upsample_ptr upsample = (my_upsample_ptr)cinfo->upsample;
185
174k
  _JSAMPARRAY output_data = *output_data_ptr;
186
174k
  register _JSAMPROW inptr, outptr;
187
174k
  register _JSAMPLE invalue;
188
174k
  register int h;
189
174k
  _JSAMPROW outend;
190
174k
  int h_expand, v_expand;
191
174k
  int inrow, outrow;
192
193
174k
  h_expand = upsample->h_expand[compptr->component_index];
194
174k
  v_expand = upsample->v_expand[compptr->component_index];
195
196
174k
  inrow = outrow = 0;
197
459k
  while (outrow < cinfo->max_v_samp_factor) {
198
    /* Generate one output row with proper horizontal expansion */
199
284k
    inptr = input_data[inrow];
200
284k
    outptr = output_data[outrow];
201
284k
    outend = outptr + cinfo->output_width;
202
5.08M
    while (outptr < outend) {
203
4.80M
      invalue = *inptr++;
204
15.0M
      for (h = h_expand; h > 0; h--) {
205
10.2M
        *outptr++ = invalue;
206
10.2M
      }
207
4.80M
    }
208
    /* Generate any additional output rows by duplicating the first one */
209
284k
    if (v_expand > 1) {
210
138k
      _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1,
211
138k
                         v_expand - 1, cinfo->output_width);
212
138k
    }
213
284k
    inrow++;
214
284k
    outrow += v_expand;
215
284k
  }
216
174k
}
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
229k
{
228
229k
  _JSAMPARRAY output_data = *output_data_ptr;
229
229k
  register _JSAMPROW inptr, outptr;
230
229k
  register _JSAMPLE invalue;
231
229k
  _JSAMPROW outend;
232
229k
  int inrow;
233
234
1.04M
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
235
817k
    inptr = input_data[inrow];
236
817k
    outptr = output_data[inrow];
237
817k
    outend = outptr + cinfo->output_width;
238
2.44M
    while (outptr < outend) {
239
1.62M
      invalue = *inptr++;
240
1.62M
      *outptr++ = invalue;
241
1.62M
      *outptr++ = invalue;
242
1.62M
    }
243
817k
  }
244
229k
}
jdsample-8.c:h2v1_upsample
Line
Count
Source
227
229k
{
228
229k
  _JSAMPARRAY output_data = *output_data_ptr;
229
229k
  register _JSAMPROW inptr, outptr;
230
229k
  register _JSAMPLE invalue;
231
229k
  _JSAMPROW outend;
232
229k
  int inrow;
233
234
1.04M
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
235
817k
    inptr = input_data[inrow];
236
817k
    outptr = output_data[inrow];
237
817k
    outend = outptr + cinfo->output_width;
238
2.44M
    while (outptr < outend) {
239
1.62M
      invalue = *inptr++;
240
1.62M
      *outptr++ = invalue;
241
1.62M
      *outptr++ = invalue;
242
1.62M
    }
243
817k
  }
244
229k
}
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
190k
{
256
190k
  _JSAMPARRAY output_data = *output_data_ptr;
257
190k
  register _JSAMPROW inptr, outptr;
258
190k
  register _JSAMPLE invalue;
259
190k
  _JSAMPROW outend;
260
190k
  int inrow, outrow;
261
262
190k
  inrow = outrow = 0;
263
555k
  while (outrow < cinfo->max_v_samp_factor) {
264
365k
    inptr = input_data[inrow];
265
365k
    outptr = output_data[outrow];
266
365k
    outend = outptr + cinfo->output_width;
267
998k
    while (outptr < outend) {
268
632k
      invalue = *inptr++;
269
632k
      *outptr++ = invalue;
270
632k
      *outptr++ = invalue;
271
632k
    }
272
365k
    _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1, 1,
273
365k
                       cinfo->output_width);
274
365k
    inrow++;
275
365k
    outrow += 2;
276
365k
  }
277
190k
}
jdsample-8.c:h2v2_upsample
Line
Count
Source
255
190k
{
256
190k
  _JSAMPARRAY output_data = *output_data_ptr;
257
190k
  register _JSAMPROW inptr, outptr;
258
190k
  register _JSAMPLE invalue;
259
190k
  _JSAMPROW outend;
260
190k
  int inrow, outrow;
261
262
190k
  inrow = outrow = 0;
263
555k
  while (outrow < cinfo->max_v_samp_factor) {
264
365k
    inptr = input_data[inrow];
265
365k
    outptr = output_data[outrow];
266
365k
    outend = outptr + cinfo->output_width;
267
998k
    while (outptr < outend) {
268
632k
      invalue = *inptr++;
269
632k
      *outptr++ = invalue;
270
632k
      *outptr++ = invalue;
271
632k
    }
272
365k
    _jcopy_sample_rows(output_data, outrow, output_data, outrow + 1, 1,
273
365k
                       cinfo->output_width);
274
365k
    inrow++;
275
365k
    outrow += 2;
276
365k
  }
277
190k
}
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
236k
{
299
236k
  _JSAMPARRAY output_data = *output_data_ptr;
300
236k
  register _JSAMPROW inptr, outptr;
301
236k
  register int invalue;
302
236k
  register JDIMENSION colctr;
303
236k
  int inrow;
304
305
790k
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
306
553k
    inptr = input_data[inrow];
307
553k
    outptr = output_data[inrow];
308
    /* Special case for first column */
309
553k
    invalue = *inptr++;
310
553k
    *outptr++ = (_JSAMPLE)invalue;
311
553k
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[0] + 2) >> 2);
312
313
61.6M
    for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
314
      /* General case: 3/4 * nearer component + 1/4 * further component */
315
61.1M
      invalue = (*inptr++) * 3;
316
61.1M
      *outptr++ = (_JSAMPLE)((invalue + inptr[-2] + 1) >> 2);
317
61.1M
      *outptr++ = (_JSAMPLE)((invalue + inptr[0] + 2) >> 2);
318
61.1M
    }
319
320
    /* Special case for last column */
321
553k
    invalue = *inptr;
322
553k
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[-1] + 1) >> 2);
323
553k
    *outptr++ = (_JSAMPLE)invalue;
324
553k
  }
325
236k
}
jdsample-8.c:h2v1_fancy_upsample
Line
Count
Source
298
236k
{
299
236k
  _JSAMPARRAY output_data = *output_data_ptr;
300
236k
  register _JSAMPROW inptr, outptr;
301
236k
  register int invalue;
302
236k
  register JDIMENSION colctr;
303
236k
  int inrow;
304
305
790k
  for (inrow = 0; inrow < cinfo->max_v_samp_factor; inrow++) {
306
553k
    inptr = input_data[inrow];
307
553k
    outptr = output_data[inrow];
308
    /* Special case for first column */
309
553k
    invalue = *inptr++;
310
553k
    *outptr++ = (_JSAMPLE)invalue;
311
553k
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[0] + 2) >> 2);
312
313
61.6M
    for (colctr = compptr->downsampled_width - 2; colctr > 0; colctr--) {
314
      /* General case: 3/4 * nearer component + 1/4 * further component */
315
61.1M
      invalue = (*inptr++) * 3;
316
61.1M
      *outptr++ = (_JSAMPLE)((invalue + inptr[-2] + 1) >> 2);
317
61.1M
      *outptr++ = (_JSAMPLE)((invalue + inptr[0] + 2) >> 2);
318
61.1M
    }
319
320
    /* Special case for last column */
321
553k
    invalue = *inptr;
322
553k
    *outptr++ = (_JSAMPLE)((invalue * 3 + inptr[-1] + 1) >> 2);
323
553k
    *outptr++ = (_JSAMPLE)invalue;
324
553k
  }
325
236k
}
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
243k
{
339
243k
  _JSAMPARRAY output_data = *output_data_ptr;
340
243k
  _JSAMPROW inptr0, inptr1, outptr;
341
#if BITS_IN_JSAMPLE == 8
342
  int thiscolsum, bias;
343
#else
344
  JLONG thiscolsum, bias;
345
#endif
346
243k
  JDIMENSION colctr;
347
243k
  int inrow, outrow, v;
348
349
243k
  inrow = outrow = 0;
350
721k
  while (outrow < cinfo->max_v_samp_factor) {
351
1.43M
    for (v = 0; v < 2; v++) {
352
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
353
956k
      inptr0 = input_data[inrow];
354
956k
      if (v == 0) {             /* next nearest is row above */
355
478k
        inptr1 = input_data[inrow - 1];
356
478k
        bias = 1;
357
478k
      } else {                  /* next nearest is row below */
358
478k
        inptr1 = input_data[inrow + 1];
359
478k
        bias = 2;
360
478k
      }
361
956k
      outptr = output_data[outrow++];
362
363
92.6M
      for (colctr = 0; colctr < compptr->downsampled_width; colctr++) {
364
91.6M
        thiscolsum = (*inptr0++) * 3 + (*inptr1++);
365
91.6M
        *outptr++ = (_JSAMPLE)((thiscolsum + bias) >> 2);
366
91.6M
      }
367
956k
    }
368
478k
    inrow++;
369
478k
  }
370
243k
}
jdsample-8.c:h1v2_fancy_upsample
Line
Count
Source
338
243k
{
339
243k
  _JSAMPARRAY output_data = *output_data_ptr;
340
243k
  _JSAMPROW inptr0, inptr1, outptr;
341
243k
#if BITS_IN_JSAMPLE == 8
342
243k
  int thiscolsum, bias;
343
#else
344
  JLONG thiscolsum, bias;
345
#endif
346
243k
  JDIMENSION colctr;
347
243k
  int inrow, outrow, v;
348
349
243k
  inrow = outrow = 0;
350
721k
  while (outrow < cinfo->max_v_samp_factor) {
351
1.43M
    for (v = 0; v < 2; v++) {
352
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
353
956k
      inptr0 = input_data[inrow];
354
956k
      if (v == 0) {             /* next nearest is row above */
355
478k
        inptr1 = input_data[inrow - 1];
356
478k
        bias = 1;
357
478k
      } else {                  /* next nearest is row below */
358
478k
        inptr1 = input_data[inrow + 1];
359
478k
        bias = 2;
360
478k
      }
361
956k
      outptr = output_data[outrow++];
362
363
92.6M
      for (colctr = 0; colctr < compptr->downsampled_width; colctr++) {
364
91.6M
        thiscolsum = (*inptr0++) * 3 + (*inptr1++);
365
91.6M
        *outptr++ = (_JSAMPLE)((thiscolsum + bias) >> 2);
366
91.6M
      }
367
956k
    }
368
478k
    inrow++;
369
478k
  }
370
243k
}
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
139k
{
385
139k
  _JSAMPARRAY output_data = *output_data_ptr;
386
139k
  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
139k
  register JDIMENSION colctr;
393
139k
  int inrow, outrow, v;
394
395
139k
  inrow = outrow = 0;
396
337k
  while (outrow < cinfo->max_v_samp_factor) {
397
593k
    for (v = 0; v < 2; v++) {
398
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
399
395k
      inptr0 = input_data[inrow];
400
395k
      if (v == 0)               /* next nearest is row above */
401
197k
        inptr1 = input_data[inrow - 1];
402
197k
      else                      /* next nearest is row below */
403
197k
        inptr1 = input_data[inrow + 1];
404
395k
      outptr = output_data[outrow++];
405
406
      /* Special case for first column */
407
395k
      thiscolsum = (*inptr0++) * 3 + (*inptr1++);
408
395k
      nextcolsum = (*inptr0++) * 3 + (*inptr1++);
409
395k
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 8) >> 4);
410
395k
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
411
395k
      lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
412
413
66.7M
      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
66.3M
        nextcolsum = (*inptr0++) * 3 + (*inptr1++);
418
66.3M
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
419
66.3M
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
420
66.3M
        lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
421
66.3M
      }
422
423
      /* Special case for last column */
424
395k
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
425
395k
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 7) >> 4);
426
395k
    }
427
197k
    inrow++;
428
197k
  }
429
139k
}
jdsample-8.c:h2v2_fancy_upsample
Line
Count
Source
384
139k
{
385
139k
  _JSAMPARRAY output_data = *output_data_ptr;
386
139k
  register _JSAMPROW inptr0, inptr1, outptr;
387
139k
#if BITS_IN_JSAMPLE == 8
388
139k
  register int thiscolsum, lastcolsum, nextcolsum;
389
#else
390
  register JLONG thiscolsum, lastcolsum, nextcolsum;
391
#endif
392
139k
  register JDIMENSION colctr;
393
139k
  int inrow, outrow, v;
394
395
139k
  inrow = outrow = 0;
396
337k
  while (outrow < cinfo->max_v_samp_factor) {
397
593k
    for (v = 0; v < 2; v++) {
398
      /* inptr0 points to nearest input row, inptr1 points to next nearest */
399
395k
      inptr0 = input_data[inrow];
400
395k
      if (v == 0)               /* next nearest is row above */
401
197k
        inptr1 = input_data[inrow - 1];
402
197k
      else                      /* next nearest is row below */
403
197k
        inptr1 = input_data[inrow + 1];
404
395k
      outptr = output_data[outrow++];
405
406
      /* Special case for first column */
407
395k
      thiscolsum = (*inptr0++) * 3 + (*inptr1++);
408
395k
      nextcolsum = (*inptr0++) * 3 + (*inptr1++);
409
395k
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 8) >> 4);
410
395k
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
411
395k
      lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
412
413
66.7M
      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
66.3M
        nextcolsum = (*inptr0++) * 3 + (*inptr1++);
418
66.3M
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
419
66.3M
        *outptr++ = (_JSAMPLE)((thiscolsum * 3 + nextcolsum + 7) >> 4);
420
66.3M
        lastcolsum = thiscolsum;  thiscolsum = nextcolsum;
421
66.3M
      }
422
423
      /* Special case for last column */
424
395k
      *outptr++ = (_JSAMPLE)((thiscolsum * 3 + lastcolsum + 8) >> 4);
425
395k
      *outptr++ = (_JSAMPLE)((thiscolsum * 4 + 7) >> 4);
426
395k
    }
427
197k
    inrow++;
428
197k
  }
429
139k
}
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
7.78k
{
439
7.78k
  my_upsample_ptr upsample;
440
7.78k
  int ci;
441
7.78k
  jpeg_component_info *compptr;
442
7.78k
  boolean need_buffer, do_fancy;
443
7.78k
  int h_in_group, v_in_group, h_out_group, v_out_group;
444
445
7.78k
#ifdef D_LOSSLESS_SUPPORTED
446
7.78k
  if (cinfo->master->lossless) {
447
#if BITS_IN_JSAMPLE == 8
448
837
    if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2)
449
#else
450
1.37k
    if (cinfo->data_precision > BITS_IN_JSAMPLE ||
451
1.37k
        cinfo->data_precision < BITS_IN_JSAMPLE - 3)
452
0
#endif
453
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
454
2.21k
  } else
455
5.57k
#endif
456
5.57k
  {
457
5.57k
    if (cinfo->data_precision != BITS_IN_JSAMPLE)
458
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
459
5.57k
  }
460
461
7.78k
  if (!cinfo->master->jinit_upsampler_no_alloc) {
462
7.78k
    upsample = (my_upsample_ptr)
463
7.78k
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
464
7.78k
                                  sizeof(my_upsampler));
465
7.78k
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
466
7.78k
    upsample->pub.start_pass = start_pass_upsample;
467
7.78k
    upsample->pub._upsample = sep_upsample;
468
7.78k
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
469
7.78k
  } else
470
0
    upsample = (my_upsample_ptr)cinfo->upsample;
471
472
7.78k
  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
7.78k
  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.8k
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
484
20.0k
       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
20.0k
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
489
20.0k
                 cinfo->_min_DCT_scaled_size;
490
20.0k
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
491
20.0k
                 cinfo->_min_DCT_scaled_size;
492
20.0k
    h_out_group = cinfo->max_h_samp_factor;
493
20.0k
    v_out_group = cinfo->max_v_samp_factor;
494
20.0k
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
495
20.0k
    need_buffer = TRUE;
496
20.0k
    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
20.0k
    } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
501
      /* Fullsize components can be processed without any work. */
502
7.25k
      upsample->methods[ci] = fullsize_upsample;
503
7.25k
      need_buffer = FALSE;
504
12.7k
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
505
      /* Special cases for 2h1v upsampling */
506
2.82k
      if (do_fancy && compptr->downsampled_width > 2) {
507
#ifdef WITH_SIMD
508
1.86k
        if (jsimd_set_h2v1_fancy_upsample(cinfo))
509
0
          upsample->methods[ci] = jsimd_h2v1_fancy_upsample;
510
1.86k
        else
511
1.86k
#endif
512
1.86k
          upsample->methods[ci] = h2v1_fancy_upsample;
513
2.26k
      } else {
514
#ifdef WITH_SIMD
515
430
        if (jsimd_set_h2v1_upsample(cinfo))
516
0
          upsample->methods[ci] = jsimd_h2v1_upsample;
517
430
        else
518
430
#endif
519
430
          upsample->methods[ci] = h2v1_upsample;
520
556
      }
521
9.97k
    } else if (h_in_group == h_out_group &&
522
2.22k
               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
1.79k
        upsample->methods[ci] = h1v2_fancy_upsample;
530
1.79k
      upsample->pub.need_context_rows = TRUE;
531
8.18k
    } else if (h_in_group * 2 == h_out_group &&
532
4.53k
               v_in_group * 2 == v_out_group) {
533
      /* Special cases for 2h2v upsampling */
534
4.05k
      if (do_fancy && compptr->downsampled_width > 2) {
535
#ifdef WITH_SIMD
536
3.28k
        if (jsimd_set_h2v2_fancy_upsample(cinfo))
537
0
          upsample->methods[ci] = jsimd_h2v2_fancy_upsample;
538
3.28k
        else
539
3.28k
#endif
540
3.28k
          upsample->methods[ci] = h2v2_fancy_upsample;
541
3.51k
        upsample->pub.need_context_rows = TRUE;
542
3.51k
      } else {
543
#ifdef WITH_SIMD
544
402
        if (jsimd_set_h2v2_upsample(cinfo))
545
0
          upsample->methods[ci] = jsimd_h2v2_upsample;
546
402
        else
547
402
#endif
548
402
          upsample->methods[ci] = h2v2_upsample;
549
539
      }
550
4.12k
    } else if ((h_out_group % h_in_group) == 0 &&
551
4.10k
               (v_out_group % v_in_group) == 0) {
552
      /* Generic integral-factors upsampling method */
553
4.07k
      upsample->methods[ci] = int_upsample;
554
4.07k
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
555
4.07k
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
556
4.07k
    } else
557
53
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
558
20.0k
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
559
12.7k
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
560
12.7k
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
561
12.7k
         (JDIMENSION)jround_up((long)cinfo->output_width,
562
12.7k
                               (long)cinfo->max_h_samp_factor),
563
12.7k
         (JDIMENSION)cinfo->max_v_samp_factor);
564
12.7k
    }
565
20.0k
  }
566
7.78k
}
jinit_upsampler
Line
Count
Source
438
5.90k
{
439
5.90k
  my_upsample_ptr upsample;
440
5.90k
  int ci;
441
5.90k
  jpeg_component_info *compptr;
442
5.90k
  boolean need_buffer, do_fancy;
443
5.90k
  int h_in_group, v_in_group, h_out_group, v_out_group;
444
445
5.90k
#ifdef D_LOSSLESS_SUPPORTED
446
5.90k
  if (cinfo->master->lossless) {
447
837
#if BITS_IN_JSAMPLE == 8
448
837
    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
837
  } else
455
5.06k
#endif
456
5.06k
  {
457
5.06k
    if (cinfo->data_precision != BITS_IN_JSAMPLE)
458
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
459
5.06k
  }
460
461
5.90k
  if (!cinfo->master->jinit_upsampler_no_alloc) {
462
5.90k
    upsample = (my_upsample_ptr)
463
5.90k
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
464
5.90k
                                  sizeof(my_upsampler));
465
5.90k
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
466
5.90k
    upsample->pub.start_pass = start_pass_upsample;
467
5.90k
    upsample->pub._upsample = sep_upsample;
468
5.90k
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
469
5.90k
  } else
470
0
    upsample = (my_upsample_ptr)cinfo->upsample;
471
472
5.90k
  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.90k
  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
20.3k
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
484
14.4k
       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
14.4k
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
489
14.4k
                 cinfo->_min_DCT_scaled_size;
490
14.4k
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
491
14.4k
                 cinfo->_min_DCT_scaled_size;
492
14.4k
    h_out_group = cinfo->max_h_samp_factor;
493
14.4k
    v_out_group = cinfo->max_v_samp_factor;
494
14.4k
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
495
14.4k
    need_buffer = TRUE;
496
14.4k
    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
14.4k
    } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
501
      /* Fullsize components can be processed without any work. */
502
5.66k
      upsample->methods[ci] = fullsize_upsample;
503
5.66k
      need_buffer = FALSE;
504
8.78k
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
505
      /* Special cases for 2h1v upsampling */
506
2.29k
      if (do_fancy && compptr->downsampled_width > 2) {
507
1.86k
#ifdef WITH_SIMD
508
1.86k
        if (jsimd_set_h2v1_fancy_upsample(cinfo))
509
0
          upsample->methods[ci] = jsimd_h2v1_fancy_upsample;
510
1.86k
        else
511
1.86k
#endif
512
1.86k
          upsample->methods[ci] = h2v1_fancy_upsample;
513
1.86k
      } else {
514
430
#ifdef WITH_SIMD
515
430
        if (jsimd_set_h2v1_upsample(cinfo))
516
0
          upsample->methods[ci] = jsimd_h2v1_upsample;
517
430
        else
518
430
#endif
519
430
          upsample->methods[ci] = h2v1_upsample;
520
430
      }
521
6.49k
    } else if (h_in_group == h_out_group &&
522
1.74k
               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
1.55k
        upsample->methods[ci] = h1v2_fancy_upsample;
530
1.55k
      upsample->pub.need_context_rows = TRUE;
531
4.93k
    } else if (h_in_group * 2 == h_out_group &&
532
4.11k
               v_in_group * 2 == v_out_group) {
533
      /* Special cases for 2h2v upsampling */
534
3.68k
      if (do_fancy && compptr->downsampled_width > 2) {
535
3.28k
#ifdef WITH_SIMD
536
3.28k
        if (jsimd_set_h2v2_fancy_upsample(cinfo))
537
0
          upsample->methods[ci] = jsimd_h2v2_fancy_upsample;
538
3.28k
        else
539
3.28k
#endif
540
3.28k
          upsample->methods[ci] = h2v2_fancy_upsample;
541
3.28k
        upsample->pub.need_context_rows = TRUE;
542
3.28k
      } else {
543
402
#ifdef WITH_SIMD
544
402
        if (jsimd_set_h2v2_upsample(cinfo))
545
0
          upsample->methods[ci] = jsimd_h2v2_upsample;
546
402
        else
547
402
#endif
548
402
          upsample->methods[ci] = h2v2_upsample;
549
402
      }
550
3.68k
    } else if ((h_out_group % h_in_group) == 0 &&
551
1.24k
               (v_out_group % v_in_group) == 0) {
552
      /* Generic integral-factors upsampling method */
553
1.22k
      upsample->methods[ci] = int_upsample;
554
1.22k
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
555
1.22k
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
556
1.22k
    } else
557
24
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
558
14.4k
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
559
8.76k
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
560
8.76k
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
561
8.76k
         (JDIMENSION)jround_up((long)cinfo->output_width,
562
8.76k
                               (long)cinfo->max_h_samp_factor),
563
8.76k
         (JDIMENSION)cinfo->max_v_samp_factor);
564
8.76k
    }
565
14.4k
  }
566
5.90k
}
j12init_upsampler
Line
Count
Source
438
1.24k
{
439
1.24k
  my_upsample_ptr upsample;
440
1.24k
  int ci;
441
1.24k
  jpeg_component_info *compptr;
442
1.24k
  boolean need_buffer, do_fancy;
443
1.24k
  int h_in_group, v_in_group, h_out_group, v_out_group;
444
445
1.24k
#ifdef D_LOSSLESS_SUPPORTED
446
1.24k
  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
742
    if (cinfo->data_precision > BITS_IN_JSAMPLE ||
451
742
        cinfo->data_precision < BITS_IN_JSAMPLE - 3)
452
0
#endif
453
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
454
742
  } else
455
504
#endif
456
504
  {
457
504
    if (cinfo->data_precision != BITS_IN_JSAMPLE)
458
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
459
504
  }
460
461
1.24k
  if (!cinfo->master->jinit_upsampler_no_alloc) {
462
1.24k
    upsample = (my_upsample_ptr)
463
1.24k
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
464
1.24k
                                  sizeof(my_upsampler));
465
1.24k
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
466
1.24k
    upsample->pub.start_pass = start_pass_upsample;
467
1.24k
    upsample->pub._upsample = sep_upsample;
468
1.24k
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
469
1.24k
  } else
470
0
    upsample = (my_upsample_ptr)cinfo->upsample;
471
472
1.24k
  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.24k
  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.95k
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
484
3.71k
       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.71k
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
489
3.71k
                 cinfo->_min_DCT_scaled_size;
490
3.71k
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
491
3.71k
                 cinfo->_min_DCT_scaled_size;
492
3.71k
    h_out_group = cinfo->max_h_samp_factor;
493
3.71k
    v_out_group = cinfo->max_v_samp_factor;
494
3.71k
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
495
3.71k
    need_buffer = TRUE;
496
3.71k
    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.71k
    } 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.01k
      upsample->methods[ci] = fullsize_upsample;
503
1.01k
      need_buffer = FALSE;
504
2.69k
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
505
      /* Special cases for 2h1v upsampling */
506
486
      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
401
          upsample->methods[ci] = h2v1_fancy_upsample;
513
401
      } else {
514
#ifdef WITH_SIMD
515
        if (jsimd_set_h2v1_upsample(cinfo))
516
          upsample->methods[ci] = jsimd_h2v1_upsample;
517
        else
518
#endif
519
85
          upsample->methods[ci] = h2v1_upsample;
520
85
      }
521
2.21k
    } else if (h_in_group == h_out_group &&
522
370
               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.97k
    } else if (h_in_group * 2 == h_out_group &&
532
326
               v_in_group * 2 == v_out_group) {
533
      /* Special cases for 2h2v upsampling */
534
308
      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
237
          upsample->methods[ci] = h2v2_fancy_upsample;
541
237
        upsample->pub.need_context_rows = TRUE;
542
237
      } else {
543
#ifdef WITH_SIMD
544
        if (jsimd_set_h2v2_upsample(cinfo))
545
          upsample->methods[ci] = jsimd_h2v2_upsample;
546
        else
547
#endif
548
71
          upsample->methods[ci] = h2v2_upsample;
549
71
      }
550
1.66k
    } else if ((h_out_group % h_in_group) == 0 &&
551
1.66k
               (v_out_group % v_in_group) == 0) {
552
      /* Generic integral-factors upsampling method */
553
1.65k
      upsample->methods[ci] = int_upsample;
554
1.65k
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
555
1.65k
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
556
1.65k
    } else
557
14
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
558
3.71k
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
559
2.68k
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
560
2.68k
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
561
2.68k
         (JDIMENSION)jround_up((long)cinfo->output_width,
562
2.68k
                               (long)cinfo->max_h_samp_factor),
563
2.68k
         (JDIMENSION)cinfo->max_v_samp_factor);
564
2.68k
    }
565
3.71k
  }
566
1.24k
}
j16init_upsampler
Line
Count
Source
438
637
{
439
637
  my_upsample_ptr upsample;
440
637
  int ci;
441
637
  jpeg_component_info *compptr;
442
637
  boolean need_buffer, do_fancy;
443
637
  int h_in_group, v_in_group, h_out_group, v_out_group;
444
445
637
#ifdef D_LOSSLESS_SUPPORTED
446
637
  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
637
    if (cinfo->data_precision > BITS_IN_JSAMPLE ||
451
637
        cinfo->data_precision < BITS_IN_JSAMPLE - 3)
452
0
#endif
453
0
      ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision);
454
637
  } 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
637
  if (!cinfo->master->jinit_upsampler_no_alloc) {
462
637
    upsample = (my_upsample_ptr)
463
637
      (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE,
464
637
                                  sizeof(my_upsampler));
465
637
    cinfo->upsample = (struct jpeg_upsampler *)upsample;
466
637
    upsample->pub.start_pass = start_pass_upsample;
467
637
    upsample->pub._upsample = sep_upsample;
468
637
    upsample->pub.need_context_rows = FALSE; /* until we find out differently */
469
637
  } else
470
0
    upsample = (my_upsample_ptr)cinfo->upsample;
471
472
637
  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
637
  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.52k
  for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components;
484
1.88k
       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
1.88k
    h_in_group = (compptr->h_samp_factor * compptr->_DCT_scaled_size) /
489
1.88k
                 cinfo->_min_DCT_scaled_size;
490
1.88k
    v_in_group = (compptr->v_samp_factor * compptr->_DCT_scaled_size) /
491
1.88k
                 cinfo->_min_DCT_scaled_size;
492
1.88k
    h_out_group = cinfo->max_h_samp_factor;
493
1.88k
    v_out_group = cinfo->max_v_samp_factor;
494
1.88k
    upsample->rowgroup_height[ci] = v_in_group; /* save for use later */
495
1.88k
    need_buffer = TRUE;
496
1.88k
    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
1.88k
    } else if (h_in_group == h_out_group && v_in_group == v_out_group) {
501
      /* Fullsize components can be processed without any work. */
502
571
      upsample->methods[ci] = fullsize_upsample;
503
571
      need_buffer = FALSE;
504
1.31k
    } else if (h_in_group * 2 == h_out_group && v_in_group == v_out_group) {
505
      /* Special cases for 2h1v upsampling */
506
41
      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
41
      } else {
514
#ifdef WITH_SIMD
515
        if (jsimd_set_h2v1_upsample(cinfo))
516
          upsample->methods[ci] = jsimd_h2v1_upsample;
517
        else
518
#endif
519
41
          upsample->methods[ci] = h2v1_upsample;
520
41
      }
521
1.27k
    } else if (h_in_group == h_out_group &&
522
113
               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.27k
    } else if (h_in_group * 2 == h_out_group &&
532
88
               v_in_group * 2 == v_out_group) {
533
      /* Special cases for 2h2v upsampling */
534
66
      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
66
      } else {
543
#ifdef WITH_SIMD
544
        if (jsimd_set_h2v2_upsample(cinfo))
545
          upsample->methods[ci] = jsimd_h2v2_upsample;
546
        else
547
#endif
548
66
          upsample->methods[ci] = h2v2_upsample;
549
66
      }
550
1.20k
    } else if ((h_out_group % h_in_group) == 0 &&
551
1.19k
               (v_out_group % v_in_group) == 0) {
552
      /* Generic integral-factors upsampling method */
553
1.19k
      upsample->methods[ci] = int_upsample;
554
1.19k
      upsample->h_expand[ci] = (UINT8)(h_out_group / h_in_group);
555
1.19k
      upsample->v_expand[ci] = (UINT8)(v_out_group / v_in_group);
556
1.19k
    } else
557
15
      ERREXIT(cinfo, JERR_FRACT_SAMPLE_NOTIMPL);
558
1.88k
    if (need_buffer && !cinfo->master->jinit_upsampler_no_alloc) {
559
1.30k
      upsample->color_buf[ci] = (_JSAMPARRAY)(*cinfo->mem->alloc_sarray)
560
1.30k
        ((j_common_ptr)cinfo, JPOOL_IMAGE,
561
1.30k
         (JDIMENSION)jround_up((long)cinfo->output_width,
562
1.30k
                               (long)cinfo->max_h_samp_factor),
563
1.30k
         (JDIMENSION)cinfo->max_v_samp_factor);
564
1.30k
    }
565
1.88k
  }
566
637
}
567
568
#endif /* BITS_IN_JSAMPLE != 16 || defined(D_LOSSLESS_SUPPORTED) */