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 #define block_BytestreamInit( a ) __block_BytestreamInit( VLC_OBJECT(a) )
39 /*****************************************************************************
40 * block_bytestream_t management
41 *****************************************************************************/
42 static inline block_bytestream_t __block_BytestreamInit( vlc_object_t *p_obj )
44 block_bytestream_t bytestream;
46 bytestream.i_offset = 0;
47 bytestream.p_chain = bytestream.p_block = NULL;
52 static inline void block_BytestreamRelease( block_bytestream_t *p_bytestream )
54 while( p_bytestream->p_chain )
57 p_next = p_bytestream->p_chain->p_next;
58 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
59 p_bytestream->p_chain = p_next;
61 p_bytestream->i_offset = 0;
62 p_bytestream->p_chain = p_bytestream->p_block = NULL;
65 static inline void block_BytestreamFlush( block_bytestream_t *p_bytestream )
67 while( p_bytestream->p_chain != p_bytestream->p_block )
70 p_next = p_bytestream->p_chain->p_next;
71 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
72 p_bytestream->p_chain = p_next;
74 while( p_bytestream->p_block &&
75 (p_bytestream->p_block->i_buffer - p_bytestream->i_offset) == 0 )
78 p_next = p_bytestream->p_chain->p_next;
79 p_bytestream->p_chain->pf_release( p_bytestream->p_chain );
80 p_bytestream->p_chain = p_bytestream->p_block = p_next;
81 p_bytestream->i_offset = 0;
85 static inline void block_BytestreamPush( block_bytestream_t *p_bytestream,
88 block_ChainAppend( &p_bytestream->p_chain, p_block );
89 if( !p_bytestream->p_block ) p_bytestream->p_block = p_block;
92 static inline block_t *block_BytestreamPop( block_bytestream_t *p_bytestream )
96 block_BytestreamFlush( p_bytestream );
98 p_block = p_bytestream->p_block;
103 else if( !p_block->p_next )
105 p_block->p_buffer += p_bytestream->i_offset;
106 p_block->i_buffer -= p_bytestream->i_offset;
107 p_bytestream->i_offset = 0;
108 p_bytestream->p_chain = p_bytestream->p_block = NULL;
112 while( p_block->p_next && p_block->p_next->p_next )
113 p_block = p_block->p_next;
116 block_t *p_block_old = p_block;
117 p_block = p_block->p_next;
118 p_block_old->p_next = NULL;
124 static inline int block_SkipByte( block_bytestream_t *p_bytestream )
126 /* Most common case first */
127 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
129 p_bytestream->i_offset++;
136 /* Less common case which is also slower */
137 for( p_block = p_bytestream->p_block->p_next;
138 p_block != NULL; p_block = p_block->p_next )
140 if( p_block->i_buffer )
142 p_bytestream->i_offset = 1;
143 p_bytestream->p_block = p_block;
149 /* Not enough data, bail out */
153 static inline int block_PeekByte( block_bytestream_t *p_bytestream,
156 /* Most common case first */
157 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
159 *p_data = p_bytestream->p_block->p_buffer[p_bytestream->i_offset];
166 /* Less common case which is also slower */
167 for( p_block = p_bytestream->p_block->p_next;
168 p_block != NULL; p_block = p_block->p_next )
170 if( p_block->i_buffer )
172 *p_data = p_block->p_buffer[0];
178 /* Not enough data, bail out */
182 static inline int block_GetByte( block_bytestream_t *p_bytestream,
185 /* Most common case first */
186 if( p_bytestream->p_block->i_buffer - p_bytestream->i_offset )
188 *p_data = p_bytestream->p_block->p_buffer[p_bytestream->i_offset];
189 p_bytestream->i_offset++;
196 /* Less common case which is also slower */
197 for( p_block = p_bytestream->p_block->p_next;
198 p_block != NULL; p_block = p_block->p_next )
200 if( p_block->i_buffer )
202 *p_data = p_block->p_buffer[0];
203 p_bytestream->i_offset = 1;
204 p_bytestream->p_block = p_block;
210 /* Not enough data, bail out */
214 static inline int block_WaitBytes( block_bytestream_t *p_bytestream,
218 int i_offset, i_copy, i_size;
220 /* Check we have that much data */
221 i_offset = p_bytestream->i_offset;
224 for( p_block = p_bytestream->p_block;
225 p_block != NULL; p_block = p_block->p_next )
227 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
236 /* Not enough data, bail out */
242 static inline int block_SkipBytes( block_bytestream_t *p_bytestream,
246 int i_offset, i_copy;
248 /* Check we have that much data */
249 i_offset = p_bytestream->i_offset;
251 for( p_block = p_bytestream->p_block;
252 p_block != NULL; p_block = p_block->p_next )
254 i_copy = __MIN( i_data, p_block->i_buffer - i_offset );
264 /* Not enough data, bail out */
268 p_bytestream->p_block = p_block;
269 p_bytestream->i_offset = i_offset + i_copy;
273 static inline int block_PeekBytes( block_bytestream_t *p_bytestream,
274 uint8_t *p_data, int i_data )
277 int i_offset, i_copy, i_size;
279 /* Check we have that much data */
280 i_offset = p_bytestream->i_offset;
283 for( p_block = p_bytestream->p_block;
284 p_block != NULL; p_block = p_block->p_next )
286 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
295 /* Not enough data, bail out */
300 i_offset = p_bytestream->i_offset;
303 for( p_block = p_bytestream->p_block;
304 p_block != NULL; p_block = p_block->p_next )
306 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
311 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
323 static inline int block_GetBytes( block_bytestream_t *p_bytestream,
324 uint8_t *p_data, int i_data )
327 int i_offset, i_copy, i_size;
329 /* Check we have that much data */
330 i_offset = p_bytestream->i_offset;
333 for( p_block = p_bytestream->p_block;
334 p_block != NULL; p_block = p_block->p_next )
336 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
345 /* Not enough data, bail out */
350 i_offset = p_bytestream->i_offset;
353 for( p_block = p_bytestream->p_block;
354 p_block != NULL; p_block = p_block->p_next )
356 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
361 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
370 /* No buffer given, just skip the data */
371 p_bytestream->p_block = p_block;
372 p_bytestream->i_offset = i_offset + i_copy;
377 static inline int block_PeekOffsetBytes( block_bytestream_t *p_bytestream,
378 int i_peek_offset, uint8_t *p_data, int i_data )
381 int i_offset, i_copy, i_size;
383 /* Check we have that much data */
384 i_offset = p_bytestream->i_offset;
385 i_size = i_data + i_peek_offset;
387 for( p_block = p_bytestream->p_block;
388 p_block != NULL; p_block = p_block->p_next )
390 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
399 /* Not enough data, bail out */
403 /* Find the right place */
404 i_offset = p_bytestream->i_offset;
405 i_size = i_peek_offset;
407 for( p_block = p_bytestream->p_block;
408 p_block != NULL; p_block = p_block->p_next )
410 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
422 for( ; p_block != NULL; p_block = p_block->p_next )
424 i_copy = __MIN( i_size, p_block->i_buffer - i_offset );
429 memcpy( p_data, p_block->p_buffer + i_offset, i_copy );
441 static inline int block_FindStartcodeFromOffset(
442 block_bytestream_t *p_bytestream, int *pi_offset,
443 uint8_t *p_startcode, int i_startcode_length )
445 block_t *p_block, *p_block_backup = 0;
446 int i_size, i_offset, i_offset_backup = 0;
447 int i_caller_offset_backup = 0, i_match;
449 /* Find the right place */
450 i_size = *pi_offset + p_bytestream->i_offset;
451 for( p_block = p_bytestream->p_block;
452 p_block != NULL; p_block = p_block->p_next )
454 i_size -= p_block->i_buffer;
455 if( i_size < 0 ) break;
460 /* Not enough data, bail out */
465 * We first look for an occurrence of the 1st startcode byte and
466 * if found, we do a more thorough check. */
467 i_size = p_block->i_buffer + i_size;
468 *pi_offset -= i_size;
470 for( ; p_block != NULL; p_block = p_block->p_next )
472 for( i_offset = i_size; i_offset < p_block->i_buffer; i_offset++ )
474 if( p_block->p_buffer[i_offset] == p_startcode[i_match] )
478 p_block_backup = p_block;
479 i_offset_backup = i_offset;
480 i_caller_offset_backup = *pi_offset;
483 if( i_match + 1 == i_startcode_length )
486 *pi_offset += i_offset - i_match;
495 p_block = p_block_backup;
496 i_offset = i_offset_backup;
497 *pi_offset = i_caller_offset_backup;
503 *pi_offset += i_offset;
506 *pi_offset -= i_match;
510 #endif /* VLC_BLOCK_HELPER_H */