source: 3DVCSoftware/trunk/source/Lib/TLibEncoder/NALwrite.cpp @ 56

Last change on this file since 56 was 56, checked in by hschwarz, 12 years ago

updated trunk (move to HM6.1)

File size: 7.5 KB
Line 
1/* The copyright in this software is being made available under the BSD
2 * License, included below. This software may be subject to other third party
3 * and contributor rights, including patent rights, and no such rights are
4 * granted under this license.
5 *
6 * Copyright (c) 2010-2012, ITU/ISO/IEC
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions are met:
11 *
12 *  * Redistributions of source code must retain the above copyright notice,
13 *    this list of conditions and the following disclaimer.
14 *  * Redistributions in binary form must reproduce the above copyright notice,
15 *    this list of conditions and the following disclaimer in the documentation
16 *    and/or other materials provided with the distribution.
17 *  * Neither the name of the ITU/ISO/IEC nor the names of its contributors may
18 *    be used to endorse or promote products derived from this software without
19 *    specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
22 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
25 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
28 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
29 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
30 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
31 * THE POSSIBILITY OF SUCH DAMAGE.
32 */
33
34#include <vector>
35#include <algorithm>
36#include <ostream>
37
38#include "TLibCommon/NAL.h"
39#include "TLibCommon/TComBitStream.h"
40#include "NALwrite.h"
41
42using namespace std;
43
44//! \ingroup TLibEncoder
45//! \{
46
47static const char emulation_prevention_three_byte[] = {3};
48
49/**
50 * write nalu to bytestream out, performing RBSP anti startcode
51 * emulation as required.  nalu.m_RBSPayload must be byte aligned.
52 */
53void write(ostream& out, OutputNALUnit& nalu)
54{
55  TComOutputBitstream bsNALUHeader;
56
57  bsNALUHeader.write(0,1); // forbidden_zero_flag
58#if NAL_REF_FLAG
59  bsNALUHeader.write(nalu.m_nalRefFlag? 1 : 0, 1); // nal_ref_flag
60  bsNALUHeader.write(nalu.m_nalUnitType, 6);          // nal_unit_type
61#else
62  bsNALUHeader.write(nalu.m_nalRefIDC, 2); // nal_ref_idc
63  bsNALUHeader.write(nalu.m_nalUnitType, 5); // nal_unit_type
64#endif
65
66#if H0388
67  bsNALUHeader.write(nalu.m_temporalId, 3); // temporal_id
68 // bsNALUHeader.write(1, 5); // reserved_one_5bits
69  bsNALUHeader.write(nalu.m_viewId+1,4); 
70  bsNALUHeader.write(nalu.m_isDepth,1);
71#else
72  switch (nalu.m_nalUnitType)
73  {
74  case NAL_UNIT_CODED_SLICE:
75  case NAL_UNIT_CODED_SLICE_IDR:
76#if H0566_TLA
77  case NAL_UNIT_CODED_SLICE_IDV:
78  case NAL_UNIT_CODED_SLICE_CRA:
79  case NAL_UNIT_CODED_SLICE_TLA:
80#else
81  case NAL_UNIT_CODED_SLICE_CDR:
82#endif
83    bsNALUHeader.write(nalu.m_temporalId, 3); // temporal_id
84    bsNALUHeader.write(nalu.m_OutputFlag, 1); // output_flag
85  //  bsNALUHeader.write(1, 4); // reserved_one_4bits
86    bsNALUHeader.write(nalu.m_viewId+1,3); 
87    bsNALUHeader.write(nalu.m_isDepth,1);
88    break;
89  default: break;
90  }
91#endif
92  out.write(bsNALUHeader.getByteStream(), bsNALUHeader.getByteStreamLength());
93
94  /* write out rsbp_byte's, inserting any required
95   * emulation_prevention_three_byte's */
96  /* 7.4.1 ...
97   * emulation_prevention_three_byte is a byte equal to 0x03. When an
98   * emulation_prevention_three_byte is present in the NAL unit, it shall be
99   * discarded by the decoding process.
100   * The last byte of the NAL unit shall not be equal to 0x00.
101   * Within the NAL unit, the following three-byte sequences shall not occur at
102   * any byte-aligned position:
103   *  - 0x000000
104   *  - 0x000001
105   *  - 0x000002
106   * Within the NAL unit, any four-byte sequence that starts with 0x000003
107   * other than the following sequences shall not occur at any byte-aligned
108   * position:
109   *  - 0x00000300
110   *  - 0x00000301
111   *  - 0x00000302
112   *  - 0x00000303
113   */
114  vector<uint8_t>& rbsp   = nalu.m_Bitstream.getFIFO();
115  UInt uiTileMarkerCount  = nalu.m_Bitstream.getTileMarkerLocationCount();
116
117  for (vector<uint8_t>::iterator it = rbsp.begin(); it != rbsp.end();)
118  {
119    /* 1) find the next emulated 00 00 {00,01,02,03}
120     * 2a) if not found, write all remaining bytes out, stop.
121     * 2b) otherwise, write all non-emulated bytes out
122     * 3) insert emulation_prevention_three_byte
123     */
124    vector<uint8_t>::iterator found = it;
125    do
126    {
127      /* NB, end()-1, prevents finding a trailing two byte sequence */
128      found = search_n(found, rbsp.end()-1, 2, 0);
129      found++;
130      /* if not found, found == end, otherwise found = second zero byte */
131      if (found == rbsp.end())
132        break;
133      if (*(++found) <= 3)
134        break;
135    } while (true);
136
137    UInt uiDistance = (UInt)(found - rbsp.begin());
138    for ( UInt uiMrkrIdx = 0; uiMrkrIdx < uiTileMarkerCount ; uiMrkrIdx++ )
139    {   
140      UInt uiByteLocation   = nalu.m_Bitstream.getTileMarkerLocation( uiMrkrIdx );
141      if (found != rbsp.end() && uiByteLocation > (uiDistance - 2) )
142      {
143        nalu.m_Bitstream.setTileMarkerLocation( uiMrkrIdx, uiByteLocation+1 );
144      }
145    }
146    it = found;
147    if (found != rbsp.end())
148    {
149      it = rbsp.insert(found, emulation_prevention_three_byte[0]);
150    }
151  }
152
153  // Insert tile markers
154  TComOutputBitstream cTileMarker;
155  UInt uiMarker = 0x000002;
156  cTileMarker.write(uiMarker, 24);
157  for ( UInt uiInsertIdx   = 0; uiInsertIdx < uiTileMarkerCount ; uiInsertIdx++ )
158  {
159    UInt uiByteLocation   = nalu.m_Bitstream.getTileMarkerLocation( uiInsertIdx );
160    nalu.m_Bitstream.insertAt( cTileMarker, uiByteLocation ); // 0x000002
161
162    // update tile marker byte locations of yet to be written markers
163    for ( UInt uiUpdateLOCIdx = uiInsertIdx+1; uiUpdateLOCIdx < uiTileMarkerCount; uiUpdateLOCIdx++ )
164    {
165      UInt uiLocation = nalu.m_Bitstream.getTileMarkerLocation( uiUpdateLOCIdx );
166      nalu.m_Bitstream.setTileMarkerLocation( uiUpdateLOCIdx, uiLocation + 3 );
167    }
168  }
169  out.write((char*)&(*rbsp.begin()), rbsp.end() - rbsp.begin());
170
171
172  /* 7.4.1.1
173   * ... when the last byte of the RBSP data is equal to 0x00 (which can
174   * only occur when the RBSP ends in a cabac_zero_word), a final byte equal
175   * to 0x03 is appended to the end of the data.
176   */
177  if (rbsp.back() == 0x00)
178  {
179    out.write(emulation_prevention_three_byte, 1);
180  }
181}
182
183/**
184 * Write rbsp_trailing_bits to bs causing it to become byte-aligned
185 */
186void writeRBSPTrailingBits(TComOutputBitstream& bs)
187{
188  bs.write( 1, 1 );
189  bs.writeAlignZero();
190}
191
192/**
193 * Copy NALU from naluSrc to naluDest
194 */
195void copyNaluData(OutputNALUnit& naluDest, const OutputNALUnit& naluSrc)
196{
197  naluDest.m_nalUnitType = naluSrc.m_nalUnitType;
198#if NAL_REF_FLAG
199  naluDest.m_nalRefFlag  = naluSrc.m_nalRefFlag;
200#else
201  naluDest.m_nalRefIDC   = naluSrc.m_nalRefIDC;
202#endif
203  naluDest.m_viewId      = naluSrc.m_viewId;
204  naluDest.m_isDepth     = naluSrc.m_isDepth;
205  naluDest.m_temporalId  = naluSrc.m_temporalId;
206#if !H0388
207  naluDest.m_OutputFlag  = naluSrc.m_OutputFlag;
208#endif
209  naluDest.m_Bitstream   = naluSrc.m_Bitstream;
210}
211
212//! \}
Note: See TracBrowser for help on using the repository browser.