src/lib/openjp3d/pi.c

   1 /*
   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.
   6  *
   7  * Copyright (c) 2001-2003, David Janssens
   8  * Copyright (c) 2002-2003, Yannick Verschueren
   9  * Copyright (c) 2003-2005, Francois Devaux and Antonin Descampe
  10  * Copyright (c) 2005, Herve Drolon, FreeImage Team
  11  * Copyright (c) 2002-2005, Communications and remote sensing Laboratory, Universite catholique de Louvain, Belgium
  12  * Copyright (c) 2006, Mónica Díez, LPI-UVA, Spain
  13  * All rights reserved.
  14  *
  15  * Redistribution and use in source and binary forms, with or without
  16  * modification, are permitted provided that the following conditions
  17  * are met:
  18  * 1. Redistributions of source code must retain the above copyright
  19  *    notice, this list of conditions and the following disclaimer.
  20  * 2. Redistributions in binary form must reproduce the above copyright
  21  *    notice, this list of conditions and the following disclaimer in the
  22  *    documentation and/or other materials provided with the distribution.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
  25  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  28  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  29  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  30  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  31  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  32  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  33  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  34  * POSSIBILITY OF SUCH DAMAGE.
  35  */
  36
  37 #include "opj_includes.h"
  38
  39 /** @defgroup PI PI - Implementation of a packet iterator */
  40 /*@{*/
  41
  42 /** @name Funciones locales */
  43 /*@{*/
  44
  45 /**
  46 Get next packet in layer-resolution-component-precinct order.
  47 @param pi packet iterator to modify
  48 @return returns false if pi pointed to the last packet or else returns true
  49 */
  50 static bool pi_next_lrcp(opj_pi_iterator_t * pi);
  51 /**
  52 Get next packet in resolution-layer-component-precinct order.
  53 @param pi packet iterator to modify
  54 @return returns false if pi pointed to the last packet or else returns true
  55 */
  56 static bool pi_next_rlcp(opj_pi_iterator_t * pi);
  57 /**
  58 Get next packet in resolution-precinct-component-layer order.
  59 @param pi packet iterator to modify
  60 @return returns false if pi pointed to the last packet or else returns true
  61 */
  62 static bool pi_next_rpcl(opj_pi_iterator_t * pi);
  63 /**
  64 Get next packet in precinct-component-resolution-layer order.
  65 @param pi packet iterator to modify
  66 @return returns false if pi pointed to the last packet or else returns true
  67 */
  68 static bool pi_next_pcrl(opj_pi_iterator_t * pi);
  69 /**
  70 Get next packet in component-precinct-resolution-layer order.
  71 @param pi packet iterator to modify
  72 @return returns false if pi pointed to the last packet or else returns true
  73 */
  74 static bool pi_next_cprl(opj_pi_iterator_t * pi);
  75
  76 /*@}*/
  77
  78 /*@}*/
  79
  80 /*
  81 ==========================================================
  82    local functions
  83 ==========================================================
  84 */
  85
  86 static bool pi_next_lrcp(opj_pi_iterator_t * pi)
  87 {
  88     opj_pi_comp_t *comp = NULL;
  89     opj_pi_resolution_t *res = NULL;
  90     long index = 0;
  91
  92     if (!pi->first) {
  93         comp = &pi->comps[pi->compno];
  94         res = &comp->resolutions[pi->resno];
  95         goto LABEL_SKIP;
  96     } else {
  97         pi->first = 0;
  98     }
  99
 100     for (pi->layno = 0; pi->layno < pi->poc.layno1; pi->layno++) {
 101         for (pi->resno = pi->poc.resno0; pi->resno < pi->poc.resno1; pi->resno++) {
 102             for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
 103                 comp = &pi->comps[pi->compno];
 104                 if (pi->resno >= comp->numresolution[0]) {
 105                     continue;
 106                 }
 107                 res = &comp->resolutions[pi->resno];
 108                 /*for (pi->precno = 0; pi->precno < (res->prctno[0] * res->prctno[1]); pi->precno++) {*/
 109                 for (pi->precno = 0;
 110                         pi->precno < (res->prctno[0] * res->prctno[1] * res->prctno[2]); pi->precno++) {
 111                     index = pi->layno * pi->step_l
 112                             + pi->resno * pi->step_r
 113                             + pi->compno * pi->step_c
 114                             + pi->precno * pi->step_p;
 115                     if (!pi->include[index]) {
 116                         pi->include[index] = 1;
 117                         return true;
 118                     }
 119 LABEL_SKIP:
 120                     ;
 121
 122                 }
 123             }
 124         }
 125     }
 126
 127     return false;
 128 }
 129
 130 static bool pi_next_rlcp(opj_pi_iterator_t * pi)
 131 {
 132     opj_pi_comp_t *comp = NULL;
 133     opj_pi_resolution_t *res = NULL;
 134     long index = 0;
 135
 136     if (!pi->first) {
 137         comp = &pi->comps[pi->compno];
 138         res = &comp->resolutions[pi->resno];
 139         goto LABEL_SKIP;
 140     } else {
 141         pi->first = 0;
 142     }
 143
 144     for (pi->resno = pi->poc.resno0; pi->resno < pi->poc.resno1; pi->resno++) {
 145         for (pi->layno = 0; pi->layno < pi->poc.layno1; pi->layno++) {
 146             for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
 147                 comp = &pi->comps[pi->compno];
 148                 if (pi->resno >= comp->numresolution[0]) {
 149                     continue;
 150                 }
 151                 res = &comp->resolutions[pi->resno];
 152                 /*for (pi->precno = 0; pi->precno < (res->prctno[0] * res->prctno[1]); pi->precno++) {*/
 153                 for (pi->precno = 0;
 154                         pi->precno < (res->prctno[0] * res->prctno[1] * res->prctno[2]); pi->precno++) {
 155                     index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
 156                             pi->step_c + pi->precno * pi->step_p;
 157                     if (!pi->include[index]) {
 158                         pi->include[index] = 1;
 159                         return true;
 160                     }
 161 LABEL_SKIP:
 162                     ;
 163                 }
 164             }
 165         }
 166     }
 167
 168     return false;
 169 }
 170
 171 static bool pi_next_rpcl(opj_pi_iterator_t * pi)
 172 {
 173     opj_pi_comp_t *comp = NULL;
 174     opj_pi_resolution_t *res = NULL;
 175     long index = 0;
 176
 177     if (!pi->first) {
 178         goto LABEL_SKIP;
 179     } else {
 180         int compno, resno;
 181         pi->first = 0;
 182         pi->dx = 0;
 183         pi->dy = 0;
 184         for (compno = 0; compno < pi->numcomps; compno++) {
 185             comp = &pi->comps[compno];
 186             for (resno = 0; resno < comp->numresolution[0]; resno++) {
 187                 int dx, dy, dz;
 188                 res = &comp->resolutions[resno];
 189                 dx = comp->dx * (1 << (res->pdx + comp->numresolution[0] - 1 - resno));
 190                 dy = comp->dy * (1 << (res->pdy + comp->numresolution[1] - 1 - resno));
 191                 dz = comp->dz * (1 << (res->pdz + comp->numresolution[2] - 1 - resno));
 192                 pi->dx = !pi->dx ? dx : int_min(pi->dx, dx);
 193                 pi->dy = !pi->dy ? dy : int_min(pi->dy, dy);
 194                 pi->dz = !pi->dz ? dz : int_min(pi->dz, dz);
 195             }
 196         }
 197     }
 198
 199     for (pi->resno = pi->poc.resno0; pi->resno < pi->poc.resno1; pi->resno++) {
 200         for (pi->z = pi->tz0; pi->z < pi->tz1; pi->z += pi->dz - (pi->z % pi->dz)) {
 201             for (pi->y = pi->ty0; pi->y < pi->ty1; pi->y += pi->dy - (pi->y % pi->dy)) {
 202                 for (pi->x = pi->tx0; pi->x < pi->tx1; pi->x += pi->dx - (pi->x % pi->dx)) {
 203                     for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
 204                         int levelnox, levelnoy, levelnoz;
 205                         int trx0, try0, trz0;
 206                         int trx1, try1, trz1;
 207                         int rpx, rpy, rpz;
 208                         int prci, prcj, prck;
 209                         comp = &pi->comps[pi->compno];
 210                         if (pi->resno >= comp->numresolution[0]) {
 211                             continue;
 212                         }
 213                         res = &comp->resolutions[pi->resno];
 214                         levelnox = comp->numresolution[0] - 1 - pi->resno;
 215                         levelnoy = comp->numresolution[1] - 1 - pi->resno;
 216                         levelnoz = comp->numresolution[2] - 1 - pi->resno;
 217                         trx0 = int_ceildiv(pi->tx0, comp->dx << levelnox);
 218                         try0 = int_ceildiv(pi->ty0, comp->dy << levelnoy);
 219                         trz0 = int_ceildiv(pi->tz0, comp->dz << levelnoz);
 220                         trx1 = int_ceildiv(pi->tx1, comp->dx << levelnox);
 221                         try1 = int_ceildiv(pi->ty1, comp->dy << levelnoy);
 222                         trz1 = int_ceildiv(pi->tz1, comp->dz << levelnoz);
 223                         rpx = res->pdx + levelnox;
 224                         rpy = res->pdy + levelnoy;
 225                         rpz = res->pdz + levelnoz;
 226
 227                         /* To avoid divisions by zero / undefined behaviour on shift */
 228                         if (rpx >= 31 || ((comp->dx << rpx) >> rpx) != comp->dx ||
 229                                 rpy >= 31 || ((comp->dy << rpy) >> rpy) != comp->dy ||
 230                                 rpz >= 31 || ((comp->dz << rpz) >> rpz) != comp->dz) {
 231                             continue;
 232                         }
 233
 234                         if ((!(pi->x % (comp->dx << rpx) == 0) || (pi->x == pi->tx0 &&
 235                                 (trx0 << levelnox) % (1 << rpx)))) {
 236                             continue;
 237                         }
 238                         if ((!(pi->y % (comp->dy << rpy) == 0) || (pi->y == pi->ty0 &&
 239                                 (try0 << levelnoy) % (1 << rpx)))) {
 240                             continue;
 241                         }
 242                         if ((!(pi->z % (comp->dz << rpz) == 0) || (pi->z == pi->tz0 &&
 243                                 (trz0 << levelnoz) % (1 << rpx)))) {
 244                             continue;
 245                         }
 246                         if ((res->prctno[0] == 0) || (res->prctno[1] == 0) || (res->prctno[2] == 0)) {
 247                             continue;
 248                         }
 249
 250                         if ((trx0 == trx1) || (try0 == try1) || (trz0 == trz1)) {
 251                             continue;
 252                         }
 253
 254                         prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelnox), res->pdx)
 255                                - int_floordivpow2(trx0, res->pdx);
 256                         prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelnoy), res->pdy)
 257                                - int_floordivpow2(try0, res->pdy);
 258                         prck = int_floordivpow2(int_ceildiv(pi->z, comp->dz << levelnoz), res->pdz)
 259                                - int_floordivpow2(trz0, res->pdz);
 260                         pi->precno = prci + prcj * res->prctno[0] + prck * res->prctno[0] *
 261                                      res->prctno[1];
 262                         for (pi->layno = 0; pi->layno < pi->poc.layno1; pi->layno++) {
 263                             index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
 264                                     pi->step_c + pi->precno * pi->step_p;
 265                             if (!pi->include[index]) {
 266                                 pi->include[index] = 1;
 267                                 return true;
 268                             }
 269 LABEL_SKIP:
 270                             ;
 271                         }
 272                     }
 273                 }
 274             }
 275         }
 276     }
 277
 278     return false;
 279 }
 280
 281 static bool pi_next_pcrl(opj_pi_iterator_t * pi)
 282 {
 283     opj_pi_comp_t *comp = NULL;
 284     opj_pi_resolution_t *res = NULL;
 285     long index = 0;
 286
 287     if (!pi->first) {
 288         comp = &pi->comps[pi->compno];
 289         goto LABEL_SKIP;
 290     } else {
 291         int compno, resno;
 292         pi->first = 0;
 293         pi->dx = 0;
 294         pi->dy = 0;
 295         pi->dz = 0;
 296         for (compno = 0; compno < pi->numcomps; compno++) {
 297             comp = &pi->comps[compno];
 298             for (resno = 0; resno < comp->numresolution[0]; resno++) {
 299                 int dx, dy, dz;
 300                 res = &comp->resolutions[resno];
 301                 dx = comp->dx * (1 << (res->pdx + comp->numresolution[0] - 1 - resno));
 302                 dy = comp->dy * (1 << (res->pdy + comp->numresolution[1] - 1 - resno));
 303                 dz = comp->dz * (1 << (res->pdy + comp->numresolution[2] - 1 - resno));
 304                 pi->dx = !pi->dx ? dx : int_min(pi->dx, dx);
 305                 pi->dy = !pi->dy ? dy : int_min(pi->dy, dy);
 306                 pi->dz = !pi->dz ? dz : int_min(pi->dz, dz);
 307             }
 308         }
 309     }
 310
 311     for (pi->z = pi->tz0; pi->z < pi->tz1; pi->z += pi->dz - (pi->z % pi->dz)) {
 312         for (pi->y = pi->ty0; pi->y < pi->ty1; pi->y += pi->dy - (pi->y % pi->dy)) {
 313             for (pi->x = pi->tx0; pi->x < pi->tx1; pi->x += pi->dx - (pi->x % pi->dx)) {
 314                 for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
 315                     comp = &pi->comps[pi->compno];
 316                     for (pi->resno = pi->poc.resno0;
 317                             pi->resno < int_min(pi->poc.resno1, comp->numresolution[0]); pi->resno++) {
 318                         int levelnox, levelnoy, levelnoz;
 319                         int trx0, try0, trz0;
 320                         int trx1, try1, trz1;
 321                         int rpx, rpy, rpz;
 322                         int prci, prcj, prck;
 323                         comp = &pi->comps[pi->compno];
 324                         if (pi->resno >= comp->numresolution[0]) {
 325                             continue;
 326                         }
 327                         res = &comp->resolutions[pi->resno];
 328                         levelnox = comp->numresolution[0] - 1 - pi->resno;
 329                         levelnoy = comp->numresolution[1] - 1 - pi->resno;
 330                         levelnoz = comp->numresolution[2] - 1 - pi->resno;
 331                         trx0 = int_ceildiv(pi->tx0, comp->dx << levelnox);
 332                         try0 = int_ceildiv(pi->ty0, comp->dy << levelnoy);
 333                         trz0 = int_ceildiv(pi->tz0, comp->dz << levelnoz);
 334                         trx1 = int_ceildiv(pi->tx1, comp->dx << levelnox);
 335                         try1 = int_ceildiv(pi->ty1, comp->dy << levelnoy);
 336                         trz1 = int_ceildiv(pi->tz1, comp->dz << levelnoz);
 337                         rpx = res->pdx + levelnox;
 338                         rpy = res->pdy + levelnoy;
 339                         rpz = res->pdz + levelnoz;
 340
 341                         /* To avoid divisions by zero / undefined behaviour on shift */
 342                         if (rpx >= 31 || ((comp->dx << rpx) >> rpx) != comp->dx ||
 343                                 rpy >= 31 || ((comp->dy << rpy) >> rpy) != comp->dy ||
 344                                 rpz >= 31 || ((comp->dz << rpz) >> rpz) != comp->dz) {
 345                             continue;
 346                         }
 347
 348                         if ((!(pi->x % (comp->dx << rpx) == 0) || (pi->x == pi->tx0 &&
 349                                 (trx0 << levelnox) % (1 << rpx)))) {
 350                             continue;
 351                         }
 352                         if ((!(pi->y % (comp->dy << rpy) == 0) || (pi->y == pi->ty0 &&
 353                                 (try0 << levelnoy) % (1 << rpx)))) {
 354                             continue;
 355                         }
 356                         if ((!(pi->z % (comp->dz << rpz) == 0) || (pi->z == pi->tz0 &&
 357                                 (trz0 << levelnoz) % (1 << rpx)))) {
 358                             continue;
 359                         }
 360                         if ((res->prctno[0] == 0) || (res->prctno[1] == 0) || (res->prctno[2] == 0)) {
 361                             continue;
 362                         }
 363
 364                         if ((trx0 == trx1) || (try0 == try1) || (trz0 == trz1)) {
 365                             continue;
 366                         }
 367
 368                         prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelnox), res->pdx)
 369                                - int_floordivpow2(trx0, res->pdx);
 370                         prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelnoy), res->pdy)
 371                                - int_floordivpow2(try0, res->pdy);
 372                         prck = int_floordivpow2(int_ceildiv(pi->z, comp->dz << levelnoz), res->pdz)
 373                                - int_floordivpow2(trz0, res->pdz);
 374                         pi->precno = prci + prcj * res->prctno[0] + prck * res->prctno[0] *
 375                                      res->prctno[1];
 376                         for (pi->layno = 0; pi->layno < pi->poc.layno1; pi->layno++) {
 377                             index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
 378                                     pi->step_c + pi->precno * pi->step_p;
 379                             if (!pi->include[index]) {
 380                                 pi->include[index] = 1;
 381                                 return true;
 382                             }
 383 LABEL_SKIP:
 384                             ;
 385                         }
 386                     }
 387                 }
 388             }
 389         }
 390     }
 391
 392     return false;
 393 }
 394
 395 static bool pi_next_cprl(opj_pi_iterator_t * pi)
 396 {
 397     opj_pi_comp_t *comp = NULL;
 398     opj_pi_resolution_t *res = NULL;
 399     long index = 0;
 400
 401     if (!pi->first) {
 402         comp = &pi->comps[pi->compno];
 403         goto LABEL_SKIP;
 404     } else {
 405         pi->first = 0;
 406     }
 407
 408     for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
 409         int resno;
 410         comp = &pi->comps[pi->compno];
 411         pi->dx = 0;
 412         pi->dy = 0;
 413         pi->dz = 0;
 414         for (resno = 0; resno < comp->numresolution[0]; resno++) {
 415             int dx, dy, dz;
 416             res = &comp->resolutions[resno];
 417             dx = comp->dx * (1 << (res->pdx + comp->numresolution[0] - 1 - resno));
 418             dy = comp->dy * (1 << (res->pdy + comp->numresolution[1] - 1 - resno));
 419             dz = comp->dz * (1 << (res->pdz + comp->numresolution[2] - 1 - resno));
 420             pi->dx = !pi->dx ? dx : int_min(pi->dx, dx);
 421             pi->dy = !pi->dy ? dy : int_min(pi->dy, dy);
 422             pi->dz = !pi->dz ? dz : int_min(pi->dz, dz);
 423         }
 424         for (pi->z = pi->tz0; pi->z < pi->tz1; pi->z += pi->dz - (pi->z % pi->dz)) {
 425             for (pi->y = pi->ty0; pi->y < pi->ty1; pi->y += pi->dy - (pi->y % pi->dy)) {
 426                 for (pi->x = pi->tx0; pi->x < pi->tx1; pi->x += pi->dx - (pi->x % pi->dx)) {
 427                     for (pi->resno = pi->poc.resno0;
 428                             pi->resno < int_min(pi->poc.resno1, comp->numresolution[0]); pi->resno++) {
 429                         int levelnox, levelnoy, levelnoz;
 430                         int trx0, try0, trz0;
 431                         int trx1, try1, trz1;
 432                         int rpx, rpy, rpz;
 433                         int prci, prcj, prck;
 434                         comp = &pi->comps[pi->compno];
 435                         if (pi->resno >= comp->numresolution[0]) {
 436                             continue;
 437                         }
 438                         res = &comp->resolutions[pi->resno];
 439                         levelnox = comp->numresolution[0] - 1 - pi->resno;
 440                         levelnoy = comp->numresolution[1] - 1 - pi->resno;
 441                         levelnoz = comp->numresolution[2] - 1 - pi->resno;
 442                         trx0 = int_ceildiv(pi->tx0, comp->dx << levelnox);
 443                         try0 = int_ceildiv(pi->ty0, comp->dy << levelnoy);
 444                         trz0 = int_ceildiv(pi->tz0, comp->dz << levelnoz);
 445                         trx1 = int_ceildiv(pi->tx1, comp->dx << levelnox);
 446                         try1 = int_ceildiv(pi->ty1, comp->dy << levelnoy);
 447                         trz1 = int_ceildiv(pi->tz1, comp->dz << levelnoz);
 448                         rpx = res->pdx + levelnox;
 449                         rpy = res->pdy + levelnoy;
 450                         rpz = res->pdz + levelnoz;
 451
 452                         /* To avoid divisions by zero / undefined behaviour on shift */
 453                         if (rpx >= 31 || ((comp->dx << rpx) >> rpx) != comp->dx ||
 454                                 rpy >= 31 || ((comp->dy << rpy) >> rpy) != comp->dy ||
 455                                 rpz >= 31 || ((comp->dz << rpz) >> rpz) != comp->dz) {
 456                             continue;
 457                         }
 458
 459                         if ((!(pi->x % (comp->dx << rpx) == 0) || (pi->x == pi->tx0 &&
 460                                 (trx0 << levelnox) % (1 << rpx)))) {
 461                             continue;
 462                         }
 463                         if ((!(pi->y % (comp->dy << rpy) == 0) || (pi->y == pi->ty0 &&
 464                                 (try0 << levelnoy) % (1 << rpx)))) {
 465                             continue;
 466                         }
 467                         if ((!(pi->z % (comp->dz << rpz) == 0) || (pi->z == pi->tz0 &&
 468                                 (trz0 << levelnoz) % (1 << rpx)))) {
 469                             continue;
 470                         }
 471                         if ((res->prctno[0] == 0) || (res->prctno[1] == 0) || (res->prctno[2] == 0)) {
 472                             continue;
 473                         }
 474
 475                         if ((trx0 == trx1) || (try0 == try1) || (trz0 == trz1)) {
 476                             continue;
 477                         }
 478
 479                         prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelnox), res->pdx)
 480                                - int_floordivpow2(trx0, res->pdx);
 481                         prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelnoy), res->pdy)
 482                                - int_floordivpow2(try0, res->pdy);
 483                         prck = int_floordivpow2(int_ceildiv(pi->z, comp->dz << levelnoz), res->pdz)
 484                                - int_floordivpow2(trz0, res->pdz);
 485                         pi->precno = prci + prcj * res->prctno[0] + prck * res->prctno[0] *
 486                                      res->prctno[1];
 487                         for (pi->layno = 0; pi->layno < pi->poc.layno1; pi->layno++) {
 488                             index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
 489                                     pi->step_c + pi->precno * pi->step_p;
 490                             if (!pi->include[index]) {
 491                                 pi->include[index] = 1;
 492                                 return true;
 493                             }
 494 LABEL_SKIP:
 495                             ;
 496                         }
 497                     }
 498                 }
 499             }
 500         }
 501     }
 502
 503     return false;
 504 }
 505
 506 /*
 507 ==========================================================
 508    Packet iterator interface
 509 ==========================================================
 510 */
 511
 512 opj_pi_iterator_t *pi_create(opj_volume_t *volume, opj_cp_t *cp, int tileno)
 513 {
 514     int p, q, r;
 515     int compno, resno, pino;
 516     opj_pi_iterator_t *pi = NULL;
 517     opj_tcp_t *tcp = NULL;
 518     opj_tccp_t *tccp = NULL;
 519     size_t array_size;
 520
 521     tcp = &cp->tcps[tileno];
 522
 523     array_size = (tcp->numpocs + 1) * sizeof(opj_pi_iterator_t);
 524     pi = (opj_pi_iterator_t *) opj_malloc(array_size);
 525     if (!pi) {
 526         fprintf(stdout, "[ERROR] Malloc of opj_pi_iterator failed \n");
 527         return NULL;
 528     }
 529
 530     for (pino = 0; pino < tcp->numpocs + 1; pino++) {   /* change */
 531         int maxres = 0;
 532         int maxprec = 0;
 533         p = tileno % cp->tw;
 534         q = tileno / cp->tw;
 535         r = tileno / (cp->tw * cp->th);
 536
 537         pi[pino].tx0 = int_max(cp->tx0 + p * cp->tdx, volume->x0);
 538         pi[pino].ty0 = int_max(cp->ty0 + q * cp->tdy, volume->y0);
 539         pi[pino].tz0 = int_max(cp->tz0 + r * cp->tdz, volume->z0);
 540         pi[pino].tx1 = int_min(cp->tx0 + (p + 1) * cp->tdx, volume->x1);
 541         pi[pino].ty1 = int_min(cp->ty0 + (q + 1) * cp->tdy, volume->y1);
 542         pi[pino].tz1 = int_min(cp->tz0 + (r + 1) * cp->tdz, volume->z1);
 543         pi[pino].numcomps = volume->numcomps;
 544
 545         array_size = volume->numcomps * sizeof(opj_pi_comp_t);
 546         pi[pino].comps = (opj_pi_comp_t *) opj_malloc(array_size);
 547         if (!pi[pino].comps) {
 548             fprintf(stdout, "[ERROR] Malloc of opj_pi_comp failed \n");
 549             pi_destroy(pi, cp, tileno);
 550             return NULL;
 551         }
 552         memset(pi[pino].comps, 0, array_size);
 553
 554         for (compno = 0; compno < pi->numcomps; compno++) {
 555             int tcx0, tcx1, tcy0, tcy1, tcz0, tcz1;
 556             int i;
 557             opj_pi_comp_t *comp = &pi[pino].comps[compno];
 558             tccp = &tcp->tccps[compno];
 559
 560             comp->dx = volume->comps[compno].dx;
 561             comp->dy = volume->comps[compno].dy;
 562             comp->dz = volume->comps[compno].dz;
 563             for (i = 0; i < 3; i++) {
 564                 comp->numresolution[i] = tccp->numresolution[i];
 565                 if (comp->numresolution[i] > maxres) {
 566                     maxres = comp->numresolution[i];
 567                 }
 568             }
 569             array_size = comp->numresolution[0] * sizeof(opj_pi_resolution_t);
 570             comp->resolutions = (opj_pi_resolution_t *) opj_malloc(array_size);
 571             if (!comp->resolutions) {
 572                 fprintf(stdout, "[ERROR] Malloc of opj_pi_resolution failed \n");
 573                 pi_destroy(pi, cp, tileno);
 574                 return NULL;
 575             }
 576
 577             tcx0 = int_ceildiv(pi->tx0, comp->dx);
 578             tcy0 = int_ceildiv(pi->ty0, comp->dy);
 579             tcz0 = int_ceildiv(pi->tz0, comp->dz);
 580             tcx1 = int_ceildiv(pi->tx1, comp->dx);
 581             tcy1 = int_ceildiv(pi->ty1, comp->dy);
 582             tcz1 = int_ceildiv(pi->tz1, comp->dz);
 583
 584             for (resno = 0; resno < comp->numresolution[0]; resno++) {
 585                 int levelnox, levelnoy, levelnoz, diff;
 586                 int rx0, ry0, rz0, rx1, ry1, rz1;
 587                 int px0, py0, pz0, px1, py1, pz1;
 588                 opj_pi_resolution_t *res = &comp->resolutions[resno];
 589                 if (tccp->csty & J3D_CCP_CSTY_PRT) {
 590                     res->pdx = tccp->prctsiz[0][resno];
 591                     res->pdy = tccp->prctsiz[1][resno];
 592                     res->pdz = tccp->prctsiz[2][resno];
 593                 } else {
 594                     res->pdx = 15;
 595                     res->pdy = 15;
 596                     res->pdz = 15;
 597                 }
 598                 levelnox = comp->numresolution[0] - 1 - resno;
 599                 levelnoy = comp->numresolution[1] - 1 - resno;
 600                 levelnoz = comp->numresolution[2] - 1 - resno;
 601                 if (levelnoz < 0) {
 602                     levelnoz = 0;
 603                 }
 604                 diff = comp->numresolution[0] - comp->numresolution[2];
 605
 606                 rx0 = int_ceildivpow2(tcx0, levelnox);
 607                 ry0 = int_ceildivpow2(tcy0, levelnoy);
 608                 rz0 = int_ceildivpow2(tcz0, levelnoz);
 609                 rx1 = int_ceildivpow2(tcx1, levelnox);
 610                 ry1 = int_ceildivpow2(tcy1, levelnoy);
 611                 rz1 = int_ceildivpow2(tcz1, levelnoz);
 612                 px0 = int_floordivpow2(rx0, res->pdx) << res->pdx;
 613                 py0 = int_floordivpow2(ry0, res->pdy) << res->pdy;
 614                 pz0 = int_floordivpow2(rz0, res->pdz) << res->pdz;
 615                 px1 = int_ceildivpow2(rx1, res->pdx) << res->pdx;
 616                 py1 = int_ceildivpow2(ry1, res->pdy) << res->pdy;
 617                 pz1 = int_ceildivpow2(rz1, res->pdz) << res->pdz;
 618                 res->prctno[0] = (rx0 == rx1) ? 0 : ((px1 - px0) >> res->pdx);
 619                 res->prctno[1] = (ry0 == ry1) ? 0 : ((py1 - py0) >> res->pdy);
 620                 res->prctno[2] = (rz0 == rz1) ? 0 : ((pz1 - pz0) >> res->pdz);
 621
 622                 if (res->prctno[0]*res->prctno[1]*res->prctno[2] > maxprec) {
 623                     maxprec = res->prctno[0] * res->prctno[1] * res->prctno[2];
 624                 }
 625             }
 626         }
 627
 628         tccp = &tcp->tccps[0];
 629         pi[pino].step_p = 1;
 630         pi[pino].step_c = maxprec * pi[pino].step_p;
 631         pi[pino].step_r = volume->numcomps * pi[pino].step_c;
 632         pi[pino].step_l = maxres * pi[pino].step_r;
 633
 634         if (pino == 0) {
 635             array_size = volume->numcomps * maxres * tcp->numlayers * maxprec * sizeof(
 636                              short int);
 637             pi[pino].include = (short int *) opj_malloc(array_size);
 638             if (!pi[pino].include) {
 639                 fprintf(stdout, "[ERROR] Malloc of pi[pino].include failed \n");
 640                 pi_destroy(pi, cp, tileno);
 641                 return NULL;
 642             }
 643         } else {
 644             pi[pino].include = pi[pino - 1].include;
 645         }
 646
 647         if (tcp->POC == 0) {
 648             pi[pino].first = 1;
 649             pi[pino].poc.resno0 = 0;
 650             pi[pino].poc.compno0 = 0;
 651             pi[pino].poc.layno1 = tcp->numlayers;
 652             pi[pino].poc.resno1 = maxres;
 653             pi[pino].poc.compno1 = volume->numcomps;
 654             pi[pino].poc.prg = tcp->prg;
 655         } else {
 656             pi[pino].first = 1;
 657             pi[pino].poc.resno0 = tcp->pocs[pino].resno0;
 658             pi[pino].poc.compno0 = tcp->pocs[pino].compno0;
 659             pi[pino].poc.layno1 = tcp->pocs[pino].layno1;
 660             pi[pino].poc.resno1 = tcp->pocs[pino].resno1;
 661             pi[pino].poc.compno1 = tcp->pocs[pino].compno1;
 662             pi[pino].poc.prg = tcp->pocs[pino].prg;
 663         }
 664     }
 665
 666     return pi;
 667 }
 668
 669 void pi_destroy(opj_pi_iterator_t *pi, opj_cp_t *cp, int tileno)
 670 {
 671     int compno, pino;
 672     opj_tcp_t *tcp = &cp->tcps[tileno];
 673     if (pi) {
 674         for (pino = 0; pino < tcp->numpocs + 1; pino++) {
 675             if (pi[pino].comps) {
 676                 for (compno = 0; compno < pi->numcomps; compno++) {
 677                     opj_pi_comp_t *comp = &pi[pino].comps[compno];
 678                     if (comp->resolutions) {
 679                         opj_free(comp->resolutions);
 680                     }
 681                 }
 682                 opj_free(pi[pino].comps);
 683             }
 684         }
 685         if (pi->include) {
 686             opj_free(pi->include);
 687         }
 688         opj_free(pi);
 689     }
 690 }
 691
 692 bool pi_next(opj_pi_iterator_t * pi)
 693 {
 694     switch (pi->poc.prg) {
 695     case LRCP:
 696         return pi_next_lrcp(pi);
 697     case RLCP:
 698         return pi_next_rlcp(pi);
 699     case RPCL:
 700         return pi_next_rpcl(pi);
 701     case PCRL:
 702         return pi_next_pcrl(pi);
 703     case CPRL:
 704         return pi_next_cprl(pi);
 705     }
 706
 707     return false;
 708 }
 709