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 * All rights reserved.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
42 @brief Implementation of a packet iterator (PI)
44 The functions in PI.C have for goal to realize a packet iterator that permits to get the next
45 packet following the progression order and change of it. The functions in PI.C are used
46 by some function in T2.C.
49 /** @defgroup PI PI - Implementation of a packet iterator */
55 typedef struct opj_pi_resolution {
58 } opj_pi_resolution_t;
63 typedef struct opj_pi_comp {
65 /** number of resolution levels */
67 opj_pi_resolution_t *resolutions;
73 typedef struct opj_pi_iterator {
74 /** Enabling Tile part generation*/
76 /** precise if the packet has been already used (useful for progression order change) */
78 /** layer step used to localize the packet in the include vector */
80 /** resolution step used to localize the packet in the include vector */
82 /** component step used to localize the packet in the include vector */
84 /** precinct step used to localize the packet in the include vector */
86 /** component that identify the packet */
88 /** resolution that identify the packet */
90 /** precinct that identify the packet */
92 /** layer that identify the packet */
94 /** 0 if the first packet */
96 /** progression order change information */
98 /** number of components in the image */
101 opj_pi_comp_t *comps;
102 int tx0, ty0, tx1, ty1;
106 /** @name Exported functions */
108 /* ----------------------------------------------------------------------- */
110 Create a packet iterator for Encoder
111 @param image Raw image for which the packets will be listed
112 @param cp Coding parameters
113 @param tileno Number that identifies the tile for which to list the packets
114 @param t2_mode If == 0 In Threshold calculation ,If == 1 Final pass
115 @return Returns a packet iterator that points to the first packet of the tile
118 opj_pi_iterator_t *pi_initialise_encode(opj_image_t *image, opj_cp_t *cp, int tileno,J2K_T2_MODE t2_mode);
120 Modify the packet iterator for enabling tile part generation
121 @param pi Handle to the packet iterator generated in pi_initialise_encode
122 @param cp Coding parameters
123 @param tileno Number that identifies the tile for which to list the packets
124 @param pino Iterator index for pi
125 @param tpnum Tile part number of the current tile
126 @param tppos The position of the tile part flag in the progression order
127 @param t2_mode If == 0 In Threshold calculation ,If == 1 Final pass
128 @param cur_totnum_tp The total number of tile parts in the current tile
129 @return Returns true if an error is detected
131 opj_bool pi_create_encode(opj_pi_iterator_t *pi, opj_cp_t *cp,int tileno, int pino,int tpnum, int tppos, J2K_T2_MODE t2_mode,int cur_totnum_tp);
133 Create a packet iterator for Decoder
134 @param image Raw image for which the packets will be listed
135 @param cp Coding parameters
136 @param tileno Number that identifies the tile for which to list the packets
137 @return Returns a packet iterator that points to the first packet of the tile
140 opj_pi_iterator_t *pi_create_decode(opj_image_t * image, opj_cp_t * cp, int tileno);
143 Destroy a packet iterator
144 @param pi Previously created packet iterator
145 @param cp Coding parameters
146 @param tileno Number that identifies the tile for which the packets were listed
149 void pi_destroy(opj_pi_iterator_t *pi, opj_cp_t *cp, int tileno);
152 Modify the packet iterator to point to the next packet
153 @param pi Packet iterator to modify
154 @return Returns false if pi pointed to the last packet or else returns true
156 opj_bool pi_next(opj_pi_iterator_t * pi);
157 /* ----------------------------------------------------------------------- */