OpenJPH
Open-source implementation of JPEG2000 Part-15
Loading...
Searching...
No Matches
ojph_subband.cpp
Go to the documentation of this file.
1
2//***************************************************************************/
3// This software is released under the 2-Clause BSD license, included
4// below.
5//
6// Copyright (c) 2019, Aous Naman
7// Copyright (c) 2019, Kakadu Software Pty Ltd, Australia
8// Copyright (c) 2019, The University of New South Wales, Australia
9//
10// Redistribution and use in source and binary forms, with or without
11// modification, are permitted provided that the following conditions are
12// met:
13//
14// 1. Redistributions of source code must retain the above copyright
15// notice, this list of conditions and the following disclaimer.
16//
17// 2. Redistributions in binary form must reproduce the above copyright
18// notice, this list of conditions and the following disclaimer in the
19// documentation and/or other materials provided with the distribution.
20//
21// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
22// IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
23// TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
24// PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
27// TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
28// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
29// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
30// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
31// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32//***************************************************************************/
33// This file is part of the OpenJPH software implementation.
34// File: ojph_subband.cpp
35// Author: Aous Naman
36// Date: 28 August 2019
37//***************************************************************************/
38
39
40#include <climits>
41#include <cmath>
42
43#include "ojph_mem.h"
44#include "ojph_params.h"
46#include "ojph_subband.h"
47#include "ojph_resolution.h"
48#include "ojph_codeblock.h"
49#include "ojph_precinct.h"
50
51namespace ojph {
52
53 namespace local
54 {
55
58 ui32 comp_num, ui32 res_num, ui32 transform_flags)
59 {
61
62 bool empty = ((band_rect.siz.w == 0) || (band_rect.siz.h == 0));
63 if (empty)
64 return;
65
66 const param_cod* cdp = codestream->get_coc(comp_num);
67 size log_cb = cdp->get_log_block_dims();
69
70 ui32 x_off = ((transform_flags & resolution::HORZ_TRX) ? 1 : 0);
71 ui32 y_off = ((transform_flags & resolution::VERT_TRX) ? 1 : 0);
72
73 ui32 xcb_prime = ojph_min(log_cb.w, log_PP.w - x_off);
74 ui32 ycb_prime = ojph_min(log_cb.h, log_PP.h - y_off);
75
76 size nominal(1 << xcb_prime, 1 << ycb_prime);
77
78 ui32 tbx0 = band_rect.org.x;
79 ui32 tby0 = band_rect.org.y;
80 ui32 tbx1 = band_rect.org.x + band_rect.siz.w;
81 ui32 tby1 = band_rect.org.y + band_rect.siz.h;
82
84 num_blocks.w = (tbx1 + (1 << xcb_prime) - 1) >> xcb_prime;
85 num_blocks.w -= tbx0 >> xcb_prime;
86 num_blocks.h = (tby1 + (1 << ycb_prime) - 1) >> ycb_prime;
87 num_blocks.h -= tby0 >> ycb_prime;
88
90 //allocate codeblock headers
91 allocator->pre_alloc_obj<coded_cb_header>((size_t)num_blocks.area());
92
93 const param_qcd* qp = codestream->access_qcd()->get_qcc(comp_num);
94 ui32 precision = qp->propose_precision(cdp);
95 const param_atk* atk = cdp->access_atk();
96 bool reversible = atk->is_reversible();
97
98 for (ui32 i = 0; i < num_blocks.w; ++i)
99 codeblock::pre_alloc(codestream, nominal, precision);
100
101 //allocate lines
102 allocator->pre_alloc_obj<line_buf>(1);
103 //allocate line_buf
104 ui32 width = band_rect.siz.w + 1;
105 if (reversible)
106 {
107 if (precision <= 32)
108 allocator->pre_alloc_data<si32>(width, 1);
109 else
110 allocator->pre_alloc_data<si64>(width, 1);
111 }
112 else
113 allocator->pre_alloc_data<float>(width, 1);
114 }
115
118 const rect &band_rect,
119 resolution* res, ui32 res_num,
120 ui32 subband_num)
121 {
124
125 this->res_num = res_num;
126 this->band_num = subband_num;
127 this->band_rect = band_rect;
128 this->parent = res;
129
131 this->reversible = cdp->access_atk()->is_reversible();
132 size log_cb = cdp->get_log_block_dims();
134
135 ui32 x_off = ((parent->has_horz_transform()) ? 1 : 0);
136 ui32 y_off = ((parent->has_vert_transform()) ? 1 : 0);
137
138 xcb_prime = ojph_min(log_cb.w, log_PP.w - x_off);
139 ycb_prime = ojph_min(log_cb.h, log_PP.h - y_off);
140
141 size nominal(1 << xcb_prime, 1 << ycb_prime);
142
143 cur_cb_row = 0;
144 cur_line = 0;
145 cur_cb_height = 0;
146 const param_dfs* dfs = NULL;
147 if (cdp->is_dfs_defined()) {
148 dfs = codestream->access_dfs();
149 if (dfs != NULL)
150 dfs = dfs->get_dfs(cdp->get_dfs_index());
151 }
152 ui32 comp_num = parent->get_comp_num();
153 const param_qcd* qcd = codestream->access_qcd()->get_qcc(comp_num);
154 ui32 num_decomps = cdp->get_num_decompositions();
155 this->K_max = qcd->get_Kmax(dfs, num_decomps, this->res_num, band_num);
156 if (!reversible)
157 {
158 float d =
159 qcd->get_irrev_delta(dfs, num_decomps, res_num, subband_num);
160 d /= (float)(1u << (31 - this->K_max));
161 delta = d;
162 delta_inv = (1.0f/d);
163 }
164 ui32 precision = qcd->propose_precision(cdp);
165
166 this->empty = ((band_rect.siz.w == 0) || (band_rect.siz.h == 0));
167 if (this->empty)
168 return;
169
170 ui32 tbx0 = band_rect.org.x;
171 ui32 tby0 = band_rect.org.y;
172 ui32 tbx1 = band_rect.org.x + band_rect.siz.w;
173 ui32 tby1 = band_rect.org.y + band_rect.siz.h;
174
175 num_blocks = size();
176 num_blocks.w = (tbx1 + (1 << xcb_prime) - 1) >> xcb_prime;
177 num_blocks.w -= tbx0 >> xcb_prime;
178 num_blocks.h = (tby1 + (1 << ycb_prime) - 1) >> ycb_prime;
179 num_blocks.h -= tby0 >> ycb_prime;
180
182 //allocate codeblock headers
184 allocator->post_alloc_obj<coded_cb_header>((size_t)num_blocks.area());
185 memset(coded_cbs, 0, sizeof(coded_cb_header) * (size_t)num_blocks.area());
186 for (int i = (int)num_blocks.area(); i > 0; --i, ++cp)
187 cp->Kmax = K_max;
188
189 ui32 x_lower_bound = (tbx0 >> xcb_prime) << xcb_prime;
190 ui32 y_lower_bound = (tby0 >> ycb_prime) << ycb_prime;
191
192 size cb_size;
193 cb_size.h = ojph_min(tby1, y_lower_bound + nominal.h) - tby0;
194 cur_cb_height = (si32)cb_size.h;
195 int line_offset = 0;
196 for (ui32 i = 0; i < num_blocks.w; ++i)
197 {
198 ui32 cbx0 = ojph_max(tbx0, x_lower_bound + i * nominal.w);
199 ui32 cbx1 = ojph_min(tbx1, x_lower_bound + (i + 1) * nominal.w);
200 cb_size.w = cbx1 - cbx0;
201 blocks[i].finalize_alloc(codestream, this, nominal, cb_size,
202 coded_cbs + i, K_max, line_offset,
203 precision, comp_num);
204 line_offset += cb_size.w;
205 }
206
207 //allocate lines
208 lines = allocator->post_alloc_obj<line_buf>(1);
209 //allocate line_buf
210 ui32 width = band_rect.siz.w + 1;
211 if (reversible)
212 {
213 if (precision <= 32)
214 lines->wrap(allocator->post_alloc_data<si32>(width, 1), width, 1);
215 else
216 lines->wrap(allocator->post_alloc_data<si64>(width, 1), width, 1);
217 }
218 else
219 lines->wrap(allocator->post_alloc_data<float>(width, 1), width, 1);
220 }
221
223 void subband::get_cb_indices(const size& num_precincts,
224 precinct *precincts)
225 {
226 if (empty)
227 return;
228
229 rect res_rect = parent->get_rect();
230 ui32 trx0 = res_rect.org.x;
231 ui32 try0 = res_rect.org.y;
232 ui32 trx1 = res_rect.org.x + res_rect.siz.w;
233 ui32 try1 = res_rect.org.y + res_rect.siz.h;
234
235 ui32 pc_lft = (res_rect.org.x >> log_PP.w) << log_PP.w;
236 ui32 pc_top = (res_rect.org.y >> log_PP.h) << log_PP.h;
237
238 ui32 pcx0, pcx1, pcy0, pcy1;
239 ui32 x_shift = parent->has_horz_transform() ? 1 : 0;
240 ui32 y_shift = parent->has_vert_transform() ? 1 : 0;
241 ui32 yb, xb, coly = 0, colx = 0;
242 for (ui32 y = 0; y < num_precincts.h; ++y)
243 {
244 pcy0 = ojph_max(try0, pc_top + (y << log_PP.h));
245 pcy1 = ojph_min(try1, pc_top + ((y + 1) << log_PP.h));
246 pcy0 = (pcy0 - (band_num >> 1) + (1 << y_shift) - 1) >> y_shift;
247 pcy1 = (pcy1 - (band_num >> 1) + (1 << y_shift) - 1) >> y_shift;
248
249 precinct *p = precincts + y * num_precincts.w;
250 yb = ((pcy1 + (1<<ycb_prime) - 1) >> ycb_prime);
251 yb -= (pcy0 >> ycb_prime);
252 colx = 0;
253
254 for (ui32 x = 0; x < num_precincts.w; ++x, ++p)
255 {
256 pcx0 = ojph_max(trx0, pc_lft + (x << log_PP.w));
257 pcx1 = ojph_min(trx1, pc_lft + ((x + 1) << log_PP.w));
258 pcx0 = (pcx0 - (band_num & 1) + (1 << x_shift) - 1) >> x_shift;
259 pcx1 = (pcx1 - (band_num & 1) + (1 << x_shift) - 1) >> x_shift;
260
261 rect *bp = p->cb_idxs + band_num;
262 xb = ((pcx1 + (1<<xcb_prime) - 1) >> xcb_prime);
263 xb -= (pcx0 >> xcb_prime);
264
265 bp->org.x = colx;
266 bp->org.y = coly;
267 bp->siz.w = xb;
268 bp->siz.h = yb;
269
270 colx += xb;
271 }
272 coly += yb;
273 }
274 assert(colx == num_blocks.w && coly == num_blocks.h);
275 }
276
279 {
280 if (empty)
281 return;
282
283 assert(l->pre_size == lines[0].pre_size && l->size == lines[0].size &&
284 l->flags == lines[0].flags);
285 void* p = lines[0].p;
286 lines[0].p = l->p;
287 l->p = p;
288 }
289
292 {
293 if (empty)
294 return;
295
296 //push to codeblocks
297 for (ui32 i = 0; i < num_blocks.w; ++i)
298 blocks[i].push(lines + 0);
299 if (++cur_line >= cur_cb_height)
300 {
301 for (ui32 i = 0; i < num_blocks.w; ++i)
302 blocks[i].encode(elastic);
303
304 if (++cur_cb_row < num_blocks.h)
305 {
306 cur_line = 0;
307
308 ui32 tbx0 = band_rect.org.x;
309 ui32 tby0 = band_rect.org.y;
310 ui32 tbx1 = band_rect.org.x + band_rect.siz.w;
311 ui32 tby1 = band_rect.org.y + band_rect.siz.h;
312 size nominal(1 << xcb_prime, 1 << ycb_prime);
313
314 ui32 x_lower_bound = (tbx0 >> xcb_prime) << xcb_prime;
315 ui32 y_lower_bound = (tby0 >> ycb_prime) << ycb_prime;
316 ui32 cby0 = y_lower_bound + cur_cb_row * nominal.h;
317 ui32 cby1 = ojph_min(tby1, cby0 + nominal.h);
318
319 size cb_size;
320 cb_size.h = cby1 - ojph_max(tby0, cby0);
321 cur_cb_height = (int)cb_size.h;
322 for (ui32 i = 0; i < num_blocks.w; ++i)
323 {
324 ui32 cbx0 = ojph_max(tbx0, x_lower_bound + i * nominal.w);
325 ui32 cbx1 = ojph_min(tbx1, x_lower_bound + (i + 1) * nominal.w);
326 cb_size.w = cbx1 - cbx0;
327 blocks[i].recreate(cb_size,
329 }
330 }
331 }
332 }
333
336 {
337 if (empty)
338 return lines;
339
340 //pull from codeblocks
341 if (--cur_line <= 0)
342 {
343 if (cur_cb_row < num_blocks.h)
344 {
345 ui32 tbx0 = band_rect.org.x;
346 ui32 tby0 = band_rect.org.y;
347 ui32 tbx1 = band_rect.org.x + band_rect.siz.w;
348 ui32 tby1 = band_rect.org.y + band_rect.siz.h;
349 size nominal(1 << xcb_prime, 1 << ycb_prime);
350
351 ui32 x_lower_bound = (tbx0 >> xcb_prime) << xcb_prime;
352 ui32 y_lower_bound = (tby0 >> ycb_prime) << ycb_prime;
353 ui32 cby0 = ojph_max(tby0, y_lower_bound + cur_cb_row * nominal.h);
354 ui32 cby1 = ojph_min(tby1, y_lower_bound+(cur_cb_row+1)*nominal.h);
355
356 size cb_size;
357 cb_size.h = cby1 - cby0;
358 cur_line = cur_cb_height = (int)cb_size.h;
359 for (ui32 i = 0; i < num_blocks.w; ++i)
360 {
361 ui32 cbx0 = ojph_max(tbx0, x_lower_bound + i * nominal.w);
362 ui32 cbx1 = ojph_min(tbx1, x_lower_bound + (i + 1) * nominal.w);
363 cb_size.w = cbx1 - cbx0;
364 blocks[i].recreate(cb_size,
366 blocks[i].decode();
367 }
368 ++cur_cb_row;
369 }
370 }
371
372 assert(cur_line >= 0);
373
374 //pull from codeblocks
375 for (ui32 i = 0; i < num_blocks.w; ++i)
376 blocks[i].pull_line(lines + 0);
377
378 return lines;
379 }
380
381 }
382}
void wrap(T *buffer, size_t num_ele, ui32 pre_size)
void finalize_alloc(codestream *codestream, subband *parent, const size &nominal, const size &cb_size, coded_cb_header *coded_cb, ui32 K_max, int tbx0, ui32 precision, ui32 comp_idx)
static void pre_alloc(codestream *codestream, const size &nominal, ui32 precision)
void recreate(const size &cb_size, coded_cb_header *coded_cb)
const param_cod * get_coc(ui32 comp_num)
mem_elastic_allocator * get_elastic_alloc()
const param_qcd * access_qcd()
mem_fixed_allocator * get_allocator()
const param_dfs * access_dfs()
static void pre_alloc(codestream *codestream, const rect &band_rect, ui32 comp_num, ui32 res_num, ui32 transform_flags)
void exchange_buf(line_buf *l)
coded_cb_header * coded_cbs
void get_cb_indices(const size &num_precincts, precinct *precincts)
mem_elastic_allocator * elastic
void finalize_alloc(codestream *codestream, const rect &band_rect, resolution *res, ui32 res_num, ui32 subband_num)
void pre_alloc_data(size_t num_ele, ui32 pre_size)
Definition ojph_mem.h:66
void pre_alloc_obj(size_t num_ele)
Definition ojph_mem.h:72
T * post_alloc_data(size_t num_ele, ui32 pre_size)
Definition ojph_mem.h:89
T * post_alloc_obj(size_t num_ele)
Definition ojph_mem.h:96
int64_t si64
Definition ojph_defs.h:57
int32_t si32
Definition ojph_defs.h:55
uint32_t ui32
Definition ojph_defs.h:54
#define ojph_max(a, b)
Definition ojph_defs.h:73
#define ojph_min(a, b)
Definition ojph_defs.h:76
const param_atk * access_atk() const
size get_log_precinct_size(ui32 res_num) const
const param_dfs * get_dfs(int index) const
float get_irrev_delta(const param_dfs *dfs, ui32 num_decompositions, ui32 resolution, ui32 subband) const
ui32 propose_precision(const param_cod *cod) const
ui32 get_Kmax(const param_dfs *dfs, ui32 num_decompositions, ui32 resolution, ui32 subband) const
param_qcd * get_qcc(ui32 comp_idx)
point org
Definition ojph_base.h:66
ui64 area() const
Definition ojph_base.h:53