ppix_manager.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215
  1. /*
  2. * $Id: ppix_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. /*
  36. * Write faix box of ppix
  37. *
  38. * @param[in] coff offset of j2k codestream
  39. * @param[in] compno component number
  40. * @param[in] cstr_info codestream information
  41. * @param[in] EPHused true if if EPH option used
  42. * @param[in] j2klen length of j2k codestream
  43. * @param[in] cio file output handle
  44. * @return length of faix box
  45. */
  46. int opj_write_ppix(int coff, opj_codestream_info_t cstr_info, OPJ_BOOL EPHused,
  47. int j2klen, opj_stream_private_t *cio,
  48. opj_event_mgr_t * p_manager)
  49. {
  50. OPJ_BYTE l_data_header [4];
  51. int compno, i;
  52. opj_jp2_box_t *box;
  53. OPJ_OFF_T lenp;
  54. OPJ_UINT32 len;
  55. /* printf("cstr_info.packno %d\n", cstr_info.packno); //NMAX? */
  56. lenp = -1;
  57. box = (opj_jp2_box_t *)opj_calloc((size_t)cstr_info.numcomps,
  58. sizeof(opj_jp2_box_t));
  59. if (box == NULL) {
  60. return 0;
  61. }
  62. for (i = 0; i < 2; i++) {
  63. if (i)
  64. {
  65. opj_stream_seek(cio, lenp, p_manager);
  66. }
  67. lenp = (OPJ_UINT32)(opj_stream_tell(cio));
  68. opj_stream_skip(cio, 4, p_manager); /* L [at the end] */
  69. opj_write_bytes(l_data_header, JPIP_PPIX, 4); /* PPIX */
  70. opj_stream_write_data(cio, l_data_header, 4, p_manager);
  71. opj_write_manf(i, cstr_info.numcomps, box, cio, p_manager);
  72. for (compno = 0; compno < cstr_info.numcomps; compno++) {
  73. box[compno].length = (OPJ_UINT32)opj_write_ppixfaix(coff, compno, cstr_info,
  74. EPHused, j2klen, cio, p_manager);
  75. box[compno].type = JPIP_FAIX;
  76. }
  77. len = (OPJ_UINT32)(opj_stream_tell(cio) - lenp);
  78. opj_stream_seek(cio, lenp, p_manager);
  79. opj_write_bytes(l_data_header, len, 4); /* L */
  80. opj_stream_write_data(cio, l_data_header, 4, p_manager);
  81. opj_stream_seek(cio, lenp + len, p_manager);
  82. }
  83. opj_free(box);
  84. return (int)len;
  85. }
  86. int opj_write_ppixfaix(int coff, int compno, opj_codestream_info_t cstr_info,
  87. OPJ_BOOL EPHused, int j2klen, opj_stream_private_t *cio,
  88. opj_event_mgr_t * p_manager)
  89. {
  90. OPJ_BYTE l_data_header [8];
  91. OPJ_UINT32 tileno, version, i, nmax, size_of_coding; /* 4 or 8*/
  92. OPJ_UINT32 len;
  93. OPJ_OFF_T lenp;
  94. opj_tile_info_t *tile_Idx;
  95. opj_packet_info_t packet;
  96. int resno, precno, layno;
  97. OPJ_UINT32 num_packet;
  98. int numOfres, numOfprec, numOflayers;
  99. packet.end_pos = packet.end_ph_pos = packet.start_pos = -1;
  100. (void)EPHused; /* unused ? */
  101. if (j2klen > pow(2, 32)) {
  102. size_of_coding = 8;
  103. version = 1;
  104. } else {
  105. size_of_coding = 4;
  106. version = 0;
  107. }
  108. lenp = opj_stream_tell(cio);
  109. opj_stream_skip(cio, 4, p_manager); /* L [at the end] */
  110. opj_write_bytes(l_data_header, JPIP_FAIX, 4); /* FAIX */
  111. opj_write_bytes(l_data_header, version, 1);
  112. opj_stream_write_data(cio, l_data_header, 1,
  113. p_manager); /* Version 0 = 4 bytes */
  114. nmax = 0;
  115. for (i = 0; i <= (OPJ_UINT32)cstr_info.numdecompos[compno]; i++) {
  116. nmax += (OPJ_UINT32)(cstr_info.tile[0].ph[i] * cstr_info.tile[0].pw[i] *
  117. cstr_info.numlayers);
  118. }
  119. opj_write_bytes(l_data_header, nmax, size_of_coding); /* NMAX */
  120. opj_stream_write_data(cio, l_data_header, size_of_coding, p_manager);
  121. opj_write_bytes(l_data_header, (OPJ_UINT32)(cstr_info.tw * cstr_info.th),
  122. size_of_coding); /* M */
  123. opj_stream_write_data(cio, l_data_header, size_of_coding, p_manager);
  124. for (tileno = 0; tileno < (OPJ_UINT32)(cstr_info.tw * cstr_info.th); tileno++) {
  125. tile_Idx = &cstr_info.tile[ tileno];
  126. num_packet = 0;
  127. numOfres = cstr_info.numdecompos[compno] + 1;
  128. for (resno = 0; resno < numOfres ; resno++) {
  129. numOfprec = tile_Idx->pw[resno] * tile_Idx->ph[resno];
  130. for (precno = 0; precno < numOfprec; precno++) {
  131. numOflayers = cstr_info.numlayers;
  132. for (layno = 0; layno < numOflayers; layno++) {
  133. switch (cstr_info.prog) {
  134. case OPJ_LRCP:
  135. packet = tile_Idx->packet[((layno * numOfres + resno) * cstr_info.numcomps +
  136. compno) * numOfprec + precno];
  137. break;
  138. case OPJ_RLCP:
  139. packet = tile_Idx->packet[((resno * numOflayers + layno) * cstr_info.numcomps +
  140. compno) * numOfprec + precno];
  141. break;
  142. case OPJ_RPCL:
  143. packet = tile_Idx->packet[((resno * numOfprec + precno) * cstr_info.numcomps +
  144. compno) * numOflayers + layno];
  145. break;
  146. case OPJ_PCRL:
  147. packet = tile_Idx->packet[((precno * cstr_info.numcomps + compno) * numOfres +
  148. resno) * numOflayers + layno];
  149. break;
  150. case OPJ_CPRL:
  151. packet = tile_Idx->packet[((compno * numOfprec + precno) * numOfres + resno) *
  152. numOflayers + layno];
  153. break;
  154. default:
  155. fprintf(stderr, "failed to ppix indexing\n");
  156. }
  157. opj_write_bytes(l_data_header, (OPJ_UINT32)(packet.start_pos - coff),
  158. size_of_coding); /* start position */
  159. opj_stream_write_data(cio, l_data_header, size_of_coding, p_manager);
  160. opj_write_bytes(l_data_header,
  161. (OPJ_UINT32)(packet.end_pos - packet.start_pos + 1),
  162. size_of_coding); /* length */
  163. opj_stream_write_data(cio, l_data_header, size_of_coding, p_manager);
  164. num_packet++;
  165. }
  166. }
  167. }
  168. while (num_packet < nmax) { /* PADDING */
  169. opj_write_bytes(l_data_header, 0,
  170. size_of_coding); /* start position */
  171. opj_stream_write_data(cio, l_data_header, size_of_coding, p_manager);
  172. opj_write_bytes(l_data_header, 0,
  173. size_of_coding); /* length */
  174. opj_stream_write_data(cio, l_data_header, size_of_coding, p_manager);
  175. num_packet++;
  176. }
  177. }
  178. len = (OPJ_UINT32)(opj_stream_tell(cio) - lenp);
  179. opj_stream_seek(cio, lenp, p_manager);
  180. opj_write_bytes(l_data_header, len, 4); /* L */
  181. opj_stream_write_data(cio, l_data_header, 4, p_manager);
  182. opj_stream_seek(cio, lenp + len, p_manager);
  183. return (int)len;
  184. }