2 * $Id: phix_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
38 #include "opj_includes.h"
42 * Write faix box of phix
44 * @param[in] coff offset of j2k codestream
45 * @param[in] compno component number
46 * @param[in] cstr_info codestream information
47 * @param[in] EPHused true if if EPH option used
48 * @param[in] j2klen length of j2k codestream
49 * @param[in] cio file output handle
50 * @return length of faix box
52 int write_phixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio);
54 int write_phix( int coff, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
56 int len, lenp=0, compno, i;
59 box = (opj_jp2_box_t *)opj_calloc( cstr_info.numcomps, sizeof(opj_jp2_box_t));
62 if (i) cio_seek( cio, lenp);
64 lenp = cio_tell( cio);
65 cio_skip( cio, 4); /* L [at the end] */
66 cio_write( cio, JPIP_PHIX, 4); /* PHIX */
68 write_manf( i, cstr_info.numcomps, box, cio);
70 for( compno=0; compno<cstr_info.numcomps; compno++){
71 box[compno].length = write_phixfaix( coff, compno, cstr_info, EPHused, j2klen, cio);
72 box[compno].type = JPIP_FAIX;
75 len = cio_tell( cio)-lenp;
77 cio_write( cio, len, 4); /* L */
78 cio_seek( cio, lenp+len);
86 int write_phixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
89 int size_of_coding; // 4 or 8
91 int tileno, resno, precno, layno, num_packet=0;
93 opj_tile_info_t *tile_Idx;
94 opj_packet_info_t packet;
96 if( j2klen > pow( 2, 32)){
105 lenp = cio_tell( cio);
106 cio_skip( cio, 4); /* L [at the end] */
107 cio_write( cio, JPIP_FAIX, 4); /* FAIX */
108 cio_write( cio, version,1); /* Version 0 = 4 bytes */
110 for( i=0; i<=cstr_info.numdecompos[compno]; i++)
111 nmax += cstr_info.tile[0].ph[i] * cstr_info.tile[0].pw[i] * cstr_info.numlayers;
113 cio_write( cio, nmax, size_of_coding); /* NMAX */
114 cio_write( cio, cstr_info.tw*cstr_info.th, size_of_coding); /* M */
116 for( tileno=0; tileno<cstr_info.tw*cstr_info.th; tileno++){
118 tile_Idx = &cstr_info.tile[ tileno];
119 // int correction = EPHused ? 3 : 1;
122 for( resno=0; resno<=cstr_info.numdecompos[compno]; resno++){
123 for( precno=0; precno<tile_Idx->pw[resno]*tile_Idx->ph[resno]; precno++){
124 for( layno=0; layno<cstr_info.numlayers; layno++){
125 packet = tile_Idx->packet[num_packet * cstr_info.numcomps + compno];
126 cio_write( cio, packet.start_pos-coff, size_of_coding); /* start position */
127 cio_write( cio, packet.end_ph_pos-packet.start_pos+1, size_of_coding); /* length */
135 while( num_packet < nmax){
136 cio_write( cio, 0, size_of_coding); /* start position */
137 cio_write( cio, 0, size_of_coding); /* length */
142 len = cio_tell( cio)-lenp;
143 cio_seek( cio, lenp);
144 cio_write( cio, len, 4); /* L */
145 cio_seek( cio, lenp+len);