148 lines
4.9 KiB
C
148 lines
4.9 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 <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <math.h>
|
|
#include "indexbox_manager.h"
|
|
#include "cio_ext.h"
|
|
#include "cio.h"
|
|
|
|
/*
|
|
* Write faix box of ppix
|
|
*
|
|
* @param[in] compno component number
|
|
* @param[in] cstr_info codestream information
|
|
* @param[in] EPHused true if if EPH option used
|
|
* @param[in] j2klen length of j2k codestream
|
|
* @param[in] cio file output handle
|
|
* @return length of faix box
|
|
*/
|
|
int write_ppixfaix( int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio);
|
|
|
|
int write_ppix( opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
|
|
{
|
|
int len, lenp, compno, i;
|
|
opj_jp2_box_t *box;
|
|
|
|
printf("cstr_info.packno %d\n", cstr_info.packno); //NMAX?
|
|
|
|
box = (opj_jp2_box_t *)calloc( cstr_info.numcomps, sizeof(opj_jp2_box_t));
|
|
|
|
for (i=0;i<2;i++){
|
|
if (i) cio_seek( cio, lenp);
|
|
|
|
lenp = cio_tell( cio);
|
|
cio_skip( cio, 4); /* L [at the end] */
|
|
cio_write( cio, JPIP_PPIX, 4); /* PPIX */
|
|
|
|
write_manf( i, cstr_info.numcomps, box, cio);
|
|
|
|
for (compno=0; compno<cstr_info.numcomps; compno++){
|
|
box[compno].length = write_ppixfaix( compno, cstr_info, EPHused, j2klen, cio);
|
|
box[compno].type = JPIP_FAIX;
|
|
}
|
|
|
|
len = cio_tell( cio)-lenp;
|
|
cio_seek( cio, lenp);
|
|
cio_write( cio, len, 4); /* L */
|
|
cio_seek( cio, lenp+len);
|
|
}
|
|
|
|
free(box);
|
|
|
|
return len;
|
|
}
|
|
|
|
// NMAX might be wrong , phix too, do sth to correction
|
|
int write_ppixfaix( int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
|
|
{
|
|
int len, lenp;
|
|
int tileno, resno, precno, layno, num_packet=0;
|
|
int size_of_coding; // 4 or 8
|
|
int version;
|
|
|
|
if( j2klen > pow( 2, 32)){
|
|
size_of_coding = 8;
|
|
version = 1;
|
|
}
|
|
else{
|
|
size_of_coding = 4;
|
|
version = 0;
|
|
}
|
|
|
|
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, cstr_info.packno, size_of_coding); /* NMAX */
|
|
cio_ext_write( cio, cstr_info.tw*cstr_info.th, size_of_coding); /* M */
|
|
|
|
for( tileno=0; tileno<cstr_info.tw*cstr_info.th; tileno++){
|
|
|
|
opj_tile_info_t *tile_Idx = &cstr_info.tile[ tileno];
|
|
// int correction = EPHused ? 3 : 1;
|
|
num_packet=0;
|
|
|
|
for( resno=0; resno< cstr_info.numdecompos[compno]+1; resno++){
|
|
for( precno=0; precno<tile_Idx->pw[resno]*tile_Idx->ph[resno]; precno++){
|
|
for( layno=0; layno<cstr_info.numlayers; layno++){
|
|
opj_packet_info_t packet = tile_Idx->packet[num_packet];
|
|
cio_ext_write( cio, packet.start_pos, size_of_coding); /* start position */
|
|
cio_ext_write( cio, packet.end_pos-packet.start_pos+1, size_of_coding); /* length */
|
|
|
|
num_packet++;
|
|
}
|
|
}
|
|
}
|
|
|
|
/* PADDING */
|
|
while( num_packet < cstr_info.packno){
|
|
cio_ext_write( cio, 0, size_of_coding); /* start position */
|
|
cio_ext_write( cio, 0, size_of_coding); /* length */
|
|
num_packet++;
|
|
}
|
|
}
|
|
|
|
len = cio_tell( cio)-lenp;
|
|
cio_seek( cio, lenp);
|
|
cio_write( cio, len, 4); /* L */
|
|
cio_seek( cio, lenp+len);
|
|
|
|
return len;
|
|
|
|
}
|