thix_manager.c 5.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146
  1. /*
  2. * $Id: thix_manager.c 897 2011-08-28 21:43:57Z Kaori.Hagihara@gmail.com $
  3. *
  4. * Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
  5. * Copyright (c) 2002-2014, 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. /*! \file
  32. * \brief Modification of jpip.c from 2KAN indexer
  33. */
  34. #include "opj_includes.h"
  35. int opj_write_thix(int coff, opj_codestream_info_t cstr_info,
  36. opj_stream_private_t *cio,
  37. opj_event_mgr_t * p_manager)
  38. {
  39. OPJ_BYTE l_data_header [4];
  40. int i;
  41. int tileno;
  42. opj_jp2_box_t *box;
  43. OPJ_UINT32 len;
  44. OPJ_OFF_T lenp;
  45. lenp = 0;
  46. box = (opj_jp2_box_t *)opj_calloc((size_t)(cstr_info.tw * cstr_info.th),
  47. sizeof(opj_jp2_box_t));
  48. if (box == NULL) {
  49. return 0;
  50. }
  51. for (i = 0; i < 2 ; i++) {
  52. if (i) {
  53. opj_stream_seek(cio, lenp, p_manager);
  54. }
  55. lenp = opj_stream_tell(cio);
  56. opj_stream_skip(cio, 4, p_manager); /* L [at the end] */
  57. opj_write_bytes(l_data_header, JPIP_THIX, 4); /* THIX */
  58. opj_stream_write_data(cio, l_data_header, 4, p_manager);
  59. opj_write_manf(i, cstr_info.tw * cstr_info.th, box, cio, p_manager);
  60. for (tileno = 0; tileno < cstr_info.tw * cstr_info.th; tileno++) {
  61. box[tileno].length = (OPJ_UINT32)opj_write_tilemhix(coff, cstr_info, tileno,
  62. cio, p_manager);
  63. box[tileno].type = JPIP_MHIX;
  64. }
  65. len = (OPJ_UINT32)(opj_stream_tell(cio) - lenp);
  66. opj_stream_seek(cio, lenp, p_manager);
  67. opj_write_bytes(l_data_header, len, 4); /* L */
  68. opj_stream_write_data(cio, l_data_header, 4, p_manager);
  69. opj_stream_seek(cio, lenp + len, p_manager);
  70. }
  71. opj_free(box);
  72. return (int)len;
  73. }
  74. /*
  75. * Write tile-part headers mhix box
  76. *
  77. * @param[in] coff offset of j2k codestream
  78. * @param[in] cstr_info codestream information
  79. * @param[in] tileno tile number
  80. * @param[in] cio file output handle
  81. * @return length of mhix box
  82. */
  83. int opj_write_tilemhix(int coff, opj_codestream_info_t cstr_info, int tileno,
  84. opj_stream_private_t *cio,
  85. opj_event_mgr_t * p_manager)
  86. {
  87. OPJ_BYTE l_data_header [8];
  88. int i;
  89. opj_tile_info_t tile;
  90. opj_tp_info_t tp;
  91. opj_marker_info_t *marker;
  92. OPJ_UINT32 len;
  93. OPJ_OFF_T lenp;
  94. lenp = opj_stream_tell(cio);
  95. opj_stream_skip(cio, 4,
  96. p_manager); /* L [at the end] */
  97. opj_write_bytes(l_data_header, JPIP_MHIX,
  98. 4); /* MHIX */
  99. opj_stream_write_data(cio, l_data_header, 4, p_manager);
  100. tile = cstr_info.tile[tileno];
  101. tp = tile.tp[0];
  102. opj_write_bytes(l_data_header,
  103. (OPJ_UINT32)(tp.tp_end_header - tp.tp_start_pos + 1),
  104. 8); /* TLEN */
  105. opj_stream_write_data(cio, l_data_header, 8, p_manager);
  106. marker = cstr_info.tile[tileno].marker;
  107. for (i = 0; i < cstr_info.tile[tileno].marknum;
  108. i++) { /* Marker restricted to 1 apparition */
  109. opj_write_bytes(l_data_header, marker[i].type, 2);
  110. opj_write_bytes(l_data_header + 2, 0, 2);
  111. opj_stream_write_data(cio, l_data_header, 4, p_manager);
  112. opj_write_bytes(l_data_header, (OPJ_UINT32)(marker[i].pos - coff), 8);
  113. opj_stream_write_data(cio, l_data_header, 8, p_manager);
  114. opj_write_bytes(l_data_header, (OPJ_UINT32)marker[i].len, 2);
  115. opj_stream_write_data(cio, l_data_header, 2, p_manager);
  116. }
  117. /* free( marker);*/
  118. len = (OPJ_UINT32)(opj_stream_tell(cio) - lenp);
  119. opj_stream_seek(cio, lenp, p_manager);
  120. opj_write_bytes(l_data_header, len, 4); /* L */
  121. opj_stream_write_data(cio, l_data_header, 4, p_manager);
  122. opj_stream_seek(cio, lenp + len, p_manager);
  123. return (int)len;
  124. }