2 * $Id: tpix_manager.c 897 2011-08-28 21:43:57Z Kaori.Hagihara@gmail.com $
4 * Copyright (c) 2002-2011, Communications and Remote Sensing Laboratory, Universite catholique de Louvain (UCL), Belgium
5 * Copyright (c) 2002-2011, Professor Benoit Macq
6 * Copyright (c) 2003-2004, Yannick Verschueren
7 * Copyright (c) 2010-2011, Kaori Hagihara
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.
33 * \brief Modification of jpip.c from 2KAN indexer
36 #include "opj_includes.h"
38 #define MAX(a,b) ((a)>(b)?(a):(b))
42 * Write faix box of tpix
44 * @param[in] coff offset of j2k codestream
45 * @param[in] compno component number
46 * @param[in] cstr_info codestream information
47 * @param[in] j2klen length of j2k codestream
48 * @param[in] cio file output handle
49 * @return length of faix box
51 int write_tpixfaix( int coff, int compno, opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio);
54 int write_tpix( int coff, opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio)
57 lenp = cio_tell( cio);
58 cio_skip( cio, 4); /* L [at the end] */
59 cio_write( cio, JPIP_TPIX, 4); /* TPIX */
61 write_tpixfaix( coff, 0, cstr_info, j2klen, cio);
63 len = cio_tell( cio)-lenp;
65 cio_write( cio, len, 4); /* L */
66 cio_seek( cio, lenp+len);
73 * Get number of maximum tile parts per tile
75 * @param[in] cstr_info codestream information
76 * @return number of maximum tile parts per tile
78 int get_num_max_tile_parts( opj_codestream_info_t cstr_info);
80 int write_tpixfaix( int coff, int compno, opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio)
85 int num_max_tile_parts;
86 int size_of_coding; /* 4 or 8 */
90 num_max_tile_parts = get_num_max_tile_parts( cstr_info);
92 if( j2klen > pow( 2, 32)){
94 version = num_max_tile_parts == 1 ? 1:3;
98 version = num_max_tile_parts == 1 ? 0:2;
101 lenp = cio_tell( cio);
102 cio_skip( cio, 4); /* L [at the end] */
103 cio_write( cio, JPIP_FAIX, 4); /* FAIX */
104 cio_write( cio, version, 1); /* Version 0 = 4 bytes */
106 cio_write( cio, num_max_tile_parts, size_of_coding); /* NMAX */
107 cio_write( cio, cstr_info.tw*cstr_info.th, size_of_coding); /* M */
108 for (i = 0; i < cstr_info.tw*cstr_info.th; i++){
109 for (j = 0; j < cstr_info.tile[i].num_tps; j++){
110 tp = cstr_info.tile[i].tp[j];
111 cio_write( cio, tp.tp_start_pos-coff, size_of_coding); /* start position */
112 cio_write( cio, tp.tp_end_pos-tp.tp_start_pos+1, size_of_coding); /* length */
114 if( cstr_info.tile[i].num_tps == 1 && cstr_info.numdecompos[compno] > 1)
115 Aux = cstr_info.numdecompos[compno] + 1;
119 cio_write( cio, Aux,4);
120 /*cio_write(img.tile[i].tile_parts[j].num_reso_AUX,4);*/ /* Aux_i,j : Auxiliary value */
121 /* fprintf(stderr,"AUX value %d\n",Aux);*/
126 while (j < num_max_tile_parts){
127 cio_write( cio, 0, size_of_coding); /* start position */
128 cio_write( cio, 0, size_of_coding); /* length */
130 cio_write( cio, 0,4); /* Aux_i,j : Auxiliary value */
135 len = cio_tell( cio)-lenp;
136 cio_seek( cio, lenp);
137 cio_write( cio, len, 4); /* L */
138 cio_seek( cio, lenp+len);
144 int get_num_max_tile_parts( opj_codestream_info_t cstr_info)
146 int num_max_tp = 0, i;
148 for( i=0; i<cstr_info.tw*cstr_info.th; i++)
149 num_max_tp = MAX( cstr_info.tile[i].num_tps, num_max_tp);