1/*
2 * $Id: tpix_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 <math.h>
37#include "opj_includes.h"
38
39#define MAX(a,b) ((a)>(b)?(a):(b))
40
41
42/*
43 * Write faix box of tpix
44 *
45 * @param[in] coff offset of j2k codestream
46 * @param[in] compno    component number
47 * @param[in] cstr_info codestream information
48 * @param[in] j2klen    length of j2k codestream
49 * @param[in] cio       file output handle
50 * @return              length of faix box
51 */
52int write_tpixfaix( int coff, int compno, opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio);
53
54
55int write_tpix( int coff, opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio)
56{
57  int len, lenp;
58  lenp = cio_tell( cio);
59  cio_skip( cio, 4);              /* L [at the end] */
60  cio_write( cio, JPIP_TPIX, 4);  /* TPIX           */
61
62  write_tpixfaix( coff, 0, cstr_info, j2klen, cio);
63
64  len = cio_tell( cio)-lenp;
65  cio_seek( cio, lenp);
66  cio_write( cio, len, 4);        /* L              */
67  cio_seek( cio, lenp+len);
68
69  return len;
70}
71
72
73/*
74 * Get number of maximum tile parts per tile
75 *
76 * @param[in] cstr_info codestream information
77 * @return              number of maximum tile parts per tile
78 */
79int get_num_max_tile_parts( opj_codestream_info_t cstr_info);
80
81int write_tpixfaix( int coff, int compno, opj_codestream_info_t cstr_info, int j2klen, opj_cio_t *cio)
82{
83  int len, lenp;
84  int i, j;
85  int Aux;
86  int num_max_tile_parts;
87  int size_of_coding; /* 4 or 8 */
88  opj_tp_info_t tp;
89  int version;
90
91  num_max_tile_parts = get_num_max_tile_parts( cstr_info);
92
93  if( j2klen > pow( 2, 32)){
94    size_of_coding =  8;
95    version = num_max_tile_parts == 1 ? 1:3;
96  }
97  else{
98    size_of_coding = 4;
99    version = num_max_tile_parts == 1 ? 0:2;
100  }
101
102  lenp = cio_tell( cio);
103  cio_skip( cio, 4);              /* L [at the end]      */
104  cio_write( cio, JPIP_FAIX, 4);  /* FAIX                */
105  cio_write( cio, version, 1);     /* Version 0 = 4 bytes */
106
107  cio_write( cio, num_max_tile_parts, size_of_coding);                      /* NMAX           */
108  cio_write( cio, cstr_info.tw*cstr_info.th, size_of_coding);                               /* M              */
109  for (i = 0; i < cstr_info.tw*cstr_info.th; i++){
110    for (j = 0; j < cstr_info.tile[i].num_tps; j++){
111      tp = cstr_info.tile[i].tp[j];
112      cio_write( cio, tp.tp_start_pos-coff, size_of_coding); /* start position */
113      cio_write( cio, tp.tp_end_pos-tp.tp_start_pos+1, size_of_coding);    /* length         */
114      if (version & 0x02){
115	if( cstr_info.tile[i].num_tps == 1 && cstr_info.numdecompos[compno] > 1)
116	  Aux = cstr_info.numdecompos[compno] + 1;
117	else
118	  Aux = j + 1;
119
120	cio_write( cio, Aux,4);
121	/*cio_write(img.tile[i].tile_parts[j].num_reso_AUX,4);*/ /* Aux_i,j : Auxiliary value */
122	/* fprintf(stderr,"AUX value %d\n",Aux);*/
123      }
124      /*cio_write(0,4);*/
125    }
126    /* PADDING */
127    while (j < num_max_tile_parts){
128      cio_write( cio, 0, size_of_coding); /* start position            */
129      cio_write( cio, 0, size_of_coding); /* length                    */
130      if (version & 0x02)
131	cio_write( cio, 0,4);                  /* Aux_i,j : Auxiliary value */
132      j++;
133    }
134  }
135
136  len = cio_tell( cio)-lenp;
137  cio_seek( cio, lenp);
138  cio_write( cio, len, 4);        /* L  */
139  cio_seek( cio, lenp+len);
140
141  return len;
142
143}
144
145int get_num_max_tile_parts( opj_codestream_info_t cstr_info)
146{
147  int num_max_tp = 0, i;
148
149  for( i=0; i<cstr_info.tw*cstr_info.th; i++)
150    num_max_tp = MAX( cstr_info.tile[i].num_tps, num_max_tp);
151
152  return num_max_tp;
153}
154