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-2013, 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 | #pragma once |
---|
35 | |
---|
36 | #include <ostream> |
---|
37 | #include "TLibCommon/AccessUnit.h" |
---|
38 | #include "NALwrite.h" |
---|
39 | |
---|
40 | //! \ingroup TLibEncoder |
---|
41 | //! \{ |
---|
42 | |
---|
43 | /** |
---|
44 | * write all NALunits in au to bytestream out in a manner satisfying |
---|
45 | * AnnexB of AVC. NALunits are written in the order they are found in au. |
---|
46 | * the zero_byte word is appended to: |
---|
47 | * - the initial startcode in the access unit, |
---|
48 | * - any SPS/PPS nal units |
---|
49 | */ |
---|
50 | static std::vector<UInt> writeAnnexB(std::ostream& out, const AccessUnit& au) |
---|
51 | { |
---|
52 | std::vector<UInt> annexBsizes; |
---|
53 | |
---|
54 | for (AccessUnit::const_iterator it = au.begin(); it != au.end(); it++) |
---|
55 | { |
---|
56 | const NALUnitEBSP& nalu = **it; |
---|
57 | UInt size = 0; /* size of annexB unit in bytes */ |
---|
58 | |
---|
59 | static const Char start_code_prefix[] = {0,0,0,1}; |
---|
60 | if (it == au.begin() || nalu.m_nalUnitType == NAL_UNIT_SPS || nalu.m_nalUnitType == NAL_UNIT_PPS) |
---|
61 | { |
---|
62 | /* From AVC, When any of the following conditions are fulfilled, the |
---|
63 | * zero_byte syntax element shall be present: |
---|
64 | * - the nal_unit_type within the nal_unit() is equal to 7 (sequence |
---|
65 | * parameter set) or 8 (picture parameter set), |
---|
66 | * - the byte stream NAL unit syntax structure contains the first NAL |
---|
67 | * unit of an access unit in decoding order, as specified by subclause |
---|
68 | * 7.4.1.2.3. |
---|
69 | */ |
---|
70 | out.write(start_code_prefix, 4); |
---|
71 | size += 4; |
---|
72 | } |
---|
73 | else |
---|
74 | { |
---|
75 | out.write(start_code_prefix+1, 3); |
---|
76 | size += 3; |
---|
77 | } |
---|
78 | out << nalu.m_nalUnitData.str(); |
---|
79 | size += UInt(nalu.m_nalUnitData.str().size()); |
---|
80 | |
---|
81 | annexBsizes.push_back(size); |
---|
82 | } |
---|
83 | |
---|
84 | return annexBsizes; |
---|
85 | } |
---|
86 | //! \} |
---|