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                         if ((!(pi->x % (comp->dx << rpx) == 0) || (pi->x == pi->tx0 &&
 227                                 (trx0 << levelnox) % (1 << rpx)))) {
 228                             continue;
 229                         }
 230                         if ((!(pi->y % (comp->dy << rpy) == 0) || (pi->y == pi->ty0 &&
 231                                 (try0 << levelnoy) % (1 << rpx)))) {
 232                             continue;
 233                         }
 234                         if ((!(pi->z % (comp->dz << rpz) == 0) || (pi->z == pi->tz0 &&
 235                                 (trz0 << levelnoz) % (1 << rpx)))) {
 236                             continue;
 237                         }
 238                         if ((res->prctno[0] == 0) || (res->prctno[1] == 0) || (res->prctno[2] == 0)) {
 239                             continue;
 240                         }
 241
 242                         if ((trx0 == trx1) || (try0 == try1) || (trz0 == trz1)) {
 243                             continue;
 244                         }
 245
 246                         prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelnox), res->pdx)
 247                                - int_floordivpow2(trx0, res->pdx);
 248                         prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelnoy), res->pdy)
 249                                - int_floordivpow2(try0, res->pdy);
 250                         prck = int_floordivpow2(int_ceildiv(pi->z, comp->dz << levelnoz), res->pdz)
 251                                - int_floordivpow2(trz0, res->pdz);
 252                         pi->precno = prci + prcj * res->prctno[0] + prck * res->prctno[0] *
 253                                      res->prctno[1];
 254                         for (pi->layno = 0; pi->layno < pi->poc.layno1; pi->layno++) {
 255                             index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
 256                                     pi->step_c + pi->precno * pi->step_p;
 257                             if (!pi->include[index]) {
 258                                 pi->include[index] = 1;
 259                                 return true;
 260                             }
 261 LABEL_SKIP:
 262                             ;
 263                         }
 264                     }
 265                 }
 266             }
 267         }
 268     }
 269
 270     return false;
 271 }
 272
 273 static bool pi_next_pcrl(opj_pi_iterator_t * pi)
 274 {
 275     opj_pi_comp_t *comp = NULL;
 276     opj_pi_resolution_t *res = NULL;
 277     long index = 0;
 278
 279     if (!pi->first) {
 280         comp = &pi->comps[pi->compno];
 281         goto LABEL_SKIP;
 282     } else {
 283         int compno, resno;
 284         pi->first = 0;
 285         pi->dx = 0;
 286         pi->dy = 0;
 287         pi->dz = 0;
 288         for (compno = 0; compno < pi->numcomps; compno++) {
 289             comp = &pi->comps[compno];
 290             for (resno = 0; resno < comp->numresolution[0]; resno++) {
 291                 int dx, dy, dz;
 292                 res = &comp->resolutions[resno];
 293                 dx = comp->dx * (1 << (res->pdx + comp->numresolution[0] - 1 - resno));
 294                 dy = comp->dy * (1 << (res->pdy + comp->numresolution[1] - 1 - resno));
 295                 dz = comp->dz * (1 << (res->pdy + comp->numresolution[2] - 1 - resno));
 296                 pi->dx = !pi->dx ? dx : int_min(pi->dx, dx);
 297                 pi->dy = !pi->dy ? dy : int_min(pi->dy, dy);
 298                 pi->dz = !pi->dz ? dz : int_min(pi->dz, dz);
 299             }
 300         }
 301     }
 302
 303     for (pi->z = pi->tz0; pi->z < pi->tz1; pi->z += pi->dz - (pi->z % pi->dz)) {
 304         for (pi->y = pi->ty0; pi->y < pi->ty1; pi->y += pi->dy - (pi->y % pi->dy)) {
 305             for (pi->x = pi->tx0; pi->x < pi->tx1; pi->x += pi->dx - (pi->x % pi->dx)) {
 306                 for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
 307                     comp = &pi->comps[pi->compno];
 308                     for (pi->resno = pi->poc.resno0;
 309                             pi->resno < int_min(pi->poc.resno1, comp->numresolution[0]); pi->resno++) {
 310                         int levelnox, levelnoy, levelnoz;
 311                         int trx0, try0, trz0;
 312                         int trx1, try1, trz1;
 313                         int rpx, rpy, rpz;
 314                         int prci, prcj, prck;
 315                         comp = &pi->comps[pi->compno];
 316                         if (pi->resno >= comp->numresolution[0]) {
 317                             continue;
 318                         }
 319                         res = &comp->resolutions[pi->resno];
 320                         levelnox = comp->numresolution[0] - 1 - pi->resno;
 321                         levelnoy = comp->numresolution[1] - 1 - pi->resno;
 322                         levelnoz = comp->numresolution[2] - 1 - pi->resno;
 323                         trx0 = int_ceildiv(pi->tx0, comp->dx << levelnox);
 324                         try0 = int_ceildiv(pi->ty0, comp->dy << levelnoy);
 325                         trz0 = int_ceildiv(pi->tz0, comp->dz << levelnoz);
 326                         trx1 = int_ceildiv(pi->tx1, comp->dx << levelnox);
 327                         try1 = int_ceildiv(pi->ty1, comp->dy << levelnoy);
 328                         trz1 = int_ceildiv(pi->tz1, comp->dz << levelnoz);
 329                         rpx = res->pdx + levelnox;
 330                         rpy = res->pdy + levelnoy;
 331                         rpz = res->pdz + levelnoz;
 332                         if ((!(pi->x % (comp->dx << rpx) == 0) || (pi->x == pi->tx0 &&
 333                                 (trx0 << levelnox) % (1 << rpx)))) {
 334                             continue;
 335                         }
 336                         if ((!(pi->y % (comp->dy << rpy) == 0) || (pi->y == pi->ty0 &&
 337                                 (try0 << levelnoy) % (1 << rpx)))) {
 338                             continue;
 339                         }
 340                         if ((!(pi->z % (comp->dz << rpz) == 0) || (pi->z == pi->tz0 &&
 341                                 (trz0 << levelnoz) % (1 << rpx)))) {
 342                             continue;
 343                         }
 344                         if ((res->prctno[0] == 0) || (res->prctno[1] == 0) || (res->prctno[2] == 0)) {
 345                             continue;
 346                         }
 347
 348                         if ((trx0 == trx1) || (try0 == try1) || (trz0 == trz1)) {
 349                             continue;
 350                         }
 351
 352                         prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelnox), res->pdx)
 353                                - int_floordivpow2(trx0, res->pdx);
 354                         prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelnoy), res->pdy)
 355                                - int_floordivpow2(try0, res->pdy);
 356                         prck = int_floordivpow2(int_ceildiv(pi->z, comp->dz << levelnoz), res->pdz)
 357                                - int_floordivpow2(trz0, res->pdz);
 358                         pi->precno = prci + prcj * res->prctno[0] + prck * res->prctno[0] *
 359                                      res->prctno[1];
 360                         for (pi->layno = 0; pi->layno < pi->poc.layno1; pi->layno++) {
 361                             index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
 362                                     pi->step_c + pi->precno * pi->step_p;
 363                             if (!pi->include[index]) {
 364                                 pi->include[index] = 1;
 365                                 return true;
 366                             }
 367 LABEL_SKIP:
 368                             ;
 369                         }
 370                     }
 371                 }
 372             }
 373         }
 374     }
 375
 376     return false;
 377 }
 378
 379 static bool pi_next_cprl(opj_pi_iterator_t * pi)
 380 {
 381     opj_pi_comp_t *comp = NULL;
 382     opj_pi_resolution_t *res = NULL;
 383     long index = 0;
 384
 385     if (!pi->first) {
 386         comp = &pi->comps[pi->compno];
 387         goto LABEL_SKIP;
 388     } else {
 389         pi->first = 0;
 390     }
 391
 392     for (pi->compno = pi->poc.compno0; pi->compno < pi->poc.compno1; pi->compno++) {
 393         int resno;
 394         comp = &pi->comps[pi->compno];
 395         pi->dx = 0;
 396         pi->dy = 0;
 397         pi->dz = 0;
 398         for (resno = 0; resno < comp->numresolution[0]; resno++) {
 399             int dx, dy, dz;
 400             res = &comp->resolutions[resno];
 401             dx = comp->dx * (1 << (res->pdx + comp->numresolution[0] - 1 - resno));
 402             dy = comp->dy * (1 << (res->pdy + comp->numresolution[1] - 1 - resno));
 403             dz = comp->dz * (1 << (res->pdz + comp->numresolution[2] - 1 - resno));
 404             pi->dx = !pi->dx ? dx : int_min(pi->dx, dx);
 405             pi->dy = !pi->dy ? dy : int_min(pi->dy, dy);
 406             pi->dz = !pi->dz ? dz : int_min(pi->dz, dz);
 407         }
 408         for (pi->z = pi->tz0; pi->z < pi->tz1; pi->z += pi->dz - (pi->z % pi->dz)) {
 409             for (pi->y = pi->ty0; pi->y < pi->ty1; pi->y += pi->dy - (pi->y % pi->dy)) {
 410                 for (pi->x = pi->tx0; pi->x < pi->tx1; pi->x += pi->dx - (pi->x % pi->dx)) {
 411                     for (pi->resno = pi->poc.resno0;
 412                             pi->resno < int_min(pi->poc.resno1, comp->numresolution[0]); pi->resno++) {
 413                         int levelnox, levelnoy, levelnoz;
 414                         int trx0, try0, trz0;
 415                         int trx1, try1, trz1;
 416                         int rpx, rpy, rpz;
 417                         int prci, prcj, prck;
 418                         comp = &pi->comps[pi->compno];
 419                         if (pi->resno >= comp->numresolution[0]) {
 420                             continue;
 421                         }
 422                         res = &comp->resolutions[pi->resno];
 423                         levelnox = comp->numresolution[0] - 1 - pi->resno;
 424                         levelnoy = comp->numresolution[1] - 1 - pi->resno;
 425                         levelnoz = comp->numresolution[2] - 1 - pi->resno;
 426                         trx0 = int_ceildiv(pi->tx0, comp->dx << levelnox);
 427                         try0 = int_ceildiv(pi->ty0, comp->dy << levelnoy);
 428                         trz0 = int_ceildiv(pi->tz0, comp->dz << levelnoz);
 429                         trx1 = int_ceildiv(pi->tx1, comp->dx << levelnox);
 430                         try1 = int_ceildiv(pi->ty1, comp->dy << levelnoy);
 431                         trz1 = int_ceildiv(pi->tz1, comp->dz << levelnoz);
 432                         rpx = res->pdx + levelnox;
 433                         rpy = res->pdy + levelnoy;
 434                         rpz = res->pdz + levelnoz;
 435                         if ((!(pi->x % (comp->dx << rpx) == 0) || (pi->x == pi->tx0 &&
 436                                 (trx0 << levelnox) % (1 << rpx)))) {
 437                             continue;
 438                         }
 439                         if ((!(pi->y % (comp->dy << rpy) == 0) || (pi->y == pi->ty0 &&
 440                                 (try0 << levelnoy) % (1 << rpx)))) {
 441                             continue;
 442                         }
 443                         if ((!(pi->z % (comp->dz << rpz) == 0) || (pi->z == pi->tz0 &&
 444                                 (trz0 << levelnoz) % (1 << rpx)))) {
 445                             continue;
 446                         }
 447                         if ((res->prctno[0] == 0) || (res->prctno[1] == 0) || (res->prctno[2] == 0)) {
 448                             continue;
 449                         }
 450
 451                         if ((trx0 == trx1) || (try0 == try1) || (trz0 == trz1)) {
 452                             continue;
 453                         }
 454
 455                         prci = int_floordivpow2(int_ceildiv(pi->x, comp->dx << levelnox), res->pdx)
 456                                - int_floordivpow2(trx0, res->pdx);
 457                         prcj = int_floordivpow2(int_ceildiv(pi->y, comp->dy << levelnoy), res->pdy)
 458                                - int_floordivpow2(try0, res->pdy);
 459                         prck = int_floordivpow2(int_ceildiv(pi->z, comp->dz << levelnoz), res->pdz)
 460                                - int_floordivpow2(trz0, res->pdz);
 461                         pi->precno = prci + prcj * res->prctno[0] + prck * res->prctno[0] *
 462                                      res->prctno[1];
 463                         for (pi->layno = 0; pi->layno < pi->poc.layno1; pi->layno++) {
 464                             index = pi->layno * pi->step_l + pi->resno * pi->step_r + pi->compno *
 465                                     pi->step_c + pi->precno * pi->step_p;
 466                             if (!pi->include[index]) {
 467                                 pi->include[index] = 1;
 468                                 return true;
 469                             }
 470 LABEL_SKIP:
 471                             ;
 472                         }
 473                     }
 474                 }
 475             }
 476         }
 477     }
 478
 479     return false;
 480 }
 481
 482 /*
 483 ==========================================================
 484    Packet iterator interface
 485 ==========================================================
 486 */
 487
 488 opj_pi_iterator_t *pi_create(opj_volume_t *volume, opj_cp_t *cp, int tileno)
 489 {
 490     int p, q, r;
 491     int compno, resno, pino;
 492     opj_pi_iterator_t *pi = NULL;
 493     opj_tcp_t *tcp = NULL;
 494     opj_tccp_t *tccp = NULL;
 495     size_t array_size;
 496
 497     tcp = &cp->tcps[tileno];
 498
 499     array_size = (tcp->numpocs + 1) * sizeof(opj_pi_iterator_t);
 500     pi = (opj_pi_iterator_t *) opj_malloc(array_size);
 501     if (!pi) {
 502         fprintf(stdout, "[ERROR] Malloc of opj_pi_iterator failed \n");
 503         return NULL;
 504     }
 505
 506     for (pino = 0; pino < tcp->numpocs + 1; pino++) {   /* change */
 507         int maxres = 0;
 508         int maxprec = 0;
 509         p = tileno % cp->tw;
 510         q = tileno / cp->tw;
 511         r = tileno / (cp->tw * cp->th);
 512
 513         pi[pino].tx0 = int_max(cp->tx0 + p * cp->tdx, volume->x0);
 514         pi[pino].ty0 = int_max(cp->ty0 + q * cp->tdy, volume->y0);
 515         pi[pino].tz0 = int_max(cp->tz0 + r * cp->tdz, volume->z0);
 516         pi[pino].tx1 = int_min(cp->tx0 + (p + 1) * cp->tdx, volume->x1);
 517         pi[pino].ty1 = int_min(cp->ty0 + (q + 1) * cp->tdy, volume->y1);
 518         pi[pino].tz1 = int_min(cp->tz0 + (r + 1) * cp->tdz, volume->z1);
 519         pi[pino].numcomps = volume->numcomps;
 520
 521         array_size = volume->numcomps * sizeof(opj_pi_comp_t);
 522         pi[pino].comps = (opj_pi_comp_t *) opj_malloc(array_size);
 523         if (!pi[pino].comps) {
 524             fprintf(stdout, "[ERROR] Malloc of opj_pi_comp failed \n");
 525             pi_destroy(pi, cp, tileno);
 526             return NULL;
 527         }
 528         memset(pi[pino].comps, 0, array_size);
 529
 530         for (compno = 0; compno < pi->numcomps; compno++) {
 531             int tcx0, tcx1, tcy0, tcy1, tcz0, tcz1;
 532             int i;
 533             opj_pi_comp_t *comp = &pi[pino].comps[compno];
 534             tccp = &tcp->tccps[compno];
 535
 536             comp->dx = volume->comps[compno].dx;
 537             comp->dy = volume->comps[compno].dy;
 538             comp->dz = volume->comps[compno].dz;
 539             for (i = 0; i < 3; i++) {
 540                 comp->numresolution[i] = tccp->numresolution[i];
 541                 if (comp->numresolution[i] > maxres) {
 542                     maxres = comp->numresolution[i];
 543                 }
 544             }
 545             array_size = comp->numresolution[0] * sizeof(opj_pi_resolution_t);
 546             comp->resolutions = (opj_pi_resolution_t *) opj_malloc(array_size);
 547             if (!comp->resolutions) {
 548                 fprintf(stdout, "[ERROR] Malloc of opj_pi_resolution failed \n");
 549                 pi_destroy(pi, cp, tileno);
 550                 return NULL;
 551             }
 552
 553             tcx0 = int_ceildiv(pi->tx0, comp->dx);
 554             tcy0 = int_ceildiv(pi->ty0, comp->dy);
 555             tcz0 = int_ceildiv(pi->tz0, comp->dz);
 556             tcx1 = int_ceildiv(pi->tx1, comp->dx);
 557             tcy1 = int_ceildiv(pi->ty1, comp->dy);
 558             tcz1 = int_ceildiv(pi->tz1, comp->dz);
 559
 560             for (resno = 0; resno < comp->numresolution[0]; resno++) {
 561                 int levelnox, levelnoy, levelnoz, diff;
 562                 int rx0, ry0, rz0, rx1, ry1, rz1;
 563                 int px0, py0, pz0, px1, py1, pz1;
 564                 opj_pi_resolution_t *res = &comp->resolutions[resno];
 565                 if (tccp->csty & J3D_CCP_CSTY_PRT) {
 566                     res->pdx = tccp->prctsiz[0][resno];
 567                     res->pdy = tccp->prctsiz[1][resno];
 568                     res->pdz = tccp->prctsiz[2][resno];
 569                 } else {
 570                     res->pdx = 15;
 571                     res->pdy = 15;
 572                     res->pdz = 15;
 573                 }
 574                 levelnox = comp->numresolution[0] - 1 - resno;
 575                 levelnoy = comp->numresolution[1] - 1 - resno;
 576                 levelnoz = comp->numresolution[2] - 1 - resno;
 577                 if (levelnoz < 0) {
 578                     levelnoz = 0;
 579                 }
 580                 diff = comp->numresolution[0] - comp->numresolution[2];
 581
 582                 rx0 = int_ceildivpow2(tcx0, levelnox);
 583                 ry0 = int_ceildivpow2(tcy0, levelnoy);
 584                 rz0 = int_ceildivpow2(tcz0, levelnoz);
 585                 rx1 = int_ceildivpow2(tcx1, levelnox);
 586                 ry1 = int_ceildivpow2(tcy1, levelnoy);
 587                 rz1 = int_ceildivpow2(tcz1, levelnoz);
 588                 px0 = int_floordivpow2(rx0, res->pdx) << res->pdx;
 589                 py0 = int_floordivpow2(ry0, res->pdy) << res->pdy;
 590                 pz0 = int_floordivpow2(rz0, res->pdz) << res->pdz;
 591                 px1 = int_ceildivpow2(rx1, res->pdx) << res->pdx;
 592                 py1 = int_ceildivpow2(ry1, res->pdy) << res->pdy;
 593                 pz1 = int_ceildivpow2(rz1, res->pdz) << res->pdz;
 594                 res->prctno[0] = (rx0 == rx1) ? 0 : ((px1 - px0) >> res->pdx);
 595                 res->prctno[1] = (ry0 == ry1) ? 0 : ((py1 - py0) >> res->pdy);
 596                 res->prctno[2] = (rz0 == rz1) ? 0 : ((pz1 - pz0) >> res->pdz);
 597
 598                 if (res->prctno[0]*res->prctno[1]*res->prctno[2] > maxprec) {
 599                     maxprec = res->prctno[0] * res->prctno[1] * res->prctno[2];
 600                 }
 601             }
 602         }
 603
 604         tccp = &tcp->tccps[0];
 605         pi[pino].step_p = 1;
 606         pi[pino].step_c = maxprec * pi[pino].step_p;
 607         pi[pino].step_r = volume->numcomps * pi[pino].step_c;
 608         pi[pino].step_l = maxres * pi[pino].step_r;
 609
 610         if (pino == 0) {
 611             array_size = volume->numcomps * maxres * tcp->numlayers * maxprec * sizeof(
 612                              short int);
 613             pi[pino].include = (short int *) opj_malloc(array_size);
 614             if (!pi[pino].include) {
 615                 fprintf(stdout, "[ERROR] Malloc of pi[pino].include failed \n");
 616                 pi_destroy(pi, cp, tileno);
 617                 return NULL;
 618             }
 619         } else {
 620             pi[pino].include = pi[pino - 1].include;
 621         }
 622
 623         if (tcp->POC == 0) {
 624             pi[pino].first = 1;
 625             pi[pino].poc.resno0 = 0;
 626             pi[pino].poc.compno0 = 0;
 627             pi[pino].poc.layno1 = tcp->numlayers;
 628             pi[pino].poc.resno1 = maxres;
 629             pi[pino].poc.compno1 = volume->numcomps;
 630             pi[pino].poc.prg = tcp->prg;
 631         } else {
 632             pi[pino].first = 1;
 633             pi[pino].poc.resno0 = tcp->pocs[pino].resno0;
 634             pi[pino].poc.compno0 = tcp->pocs[pino].compno0;
 635             pi[pino].poc.layno1 = tcp->pocs[pino].layno1;
 636             pi[pino].poc.resno1 = tcp->pocs[pino].resno1;
 637             pi[pino].poc.compno1 = tcp->pocs[pino].compno1;
 638             pi[pino].poc.prg = tcp->pocs[pino].prg;
 639         }
 640     }
 641
 642     return pi;
 643 }
 644
 645 void pi_destroy(opj_pi_iterator_t *pi, opj_cp_t *cp, int tileno)
 646 {
 647     int compno, pino;
 648     opj_tcp_t *tcp = &cp->tcps[tileno];
 649     if (pi) {
 650         for (pino = 0; pino < tcp->numpocs + 1; pino++) {
 651             if (pi[pino].comps) {
 652                 for (compno = 0; compno < pi->numcomps; compno++) {
 653                     opj_pi_comp_t *comp = &pi[pino].comps[compno];
 654                     if (comp->resolutions) {
 655                         opj_free(comp->resolutions);
 656                     }
 657                 }
 658                 opj_free(pi[pino].comps);
 659             }
 660         }
 661         if (pi->include) {
 662             opj_free(pi->include);
 663         }
 664         opj_free(pi);
 665     }
 666 }
 667
 668 bool pi_next(opj_pi_iterator_t * pi)
 669 {
 670     switch (pi->poc.prg) {
 671     case LRCP:
 672         return pi_next_lrcp(pi);
 673     case RLCP:
 674         return pi_next_rlcp(pi);
 675     case RPCL:
 676         return pi_next_rpcl(pi);
 677     case PCRL:
 678         return pi_next_pcrl(pi);
 679     case CPRL:
 680         return pi_next_cprl(pi);
 681     }
 682
 683     return false;
 684 }
 685