155 lines
5.0 KiB
C
155 lines
5.0 KiB
C
/*
|
|
* $Id$
|
|
*
|
|
* Copyright (c) 2002-2011, Communications and Remote Sensing Laboratory, Universite catholique de Louvain (UCL), Belgium
|
|
* Copyright (c) 2002-2011, Professor Benoit Macq
|
|
* Copyright (c) 2003-2004, Yannick Verschueren
|
|
* Copyright (c) 2010-2011, Kaori Hagihara
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
/*! \file
|
|
* \brief Modification of jpip.c from 2KAN indexer
|
|
*/
|
|
|
|
#include <math.h>
|
|
#include "indexbox_manager.h"
|
|
#include "cio_ext.h"
|
|
#include "cio.h"
|
|
|
|
#define MAX(a,b) ((a)>(b)?(a):(b))
|
|
|
|
|
|
/*
|
|
* Write faix box of tpix
|
|
*
|
|
* @param[in] compno component number
|
|
* @param[in] cstr_info codestream information
|
|
* @param[in] j2klen length of j2k codestream
|
|
* @param[in] cio file output handle
|
|
* @return length of faix box
|
|
*/
|
|
int write_tpixfaix( int compno, opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio);
|
|
|
|
|
|
int write_tpix( opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio)
|
|
{
|
|
int len, lenp;
|
|
lenp = cio_tell( cio);
|
|
cio_skip( cio, 4); /* L [at the end] */
|
|
cio_write( cio, JPIP_TPIX, 4); /* TPIX */
|
|
|
|
write_tpixfaix( 0, cstr_info, j2klen, cio);
|
|
|
|
len = cio_tell( cio)-lenp;
|
|
cio_seek( cio, lenp);
|
|
cio_write( cio, len, 4); /* L */
|
|
cio_seek( cio, lenp+len);
|
|
|
|
return len;
|
|
}
|
|
|
|
|
|
/*
|
|
* Get number of maximum tile parts per tile
|
|
*
|
|
* @param[in] cstr_info codestream information
|
|
* @return number of maximum tile parts per tile
|
|
*/
|
|
int get_num_max_tile_parts( opj_codestream_info_t cstr_info);
|
|
|
|
int write_tpixfaix( int compno, opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio)
|
|
{
|
|
int len, lenp;
|
|
int i, j;
|
|
int Aux;
|
|
int num_max_tile_parts;
|
|
int size_of_coding; // 4 or 8
|
|
opj_tp_info_t tp;
|
|
int version;
|
|
|
|
num_max_tile_parts = get_num_max_tile_parts( cstr_info);
|
|
|
|
if( j2klen > pow( 2, 32)){
|
|
size_of_coding = 8;
|
|
version = num_max_tile_parts == 1 ? 1:3;
|
|
}
|
|
else{
|
|
size_of_coding = 4;
|
|
version = num_max_tile_parts == 1 ? 0:2;
|
|
}
|
|
|
|
lenp = cio_tell( cio);
|
|
cio_skip( cio, 4); /* L [at the end] */
|
|
cio_write( cio, JPIP_FAIX, 4); /* FAIX */
|
|
cio_write( cio, version, 1); /* Version 0 = 4 bytes */
|
|
|
|
cio_ext_write( cio, num_max_tile_parts, size_of_coding); /* NMAX */
|
|
cio_ext_write( cio, cstr_info.tw*cstr_info.th, size_of_coding); /* M */
|
|
for (i = 0; i < cstr_info.tw*cstr_info.th; i++){
|
|
for (j = 0; j < cstr_info.tile[i].num_tps; j++){
|
|
tp = cstr_info.tile[i].tp[j];
|
|
cio_ext_write( cio, tp.tp_start_pos, size_of_coding); /* start position */
|
|
cio_ext_write( cio, tp.tp_end_pos-tp.tp_start_pos+1, size_of_coding); /* length */
|
|
if (version & 0x02){
|
|
if( cstr_info.tile[i].num_tps == 1 && cstr_info.numdecompos[compno] > 1)
|
|
Aux = cstr_info.numdecompos[compno] + 1;
|
|
else
|
|
Aux = j + 1;
|
|
|
|
cio_write( cio, Aux,4);
|
|
//cio_write(img.tile[i].tile_parts[j].num_reso_AUX,4); /* Aux_i,j : Auxiliary value */
|
|
// fprintf(stderr,"AUX value %d\n",Aux);
|
|
}
|
|
//cio_write(0,4);
|
|
}
|
|
/* PADDING */
|
|
while (j < num_max_tile_parts){
|
|
cio_ext_write( cio, 0, size_of_coding); /* start position */
|
|
cio_ext_write( cio, 0, size_of_coding); /* length */
|
|
if (version & 0x02)
|
|
cio_write( cio, 0,4); /* Aux_i,j : Auxiliary value */
|
|
j++;
|
|
}
|
|
}
|
|
|
|
len = cio_tell( cio)-lenp;
|
|
cio_seek( cio, lenp);
|
|
cio_write( cio, len, 4); /* L */
|
|
cio_seek( cio, lenp+len);
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
int get_num_max_tile_parts( opj_codestream_info_t cstr_info)
|
|
{
|
|
int num_max_tp = 0, i;
|
|
|
|
for( i=0; i<cstr_info.tw*cstr_info.th; i++)
|
|
num_max_tp = MAX( cstr_info.tile[i].num_tps, num_max_tp);
|
|
|
|
return num_max_tp;
|
|
}
|