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 *****************************************************************************/
40 static inline void block_BytestreamInit( block_bytestream_t *p_bytestream )
42 p_bytestream->p_chain = p_bytestream->p_block = NULL;
43 p_bytestream->i_offset = 0;
46 static inline void block_BytestreamRelease( block_bytestream_t *p_bytestream )
48 while( p_bytestream->p_chain )
51 p_next = p_bytestream->p_chain->p_next;
52 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
53 p_bytestream->p_chain = p_next;
58 * It flush all data (read and unread) from a block_bytestream_t.
60 static inline void block_BytestreamEmpty( block_bytestream_t *p_bytestream )
62 block_BytestreamRelease( p_bytestream );
63 block_BytestreamInit( p_bytestream );
67 * It flushes all already read data from a block_bytestream_t.
69 static inline void block_BytestreamFlush( block_bytestream_t *p_bytestream )
71 while( p_bytestream->p_chain != p_bytestream->p_block )
74 p_next = p_bytestream->p_chain->p_next;
75 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
76 p_bytestream->p_chain = p_next;
78 while( p_bytestream->p_block &&
79 (p_bytestream->p_block->i_buffer - p_bytestream->i_offset) == 0 )
82 p_next = p_bytestream->p_chain->p_next;
83 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
84 p_bytestream->p_chain = p_bytestream->p_block = p_next;
85 p_bytestream->i_offset = 0;
89 static inline void block_BytestreamPush( block_bytestream_t *p_bytestream,
92 block_ChainAppend( &p_bytestream->p_chain, p_block );
93 if( !p_bytestream->p_block ) p_bytestream->p_block = p_block;
97 static inline block_t *block_BytestreamPop( block_bytestream_t *p_bytestream )
101 block_BytestreamFlush( p_bytestream );
103 p_block = p_bytestream->p_block;
104 if( p_block == NULL )
108 else if( !p_block->p_next )
110 p_block->p_buffer += p_bytestream->i_offset;
111 p_block->i_buffer -= p_bytestream->i_offset;
112 p_bytestream->i_offset = 0;
113 p_bytestream->p_chain = p_bytestream->p_block = NULL;
117 while( p_block->p_next && p_block->p_next->p_next )
118 p_block = p_block->p_next;
121 block_t *p_block_old = p_block;
122 p_block = p_block->p_next;
123 p_block_old->p_next = NULL;
129 static inline int block_SkipByte( block_bytestream_t *p_bytestream )
131 /* Most common case first */
132 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
134 p_bytestream->i_offset++;
141 /* Less common case which is also slower */
142 for( p_block = p_bytestream->p_block->p_next;
143 p_block != NULL; p_block = p_block->p_next )
145 if( p_block->i_buffer )
147 p_bytestream->i_offset = 1;
148 p_bytestream->p_block = p_block;
154 /* Not enough data, bail out */
158 static inline int block_PeekByte( block_bytestream_t *p_bytestream,
161 /* Most common case first */
162 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
164 *p_data = p_bytestream->p_block->p_buffer[p_bytestream->i_offset];
171 /* Less common case which is also slower */
172 for( p_block = p_bytestream->p_block->p_next;
173 p_block != NULL; p_block = p_block->p_next )
175 if( p_block->i_buffer )
177 *p_data = p_block->p_buffer[0];
183 /* Not enough data, bail out */
187 static inline int block_GetByte( block_bytestream_t *p_bytestream,
190 /* Most common case first */
191 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
193 *p_data = p_bytestream->p_block->p_buffer[p_bytestream->i_offset];
194 p_bytestream->i_offset++;
201 /* Less common case which is also slower */
202 for( p_block = p_bytestream->p_block->p_next;
203 p_block != NULL; p_block = p_block->p_next )
205 if( p_block->i_buffer )
207 *p_data = p_block->p_buffer[0];
208 p_bytestream->i_offset = 1;
209 p_bytestream->p_block = p_block;
215 /* Not enough data, bail out */
219 static inline int block_WaitBytes( block_bytestream_t *p_bytestream,
223 size_t i_offset, i_copy, i_size;
225 /* Check we have that much data */
226 i_offset = p_bytestream->i_offset;
229 for( p_block = p_bytestream->p_block;
230 p_block != NULL; p_block = p_block->p_next )
232 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
241 /* Not enough data, bail out */
247 static inline int block_SkipBytes( block_bytestream_t *p_bytestream,
251 size_t i_offset, i_copy;
253 /* Check we have that much data */
254 i_offset = p_bytestream->i_offset;
256 for( p_block = p_bytestream->p_block;
257 p_block != NULL; p_block = p_block->p_next )
259 i_copy = __MIN( i_data, p_block->i_buffer - i_offset );
269 /* Not enough data, bail out */
273 p_bytestream->p_block = p_block;
274 p_bytestream->i_offset = i_offset + i_copy;
278 static inline int block_PeekBytes( block_bytestream_t *p_bytestream,
279 uint8_t *p_data, size_t i_data )
282 size_t i_offset, i_copy, i_size;
284 /* Check we have that much data */
285 i_offset = p_bytestream->i_offset;
288 for( p_block = p_bytestream->p_block;
289 p_block != NULL; p_block = p_block->p_next )
291 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
300 /* Not enough data, bail out */
305 i_offset = p_bytestream->i_offset;
308 for( p_block = p_bytestream->p_block;
309 p_block != NULL; p_block = p_block->p_next )
311 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
316 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
328 static inline int block_GetBytes( block_bytestream_t *p_bytestream,
329 uint8_t *p_data, size_t i_data )
332 size_t i_offset, i_copy, i_size;
334 /* Check we have that much data */
335 i_offset = p_bytestream->i_offset;
338 for( p_block = p_bytestream->p_block;
339 p_block != NULL; p_block = p_block->p_next )
341 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
350 /* Not enough data, bail out */
355 i_offset = p_bytestream->i_offset;
358 for( p_block = p_bytestream->p_block;
359 p_block != NULL; p_block = p_block->p_next )
361 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
366 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
375 /* No buffer given, just skip the data */
376 p_bytestream->p_block = p_block;
377 p_bytestream->i_offset = i_offset + i_copy;
382 static inline int block_PeekOffsetBytes( block_bytestream_t *p_bytestream,
383 size_t i_peek_offset, uint8_t *p_data, size_t i_data )
386 size_t i_offset, i_copy, i_size;
388 /* Check we have that much data */
389 i_offset = p_bytestream->i_offset;
390 i_size = i_data + i_peek_offset;
392 for( p_block = p_bytestream->p_block;
393 p_block != NULL; p_block = p_block->p_next )
395 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
404 /* Not enough data, bail out */
408 /* Find the right place */
409 i_offset = p_bytestream->i_offset;
410 i_size = i_peek_offset;
412 for( p_block = p_bytestream->p_block;
413 p_block != NULL; p_block = p_block->p_next )
415 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
427 for( ; p_block != NULL; p_block = p_block->p_next )
429 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
434 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
446 static inline int block_FindStartcodeFromOffset(
447 block_bytestream_t *p_bytestream, size_t *pi_offset,
448 const uint8_t *p_startcode, int i_startcode_length )
450 block_t *p_block, *p_block_backup = 0;
452 size_t i_offset, i_offset_backup = 0;
453 int i_caller_offset_backup = 0, i_match;
455 /* Find the right place */
456 i_size = *pi_offset + p_bytestream->i_offset;
457 for( p_block = p_bytestream->p_block;
458 p_block != NULL; p_block = p_block->p_next )
460 i_size -= p_block->i_buffer;
461 if( i_size < 0 ) break;
466 /* Not enough data, bail out */
471 * We first look for an occurrence of the 1st startcode byte and
472 * if found, we do a more thorough check. */
473 i_size += p_block->i_buffer;
474 *pi_offset -= i_size;
476 for( ; p_block != NULL; p_block = p_block->p_next )
478 for( i_offset = i_size; i_offset < p_block->i_buffer; i_offset++ )
480 if( p_block->p_buffer[i_offset] == p_startcode[i_match] )
484 p_block_backup = p_block;
485 i_offset_backup = i_offset;
486 i_caller_offset_backup = *pi_offset;
489 if( i_match + 1 == i_startcode_length )
492 *pi_offset += i_offset - i_match;
501 p_block = p_block_backup;
502 i_offset = i_offset_backup;
503 *pi_offset = i_caller_offset_backup;
509 *pi_offset += i_offset;
512 *pi_offset -= i_match;
516 #endif /* VLC_BLOCK_HELPER_H */