1/*
2 * $Id: thix_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 <stdio.h>
38#include <string.h>
39#include "opj_includes.h"
40
41/*
42 * Write tile-part headers mhix box
43 *
44 * @param[in] coff      offset of j2k codestream
45 * @param[in] cstr_info codestream information
46 * @param[in] tileno    tile number
47 * @param[in] cio       file output handle
48 * @return              length of mhix box
49 */
50int write_tilemhix( int coff, opj_codestream_info_t cstr_info, int tileno, opj_cio_t *cio);
51
52int write_thix( int coff, opj_codestream_info_t cstr_info, opj_cio_t *cio)
53{
54  int len, lenp, i;
55  int tileno;
56  opj_jp2_box_t *box;
57
58  lenp = 0;
59  box = (opj_jp2_box_t *)opj_calloc( cstr_info.tw*cstr_info.th, sizeof(opj_jp2_box_t));
60
61  for ( i = 0; i < 2 ; i++ ){
62    if (i)
63      cio_seek( cio, lenp);
64
65    lenp = cio_tell( cio);
66    cio_skip( cio, 4);              /* L [at the end] */
67    cio_write( cio, JPIP_THIX, 4);  /* THIX           */
68    write_manf( i, cstr_info.tw*cstr_info.th, box, cio);
69
70    for (tileno = 0; tileno < cstr_info.tw*cstr_info.th; tileno++){
71      box[tileno].length = write_tilemhix( coff, cstr_info, tileno, cio);
72      box[tileno].type = JPIP_MHIX;
73    }
74
75    len = cio_tell( cio)-lenp;
76    cio_seek( cio, lenp);
77    cio_write( cio, len, 4);        /* L              */
78    cio_seek( cio, lenp+len);
79  }
80
81  opj_free(box);
82
83  return len;
84}
85
86int write_tilemhix( int coff, opj_codestream_info_t cstr_info, int tileno, opj_cio_t *cio)
87{
88  int i;
89  opj_tile_info_t tile;
90  opj_tp_info_t tp;
91  int len, lenp;
92  opj_marker_info_t *marker;
93
94  lenp = cio_tell( cio);
95  cio_skip( cio, 4);                               /* L [at the end]                    */
96  cio_write( cio, JPIP_MHIX, 4);                   /* MHIX                              */
97
98  tile = cstr_info.tile[tileno];
99  tp = tile.tp[0];
100
101  cio_write( cio, tp.tp_end_header-tp.tp_start_pos+1, 8);  /* TLEN                              */
102
103  marker = cstr_info.tile[tileno].marker;
104
105  for( i=0; i<cstr_info.tile[tileno].marknum; i++){             /* Marker restricted to 1 apparition */
106    cio_write( cio, marker[i].type, 2);
107    cio_write( cio, 0, 2);
108    cio_write( cio, marker[i].pos-coff, 8);
109    cio_write( cio, marker[i].len, 2);
110  }
111
112  /*  free( marker);*/
113
114  len = cio_tell( cio) - lenp;
115  cio_seek( cio, lenp);
116  cio_write( cio, len, 4);        /* L           */
117  cio_seek( cio, lenp+len);
118
119  return len;
120}
121