2 * Copyright (c) 2001-2003, David Janssens
3 * Copyright (c) 2002-2003, Yannick Verschueren
4 * Copyright (c) 2003-2005, Francois Devaux and Antonin Descampe
5 * Copyright (c) 2005, Herve Drolon, FreeImage Team
6 * Copyright (c) 2002-2005, Communications and remote sensing Laboratory, Universite catholique de Louvain, Belgium
7 * Copyright (c) 2006, M�nica D�ez Garc�a, Image Processing Laboratory, University of Valladolid, Spain
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
20 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
23 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
36 @brief Implementation of a packet iterator (PI)
38 The functions in PI.C have for goal to realize a packet iterator that permits to get the next
39 packet following the progression order and change of it. The functions in PI.C are used
40 by some function in T2.C.
43 /** @defgroup PI PI - Implementation of a packet iterator */
47 Packet iterator : resolution level information
49 typedef struct opj_pi_resolution {
50 /** Size of precints in horizontal axis */
52 /** Size of precints in vertical axis */
54 /** Size of precints in axial axis */
56 /** Number of precints in each axis */
58 } opj_pi_resolution_t;
61 Packet iterator : component information
63 typedef struct opj_pi_comp {
64 /** Size in horizontal axis */
66 /** Size in vertical axis */
68 /** Size in axial axis */
70 /** Number of resolution levels */
72 /** Packet iterator : resolution level information */
73 opj_pi_resolution_t *resolutions;
79 typedef struct opj_pi_iterator {
80 /** precise if the packet has been already used (usefull for progression order change) */
82 /** layer step used to localize the packet in the include vector */
84 /** resolution step used to localize the packet in the include vector */
86 /** component step used to localize the packet in the include vector */
88 /** precinct step used to localize the packet in the include vector */
90 /** component that identify the packet */
92 /** resolution that identify the packet */
94 /** precinct that identify the packet */
96 /** layer that identify the packet */
98 /** 0 if the first packet */
100 /** progression order change information */
102 /** Packet iterator : component information */
103 opj_pi_comp_t *comps;
112 /** @name Funciones generales */
114 /* ----------------------------------------------------------------------- */
116 Create a packet iterator
117 @param volume Raw volume for which the packets will be listed
118 @param cp Coding parameters
119 @param tileno Number that identifies the tile for which to list the packets
120 @return Returns a packet iterator that points to the first packet of the tile
123 opj_pi_iterator_t *pi_create(opj_volume_t * volume, opj_cp_t * cp, int tileno);
126 Destroy a packet iterator
127 @param pi Previously created packet iterator
128 @param cp Coding parameters
129 @param tileno Number that identifies the tile for which the packets were listed
132 void pi_destroy(opj_pi_iterator_t *pi, opj_cp_t *cp, int tileno);
135 Modify the packet iterator to point to the next packet
136 @param pi Packet iterator to modify
137 @return Returns false if pi pointed to the last packet or else returns true
139 bool pi_next(opj_pi_iterator_t * pi);
140 /* ----------------------------------------------------------------------- */