.gitignore: Add version script.
[L-SMASH.git] / codecs / nalu.c
blobe2eb076263c403370d59c19ab7a0e68d8305ec54
1 /*****************************************************************************
2 * nalu.c
3 *****************************************************************************
4 * Copyright (C) 2010-2015 L-SMASH project
6 * Authors: Yusuke Nakamura <muken.the.vfrmaniac@gmail.com>
8 * Permission to use, copy, modify, and/or distribute this software for any
9 * purpose with or without fee is hereby granted, provided that the above
10 * copyright notice and this permission notice appear in all copies.
12 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
13 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
14 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
15 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
16 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
17 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
18 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
19 *****************************************************************************/
21 /* This file is available under an ISC license. */
23 #include "common/internal.h" /* must be placed first */
25 #include <string.h>
27 #include "core/box.h"
29 #include "nalu.h"
31 isom_dcr_ps_entry_t *isom_create_ps_entry
33 uint8_t *ps,
34 uint32_t ps_size
37 isom_dcr_ps_entry_t *entry = lsmash_malloc( sizeof(isom_dcr_ps_entry_t) );
38 if( !entry )
39 return NULL;
40 entry->nalUnit = lsmash_memdup( ps, ps_size );
41 if( !entry->nalUnit )
43 lsmash_free( entry );
44 return NULL;
46 entry->nalUnitLength = ps_size;
47 entry->unused = 0;
48 return entry;
51 void isom_remove_dcr_ps
53 isom_dcr_ps_entry_t *ps
56 if( !ps )
57 return;
58 lsmash_free( ps->nalUnit );
59 lsmash_free( ps );
62 /* Convert EBSP (Encapsulated Byte Sequence Packets) to RBSP (Raw Byte Sequence Packets). */
63 uint8_t *nalu_remove_emulation_prevention
65 uint8_t *src,
66 uint64_t src_length,
67 uint8_t *dst
70 uint8_t *src_end = src + src_length;
71 while( src < src_end )
72 if( ((src + 2) < src_end) && !src[0] && !src[1] && (src[2] == 0x03) )
74 /* 0x000003 -> 0x0000 */
75 *dst++ = *src++;
76 *dst++ = *src++;
77 src++; /* Skip emulation_prevention_three_byte (0x03). */
79 else
80 *dst++ = *src++;
81 return dst;
84 int nalu_import_rbsp_from_ebsp
86 lsmash_bits_t *bits,
87 uint8_t *rbsp_buffer,
88 uint8_t *ebsp,
89 uint64_t ebsp_size
92 uint8_t *rbsp_start = rbsp_buffer;
93 uint8_t *rbsp_end = nalu_remove_emulation_prevention( ebsp, ebsp_size, rbsp_buffer );
94 uint64_t rbsp_length = rbsp_end - rbsp_start;
95 return lsmash_bits_import_data( bits, rbsp_start, rbsp_length );
98 int nalu_check_more_rbsp_data
100 lsmash_bits_t *bits
103 lsmash_bs_t *bs = bits->bs;
104 lsmash_buffer_t *buffer = &bs->buffer;
105 if( buffer->pos < buffer->store && !(bits->store == 0 && (buffer->store == buffer->pos + 1)) )
106 return 1; /* rbsp_trailing_bits will be placed at the next or later byte.
107 * Note: bs->pos points at the next byte if bits->store isn't empty. */
108 if( bits->store == 0 )
110 if( buffer->store == buffer->pos + 1 )
111 return buffer->data[ buffer->pos ] != 0x80;
112 /* No rbsp_trailing_bits is present in RBSP data. */
113 bs->error = 1;
114 return 0;
116 /* Check whether remainder of bits is identical to rbsp_trailing_bits. */
117 uint8_t remainder_bits = bits->cache & ~(~0U << bits->store);
118 uint8_t rbsp_trailing_bits = 1U << (bits->store - 1);
119 return remainder_bits != rbsp_trailing_bits;
122 int nalu_get_max_ps_length
124 lsmash_entry_list_t *ps_list,
125 uint32_t *max_ps_length
128 *max_ps_length = 0;
129 for( lsmash_entry_t *entry = ps_list->head; entry; entry = entry->next )
131 isom_dcr_ps_entry_t *ps = (isom_dcr_ps_entry_t *)entry->data;
132 if( !ps )
133 return LSMASH_ERR_NAMELESS;
134 if( ps->unused )
135 continue;
136 *max_ps_length = LSMASH_MAX( *max_ps_length, ps->nalUnitLength );
138 return 0;
141 int nalu_get_ps_count
143 lsmash_entry_list_t *ps_list,
144 uint32_t *ps_count
147 *ps_count = 0;
148 for( lsmash_entry_t *entry = ps_list ? ps_list->head : NULL; entry; entry = entry->next )
150 isom_dcr_ps_entry_t *ps = (isom_dcr_ps_entry_t *)entry->data;
151 if( !ps )
152 return LSMASH_ERR_NAMELESS;
153 if( ps->unused )
154 continue;
155 ++(*ps_count);
157 return 0;
160 int nalu_check_same_ps_existence
162 lsmash_entry_list_t *ps_list,
163 void *ps_data,
164 uint32_t ps_length
167 for( lsmash_entry_t *entry = ps_list->head; entry; entry = entry->next )
169 isom_dcr_ps_entry_t *ps = (isom_dcr_ps_entry_t *)entry->data;
170 if( !ps )
171 return LSMASH_ERR_NAMELESS;
172 if( ps->unused )
173 continue;
174 if( ps->nalUnitLength == ps_length && !memcmp( ps->nalUnit, ps_data, ps_length ) )
175 return 1; /* The same parameter set already exists. */
177 return 0;
180 int nalu_get_dcr_ps
182 lsmash_bs_t *bs,
183 lsmash_entry_list_t *list,
184 uint8_t entry_count
187 for( uint8_t i = 0; i < entry_count; i++ )
189 isom_dcr_ps_entry_t *data = lsmash_malloc( sizeof(isom_dcr_ps_entry_t) );
190 if( !data )
191 return LSMASH_ERR_MEMORY_ALLOC;
192 if( lsmash_add_entry( list, data ) < 0 )
194 lsmash_free( data );
195 return LSMASH_ERR_MEMORY_ALLOC;
197 data->nalUnitLength = lsmash_bs_get_be16( bs );
198 data->nalUnit = lsmash_bs_get_bytes( bs, data->nalUnitLength );
199 if( !data->nalUnit )
201 lsmash_remove_entries( list, isom_remove_dcr_ps );
202 return LSMASH_ERR_NAMELESS;
205 return 0;
208 /* Return the offset from the beginning of stream if a start code is found.
209 * Return NALU_NO_START_CODE_FOUND otherwise. */
210 uint64_t nalu_find_first_start_code
212 lsmash_bs_t *bs
215 uint64_t first_sc_head_pos = 0;
216 while( 1 )
218 if( lsmash_bs_is_error( bs ) )
219 return NALU_IO_ERROR;
220 if( lsmash_bs_is_end( bs, first_sc_head_pos + NALU_LONG_START_CODE_LENGTH ) )
221 return NALU_NO_START_CODE_FOUND;
222 /* Invalid if encountered any value of non-zero before the first start code. */
223 if( lsmash_bs_show_byte( bs, first_sc_head_pos ) )
224 return NALU_NO_START_CODE_FOUND;
225 /* The first NALU of an AU in decoding order shall have long start code (0x00000001). */
226 if( 0x00000001 == lsmash_bs_show_be32( bs, first_sc_head_pos ) )
227 break;
228 ++first_sc_head_pos;
230 return first_sc_head_pos;
233 uint64_t nalu_get_codeNum
235 lsmash_bits_t *bits
238 uint32_t leadingZeroBits = 0;
239 for( int b = 0; !b; leadingZeroBits++ )
240 b = lsmash_bits_get( bits, 1 );
241 --leadingZeroBits;
242 return ((uint64_t)1 << leadingZeroBits) - 1 + lsmash_bits_get( bits, leadingZeroBits );
245 int nalu_update_bitrate( isom_stbl_t *stbl, isom_mdhd_t *mdhd, uint32_t sample_description_index )
247 isom_visual_entry_t *sample_entry = (isom_visual_entry_t *)lsmash_get_entry_data( &stbl->stsd->list, sample_description_index );
248 if( !sample_entry )
249 return LSMASH_ERR_INVALID_DATA;
250 isom_btrt_t *btrt = (isom_btrt_t *)isom_get_extension_box_format( &sample_entry->extensions, ISOM_BOX_TYPE_BTRT );
251 if( btrt )
253 uint32_t bufferSizeDB;
254 uint32_t maxBitrate;
255 uint32_t avgBitrate;
256 int err = isom_calculate_bitrate_description( stbl, mdhd, &bufferSizeDB, &maxBitrate, &avgBitrate, sample_description_index );
257 if( err < 0 )
258 return err;
259 btrt->bufferSizeDB = bufferSizeDB;
260 btrt->maxBitrate = maxBitrate;
261 btrt->avgBitrate = avgBitrate;
263 return 0;