corrade-vassal – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | vero | 1 | /* |
2 | * $Id: phix_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 <stdlib.h> |
||
37 | #include <math.h> |
||
38 | #include "opj_includes.h" |
||
39 | |||
40 | /* |
||
41 | * Write faix box of phix |
||
42 | * |
||
43 | * @param[in] coff offset of j2k codestream |
||
44 | * @param[in] compno component number |
||
45 | * @param[in] cstr_info codestream information |
||
46 | * @param[in] EPHused true if if EPH option used |
||
47 | * @param[in] j2klen length of j2k codestream |
||
48 | * @param[in] cio file output handle |
||
49 | * @return length of faix box |
||
50 | */ |
||
51 | int write_phixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio); |
||
52 | |||
53 | int write_phix( int coff, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio) |
||
54 | { |
||
55 | int len, lenp=0, compno, i; |
||
56 | opj_jp2_box_t *box; |
||
57 | |||
58 | box = (opj_jp2_box_t *)opj_calloc( cstr_info.numcomps, sizeof(opj_jp2_box_t)); |
||
59 | |||
60 | for( i=0;i<2;i++){ |
||
61 | if (i) cio_seek( cio, lenp); |
||
62 | |||
63 | lenp = cio_tell( cio); |
||
64 | cio_skip( cio, 4); /* L [at the end] */ |
||
65 | cio_write( cio, JPIP_PHIX, 4); /* PHIX */ |
||
66 | |||
67 | write_manf( i, cstr_info.numcomps, box, cio); |
||
68 | |||
69 | for( compno=0; compno<cstr_info.numcomps; compno++){ |
||
70 | box[compno].length = write_phixfaix( coff, compno, cstr_info, EPHused, j2klen, cio); |
||
71 | box[compno].type = JPIP_FAIX; |
||
72 | } |
||
73 | |||
74 | len = cio_tell( cio)-lenp; |
||
75 | cio_seek( cio, lenp); |
||
76 | cio_write( cio, len, 4); /* L */ |
||
77 | cio_seek( cio, lenp+len); |
||
78 | } |
||
79 | |||
80 | opj_free(box); |
||
81 | |||
82 | return len; |
||
83 | } |
||
84 | |||
85 | int write_phixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio) |
||
86 | { |
||
87 | int len, lenp, tileno, version, i, nmax, size_of_coding; /* 4 or 8 */ |
||
88 | opj_tile_info_t *tile_Idx; |
||
89 | opj_packet_info_t packet; |
||
90 | int resno, precno, layno, num_packet; |
||
91 | int numOfres, numOfprec, numOflayers; |
||
92 | packet.end_ph_pos = packet.start_pos = -1; |
||
93 | (void)EPHused; /* unused ? */ |
||
94 | |||
95 | if( j2klen > pow( 2, 32)){ |
||
96 | size_of_coding = 8; |
||
97 | version = 1; |
||
98 | } |
||
99 | else{ |
||
100 | size_of_coding = 4; |
||
101 | version = 0; |
||
102 | } |
||
103 | |||
104 | lenp = cio_tell( cio); |
||
105 | cio_skip( cio, 4); /* L [at the end] */ |
||
106 | cio_write( cio, JPIP_FAIX, 4); /* FAIX */ |
||
107 | cio_write( cio, version,1); /* Version 0 = 4 bytes */ |
||
108 | |||
109 | nmax = 0; |
||
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; |
||
112 | |||
113 | cio_write( cio, nmax, size_of_coding); /* NMAX */ |
||
114 | cio_write( cio, cstr_info.tw*cstr_info.th, size_of_coding); /* M */ |
||
115 | |||
116 | for( tileno=0; tileno<cstr_info.tw*cstr_info.th; tileno++){ |
||
117 | tile_Idx = &cstr_info.tile[ tileno]; |
||
118 | |||
119 | num_packet = 0; |
||
120 | numOfres = cstr_info.numdecompos[compno] + 1; |
||
121 | |||
122 | for( resno=0; resno<numOfres ; resno++){ |
||
123 | numOfprec = tile_Idx->pw[resno]*tile_Idx->ph[resno]; |
||
124 | for( precno=0; precno<numOfprec; precno++){ |
||
125 | numOflayers = cstr_info.numlayers; |
||
126 | for( layno=0; layno<numOflayers; layno++){ |
||
127 | |||
128 | switch ( cstr_info.prog){ |
||
129 | case LRCP: |
||
130 | packet = tile_Idx->packet[ ((layno*numOfres+resno)*cstr_info.numcomps+compno)*numOfprec+precno]; |
||
131 | break; |
||
132 | case RLCP: |
||
133 | packet = tile_Idx->packet[ ((resno*numOflayers+layno)*cstr_info.numcomps+compno)*numOfprec+precno]; |
||
134 | break; |
||
135 | case RPCL: |
||
136 | packet = tile_Idx->packet[ ((resno*numOfprec+precno)*cstr_info.numcomps+compno)*numOflayers+layno]; |
||
137 | break; |
||
138 | case PCRL: |
||
139 | packet = tile_Idx->packet[ ((precno*cstr_info.numcomps+compno)*numOfres+resno)*numOflayers + layno]; |
||
140 | break; |
||
141 | case CPRL: |
||
142 | packet = tile_Idx->packet[ ((compno*numOfprec+precno)*numOfres+resno)*numOflayers + layno]; |
||
143 | break; |
||
144 | default: |
||
145 | fprintf( stderr, "failed to ppix indexing\n"); |
||
146 | } |
||
147 | |||
148 | cio_write( cio, packet.start_pos-coff, size_of_coding); /* start position */ |
||
149 | cio_write( cio, packet.end_ph_pos-packet.start_pos+1, size_of_coding); /* length */ |
||
150 | |||
151 | num_packet++; |
||
152 | } |
||
153 | } |
||
154 | } |
||
155 | |||
156 | /* PADDING */ |
||
157 | while( num_packet < nmax){ |
||
158 | cio_write( cio, 0, size_of_coding); /* start position */ |
||
159 | cio_write( cio, 0, size_of_coding); /* length */ |
||
160 | num_packet++; |
||
161 | } |
||
162 | } |
||
163 | |||
164 | len = cio_tell( cio)-lenp; |
||
165 | cio_seek( cio, lenp); |
||
166 | cio_write( cio, len, 4); /* L */ |
||
167 | cio_seek( cio, lenp+len); |
||
168 | |||
169 | return len; |
||
170 | } |