1 /*****************************************************************************
2 * vlc_block_helper.h: Helper functions for data blocks management.
3 *****************************************************************************
4 * Copyright (C) 2003 the VideoLAN team
7 * Authors: Gildas Bazin <gbazin@netcourrier.com>
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
22 *****************************************************************************/
24 #ifndef VLC_BLOCK_HELPER_H
25 #define VLC_BLOCK_HELPER_H 1
27 #include <vlc_block.h>
29 typedef struct block_bytestream_t
37 /*****************************************************************************
38 * block_bytestream_t management
39 *****************************************************************************/
41 static inline block_bytestream_t block_BytestreamInit( void )
43 block_bytestream_t bytestream;
45 bytestream.i_offset = 0;
46 bytestream.p_chain = bytestream.p_block = NULL;
51 static inline void block_BytestreamRelease( block_bytestream_t *p_bytestream )
53 while( p_bytestream->p_chain )
56 p_next = p_bytestream->p_chain->p_next;
57 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
58 p_bytestream->p_chain = p_next;
63 * It flush all data (read and unread) from a block_bytestream_t.
65 static inline void block_BytestreamEmpty( block_bytestream_t *p_bytestream )
67 block_BytestreamRelease( p_bytestream );
69 *p_bytestream = block_BytestreamInit();
73 * It flushes all already read data from a block_bytestream_t.
75 static inline void block_BytestreamFlush( block_bytestream_t *p_bytestream )
77 while( p_bytestream->p_chain != p_bytestream->p_block )
80 p_next = p_bytestream->p_chain->p_next;
81 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
82 p_bytestream->p_chain = p_next;
84 while( p_bytestream->p_block &&
85 (p_bytestream->p_block->i_buffer - p_bytestream->i_offset) == 0 )
88 p_next = p_bytestream->p_chain->p_next;
89 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
90 p_bytestream->p_chain = p_bytestream->p_block = p_next;
91 p_bytestream->i_offset = 0;
95 static inline void block_BytestreamPush( block_bytestream_t *p_bytestream,
98 block_ChainAppend( &p_bytestream->p_chain, p_block );
99 if( !p_bytestream->p_block ) p_bytestream->p_block = p_block;
103 static inline block_t *block_BytestreamPop( block_bytestream_t *p_bytestream )
107 block_BytestreamFlush( p_bytestream );
109 p_block = p_bytestream->p_block;
110 if( p_block == NULL )
114 else if( !p_block->p_next )
116 p_block->p_buffer += p_bytestream->i_offset;
117 p_block->i_buffer -= p_bytestream->i_offset;
118 p_bytestream->i_offset = 0;
119 p_bytestream->p_chain = p_bytestream->p_block = NULL;
123 while( p_block->p_next && p_block->p_next->p_next )
124 p_block = p_block->p_next;
127 block_t *p_block_old = p_block;
128 p_block = p_block->p_next;
129 p_block_old->p_next = NULL;
135 static inline int block_SkipByte( block_bytestream_t *p_bytestream )
137 /* Most common case first */
138 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
140 p_bytestream->i_offset++;
147 /* Less common case which is also slower */
148 for( p_block = p_bytestream->p_block->p_next;
149 p_block != NULL; p_block = p_block->p_next )
151 if( p_block->i_buffer )
153 p_bytestream->i_offset = 1;
154 p_bytestream->p_block = p_block;
160 /* Not enough data, bail out */
164 static inline int block_PeekByte( block_bytestream_t *p_bytestream,
167 /* Most common case first */
168 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
170 *p_data = p_bytestream->p_block->p_buffer[p_bytestream->i_offset];
177 /* Less common case which is also slower */
178 for( p_block = p_bytestream->p_block->p_next;
179 p_block != NULL; p_block = p_block->p_next )
181 if( p_block->i_buffer )
183 *p_data = p_block->p_buffer[0];
189 /* Not enough data, bail out */
193 static inline int block_GetByte( block_bytestream_t *p_bytestream,
196 /* Most common case first */
197 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
199 *p_data = p_bytestream->p_block->p_buffer[p_bytestream->i_offset];
200 p_bytestream->i_offset++;
207 /* Less common case which is also slower */
208 for( p_block = p_bytestream->p_block->p_next;
209 p_block != NULL; p_block = p_block->p_next )
211 if( p_block->i_buffer )
213 *p_data = p_block->p_buffer[0];
214 p_bytestream->i_offset = 1;
215 p_bytestream->p_block = p_block;
221 /* Not enough data, bail out */
225 static inline int block_WaitBytes( block_bytestream_t *p_bytestream,
229 size_t i_offset, i_copy, i_size;
231 /* Check we have that much data */
232 i_offset = p_bytestream->i_offset;
235 for( p_block = p_bytestream->p_block;
236 p_block != NULL; p_block = p_block->p_next )
238 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
247 /* Not enough data, bail out */
253 static inline int block_SkipBytes( block_bytestream_t *p_bytestream,
257 size_t i_offset, i_copy;
259 /* Check we have that much data */
260 i_offset = p_bytestream->i_offset;
262 for( p_block = p_bytestream->p_block;
263 p_block != NULL; p_block = p_block->p_next )
265 i_copy = __MIN( i_data, p_block->i_buffer - i_offset );
275 /* Not enough data, bail out */
279 p_bytestream->p_block = p_block;
280 p_bytestream->i_offset = i_offset + i_copy;
284 static inline int block_PeekBytes( block_bytestream_t *p_bytestream,
285 uint8_t *p_data, size_t i_data )
288 size_t i_offset, i_copy, i_size;
290 /* Check we have that much data */
291 i_offset = p_bytestream->i_offset;
294 for( p_block = p_bytestream->p_block;
295 p_block != NULL; p_block = p_block->p_next )
297 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
306 /* Not enough data, bail out */
311 i_offset = p_bytestream->i_offset;
314 for( p_block = p_bytestream->p_block;
315 p_block != NULL; p_block = p_block->p_next )
317 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
322 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
334 static inline int block_GetBytes( block_bytestream_t *p_bytestream,
335 uint8_t *p_data, size_t i_data )
338 size_t i_offset, i_copy, i_size;
340 /* Check we have that much data */
341 i_offset = p_bytestream->i_offset;
344 for( p_block = p_bytestream->p_block;
345 p_block != NULL; p_block = p_block->p_next )
347 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
356 /* Not enough data, bail out */
361 i_offset = p_bytestream->i_offset;
364 for( p_block = p_bytestream->p_block;
365 p_block != NULL; p_block = p_block->p_next )
367 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
372 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
381 /* No buffer given, just skip the data */
382 p_bytestream->p_block = p_block;
383 p_bytestream->i_offset = i_offset + i_copy;
388 static inline int block_PeekOffsetBytes( block_bytestream_t *p_bytestream,
389 size_t i_peek_offset, uint8_t *p_data, size_t i_data )
392 size_t i_offset, i_copy, i_size;
394 /* Check we have that much data */
395 i_offset = p_bytestream->i_offset;
396 i_size = i_data + i_peek_offset;
398 for( p_block = p_bytestream->p_block;
399 p_block != NULL; p_block = p_block->p_next )
401 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
410 /* Not enough data, bail out */
414 /* Find the right place */
415 i_offset = p_bytestream->i_offset;
416 i_size = i_peek_offset;
418 for( p_block = p_bytestream->p_block;
419 p_block != NULL; p_block = p_block->p_next )
421 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
433 for( ; p_block != NULL; p_block = p_block->p_next )
435 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
440 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
452 static inline int block_FindStartcodeFromOffset(
453 block_bytestream_t *p_bytestream, size_t *pi_offset,
454 const uint8_t *p_startcode, int i_startcode_length )
456 block_t *p_block, *p_block_backup = 0;
458 size_t i_offset, i_offset_backup = 0;
459 int i_caller_offset_backup = 0, i_match;
461 /* Find the right place */
462 i_size = *pi_offset + p_bytestream->i_offset;
463 for( p_block = p_bytestream->p_block;
464 p_block != NULL; p_block = p_block->p_next )
466 i_size -= p_block->i_buffer;
467 if( i_size < 0 ) break;
472 /* Not enough data, bail out */
477 * We first look for an occurrence of the 1st startcode byte and
478 * if found, we do a more thorough check. */
479 i_size += p_block->i_buffer;
480 *pi_offset -= i_size;
482 for( ; p_block != NULL; p_block = p_block->p_next )
484 for( i_offset = i_size; i_offset < p_block->i_buffer; i_offset++ )
486 if( p_block->p_buffer[i_offset] == p_startcode[i_match] )
490 p_block_backup = p_block;
491 i_offset_backup = i_offset;
492 i_caller_offset_backup = *pi_offset;
495 if( i_match + 1 == i_startcode_length )
498 *pi_offset += i_offset - i_match;
507 p_block = p_block_backup;
508 i_offset = i_offset_backup;
509 *pi_offset = i_caller_offset_backup;
515 *pi_offset += i_offset;
518 *pi_offset -= i_match;
522 #endif /* VLC_BLOCK_HELPER_H */