tpix_manager.c 7.1 KB

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