2 * The copyright in this software is being made available under the 2-clauses
3 * BSD License, included below. This software may be subject to other third
4 * party and contributor rights, including patent rights, and no such rights
5 * are granted under this license.
7 * Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
8 * Copyright (c) 2002-2014, Professor Benoit Macq
9 * Copyright (c) 2001-2003, David Janssens
10 * Copyright (c) 2002-2003, Yannick Verschueren
11 * Copyright (c) 2003-2007, Francois-Olivier Devaux
12 * Copyright (c) 2003-2014, Antonin Descampe
13 * Copyright (c) 2005, Herve Drolon, FreeImage Team
14 * Copyright (c) 2006-2007, Parvatha Elangovan
15 * All rights reserved.
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions
20 * 1. Redistributions of source code must retain the above copyright
21 * notice, this list of conditions and the following disclaimer.
22 * 2. Redistributions in binary form must reproduce the above copyright
23 * notice, this list of conditions and the following disclaimer in the
24 * documentation and/or other materials provided with the distribution.
26 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
27 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
30 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 * POSSIBILITY OF SUCH DAMAGE.
39 #include "opj_includes.h"
41 /** @defgroup PI PI - Implementation of a packet iterator */
44 /** @name Local static functions */
48 Get next packet in layer-resolution-component-precinct order.
49 @param pi packet iterator to modify
50 @return returns false if pi pointed to the last packet or else returns true
52 static opj_bool pi_next_lrcp(opj_pi_iterator_t * pi);
54 Get next packet in resolution-layer-component-precinct order.
55 @param pi packet iterator to modify
56 @return returns false if pi pointed to the last packet or else returns true
58 static opj_bool pi_next_rlcp(opj_pi_iterator_t * pi);
60 Get next packet in resolution-precinct-component-layer order.
61 @param pi packet iterator to modify
62 @return returns false if pi pointed to the last packet or else returns true
64 static opj_bool pi_next_rpcl(opj_pi_iterator_t * pi);
66 Get next packet in precinct-component-resolution-layer order.
67 @param pi packet iterator to modify
68 @return returns false if pi pointed to the last packet or else returns true
70 static opj_bool pi_next_pcrl(opj_pi_iterator_t * pi);
72 Get next packet in component-precinct-resolution-layer order.
73 @param pi packet iterator to modify
74 @return returns false if pi pointed to the last packet or else returns true
76 static opj_bool pi_next_cprl(opj_pi_iterator_t * pi);
83 ==========================================================
85 ==========================================================
88 static opj_bool pi_next_lrcp(opj_pi_iterator_t * pi)
90 opj_pi_comp_t *comp = NULL;
91 opj_pi_resolution_t *res = NULL;
95 comp = &pi->comps[pi->compno];
96 res = &comp->resolutions[pi->resno];
102 for (pi->layno = pi->poc.layno0; pi->layno < pi->poc.layno1; pi->layno++) {
103 for (pi->resno = pi->poc.resno0; pi->resno < pi->poc.resno1;
105 for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
106 comp = &pi->comps[pi->compno];
107 if (pi->resno >= comp->numresolutions) {
110 res = &comp->resolutions[pi->resno];
112 pi->poc.precno1 = res->pw * res->ph;
114 for (pi->precno = pi->poc.precno0; pi->precno < pi->poc.precno1; pi->precno++) {
115 index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
116 pi->step_c + pi->precno * pi->step_p;
117 if (!pi->include[index]) {
118 pi->include[index] = 1;
131 static opj_bool pi_next_rlcp(opj_pi_iterator_t * pi)
133 opj_pi_comp_t *comp = NULL;
134 opj_pi_resolution_t *res = NULL;
138 comp = &pi->comps[pi->compno];
139 res = &comp->resolutions[pi->resno];
145 for (pi->resno = pi->poc.resno0; pi->resno < pi->poc.resno1; pi->resno++) {
146 for (pi->layno = pi->poc.layno0; pi->layno < pi->poc.layno1; pi->layno++) {
147 for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
148 comp = &pi->comps[pi->compno];
149 if (pi->resno >= comp->numresolutions) {
152 res = &comp->resolutions[pi->resno];
154 pi->poc.precno1 = res->pw * res->ph;
156 for (pi->precno = pi->poc.precno0; pi->precno < pi->poc.precno1; pi->precno++) {
157 index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
158 pi->step_c + pi->precno * pi->step_p;
159 if (!pi->include[index]) {
160 pi->include[index] = 1;
173 static opj_bool pi_next_rpcl(opj_pi_iterator_t * pi)
175 opj_pi_comp_t *comp = NULL;
176 opj_pi_resolution_t *res = NULL;
186 for (compno = 0; compno < pi->numcomps; compno++) {
187 comp = &pi->comps[compno];
188 for (resno = 0; resno < comp->numresolutions; resno++) {
190 res = &comp->resolutions[resno];
191 dx = comp->dx * (1 << (res->pdx + comp->numresolutions - 1 - resno));
192 dy = comp->dy * (1 << (res->pdy + comp->numresolutions - 1 - resno));
193 pi->dx = !pi->dx ? dx : int_min(pi->dx, dx);
194 pi->dy = !pi->dy ? dy : int_min(pi->dy, dy);
199 pi->poc.ty0 = pi->ty0;
200 pi->poc.tx0 = pi->tx0;
201 pi->poc.ty1 = pi->ty1;
202 pi->poc.tx1 = pi->tx1;
204 for (pi->resno = pi->poc.resno0; pi->resno < pi->poc.resno1; pi->resno++) {
205 for (pi->y = pi->poc.ty0; pi->y < pi->poc.ty1;
206 pi->y += pi->dy - (pi->y % pi->dy)) {
207 for (pi->x = pi->poc.tx0; pi->x < pi->poc.tx1;
208 pi->x += pi->dx - (pi->x % pi->dx)) {
209 for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
215 comp = &pi->comps[pi->compno];
216 if (pi->resno >= comp->numresolutions) {
219 res = &comp->resolutions[pi->resno];
220 levelno = comp->numresolutions - 1 - pi->resno;
221 trx0 = int_ceildiv(pi->tx0, comp->dx << levelno);
222 try0 = int_ceildiv(pi->ty0, comp->dy << levelno);
223 trx1 = int_ceildiv(pi->tx1, comp->dx << levelno);
224 try1 = int_ceildiv(pi->ty1, comp->dy << levelno);
225 rpx = res->pdx + levelno;
226 rpy = res->pdy + levelno;
228 /* To avoid divisions by zero / undefined behaviour on shift */
229 if (rpx >= 31 || ((comp->dx << rpx) >> rpx) != comp->dx ||
230 rpy >= 31 || ((comp->dy << rpy) >> rpy) != comp->dy) {
234 if (!((pi->y % (comp->dy << rpy) == 0) || ((pi->y == pi->ty0) &&
235 ((try0 << levelno) % (1 << rpy))))) {
238 if (!((pi->x % (comp->dx << rpx) == 0) || ((pi->x == pi->tx0) &&
239 ((trx0 << levelno) % (1 << rpx))))) {
243 if ((res->pw == 0) || (res->ph == 0)) {
247 if ((trx0 == trx1) || (try0 == try1)) {
251 prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelno), res->pdx)
252 - int_floordivpow2(trx0, res->pdx);
253 prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelno), res->pdy)
254 - int_floordivpow2(try0, res->pdy);
255 pi->precno = prci + prcj * res->pw;
256 for (pi->layno = pi->poc.layno0; pi->layno < pi->poc.layno1; pi->layno++) {
257 index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
258 pi->step_c + pi->precno * pi->step_p;
259 if (!pi->include[index]) {
260 pi->include[index] = 1;
274 static opj_bool pi_next_pcrl(opj_pi_iterator_t * pi)
276 opj_pi_comp_t *comp = NULL;
277 opj_pi_resolution_t *res = NULL;
281 comp = &pi->comps[pi->compno];
288 for (compno = 0; compno < pi->numcomps; compno++) {
289 comp = &pi->comps[compno];
290 for (resno = 0; resno < comp->numresolutions; resno++) {
292 res = &comp->resolutions[resno];
293 dx = comp->dx * (1 << (res->pdx + comp->numresolutions - 1 - resno));
294 dy = comp->dy * (1 << (res->pdy + comp->numresolutions - 1 - resno));
295 pi->dx = !pi->dx ? dx : int_min(pi->dx, dx);
296 pi->dy = !pi->dy ? dy : int_min(pi->dy, dy);
301 pi->poc.ty0 = pi->ty0;
302 pi->poc.tx0 = pi->tx0;
303 pi->poc.ty1 = pi->ty1;
304 pi->poc.tx1 = pi->tx1;
306 for (pi->y = pi->poc.ty0; pi->y < pi->poc.ty1;
307 pi->y += pi->dy - (pi->y % pi->dy)) {
308 for (pi->x = pi->poc.tx0; pi->x < pi->poc.tx1;
309 pi->x += pi->dx - (pi->x % pi->dx)) {
310 for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
311 comp = &pi->comps[pi->compno];
312 for (pi->resno = pi->poc.resno0;
313 pi->resno < int_min(pi->poc.resno1, comp->numresolutions); pi->resno++) {
319 res = &comp->resolutions[pi->resno];
320 levelno = comp->numresolutions - 1 - pi->resno;
321 trx0 = int_ceildiv(pi->tx0, comp->dx << levelno);
322 try0 = int_ceildiv(pi->ty0, comp->dy << levelno);
323 trx1 = int_ceildiv(pi->tx1, comp->dx << levelno);
324 try1 = int_ceildiv(pi->ty1, comp->dy << levelno);
325 rpx = res->pdx + levelno;
326 rpy = res->pdy + levelno;
328 /* To avoid divisions by zero / undefined behaviour on shift */
329 if (rpx >= 31 || ((comp->dx << rpx) >> rpx) != comp->dx ||
330 rpy >= 31 || ((comp->dy << rpy) >> rpy) != comp->dy) {
334 if (!((pi->y % (comp->dy << rpy) == 0) || ((pi->y == pi->ty0) &&
335 ((try0 << levelno) % (1 << rpy))))) {
338 if (!((pi->x % (comp->dx << rpx) == 0) || ((pi->x == pi->tx0) &&
339 ((trx0 << levelno) % (1 << rpx))))) {
343 if ((res->pw == 0) || (res->ph == 0)) {
347 if ((trx0 == trx1) || (try0 == try1)) {
351 prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelno), res->pdx)
352 - int_floordivpow2(trx0, res->pdx);
353 prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelno), res->pdy)
354 - int_floordivpow2(try0, res->pdy);
355 pi->precno = prci + prcj * res->pw;
356 for (pi->layno = pi->poc.layno0; pi->layno < pi->poc.layno1; pi->layno++) {
357 index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
358 pi->step_c + pi->precno * pi->step_p;
359 if (!pi->include[index]) {
360 pi->include[index] = 1;
374 static opj_bool pi_next_cprl(opj_pi_iterator_t * pi)
376 opj_pi_comp_t *comp = NULL;
377 opj_pi_resolution_t *res = NULL;
381 comp = &pi->comps[pi->compno];
387 for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
389 comp = &pi->comps[pi->compno];
392 for (resno = 0; resno < comp->numresolutions; resno++) {
394 res = &comp->resolutions[resno];
395 dx = comp->dx * (1 << (res->pdx + comp->numresolutions - 1 - resno));
396 dy = comp->dy * (1 << (res->pdy + comp->numresolutions - 1 - resno));
397 pi->dx = !pi->dx ? dx : int_min(pi->dx, dx);
398 pi->dy = !pi->dy ? dy : int_min(pi->dy, dy);
401 pi->poc.ty0 = pi->ty0;
402 pi->poc.tx0 = pi->tx0;
403 pi->poc.ty1 = pi->ty1;
404 pi->poc.tx1 = pi->tx1;
406 for (pi->y = pi->poc.ty0; pi->y < pi->poc.ty1;
407 pi->y += pi->dy - (pi->y % pi->dy)) {
408 for (pi->x = pi->poc.tx0; pi->x < pi->poc.tx1;
409 pi->x += pi->dx - (pi->x % pi->dx)) {
410 for (pi->resno = pi->poc.resno0;
411 pi->resno < int_min(pi->poc.resno1, comp->numresolutions); pi->resno++) {
417 res = &comp->resolutions[pi->resno];
418 levelno = comp->numresolutions - 1 - pi->resno;
419 trx0 = int_ceildiv(pi->tx0, comp->dx << levelno);
420 try0 = int_ceildiv(pi->ty0, comp->dy << levelno);
421 trx1 = int_ceildiv(pi->tx1, comp->dx << levelno);
422 try1 = int_ceildiv(pi->ty1, comp->dy << levelno);
423 rpx = res->pdx + levelno;
424 rpy = res->pdy + levelno;
426 /* To avoid divisions by zero / undefined behaviour on shift */
427 if (rpx >= 31 || ((comp->dx << rpx) >> rpx) != comp->dx ||
428 rpy >= 31 || ((comp->dy << rpy) >> rpy) != comp->dy) {
432 if (!((pi->y % (comp->dy << rpy) == 0) || ((pi->y == pi->ty0) &&
433 ((try0 << levelno) % (1 << rpy))))) {
436 if (!((pi->x % (comp->dx << rpx) == 0) || ((pi->x == pi->tx0) &&
437 ((trx0 << levelno) % (1 << rpx))))) {
441 if ((res->pw == 0) || (res->ph == 0)) {
445 if ((trx0 == trx1) || (try0 == try1)) {
449 prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelno), res->pdx)
450 - int_floordivpow2(trx0, res->pdx);
451 prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelno), res->pdy)
452 - int_floordivpow2(try0, res->pdy);
453 pi->precno = prci + prcj * res->pw;
454 for (pi->layno = pi->poc.layno0; pi->layno < pi->poc.layno1; pi->layno++) {
455 index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
456 pi->step_c + pi->precno * pi->step_p;
457 if (!pi->include[index]) {
458 pi->include[index] = 1;
473 ==========================================================
474 Packet iterator interface
475 ==========================================================
478 opj_pi_iterator_t *pi_create_decode(opj_image_t *image, opj_cp_t *cp,
482 int compno, resno, pino;
483 opj_pi_iterator_t *pi = NULL;
484 opj_tcp_t *tcp = NULL;
485 opj_tccp_t *tccp = NULL;
487 tcp = &cp->tcps[tileno];
489 pi = (opj_pi_iterator_t*) opj_calloc((tcp->numpocs + 1),
490 sizeof(opj_pi_iterator_t));
492 /* TODO: throw an error */
496 for (pino = 0; pino < tcp->numpocs + 1; pino++) { /* change */
502 pi[pino].tx0 = int_max(cp->tx0 + p * cp->tdx, image->x0);
503 pi[pino].ty0 = int_max(cp->ty0 + q * cp->tdy, image->y0);
504 pi[pino].tx1 = int_min(cp->tx0 + (p + 1) * cp->tdx, image->x1);
505 pi[pino].ty1 = int_min(cp->ty0 + (q + 1) * cp->tdy, image->y1);
506 pi[pino].numcomps = image->numcomps;
508 pi[pino].comps = (opj_pi_comp_t*) opj_calloc(image->numcomps,
509 sizeof(opj_pi_comp_t));
510 if (!pi[pino].comps) {
511 /* TODO: throw an error */
512 pi_destroy(pi, cp, tileno);
516 for (compno = 0; compno < pi->numcomps; compno++) {
517 int tcx0, tcy0, tcx1, tcy1;
518 opj_pi_comp_t *comp = &pi[pino].comps[compno];
519 tccp = &tcp->tccps[compno];
520 comp->dx = image->comps[compno].dx;
521 comp->dy = image->comps[compno].dy;
522 comp->numresolutions = tccp->numresolutions;
524 comp->resolutions = (opj_pi_resolution_t*) opj_calloc(comp->numresolutions,
525 sizeof(opj_pi_resolution_t));
526 if (!comp->resolutions) {
527 /* TODO: throw an error */
528 pi_destroy(pi, cp, tileno);
532 tcx0 = int_ceildiv(pi->tx0, comp->dx);
533 tcy0 = int_ceildiv(pi->ty0, comp->dy);
534 tcx1 = int_ceildiv(pi->tx1, comp->dx);
535 tcy1 = int_ceildiv(pi->ty1, comp->dy);
536 if (comp->numresolutions > maxres) {
537 maxres = comp->numresolutions;
540 for (resno = 0; resno < comp->numresolutions; resno++) {
542 int rx0, ry0, rx1, ry1;
543 int px0, py0, px1, py1;
544 opj_pi_resolution_t *res = &comp->resolutions[resno];
545 if (tccp->csty & J2K_CCP_CSTY_PRT) {
546 res->pdx = tccp->prcw[resno];
547 res->pdy = tccp->prch[resno];
552 levelno = comp->numresolutions - 1 - resno;
553 rx0 = int_ceildivpow2(tcx0, levelno);
554 ry0 = int_ceildivpow2(tcy0, levelno);
555 rx1 = int_ceildivpow2(tcx1, levelno);
556 ry1 = int_ceildivpow2(tcy1, levelno);
557 px0 = int_floordivpow2(rx0, res->pdx) << res->pdx;
558 py0 = int_floordivpow2(ry0, res->pdy) << res->pdy;
559 px1 = int_ceildivpow2(rx1, res->pdx) << res->pdx;
560 py1 = int_ceildivpow2(ry1, res->pdy) << res->pdy;
561 res->pw = (rx0 == rx1) ? 0 : ((px1 - px0) >> res->pdx);
562 res->ph = (ry0 == ry1) ? 0 : ((py1 - py0) >> res->pdy);
564 if (res->pw * res->ph > maxprec) {
565 maxprec = res->pw * res->ph;
571 tccp = &tcp->tccps[0];
573 pi[pino].step_c = maxprec * pi[pino].step_p;
574 pi[pino].step_r = image->numcomps * pi[pino].step_c;
575 pi[pino].step_l = maxres * pi[pino].step_r;
578 pi[pino].include = (short int*) opj_calloc(image->numcomps * maxres *
579 tcp->numlayers * maxprec, sizeof(short int));
580 if (!pi[pino].include) {
581 /* TODO: throw an error */
582 pi_destroy(pi, cp, tileno);
586 pi[pino].include = pi[pino - 1].include;
591 pi[pino].poc.resno0 = 0;
592 pi[pino].poc.compno0 = 0;
593 pi[pino].poc.layno1 = tcp->numlayers;
594 pi[pino].poc.resno1 = maxres;
595 pi[pino].poc.compno1 = image->numcomps;
596 pi[pino].poc.prg = tcp->prg;
599 pi[pino].poc.resno0 = tcp->pocs[pino].resno0;
600 pi[pino].poc.compno0 = tcp->pocs[pino].compno0;
601 pi[pino].poc.layno1 = tcp->pocs[pino].layno1;
602 pi[pino].poc.resno1 = tcp->pocs[pino].resno1;
603 pi[pino].poc.compno1 = tcp->pocs[pino].compno1;
604 pi[pino].poc.prg = tcp->pocs[pino].prg;
606 pi[pino].poc.layno0 = 0;
607 pi[pino].poc.precno0 = 0;
608 pi[pino].poc.precno1 = maxprec;
616 opj_pi_iterator_t *pi_initialise_encode(opj_image_t *image, opj_cp_t *cp,
617 int tileno, J2K_T2_MODE t2_mode)
623 opj_pi_iterator_t *pi = NULL;
624 opj_tcp_t *tcp = NULL;
625 opj_tccp_t *tccp = NULL;
627 tcp = &cp->tcps[tileno];
629 pi = (opj_pi_iterator_t*) opj_calloc((tcp->numpocs + 1),
630 sizeof(opj_pi_iterator_t));
634 pi->tp_on = cp->tp_on;
636 for (pino = 0; pino < tcp->numpocs + 1 ; pino ++) {
640 pi[pino].tx0 = int_max(cp->tx0 + p * cp->tdx, image->x0);
641 pi[pino].ty0 = int_max(cp->ty0 + q * cp->tdy, image->y0);
642 pi[pino].tx1 = int_min(cp->tx0 + (p + 1) * cp->tdx, image->x1);
643 pi[pino].ty1 = int_min(cp->ty0 + (q + 1) * cp->tdy, image->y1);
644 pi[pino].numcomps = image->numcomps;
646 pi[pino].comps = (opj_pi_comp_t*) opj_calloc(image->numcomps,
647 sizeof(opj_pi_comp_t));
648 if (!pi[pino].comps) {
649 pi_destroy(pi, cp, tileno);
653 for (compno = 0; compno < pi[pino].numcomps; compno++) {
654 int tcx0, tcy0, tcx1, tcy1;
655 opj_pi_comp_t *comp = &pi[pino].comps[compno];
656 tccp = &tcp->tccps[compno];
657 comp->dx = image->comps[compno].dx;
658 comp->dy = image->comps[compno].dy;
659 comp->numresolutions = tccp->numresolutions;
661 comp->resolutions = (opj_pi_resolution_t*) opj_malloc(comp->numresolutions *
662 sizeof(opj_pi_resolution_t));
663 if (!comp->resolutions) {
664 pi_destroy(pi, cp, tileno);
668 tcx0 = int_ceildiv(pi[pino].tx0, comp->dx);
669 tcy0 = int_ceildiv(pi[pino].ty0, comp->dy);
670 tcx1 = int_ceildiv(pi[pino].tx1, comp->dx);
671 tcy1 = int_ceildiv(pi[pino].ty1, comp->dy);
672 if (comp->numresolutions > maxres) {
673 maxres = comp->numresolutions;
676 for (resno = 0; resno < comp->numresolutions; resno++) {
678 int rx0, ry0, rx1, ry1;
679 int px0, py0, px1, py1;
680 opj_pi_resolution_t *res = &comp->resolutions[resno];
681 if (tccp->csty & J2K_CCP_CSTY_PRT) {
682 res->pdx = tccp->prcw[resno];
683 res->pdy = tccp->prch[resno];
688 levelno = comp->numresolutions - 1 - resno;
689 rx0 = int_ceildivpow2(tcx0, levelno);
690 ry0 = int_ceildivpow2(tcy0, levelno);
691 rx1 = int_ceildivpow2(tcx1, levelno);
692 ry1 = int_ceildivpow2(tcy1, levelno);
693 px0 = int_floordivpow2(rx0, res->pdx) << res->pdx;
694 py0 = int_floordivpow2(ry0, res->pdy) << res->pdy;
695 px1 = int_ceildivpow2(rx1, res->pdx) << res->pdx;
696 py1 = int_ceildivpow2(ry1, res->pdy) << res->pdy;
697 res->pw = (rx0 == rx1) ? 0 : ((px1 - px0) >> res->pdx);
698 res->ph = (ry0 == ry1) ? 0 : ((py1 - py0) >> res->pdy);
700 if (res->pw * res->ph > maxprec) {
701 maxprec = res->pw * res->ph;
706 tccp = &tcp->tccps[0];
708 pi[pino].step_c = maxprec * pi[pino].step_p;
709 pi[pino].step_r = image->numcomps * pi[pino].step_c;
710 pi[pino].step_l = maxres * pi[pino].step_r;
712 for (compno = 0; compno < pi->numcomps; compno++) {
713 opj_pi_comp_t *comp = &pi->comps[compno];
714 for (resno = 0; resno < comp->numresolutions; resno++) {
716 opj_pi_resolution_t *res = &comp->resolutions[resno];
717 dx = comp->dx * (1 << (res->pdx + comp->numresolutions - 1 - resno));
718 dy = comp->dy * (1 << (res->pdy + comp->numresolutions - 1 - resno));
719 pi[pino].dx = !pi->dx ? dx : int_min(pi->dx, dx);
720 pi[pino].dy = !pi->dy ? dy : int_min(pi->dy, dy);
725 pi[pino].include = (short int*) opj_calloc(tcp->numlayers * pi[pino].step_l,
727 if (!pi[pino].include) {
728 pi_destroy(pi, cp, tileno);
732 pi[pino].include = pi[pino - 1].include;
735 /* Generation of boundaries for each prog flag*/
736 if (tcp->POC && (cp->cinema || ((!cp->cinema) && (t2_mode == FINAL_PASS)))) {
737 tcp->pocs[pino].compS = tcp->pocs[pino].compno0;
738 tcp->pocs[pino].compE = tcp->pocs[pino].compno1;
739 tcp->pocs[pino].resS = tcp->pocs[pino].resno0;
740 tcp->pocs[pino].resE = tcp->pocs[pino].resno1;
741 tcp->pocs[pino].layE = tcp->pocs[pino].layno1;
742 tcp->pocs[pino].prg = tcp->pocs[pino].prg1;
744 tcp->pocs[pino].layS = (tcp->pocs[pino].layE > tcp->pocs[pino - 1].layE) ?
745 tcp->pocs[pino - 1].layE : 0;
748 tcp->pocs[pino].compS = 0;
749 tcp->pocs[pino].compE = image->numcomps;
750 tcp->pocs[pino].resS = 0;
751 tcp->pocs[pino].resE = maxres;
752 tcp->pocs[pino].layS = 0;
753 tcp->pocs[pino].layE = tcp->numlayers;
754 tcp->pocs[pino].prg = tcp->prg;
756 tcp->pocs[pino].prcS = 0;
757 tcp->pocs[pino].prcE = maxprec;;
758 tcp->pocs[pino].txS = pi[pino].tx0;
759 tcp->pocs[pino].txE = pi[pino].tx1;
760 tcp->pocs[pino].tyS = pi[pino].ty0;
761 tcp->pocs[pino].tyE = pi[pino].ty1;
762 tcp->pocs[pino].dx = pi[pino].dx;
763 tcp->pocs[pino].dy = pi[pino].dy;
770 void pi_destroy(opj_pi_iterator_t *pi, opj_cp_t *cp, int tileno)
773 opj_tcp_t *tcp = &cp->tcps[tileno];
775 for (pino = 0; pino < tcp->numpocs + 1; pino++) {
776 if (pi[pino].comps) {
777 for (compno = 0; compno < pi->numcomps; compno++) {
778 opj_pi_comp_t *comp = &pi[pino].comps[compno];
779 if (comp->resolutions) {
780 opj_free(comp->resolutions);
783 opj_free(pi[pino].comps);
787 opj_free(pi->include);
793 opj_bool pi_next(opj_pi_iterator_t * pi)
795 switch (pi->poc.prg) {
797 return pi_next_lrcp(pi);
799 return pi_next_rlcp(pi);
801 return pi_next_rpcl(pi);
803 return pi_next_pcrl(pi);
805 return pi_next_cprl(pi);
813 opj_bool pi_create_encode(opj_pi_iterator_t *pi, opj_cp_t *cp, int tileno,
814 int pino, int tpnum, int tppos, J2K_T2_MODE t2_mode, int cur_totnum_tp)
818 int incr_top = 1, resetX = 0;
819 opj_tcp_t *tcps = &cp->tcps[tileno];
820 opj_poc_t *tcp = &tcps->pocs[pino];
823 pi[pino].poc.prg = tcp->prg;
827 strncpy(prog, "CPRL", 4);
830 strncpy(prog, "LRCP", 4);
833 strncpy(prog, "PCRL", 4);
836 strncpy(prog, "RLCP", 4);
839 strncpy(prog, "RPCL", 4);
845 if (!(cp->tp_on && ((!cp->cinema && (t2_mode == FINAL_PASS)) || cp->cinema))) {
846 pi[pino].poc.resno0 = tcp->resS;
847 pi[pino].poc.resno1 = tcp->resE;
848 pi[pino].poc.compno0 = tcp->compS;
849 pi[pino].poc.compno1 = tcp->compE;
850 pi[pino].poc.layno0 = tcp->layS;
851 pi[pino].poc.layno1 = tcp->layE;
852 pi[pino].poc.precno0 = tcp->prcS;
853 pi[pino].poc.precno1 = tcp->prcE;
854 pi[pino].poc.tx0 = tcp->txS;
855 pi[pino].poc.ty0 = tcp->tyS;
856 pi[pino].poc.tx1 = tcp->txE;
857 pi[pino].poc.ty1 = tcp->tyE;
859 if (tpnum < cur_totnum_tp) {
860 for (i = 3; i >= 0; i--) {
864 pi[pino].poc.compno0 = tcp->compS;
865 pi[pino].poc.compno1 = tcp->compE;
868 tcp->comp_t = tcp->compS;
869 pi[pino].poc.compno0 = tcp->comp_t;
870 pi[pino].poc.compno1 = tcp->comp_t + 1;
874 if (tcp->comp_t == tcp->compE) {
875 tcp->comp_t = tcp->compS;
876 pi[pino].poc.compno0 = tcp->comp_t;
877 pi[pino].poc.compno1 = tcp->comp_t + 1;
881 pi[pino].poc.compno0 = tcp->comp_t;
882 pi[pino].poc.compno1 = tcp->comp_t + 1;
887 pi[pino].poc.compno0 = tcp->comp_t - 1;
888 pi[pino].poc.compno1 = tcp->comp_t;
896 pi[pino].poc.resno0 = tcp->resS;
897 pi[pino].poc.resno1 = tcp->resE;
900 tcp->res_t = tcp->resS;
901 pi[pino].poc.resno0 = tcp->res_t;
902 pi[pino].poc.resno1 = tcp->res_t + 1;
906 if (tcp->res_t == tcp->resE) {
907 tcp->res_t = tcp->resS;
908 pi[pino].poc.resno0 = tcp->res_t;
909 pi[pino].poc.resno1 = tcp->res_t + 1;
913 pi[pino].poc.resno0 = tcp->res_t;
914 pi[pino].poc.resno1 = tcp->res_t + 1;
919 pi[pino].poc.resno0 = tcp->res_t - 1;
920 pi[pino].poc.resno1 = tcp->res_t;
928 pi[pino].poc.layno0 = tcp->layS;
929 pi[pino].poc.layno1 = tcp->layE;
932 tcp->lay_t = tcp->layS;
933 pi[pino].poc.layno0 = tcp->lay_t;
934 pi[pino].poc.layno1 = tcp->lay_t + 1;
938 if (tcp->lay_t == tcp->layE) {
939 tcp->lay_t = tcp->layS;
940 pi[pino].poc.layno0 = tcp->lay_t;
941 pi[pino].poc.layno1 = tcp->lay_t + 1;
945 pi[pino].poc.layno0 = tcp->lay_t;
946 pi[pino].poc.layno1 = tcp->lay_t + 1;
951 pi[pino].poc.layno0 = tcp->lay_t - 1;
952 pi[pino].poc.layno1 = tcp->lay_t;
963 pi[pino].poc.precno0 = tcp->prcS;
964 pi[pino].poc.precno1 = tcp->prcE;
967 tcp->prc_t = tcp->prcS;
968 pi[pino].poc.precno0 = tcp->prc_t;
969 pi[pino].poc.precno1 = tcp->prc_t + 1;
973 if (tcp->prc_t == tcp->prcE) {
974 tcp->prc_t = tcp->prcS;
975 pi[pino].poc.precno0 = tcp->prc_t;
976 pi[pino].poc.precno1 = tcp->prc_t + 1;
980 pi[pino].poc.precno0 = tcp->prc_t;
981 pi[pino].poc.precno1 = tcp->prc_t + 1;
986 pi[pino].poc.precno0 = tcp->prc_t - 1;
987 pi[pino].poc.precno1 = tcp->prc_t;
994 pi[pino].poc.tx0 = tcp->txS;
995 pi[pino].poc.ty0 = tcp->tyS;
996 pi[pino].poc.tx1 = tcp->txE;
997 pi[pino].poc.ty1 = tcp->tyE;
1000 tcp->tx0_t = tcp->txS;
1001 tcp->ty0_t = tcp->tyS;
1002 pi[pino].poc.tx0 = tcp->tx0_t;
1003 pi[pino].poc.tx1 = tcp->tx0_t + tcp->dx - (tcp->tx0_t % tcp->dx);
1004 pi[pino].poc.ty0 = tcp->ty0_t;
1005 pi[pino].poc.ty1 = tcp->ty0_t + tcp->dy - (tcp->ty0_t % tcp->dy);
1006 tcp->tx0_t = pi[pino].poc.tx1;
1007 tcp->ty0_t = pi[pino].poc.ty1;
1009 if (incr_top == 1) {
1010 if (tcp->tx0_t >= tcp->txE) {
1011 if (tcp->ty0_t >= tcp->tyE) {
1012 tcp->ty0_t = tcp->tyS;
1013 pi[pino].poc.ty0 = tcp->ty0_t;
1014 pi[pino].poc.ty1 = tcp->ty0_t + tcp->dy - (tcp->ty0_t % tcp->dy);
1015 tcp->ty0_t = pi[pino].poc.ty1;
1019 pi[pino].poc.ty0 = tcp->ty0_t;
1020 pi[pino].poc.ty1 = tcp->ty0_t + tcp->dy - (tcp->ty0_t % tcp->dy);
1021 tcp->ty0_t = pi[pino].poc.ty1;
1026 tcp->tx0_t = tcp->txS;
1027 pi[pino].poc.tx0 = tcp->tx0_t;
1028 pi[pino].poc.tx1 = tcp->tx0_t + tcp->dx - (tcp->tx0_t % tcp->dx);
1029 tcp->tx0_t = pi[pino].poc.tx1;
1032 pi[pino].poc.tx0 = tcp->tx0_t;
1033 pi[pino].poc.tx1 = tcp->tx0_t + tcp->dx - (tcp->tx0_t % tcp->dx);
1034 tcp->tx0_t = pi[pino].poc.tx1;
1035 pi[pino].poc.ty0 = tcp->ty0_t - tcp->dy - (tcp->ty0_t % tcp->dy);
1036 pi[pino].poc.ty1 = tcp->ty0_t ;
1040 pi[pino].poc.tx0 = tcp->tx0_t - tcp->dx - (tcp->tx0_t % tcp->dx);
1041 pi[pino].poc.tx1 = tcp->tx0_t ;
1042 pi[pino].poc.ty0 = tcp->ty0_t - tcp->dy - (tcp->ty0_t % tcp->dy);
1043 pi[pino].poc.ty1 = tcp->ty0_t ;