phix_manager.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171
  1. /*
  2. * $Id: phix_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. /*! \file
  32. * \brief Modification of jpip.c from 2KAN indexer
  33. */
  34. #include <stdlib.h>
  35. #include <math.h>
  36. #include "opj_includes.h"
  37. /*
  38. * Write faix box of phix
  39. *
  40. * @param[in] coff offset of j2k codestream
  41. * @param[in] compno component number
  42. * @param[in] cstr_info codestream information
  43. * @param[in] EPHused true if if EPH option used
  44. * @param[in] j2klen length of j2k codestream
  45. * @param[in] cio file output handle
  46. * @return length of faix box
  47. */
  48. int write_phixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio);
  49. int write_phix( int coff, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
  50. {
  51. int len, lenp=0, compno, i;
  52. opj_jp2_box_t *box;
  53. box = (opj_jp2_box_t *)opj_calloc( cstr_info.numcomps, sizeof(opj_jp2_box_t));
  54. for( i=0;i<2;i++){
  55. if (i) cio_seek( cio, lenp);
  56. lenp = cio_tell( cio);
  57. cio_skip( cio, 4); /* L [at the end] */
  58. cio_write( cio, JPIP_PHIX, 4); /* PHIX */
  59. write_manf( i, cstr_info.numcomps, box, cio);
  60. for( compno=0; compno<cstr_info.numcomps; compno++){
  61. box[compno].length = write_phixfaix( coff, compno, cstr_info, EPHused, j2klen, cio);
  62. box[compno].type = JPIP_FAIX;
  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. opj_free(box);
  70. return len;
  71. }
  72. int write_phixfaix( int coff, int compno, opj_codestream_info_t cstr_info, opj_bool EPHused, int j2klen, opj_cio_t *cio)
  73. {
  74. int len, lenp, tileno, version, i, nmax, size_of_coding; /* 4 or 8 */
  75. opj_tile_info_t *tile_Idx;
  76. opj_packet_info_t packet;
  77. int resno, precno, layno, num_packet;
  78. int numOfres, numOfprec, numOflayers;
  79. packet.end_ph_pos = packet.start_pos = -1;
  80. (void)EPHused; /* unused ? */
  81. if( j2klen > pow( 2, 32)){
  82. size_of_coding = 8;
  83. version = 1;
  84. }
  85. else{
  86. size_of_coding = 4;
  87. version = 0;
  88. }
  89. lenp = cio_tell( cio);
  90. cio_skip( cio, 4); /* L [at the end] */
  91. cio_write( cio, JPIP_FAIX, 4); /* FAIX */
  92. cio_write( cio, version,1); /* Version 0 = 4 bytes */
  93. nmax = 0;
  94. for( i=0; i<=cstr_info.numdecompos[compno]; i++)
  95. nmax += cstr_info.tile[0].ph[i] * cstr_info.tile[0].pw[i] * cstr_info.numlayers;
  96. cio_write( cio, nmax, size_of_coding); /* NMAX */
  97. cio_write( cio, cstr_info.tw*cstr_info.th, size_of_coding); /* M */
  98. for( tileno=0; tileno<cstr_info.tw*cstr_info.th; tileno++){
  99. tile_Idx = &cstr_info.tile[ tileno];
  100. num_packet = 0;
  101. numOfres = cstr_info.numdecompos[compno] + 1;
  102. for( resno=0; resno<numOfres ; resno++){
  103. numOfprec = tile_Idx->pw[resno]*tile_Idx->ph[resno];
  104. for( precno=0; precno<numOfprec; precno++){
  105. numOflayers = cstr_info.numlayers;
  106. for( layno=0; layno<numOflayers; layno++){
  107. switch ( cstr_info.prog){
  108. case LRCP:
  109. packet = tile_Idx->packet[ ((layno*numOfres+resno)*cstr_info.numcomps+compno)*numOfprec+precno];
  110. break;
  111. case RLCP:
  112. packet = tile_Idx->packet[ ((resno*numOflayers+layno)*cstr_info.numcomps+compno)*numOfprec+precno];
  113. break;
  114. case RPCL:
  115. packet = tile_Idx->packet[ ((resno*numOfprec+precno)*cstr_info.numcomps+compno)*numOflayers+layno];
  116. break;
  117. case PCRL:
  118. packet = tile_Idx->packet[ ((precno*cstr_info.numcomps+compno)*numOfres+resno)*numOflayers + layno];
  119. break;
  120. case CPRL:
  121. packet = tile_Idx->packet[ ((compno*numOfprec+precno)*numOfres+resno)*numOflayers + layno];
  122. break;
  123. default:
  124. fprintf( stderr, "failed to ppix indexing\n");
  125. }
  126. cio_write( cio, packet.start_pos-coff, size_of_coding); /* start position */
  127. cio_write( cio, packet.end_ph_pos-packet.start_pos+1, size_of_coding); /* length */
  128. num_packet++;
  129. }
  130. }
  131. }
  132. /* PADDING */
  133. while( num_packet < nmax){
  134. cio_write( cio, 0, size_of_coding); /* start position */
  135. cio_write( cio, 0, size_of_coding); /* length */
  136. num_packet++;
  137. }
  138. }
  139. len = cio_tell( cio)-lenp;
  140. cio_seek( cio, lenp);
  141. cio_write( cio, len, 4); /* L */
  142. cio_seek( cio, lenp+len);
  143. return len;
  144. }