corrade-vassal – Blame information for rev 1

Subversion Repositories:
Rev:
Rev Author Line No. Line
1 vero 1 /*
2 * $Id: ppix_manager.c 897 2011-08-28 21:43:57Z Kaori.Hagihara@gmail.com $
3 *
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
8 * All rights reserved.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
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.
18 *
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.
30 */
31  
32 /*! \file
33 * \brief Modification of jpip.c from 2KAN indexer
34 */
35  
36 #include <stdio.h>
37 #include <stdlib.h>
38 #include <math.h>
39 #include "opj_includes.h"
40  
41 /*
42 * Write faix box of ppix
43 *
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
51 */
52 int write_ppixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio);
53  
54 int write_ppix( int coff, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
55 {
56 int len, lenp, compno, i;
57 opj_jp2_box_t *box;
58  
59 /* printf("cstr_info.packno %d\n", cstr_info.packno); //NMAX? */
60  
61 lenp = -1;
62 box = (opj_jp2_box_t *)opj_calloc( cstr_info.numcomps, sizeof(opj_jp2_box_t));
63  
64 for (i=0;i<2;i++){
65 if (i) cio_seek( cio, lenp);
66  
67 lenp = cio_tell( cio);
68 cio_skip( cio, 4); /* L [at the end] */
69 cio_write( cio, JPIP_PPIX, 4); /* PPIX */
70  
71 write_manf( i, cstr_info.numcomps, box, cio);
72  
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;
76 }
77  
78 len = cio_tell( cio)-lenp;
79 cio_seek( cio, lenp);
80 cio_write( cio, len, 4); /* L */
81 cio_seek( cio, lenp+len);
82 }
83  
84 opj_free(box);
85  
86 return len;
87 }
88  
89 int write_ppixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
90 {
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 ? */
98  
99 if( j2klen > pow( 2, 32)){
100 size_of_coding = 8;
101 version = 1;
102 }
103 else{
104 size_of_coding = 4;
105 version = 0;
106 }
107  
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 */
112  
113 nmax = 0;
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;
116  
117 cio_write( cio, nmax, size_of_coding); /* NMAX */
118 cio_write( cio, cstr_info.tw*cstr_info.th, size_of_coding); /* M */
119  
120 for( tileno=0; tileno<cstr_info.tw*cstr_info.th; tileno++){
121 tile_Idx = &cstr_info.tile[ tileno];
122  
123 num_packet=0;
124 numOfres = cstr_info.numdecompos[compno] + 1;
125  
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++){
131  
132 switch ( cstr_info.prog){
133 case LRCP:
134 packet = tile_Idx->packet[ ((layno*numOfres+resno)*cstr_info.numcomps+compno)*numOfprec+precno];
135 break;
136 case RLCP:
137 packet = tile_Idx->packet[ ((resno*numOflayers+layno)*cstr_info.numcomps+compno)*numOfprec+precno];
138 break;
139 case RPCL:
140 packet = tile_Idx->packet[ ((resno*numOfprec+precno)*cstr_info.numcomps+compno)*numOflayers+layno];
141 break;
142 case PCRL:
143 packet = tile_Idx->packet[ ((precno*cstr_info.numcomps+compno)*numOfres+resno)*numOflayers + layno];
144 break;
145 case CPRL:
146 packet = tile_Idx->packet[ ((compno*numOfprec+precno)*numOfres+resno)*numOflayers + layno];
147 break;
148 default:
149 fprintf( stderr, "failed to ppix indexing\n");
150 }
151  
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 */
154  
155 num_packet++;
156 }
157 }
158 }
159  
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 */
163 num_packet++;
164 }
165 }
166  
167 len = cio_tell( cio)-lenp;
168 cio_seek( cio, lenp);
169 cio_write( cio, len, 4); /* L */
170 cio_seek( cio, lenp+len);
171  
172 return len;
173 }