/src/libjpeg-turbo.main/src/jcdiffct.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * jcdiffct.c |
3 | | * |
4 | | * This file was part of the Independent JPEG Group's software: |
5 | | * Copyright (C) 1994-1997, Thomas G. Lane. |
6 | | * Lossless JPEG Modifications: |
7 | | * Copyright (C) 1999, Ken Murchison. |
8 | | * libjpeg-turbo Modifications: |
9 | | * Copyright (C) 2022, 2024, D. R. Commander. |
10 | | * For conditions of distribution and use, see the accompanying README.ijg |
11 | | * file. |
12 | | * |
13 | | * This file contains the difference buffer controller for compression. |
14 | | * This controller is the top level of the lossless JPEG compressor proper. |
15 | | * The difference buffer lies between the prediction/differencing and entropy |
16 | | * encoding steps. |
17 | | */ |
18 | | |
19 | | #define JPEG_INTERNALS |
20 | | #include "jinclude.h" |
21 | | #include "jpeglib.h" |
22 | | #include "jlossls.h" /* Private declarations for lossless codec */ |
23 | | |
24 | | |
25 | | #ifdef C_LOSSLESS_SUPPORTED |
26 | | |
27 | | /* We use a full-image sample buffer when doing Huffman optimization, |
28 | | * and also for writing multiple-scan JPEG files. In all cases, the |
29 | | * full-image buffer is filled during the first pass, and the scaling, |
30 | | * prediction and differencing steps are run during subsequent passes. |
31 | | */ |
32 | | #ifdef ENTROPY_OPT_SUPPORTED |
33 | | #define FULL_SAMP_BUFFER_SUPPORTED |
34 | | #else |
35 | | #ifdef C_MULTISCAN_FILES_SUPPORTED |
36 | | #define FULL_SAMP_BUFFER_SUPPORTED |
37 | | #endif |
38 | | #endif |
39 | | |
40 | | |
41 | | /* Private buffer controller object */ |
42 | | |
43 | | typedef struct { |
44 | | struct jpeg_c_coef_controller pub; /* public fields */ |
45 | | |
46 | | JDIMENSION iMCU_row_num; /* iMCU row # within image */ |
47 | | JDIMENSION mcu_ctr; /* counts MCUs processed in current row */ |
48 | | int MCU_vert_offset; /* counts MCU rows within iMCU row */ |
49 | | int MCU_rows_per_iMCU_row; /* number of such rows needed */ |
50 | | |
51 | | _JSAMPROW cur_row[MAX_COMPONENTS]; /* row of point-transformed samples */ |
52 | | _JSAMPROW prev_row[MAX_COMPONENTS]; /* previous row of Pt'd samples */ |
53 | | JDIFFARRAY diff_buf[MAX_COMPONENTS]; /* iMCU row of differences */ |
54 | | |
55 | | /* In multi-pass modes, we need a virtual sample array for each component. */ |
56 | | jvirt_sarray_ptr whole_image[MAX_COMPONENTS]; |
57 | | } my_diff_controller; |
58 | | |
59 | | typedef my_diff_controller *my_diff_ptr; |
60 | | |
61 | | |
62 | | /* Forward declarations */ |
63 | | METHODDEF(boolean) compress_data(j_compress_ptr cinfo, _JSAMPIMAGE input_buf); |
64 | | #ifdef FULL_SAMP_BUFFER_SUPPORTED |
65 | | METHODDEF(boolean) compress_first_pass(j_compress_ptr cinfo, |
66 | | _JSAMPIMAGE input_buf); |
67 | | METHODDEF(boolean) compress_output(j_compress_ptr cinfo, |
68 | | _JSAMPIMAGE input_buf); |
69 | | #endif |
70 | | |
71 | | |
72 | | LOCAL(void) |
73 | | start_iMCU_row(j_compress_ptr cinfo) |
74 | | /* Reset within-iMCU-row counters for a new row */ |
75 | 31.2M | { |
76 | 31.2M | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; |
77 | | |
78 | | /* In an interleaved scan, an MCU row is the same as an iMCU row. |
79 | | * In a noninterleaved scan, an iMCU row has v_samp_factor MCU rows. |
80 | | * But at the bottom of the image, process only what's left. |
81 | | */ |
82 | 31.2M | if (cinfo->comps_in_scan > 1) { |
83 | 26.8M | diff->MCU_rows_per_iMCU_row = 1; |
84 | 26.8M | } else { |
85 | 4.46M | if (diff->iMCU_row_num < (cinfo->total_iMCU_rows-1)) |
86 | 4.46M | diff->MCU_rows_per_iMCU_row = cinfo->cur_comp_info[0]->v_samp_factor; |
87 | 2.38k | else |
88 | 2.38k | diff->MCU_rows_per_iMCU_row = cinfo->cur_comp_info[0]->last_row_height; |
89 | 4.46M | } |
90 | | |
91 | 31.2M | diff->mcu_ctr = 0; |
92 | 31.2M | diff->MCU_vert_offset = 0; |
93 | 31.2M | } Unexecuted instantiation: jcdiffct-8.c:start_iMCU_row Unexecuted instantiation: jcdiffct-12.c:start_iMCU_row jcdiffct-16.c:start_iMCU_row Line | Count | Source | 75 | 31.2M | { | 76 | 31.2M | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; | 77 | | | 78 | | /* In an interleaved scan, an MCU row is the same as an iMCU row. | 79 | | * In a noninterleaved scan, an iMCU row has v_samp_factor MCU rows. | 80 | | * But at the bottom of the image, process only what's left. | 81 | | */ | 82 | 31.2M | if (cinfo->comps_in_scan > 1) { | 83 | 26.8M | diff->MCU_rows_per_iMCU_row = 1; | 84 | 26.8M | } else { | 85 | 4.46M | if (diff->iMCU_row_num < (cinfo->total_iMCU_rows-1)) | 86 | 4.46M | diff->MCU_rows_per_iMCU_row = cinfo->cur_comp_info[0]->v_samp_factor; | 87 | 2.38k | else | 88 | 2.38k | diff->MCU_rows_per_iMCU_row = cinfo->cur_comp_info[0]->last_row_height; | 89 | 4.46M | } | 90 | | | 91 | 31.2M | diff->mcu_ctr = 0; | 92 | 31.2M | diff->MCU_vert_offset = 0; | 93 | 31.2M | } |
|
94 | | |
95 | | |
96 | | /* |
97 | | * Initialize for a processing pass. |
98 | | */ |
99 | | |
100 | | METHODDEF(void) |
101 | | start_pass_diff(j_compress_ptr cinfo, J_BUF_MODE pass_mode) |
102 | 9.26k | { |
103 | 9.26k | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; |
104 | | |
105 | | /* Because it is hitching a ride on the jpeg_forward_dct struct, |
106 | | * start_pass_lossless() will be called at the start of the initial pass. |
107 | | * This ensures that it will be called at the start of the Huffman |
108 | | * optimization and output passes as well. |
109 | | */ |
110 | 9.26k | if (pass_mode == JBUF_CRANK_DEST) |
111 | 4.63k | (*cinfo->fdct->start_pass) (cinfo); |
112 | | |
113 | 9.26k | diff->iMCU_row_num = 0; |
114 | 9.26k | start_iMCU_row(cinfo); |
115 | | |
116 | 9.26k | switch (pass_mode) { |
117 | 0 | case JBUF_PASS_THRU: |
118 | 0 | if (diff->whole_image[0] != NULL) |
119 | 0 | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); |
120 | 0 | diff->pub._compress_data = compress_data; |
121 | 0 | break; |
122 | 0 | #ifdef FULL_SAMP_BUFFER_SUPPORTED |
123 | 4.63k | case JBUF_SAVE_AND_PASS: |
124 | 4.63k | if (diff->whole_image[0] == NULL) |
125 | 0 | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); |
126 | 4.63k | diff->pub._compress_data = compress_first_pass; |
127 | 4.63k | break; |
128 | 4.63k | case JBUF_CRANK_DEST: |
129 | 4.63k | if (diff->whole_image[0] == NULL) |
130 | 0 | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); |
131 | 4.63k | diff->pub._compress_data = compress_output; |
132 | 4.63k | break; |
133 | 0 | #endif |
134 | 0 | default: |
135 | 0 | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); |
136 | 0 | break; |
137 | 9.26k | } |
138 | 9.26k | } Unexecuted instantiation: jcdiffct-8.c:start_pass_diff Unexecuted instantiation: jcdiffct-12.c:start_pass_diff jcdiffct-16.c:start_pass_diff Line | Count | Source | 102 | 9.26k | { | 103 | 9.26k | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; | 104 | | | 105 | | /* Because it is hitching a ride on the jpeg_forward_dct struct, | 106 | | * start_pass_lossless() will be called at the start of the initial pass. | 107 | | * This ensures that it will be called at the start of the Huffman | 108 | | * optimization and output passes as well. | 109 | | */ | 110 | 9.26k | if (pass_mode == JBUF_CRANK_DEST) | 111 | 4.63k | (*cinfo->fdct->start_pass) (cinfo); | 112 | | | 113 | 9.26k | diff->iMCU_row_num = 0; | 114 | 9.26k | start_iMCU_row(cinfo); | 115 | | | 116 | 9.26k | switch (pass_mode) { | 117 | 0 | case JBUF_PASS_THRU: | 118 | 0 | if (diff->whole_image[0] != NULL) | 119 | 0 | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); | 120 | 0 | diff->pub._compress_data = compress_data; | 121 | 0 | break; | 122 | 0 | #ifdef FULL_SAMP_BUFFER_SUPPORTED | 123 | 4.63k | case JBUF_SAVE_AND_PASS: | 124 | 4.63k | if (diff->whole_image[0] == NULL) | 125 | 0 | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); | 126 | 4.63k | diff->pub._compress_data = compress_first_pass; | 127 | 4.63k | break; | 128 | 4.63k | case JBUF_CRANK_DEST: | 129 | 4.63k | if (diff->whole_image[0] == NULL) | 130 | 0 | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); | 131 | 4.63k | diff->pub._compress_data = compress_output; | 132 | 4.63k | break; | 133 | 0 | #endif | 134 | 0 | default: | 135 | 0 | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); | 136 | 0 | break; | 137 | 9.26k | } | 138 | 9.26k | } |
|
139 | | |
140 | | |
141 | 89.3M | #define SWAP_ROWS(rowa, rowb) { \ |
142 | 89.3M | _JSAMPROW temp = rowa; \ |
143 | 89.3M | rowa = rowb; rowb = temp; \ |
144 | 89.3M | } |
145 | | |
146 | | /* |
147 | | * Process some data in the single-pass case. |
148 | | * We process the equivalent of one fully interleaved MCU row ("iMCU" row) |
149 | | * per call, ie, v_samp_factor rows for each component in the image. |
150 | | * Returns TRUE if the iMCU row is completed, FALSE if suspended. |
151 | | * |
152 | | * NB: input_buf contains a plane for each component in image, |
153 | | * which we index according to the component's SOF position. |
154 | | */ |
155 | | |
156 | | METHODDEF(boolean) |
157 | | compress_data(j_compress_ptr cinfo, _JSAMPIMAGE input_buf) |
158 | 31.2M | { |
159 | 31.2M | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; |
160 | 31.2M | lossless_comp_ptr losslessc = (lossless_comp_ptr)cinfo->fdct; |
161 | 31.2M | JDIMENSION MCU_col_num; /* index of current MCU within row */ |
162 | 31.2M | JDIMENSION MCU_count; /* number of MCUs encoded */ |
163 | 31.2M | JDIMENSION last_iMCU_row = cinfo->total_iMCU_rows - 1; |
164 | 31.2M | int ci, compi, yoffset, samp_row, samp_rows, samps_across; |
165 | 31.2M | jpeg_component_info *compptr; |
166 | | |
167 | | /* Loop to write as much as one whole iMCU row */ |
168 | 62.5M | for (yoffset = diff->MCU_vert_offset; yoffset < diff->MCU_rows_per_iMCU_row; |
169 | 31.2M | yoffset++) { |
170 | | |
171 | 31.2M | MCU_col_num = diff->mcu_ctr; |
172 | | |
173 | | /* Scale and predict each scanline of the MCU row separately. |
174 | | * |
175 | | * Note: We only do this if we are at the start of an MCU row, ie, |
176 | | * we don't want to reprocess a row suspended by the output. |
177 | | */ |
178 | 31.2M | if (MCU_col_num == 0) { |
179 | 120M | for (ci = 0; ci < cinfo->comps_in_scan; ci++) { |
180 | 89.3M | compptr = cinfo->cur_comp_info[ci]; |
181 | 89.3M | compi = compptr->component_index; |
182 | 89.3M | if (diff->iMCU_row_num < last_iMCU_row) |
183 | 89.3M | samp_rows = compptr->v_samp_factor; |
184 | 26.6k | else { |
185 | | /* NB: can't use last_row_height here, since may not be set! */ |
186 | 26.6k | samp_rows = |
187 | 26.6k | (int)(compptr->height_in_blocks % compptr->v_samp_factor); |
188 | 26.6k | if (samp_rows == 0) samp_rows = compptr->v_samp_factor; |
189 | 0 | else { |
190 | | /* Fill dummy difference rows at the bottom edge with zeros, which |
191 | | * will encode to the smallest amount of data. |
192 | | */ |
193 | 0 | for (samp_row = samp_rows; samp_row < compptr->v_samp_factor; |
194 | 0 | samp_row++) |
195 | 0 | memset(diff->diff_buf[compi][samp_row], 0, |
196 | 0 | jround_up((long)compptr->width_in_blocks, |
197 | 0 | (long)compptr->h_samp_factor) * sizeof(JDIFF)); |
198 | 0 | } |
199 | 26.6k | } |
200 | 89.3M | samps_across = compptr->width_in_blocks; |
201 | | |
202 | 178M | for (samp_row = 0; samp_row < samp_rows; samp_row++) { |
203 | 89.3M | (*losslessc->scaler_scale) (cinfo, |
204 | 89.3M | input_buf[compi][samp_row], |
205 | 89.3M | diff->cur_row[compi], |
206 | 89.3M | samps_across); |
207 | 89.3M | (*losslessc->predict_difference[compi]) |
208 | 89.3M | (cinfo, compi, diff->cur_row[compi], diff->prev_row[compi], |
209 | 89.3M | diff->diff_buf[compi][samp_row], samps_across); |
210 | 89.3M | SWAP_ROWS(diff->cur_row[compi], diff->prev_row[compi]); |
211 | 89.3M | } |
212 | 89.3M | } |
213 | 31.2M | } |
214 | | /* Try to write the MCU row (or remaining portion of suspended MCU row). */ |
215 | 31.2M | MCU_count = |
216 | 31.2M | (*cinfo->entropy->encode_mcus) (cinfo, |
217 | 31.2M | diff->diff_buf, yoffset, MCU_col_num, |
218 | 31.2M | cinfo->MCUs_per_row - MCU_col_num); |
219 | 31.2M | if (MCU_count != cinfo->MCUs_per_row - MCU_col_num) { |
220 | | /* Suspension forced; update state counters and exit */ |
221 | 0 | diff->MCU_vert_offset = yoffset; |
222 | 0 | diff->mcu_ctr += MCU_col_num; |
223 | 0 | return FALSE; |
224 | 0 | } |
225 | | /* Completed an MCU row, but perhaps not an iMCU row */ |
226 | 31.2M | diff->mcu_ctr = 0; |
227 | 31.2M | } |
228 | | /* Completed the iMCU row, advance counters for next one */ |
229 | 31.2M | diff->iMCU_row_num++; |
230 | 31.2M | start_iMCU_row(cinfo); |
231 | 31.2M | return TRUE; |
232 | 31.2M | } Unexecuted instantiation: jcdiffct-8.c:compress_data Unexecuted instantiation: jcdiffct-12.c:compress_data jcdiffct-16.c:compress_data Line | Count | Source | 158 | 31.2M | { | 159 | 31.2M | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; | 160 | 31.2M | lossless_comp_ptr losslessc = (lossless_comp_ptr)cinfo->fdct; | 161 | 31.2M | JDIMENSION MCU_col_num; /* index of current MCU within row */ | 162 | 31.2M | JDIMENSION MCU_count; /* number of MCUs encoded */ | 163 | 31.2M | JDIMENSION last_iMCU_row = cinfo->total_iMCU_rows - 1; | 164 | 31.2M | int ci, compi, yoffset, samp_row, samp_rows, samps_across; | 165 | 31.2M | jpeg_component_info *compptr; | 166 | | | 167 | | /* Loop to write as much as one whole iMCU row */ | 168 | 62.5M | for (yoffset = diff->MCU_vert_offset; yoffset < diff->MCU_rows_per_iMCU_row; | 169 | 31.2M | yoffset++) { | 170 | | | 171 | 31.2M | MCU_col_num = diff->mcu_ctr; | 172 | | | 173 | | /* Scale and predict each scanline of the MCU row separately. | 174 | | * | 175 | | * Note: We only do this if we are at the start of an MCU row, ie, | 176 | | * we don't want to reprocess a row suspended by the output. | 177 | | */ | 178 | 31.2M | if (MCU_col_num == 0) { | 179 | 120M | for (ci = 0; ci < cinfo->comps_in_scan; ci++) { | 180 | 89.3M | compptr = cinfo->cur_comp_info[ci]; | 181 | 89.3M | compi = compptr->component_index; | 182 | 89.3M | if (diff->iMCU_row_num < last_iMCU_row) | 183 | 89.3M | samp_rows = compptr->v_samp_factor; | 184 | 26.6k | else { | 185 | | /* NB: can't use last_row_height here, since may not be set! */ | 186 | 26.6k | samp_rows = | 187 | 26.6k | (int)(compptr->height_in_blocks % compptr->v_samp_factor); | 188 | 26.6k | if (samp_rows == 0) samp_rows = compptr->v_samp_factor; | 189 | 0 | else { | 190 | | /* Fill dummy difference rows at the bottom edge with zeros, which | 191 | | * will encode to the smallest amount of data. | 192 | | */ | 193 | 0 | for (samp_row = samp_rows; samp_row < compptr->v_samp_factor; | 194 | 0 | samp_row++) | 195 | 0 | memset(diff->diff_buf[compi][samp_row], 0, | 196 | 0 | jround_up((long)compptr->width_in_blocks, | 197 | 0 | (long)compptr->h_samp_factor) * sizeof(JDIFF)); | 198 | 0 | } | 199 | 26.6k | } | 200 | 89.3M | samps_across = compptr->width_in_blocks; | 201 | | | 202 | 178M | for (samp_row = 0; samp_row < samp_rows; samp_row++) { | 203 | 89.3M | (*losslessc->scaler_scale) (cinfo, | 204 | 89.3M | input_buf[compi][samp_row], | 205 | 89.3M | diff->cur_row[compi], | 206 | 89.3M | samps_across); | 207 | 89.3M | (*losslessc->predict_difference[compi]) | 208 | 89.3M | (cinfo, compi, diff->cur_row[compi], diff->prev_row[compi], | 209 | 89.3M | diff->diff_buf[compi][samp_row], samps_across); | 210 | 89.3M | SWAP_ROWS(diff->cur_row[compi], diff->prev_row[compi]); | 211 | 89.3M | } | 212 | 89.3M | } | 213 | 31.2M | } | 214 | | /* Try to write the MCU row (or remaining portion of suspended MCU row). */ | 215 | 31.2M | MCU_count = | 216 | 31.2M | (*cinfo->entropy->encode_mcus) (cinfo, | 217 | 31.2M | diff->diff_buf, yoffset, MCU_col_num, | 218 | 31.2M | cinfo->MCUs_per_row - MCU_col_num); | 219 | 31.2M | if (MCU_count != cinfo->MCUs_per_row - MCU_col_num) { | 220 | | /* Suspension forced; update state counters and exit */ | 221 | 0 | diff->MCU_vert_offset = yoffset; | 222 | 0 | diff->mcu_ctr += MCU_col_num; | 223 | 0 | return FALSE; | 224 | 0 | } | 225 | | /* Completed an MCU row, but perhaps not an iMCU row */ | 226 | 31.2M | diff->mcu_ctr = 0; | 227 | 31.2M | } | 228 | | /* Completed the iMCU row, advance counters for next one */ | 229 | 31.2M | diff->iMCU_row_num++; | 230 | 31.2M | start_iMCU_row(cinfo); | 231 | 31.2M | return TRUE; | 232 | 31.2M | } |
|
233 | | |
234 | | |
235 | | #ifdef FULL_SAMP_BUFFER_SUPPORTED |
236 | | |
237 | | /* |
238 | | * Process some data in the first pass of a multi-pass case. |
239 | | * We process the equivalent of one fully interleaved MCU row ("iMCU" row) |
240 | | * per call, ie, v_samp_factor rows for each component in the image. |
241 | | * This amount of data is read from the source buffer and saved into the |
242 | | * virtual arrays. |
243 | | * |
244 | | * We must also emit the data to the compressor. This is conveniently |
245 | | * done by calling compress_output() after we've loaded the current strip |
246 | | * of the virtual arrays. |
247 | | * |
248 | | * NB: input_buf contains a plane for each component in image. All components |
249 | | * are loaded into the virtual arrays in this pass. However, it may be that |
250 | | * only a subset of the components are emitted to the compressor during |
251 | | * this first pass; be careful about looking at the scan-dependent variables |
252 | | * (MCU dimensions, etc). |
253 | | */ |
254 | | |
255 | | METHODDEF(boolean) |
256 | | compress_first_pass(j_compress_ptr cinfo, _JSAMPIMAGE input_buf) |
257 | 15.6M | { |
258 | 15.6M | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; |
259 | 15.6M | JDIMENSION last_iMCU_row = cinfo->total_iMCU_rows - 1; |
260 | 15.6M | JDIMENSION samps_across; |
261 | 15.6M | int ci, samp_row, samp_rows; |
262 | 15.6M | _JSAMPARRAY buffer; |
263 | 15.6M | jpeg_component_info *compptr; |
264 | | |
265 | 60.3M | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; |
266 | 44.6M | ci++, compptr++) { |
267 | | /* Align the virtual buffer for this component. */ |
268 | 44.6M | buffer = (_JSAMPARRAY)(*cinfo->mem->access_virt_sarray) |
269 | 44.6M | ((j_common_ptr)cinfo, diff->whole_image[ci], |
270 | 44.6M | diff->iMCU_row_num * compptr->v_samp_factor, |
271 | 44.6M | (JDIMENSION)compptr->v_samp_factor, TRUE); |
272 | | |
273 | | /* Count non-dummy sample rows in this iMCU row. */ |
274 | 44.6M | if (diff->iMCU_row_num < last_iMCU_row) |
275 | 44.6M | samp_rows = compptr->v_samp_factor; |
276 | 13.3k | else { |
277 | | /* NB: can't use last_row_height here, since may not be set! */ |
278 | 13.3k | samp_rows = (int)(compptr->height_in_blocks % compptr->v_samp_factor); |
279 | 13.3k | if (samp_rows == 0) samp_rows = compptr->v_samp_factor; |
280 | 13.3k | } |
281 | 44.6M | samps_across = compptr->width_in_blocks; |
282 | | |
283 | | /* Perform point transform scaling and prediction/differencing for all |
284 | | * non-dummy rows in this iMCU row. Each call on these functions |
285 | | * processes a complete row of samples. |
286 | | */ |
287 | 89.3M | for (samp_row = 0; samp_row < samp_rows; samp_row++) { |
288 | 44.6M | memcpy(buffer[samp_row], input_buf[ci][samp_row], |
289 | 44.6M | samps_across * sizeof(_JSAMPLE)); |
290 | 44.6M | } |
291 | 44.6M | } |
292 | | /* NB: compress_output will increment iMCU_row_num if successful. |
293 | | * A suspension return will result in redoing all the work above next time. |
294 | | */ |
295 | | |
296 | | /* Emit data to the compressor, sharing code with subsequent passes */ |
297 | 15.6M | return compress_output(cinfo, input_buf); |
298 | 15.6M | } Unexecuted instantiation: jcdiffct-8.c:compress_first_pass Unexecuted instantiation: jcdiffct-12.c:compress_first_pass jcdiffct-16.c:compress_first_pass Line | Count | Source | 257 | 15.6M | { | 258 | 15.6M | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; | 259 | 15.6M | JDIMENSION last_iMCU_row = cinfo->total_iMCU_rows - 1; | 260 | 15.6M | JDIMENSION samps_across; | 261 | 15.6M | int ci, samp_row, samp_rows; | 262 | 15.6M | _JSAMPARRAY buffer; | 263 | 15.6M | jpeg_component_info *compptr; | 264 | | | 265 | 60.3M | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; | 266 | 44.6M | ci++, compptr++) { | 267 | | /* Align the virtual buffer for this component. */ | 268 | 44.6M | buffer = (_JSAMPARRAY)(*cinfo->mem->access_virt_sarray) | 269 | 44.6M | ((j_common_ptr)cinfo, diff->whole_image[ci], | 270 | 44.6M | diff->iMCU_row_num * compptr->v_samp_factor, | 271 | 44.6M | (JDIMENSION)compptr->v_samp_factor, TRUE); | 272 | | | 273 | | /* Count non-dummy sample rows in this iMCU row. */ | 274 | 44.6M | if (diff->iMCU_row_num < last_iMCU_row) | 275 | 44.6M | samp_rows = compptr->v_samp_factor; | 276 | 13.3k | else { | 277 | | /* NB: can't use last_row_height here, since may not be set! */ | 278 | 13.3k | samp_rows = (int)(compptr->height_in_blocks % compptr->v_samp_factor); | 279 | 13.3k | if (samp_rows == 0) samp_rows = compptr->v_samp_factor; | 280 | 13.3k | } | 281 | 44.6M | samps_across = compptr->width_in_blocks; | 282 | | | 283 | | /* Perform point transform scaling and prediction/differencing for all | 284 | | * non-dummy rows in this iMCU row. Each call on these functions | 285 | | * processes a complete row of samples. | 286 | | */ | 287 | 89.3M | for (samp_row = 0; samp_row < samp_rows; samp_row++) { | 288 | 44.6M | memcpy(buffer[samp_row], input_buf[ci][samp_row], | 289 | 44.6M | samps_across * sizeof(_JSAMPLE)); | 290 | 44.6M | } | 291 | 44.6M | } | 292 | | /* NB: compress_output will increment iMCU_row_num if successful. | 293 | | * A suspension return will result in redoing all the work above next time. | 294 | | */ | 295 | | | 296 | | /* Emit data to the compressor, sharing code with subsequent passes */ | 297 | 15.6M | return compress_output(cinfo, input_buf); | 298 | 15.6M | } |
|
299 | | |
300 | | |
301 | | /* |
302 | | * Process some data in subsequent passes of a multi-pass case. |
303 | | * We process the equivalent of one fully interleaved MCU row ("iMCU" row) |
304 | | * per call, ie, v_samp_factor rows for each component in the scan. |
305 | | * The data is obtained from the virtual arrays and fed to the compressor. |
306 | | * Returns TRUE if the iMCU row is completed, FALSE if suspended. |
307 | | * |
308 | | * NB: input_buf is ignored; it is likely to be a NULL pointer. |
309 | | */ |
310 | | |
311 | | METHODDEF(boolean) |
312 | | compress_output(j_compress_ptr cinfo, _JSAMPIMAGE input_buf) |
313 | 31.2M | { |
314 | 31.2M | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; |
315 | 31.2M | int ci, compi; |
316 | 31.2M | _JSAMPARRAY buffer[MAX_COMPS_IN_SCAN]; |
317 | 31.2M | jpeg_component_info *compptr; |
318 | | |
319 | | /* Align the virtual buffers for the components used in this scan. |
320 | | * NB: during first pass, this is safe only because the buffers will |
321 | | * already be aligned properly, so jmemmgr.c won't need to do any I/O. |
322 | | */ |
323 | 120M | for (ci = 0; ci < cinfo->comps_in_scan; ci++) { |
324 | 89.3M | compptr = cinfo->cur_comp_info[ci]; |
325 | 89.3M | compi = compptr->component_index; |
326 | 89.3M | buffer[compi] = (_JSAMPARRAY)(*cinfo->mem->access_virt_sarray) |
327 | 89.3M | ((j_common_ptr)cinfo, diff->whole_image[compi], |
328 | 89.3M | diff->iMCU_row_num * compptr->v_samp_factor, |
329 | 89.3M | (JDIMENSION)compptr->v_samp_factor, FALSE); |
330 | 89.3M | } |
331 | | |
332 | 31.2M | return compress_data(cinfo, buffer); |
333 | 31.2M | } Unexecuted instantiation: jcdiffct-8.c:compress_output Unexecuted instantiation: jcdiffct-12.c:compress_output jcdiffct-16.c:compress_output Line | Count | Source | 313 | 31.2M | { | 314 | 31.2M | my_diff_ptr diff = (my_diff_ptr)cinfo->coef; | 315 | 31.2M | int ci, compi; | 316 | 31.2M | _JSAMPARRAY buffer[MAX_COMPS_IN_SCAN]; | 317 | 31.2M | jpeg_component_info *compptr; | 318 | | | 319 | | /* Align the virtual buffers for the components used in this scan. | 320 | | * NB: during first pass, this is safe only because the buffers will | 321 | | * already be aligned properly, so jmemmgr.c won't need to do any I/O. | 322 | | */ | 323 | 120M | for (ci = 0; ci < cinfo->comps_in_scan; ci++) { | 324 | 89.3M | compptr = cinfo->cur_comp_info[ci]; | 325 | 89.3M | compi = compptr->component_index; | 326 | 89.3M | buffer[compi] = (_JSAMPARRAY)(*cinfo->mem->access_virt_sarray) | 327 | 89.3M | ((j_common_ptr)cinfo, diff->whole_image[compi], | 328 | 89.3M | diff->iMCU_row_num * compptr->v_samp_factor, | 329 | 89.3M | (JDIMENSION)compptr->v_samp_factor, FALSE); | 330 | 89.3M | } | 331 | | | 332 | 31.2M | return compress_data(cinfo, buffer); | 333 | 31.2M | } |
|
334 | | |
335 | | #endif /* FULL_SAMP_BUFFER_SUPPORTED */ |
336 | | |
337 | | |
338 | | /* |
339 | | * Initialize difference buffer controller. |
340 | | */ |
341 | | |
342 | | GLOBAL(void) |
343 | | _jinit_c_diff_controller(j_compress_ptr cinfo, boolean need_full_buffer) |
344 | 4.63k | { |
345 | 4.63k | my_diff_ptr diff; |
346 | 4.63k | int ci, row; |
347 | 4.63k | jpeg_component_info *compptr; |
348 | | |
349 | | #if BITS_IN_JSAMPLE == 8 |
350 | 0 | if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2) |
351 | | #else |
352 | 4.63k | if (cinfo->data_precision > BITS_IN_JSAMPLE || |
353 | 4.63k | cinfo->data_precision < BITS_IN_JSAMPLE - 3) |
354 | 0 | #endif |
355 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); |
356 | | |
357 | 4.63k | diff = (my_diff_ptr) |
358 | 4.63k | (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE, |
359 | 4.63k | sizeof(my_diff_controller)); |
360 | 4.63k | cinfo->coef = (struct jpeg_c_coef_controller *)diff; |
361 | 4.63k | diff->pub.start_pass = start_pass_diff; |
362 | | |
363 | | /* Create the prediction row buffers. */ |
364 | 18.0k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; |
365 | 13.3k | ci++, compptr++) { |
366 | 13.3k | diff->cur_row[ci] = *(_JSAMPARRAY)(*cinfo->mem->alloc_sarray) |
367 | 13.3k | ((j_common_ptr)cinfo, JPOOL_IMAGE, |
368 | 13.3k | (JDIMENSION)jround_up((long)compptr->width_in_blocks, |
369 | 13.3k | (long)compptr->h_samp_factor), |
370 | 13.3k | (JDIMENSION)1); |
371 | 13.3k | diff->prev_row[ci] = *(_JSAMPARRAY)(*cinfo->mem->alloc_sarray) |
372 | 13.3k | ((j_common_ptr)cinfo, JPOOL_IMAGE, |
373 | 13.3k | (JDIMENSION)jround_up((long)compptr->width_in_blocks, |
374 | 13.3k | (long)compptr->h_samp_factor), |
375 | 13.3k | (JDIMENSION)1); |
376 | 13.3k | } |
377 | | |
378 | | /* Create the difference buffer. */ |
379 | 18.0k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; |
380 | 13.3k | ci++, compptr++) { |
381 | 13.3k | diff->diff_buf[ci] = |
382 | 13.3k | ALLOC_DARRAY(JPOOL_IMAGE, |
383 | 13.3k | (JDIMENSION)jround_up((long)compptr->width_in_blocks, |
384 | 13.3k | (long)compptr->h_samp_factor), |
385 | 13.3k | (JDIMENSION)compptr->v_samp_factor); |
386 | | /* Prefill difference rows with zeros. We do this because only actual |
387 | | * data is placed in the buffers during prediction/differencing, leaving |
388 | | * any dummy differences at the right edge as zeros, which will encode |
389 | | * to the smallest amount of data. |
390 | | */ |
391 | 26.7k | for (row = 0; row < compptr->v_samp_factor; row++) |
392 | 13.3k | memset(diff->diff_buf[ci][row], 0, |
393 | 13.3k | jround_up((long)compptr->width_in_blocks, |
394 | 13.3k | (long)compptr->h_samp_factor) * sizeof(JDIFF)); |
395 | 13.3k | } |
396 | | |
397 | | /* Create the sample buffer. */ |
398 | 4.63k | if (need_full_buffer) { |
399 | 4.63k | #ifdef FULL_SAMP_BUFFER_SUPPORTED |
400 | | /* Allocate a full-image virtual array for each component, */ |
401 | | /* padded to a multiple of samp_factor differences in each direction. */ |
402 | 18.0k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; |
403 | 13.3k | ci++, compptr++) { |
404 | 13.3k | diff->whole_image[ci] = (*cinfo->mem->request_virt_sarray) |
405 | 13.3k | ((j_common_ptr)cinfo, JPOOL_IMAGE, FALSE, |
406 | 13.3k | (JDIMENSION)jround_up((long)compptr->width_in_blocks, |
407 | 13.3k | (long)compptr->h_samp_factor), |
408 | 13.3k | (JDIMENSION)jround_up((long)compptr->height_in_blocks, |
409 | 13.3k | (long)compptr->v_samp_factor), |
410 | 13.3k | (JDIMENSION)compptr->v_samp_factor); |
411 | 13.3k | } |
412 | | #else |
413 | | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); |
414 | | #endif |
415 | 4.63k | } else |
416 | 0 | diff->whole_image[0] = NULL; /* flag for no virtual arrays */ |
417 | 4.63k | } Unexecuted instantiation: jinit_c_diff_controller Unexecuted instantiation: j12init_c_diff_controller j16init_c_diff_controller Line | Count | Source | 344 | 4.63k | { | 345 | 4.63k | my_diff_ptr diff; | 346 | 4.63k | int ci, row; | 347 | 4.63k | jpeg_component_info *compptr; | 348 | | | 349 | | #if BITS_IN_JSAMPLE == 8 | 350 | | if (cinfo->data_precision > BITS_IN_JSAMPLE || cinfo->data_precision < 2) | 351 | | #else | 352 | 4.63k | if (cinfo->data_precision > BITS_IN_JSAMPLE || | 353 | 4.63k | cinfo->data_precision < BITS_IN_JSAMPLE - 3) | 354 | 0 | #endif | 355 | 0 | ERREXIT1(cinfo, JERR_BAD_PRECISION, cinfo->data_precision); | 356 | | | 357 | 4.63k | diff = (my_diff_ptr) | 358 | 4.63k | (*cinfo->mem->alloc_small) ((j_common_ptr)cinfo, JPOOL_IMAGE, | 359 | 4.63k | sizeof(my_diff_controller)); | 360 | 4.63k | cinfo->coef = (struct jpeg_c_coef_controller *)diff; | 361 | 4.63k | diff->pub.start_pass = start_pass_diff; | 362 | | | 363 | | /* Create the prediction row buffers. */ | 364 | 18.0k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; | 365 | 13.3k | ci++, compptr++) { | 366 | 13.3k | diff->cur_row[ci] = *(_JSAMPARRAY)(*cinfo->mem->alloc_sarray) | 367 | 13.3k | ((j_common_ptr)cinfo, JPOOL_IMAGE, | 368 | 13.3k | (JDIMENSION)jround_up((long)compptr->width_in_blocks, | 369 | 13.3k | (long)compptr->h_samp_factor), | 370 | 13.3k | (JDIMENSION)1); | 371 | 13.3k | diff->prev_row[ci] = *(_JSAMPARRAY)(*cinfo->mem->alloc_sarray) | 372 | 13.3k | ((j_common_ptr)cinfo, JPOOL_IMAGE, | 373 | 13.3k | (JDIMENSION)jround_up((long)compptr->width_in_blocks, | 374 | 13.3k | (long)compptr->h_samp_factor), | 375 | 13.3k | (JDIMENSION)1); | 376 | 13.3k | } | 377 | | | 378 | | /* Create the difference buffer. */ | 379 | 18.0k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; | 380 | 13.3k | ci++, compptr++) { | 381 | 13.3k | diff->diff_buf[ci] = | 382 | 13.3k | ALLOC_DARRAY(JPOOL_IMAGE, | 383 | 13.3k | (JDIMENSION)jround_up((long)compptr->width_in_blocks, | 384 | 13.3k | (long)compptr->h_samp_factor), | 385 | 13.3k | (JDIMENSION)compptr->v_samp_factor); | 386 | | /* Prefill difference rows with zeros. We do this because only actual | 387 | | * data is placed in the buffers during prediction/differencing, leaving | 388 | | * any dummy differences at the right edge as zeros, which will encode | 389 | | * to the smallest amount of data. | 390 | | */ | 391 | 26.7k | for (row = 0; row < compptr->v_samp_factor; row++) | 392 | 13.3k | memset(diff->diff_buf[ci][row], 0, | 393 | 13.3k | jround_up((long)compptr->width_in_blocks, | 394 | 13.3k | (long)compptr->h_samp_factor) * sizeof(JDIFF)); | 395 | 13.3k | } | 396 | | | 397 | | /* Create the sample buffer. */ | 398 | 4.63k | if (need_full_buffer) { | 399 | 4.63k | #ifdef FULL_SAMP_BUFFER_SUPPORTED | 400 | | /* Allocate a full-image virtual array for each component, */ | 401 | | /* padded to a multiple of samp_factor differences in each direction. */ | 402 | 18.0k | for (ci = 0, compptr = cinfo->comp_info; ci < cinfo->num_components; | 403 | 13.3k | ci++, compptr++) { | 404 | 13.3k | diff->whole_image[ci] = (*cinfo->mem->request_virt_sarray) | 405 | 13.3k | ((j_common_ptr)cinfo, JPOOL_IMAGE, FALSE, | 406 | 13.3k | (JDIMENSION)jround_up((long)compptr->width_in_blocks, | 407 | 13.3k | (long)compptr->h_samp_factor), | 408 | 13.3k | (JDIMENSION)jround_up((long)compptr->height_in_blocks, | 409 | 13.3k | (long)compptr->v_samp_factor), | 410 | 13.3k | (JDIMENSION)compptr->v_samp_factor); | 411 | 13.3k | } | 412 | | #else | 413 | | ERREXIT(cinfo, JERR_BAD_BUFFER_MODE); | 414 | | #endif | 415 | 4.63k | } else | 416 | 0 | diff->whole_image[0] = NULL; /* flag for no virtual arrays */ | 417 | 4.63k | } |
|
418 | | |
419 | | #endif /* C_LOSSLESS_SUPPORTED */ |