2
* $Id: ppix_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
39
#include "opj_includes.h"
42
* Write faix box of ppix
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_ppixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio);
54
int write_ppix( int coff, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
56
int len, lenp, compno, i;
59
/* printf("cstr_info.packno %d\n", cstr_info.packno); //NMAX? */
62
box = (opj_jp2_box_t *)opj_calloc( cstr_info.numcomps, sizeof(opj_jp2_box_t));
65
if (i) cio_seek( cio, lenp);
67
lenp = cio_tell( cio);
68
cio_skip( cio, 4); /* L [at the end] */
69
cio_write( cio, JPIP_PPIX, 4); /* PPIX */
71
write_manf( i, cstr_info.numcomps, box, cio);
73
for (compno=0; compno<cstr_info.numcomps; compno++){
74
box[compno].length = write_ppixfaix( coff, compno, cstr_info, EPHused, j2klen, cio);
75
box[compno].type = JPIP_FAIX;
78
len = cio_tell( cio)-lenp;
80
cio_write( cio, len, 4); /* L */
81
cio_seek( cio, lenp+len);
89
int write_ppixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
91
int len, lenp, tileno, version, i, nmax, size_of_coding; /* 4 or 8*/
92
opj_tile_info_t *tile_Idx;
93
opj_packet_info_t packet;
94
int resno, precno, layno, num_packet;
95
int numOfres, numOfprec, numOflayers;
96
packet.end_pos = packet.end_ph_pos = packet.start_pos = -1;
97
(void)EPHused; /* unused ? */
99
if( j2klen > pow( 2, 32)){
108
lenp = cio_tell( cio);
109
cio_skip( cio, 4); /* L [at the end] */
110
cio_write( cio, JPIP_FAIX, 4); /* FAIX */
111
cio_write( cio, version, 1); /* Version 0 = 4 bytes */
114
for( i=0; i<=cstr_info.numdecompos[compno]; i++)
115
nmax += cstr_info.tile[0].ph[i] * cstr_info.tile[0].pw[i] * cstr_info.numlayers;
117
cio_write( cio, nmax, size_of_coding); /* NMAX */
118
cio_write( cio, cstr_info.tw*cstr_info.th, size_of_coding); /* M */
120
for( tileno=0; tileno<cstr_info.tw*cstr_info.th; tileno++){
121
tile_Idx = &cstr_info.tile[ tileno];
124
numOfres = cstr_info.numdecompos[compno] + 1;
126
for( resno=0; resno<numOfres ; resno++){
127
numOfprec = tile_Idx->pw[resno]*tile_Idx->ph[resno];
128
for( precno=0; precno<numOfprec; precno++){
129
numOflayers = cstr_info.numlayers;
130
for( layno=0; layno<numOflayers; layno++){
132
switch ( cstr_info.prog){
134
packet = tile_Idx->packet[ ((layno*numOfres+resno)*cstr_info.numcomps+compno)*numOfprec+precno];
137
packet = tile_Idx->packet[ ((resno*numOflayers+layno)*cstr_info.numcomps+compno)*numOfprec+precno];
140
packet = tile_Idx->packet[ ((resno*numOfprec+precno)*cstr_info.numcomps+compno)*numOflayers+layno];
143
packet = tile_Idx->packet[ ((precno*cstr_info.numcomps+compno)*numOfres+resno)*numOflayers + layno];
146
packet = tile_Idx->packet[ ((compno*numOfprec+precno)*numOfres+resno)*numOflayers + layno];
149
fprintf( stderr, "failed to ppix indexing\n");
152
cio_write( cio, packet.start_pos-coff, size_of_coding); /* start position */
153
cio_write( cio, packet.end_pos-packet.start_pos+1, size_of_coding); /* length */
160
while( num_packet < nmax){ /* PADDING */
161
cio_write( cio, 0, size_of_coding); /* start position */
162
cio_write( cio, 0, size_of_coding); /* length */
167
len = cio_tell( cio)-lenp;
168
cio_seek( cio, lenp);
169
cio_write( cio, len, 4); /* L */
170
cio_seek( cio, lenp+len);