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) 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 Garc�a, Image Processing Laboratory, University of Valladolid, Spain
13 * All rights reserved.
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
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.
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.
41 @brief Implementation of a packet iterator (PI)
43 The functions in PI.C have for goal to realize a packet iterator that permits to get the next
44 packet following the progression order and change of it. The functions in PI.C are used
45 by some function in T2.C.
48 /** @defgroup PI PI - Implementation of a packet iterator */
52 Packet iterator : resolution level information
54 typedef struct opj_pi_resolution {
55 /** Size of precints in horizontal axis */
57 /** Size of precints in vertical axis */
59 /** Size of precints in axial axis */
61 /** Number of precints in each axis */
63 } opj_pi_resolution_t;
66 Packet iterator : component information
68 typedef struct opj_pi_comp {
69 /** Size in horizontal axis */
71 /** Size in vertical axis */
73 /** Size in axial axis */
75 /** Number of resolution levels */
77 /** Packet iterator : resolution level information */
78 opj_pi_resolution_t *resolutions;
84 typedef struct opj_pi_iterator {
85 /** precise if the packet has been already used (usefull for progression order change) */
87 /** layer step used to localize the packet in the include vector */
89 /** resolution step used to localize the packet in the include vector */
91 /** component step used to localize the packet in the include vector */
93 /** precinct step used to localize the packet in the include vector */
95 /** component that identify the packet */
97 /** resolution that identify the packet */
99 /** precinct that identify the packet */
101 /** layer that identify the packet */
103 /** 0 if the first packet */
105 /** progression order change information */
107 /** Packet iterator : component information */
108 opj_pi_comp_t *comps;
117 /** @name Funciones generales */
119 /* ----------------------------------------------------------------------- */
121 Create a packet iterator
122 @param volume Raw volume for which the packets will be listed
123 @param cp Coding parameters
124 @param tileno Number that identifies the tile for which to list the packets
125 @return Returns a packet iterator that points to the first packet of the tile
128 opj_pi_iterator_t *pi_create(opj_volume_t * volume, opj_cp_t * cp, int tileno);
131 Destroy a packet iterator
132 @param pi Previously created packet iterator
133 @param cp Coding parameters
134 @param tileno Number that identifies the tile for which the packets were listed
137 void pi_destroy(opj_pi_iterator_t *pi, opj_cp_t *cp, int tileno);
140 Modify the packet iterator to point to the next packet
141 @param pi Packet iterator to modify
142 @return Returns false if pi pointed to the last packet or else returns true
144 bool pi_next(opj_pi_iterator_t * pi);
145 /* ----------------------------------------------------------------------- */