mirror of https://code.videolan.org/videolan/vlc
248 lines
12 KiB
C
248 lines
12 KiB
C
|
/*****************************************************************************
|
||
|
|
* vlc_arrays.h : Arrays and data structures handling
|
||
|
|
*****************************************************************************
|
||
|
|
* Copyright (C) 1999-2004 the VideoLAN team
|
||
|
|
* $Id: vlc_playlist.h 17108 2006-10-15 15:28:34Z zorglub $
|
||
|
|
*
|
||
|
|
* Authors: Samuel Hocevar <sam@zoy.org>
|
||
|
|
* Clément Stenac <zorglub@videolan.org>
|
||
|
|
*
|
||
|
|
* This program is free software; you can redistribute it and/or modify
|
||
|
|
* it under the terms of the GNU General Public License as published by
|
||
|
|
* the Free Software Foundation; either version 2 of the License, or
|
||
|
|
* (at your option) any later version.
|
||
|
|
*
|
||
|
|
* This program is distributed in the hope that it will be useful,
|
||
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
* GNU General Public License for more details.
|
||
|
|
*
|
||
|
|
* You should have received a copy of the GNU General Public License
|
||
|
|
* along with this program; if not, write to the Free Software
|
||
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA. *****************************************************************************/
|
||
|
|
|
||
|
|
#ifndef _VLC_ARRAYS_H_
|
||
|
|
#define _VLC_ARRAYS_H_
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Simple dynamic array handling. Array is realloced at each insert/removal
|
||
|
|
*/
|
||
|
|
#if defined( _MSC_VER ) && _MSC_VER < 1300 && !defined( UNDER_CE )
|
||
|
|
# define VLCCVP (void**) /* Work-around for broken compiler */
|
||
|
|
#else
|
||
|
|
# define VLCCVP
|
||
|
|
#endif
|
||
|
|
#define INSERT_ELEM( p_ar, i_oldsize, i_pos, elem ) \
|
||
|
|
do \
|
||
|
|
{ \
|
||
|
|
if( !i_oldsize ) (p_ar) = NULL; \
|
||
|
|
(p_ar) = VLCCVP realloc( p_ar, ((i_oldsize) + 1) * sizeof(*(p_ar)) ); \
|
||
|
|
if( (i_oldsize) - (i_pos) ) \
|
||
|
|
{ \
|
||
|
|
memmove( (p_ar) + (i_pos) + 1, (p_ar) + (i_pos), \
|
||
|
|
((i_oldsize) - (i_pos)) * sizeof( *(p_ar) ) ); \
|
||
|
|
} \
|
||
|
|
(p_ar)[i_pos] = elem; \
|
||
|
|
(i_oldsize)++; \
|
||
|
|
} \
|
||
|
|
while( 0 )
|
||
|
|
|
||
|
|
#define REMOVE_ELEM( p_ar, i_oldsize, i_pos ) \
|
||
|
|
do \
|
||
|
|
{ \
|
||
|
|
if( (i_oldsize) - (i_pos) - 1 ) \
|
||
|
|
{ \
|
||
|
|
memmove( (p_ar) + (i_pos), \
|
||
|
|
(p_ar) + (i_pos) + 1, \
|
||
|
|
((i_oldsize) - (i_pos) - 1) * sizeof( *(p_ar) ) ); \
|
||
|
|
} \
|
||
|
|
if( i_oldsize > 1 ) \
|
||
|
|
{ \
|
||
|
|
(p_ar) = realloc( p_ar, ((i_oldsize) - 1) * sizeof( *(p_ar) ) ); \
|
||
|
|
} \
|
||
|
|
else \
|
||
|
|
{ \
|
||
|
|
free( p_ar ); \
|
||
|
|
(p_ar) = NULL; \
|
||
|
|
} \
|
||
|
|
(i_oldsize)--; \
|
||
|
|
} \
|
||
|
|
while( 0 )
|
||
|
|
|
||
|
|
|
||
|
|
#define TAB_APPEND( count, tab, p ) \
|
||
|
|
if( (count) > 0 ) \
|
||
|
|
{ \
|
||
|
|
(tab) = realloc( tab, sizeof( void ** ) * ( (count) + 1 ) ); \
|
||
|
|
} \
|
||
|
|
else \
|
||
|
|
{ \
|
||
|
|
(tab) = malloc( sizeof( void ** ) ); \
|
||
|
|
} \
|
||
|
|
(tab)[count] = (p); \
|
||
|
|
(count)++
|
||
|
|
|
||
|
|
#define TAB_FIND( count, tab, p, index ) \
|
||
|
|
{ \
|
||
|
|
int _i_; \
|
||
|
|
(index) = -1; \
|
||
|
|
for( _i_ = 0; _i_ < (count); _i_++ ) \
|
||
|
|
{ \
|
||
|
|
if( (tab)[_i_] == (p) ) \
|
||
|
|
{ \
|
||
|
|
(index) = _i_; \
|
||
|
|
break; \
|
||
|
|
} \
|
||
|
|
} \
|
||
|
|
}
|
||
|
|
|
||
|
|
#define TAB_REMOVE( count, tab, p ) \
|
||
|
|
{ \
|
||
|
|
int _i_index_; \
|
||
|
|
TAB_FIND( count, tab, p, _i_index_ ); \
|
||
|
|
if( _i_index_ >= 0 ) \
|
||
|
|
{ \
|
||
|
|
if( (count) > 1 ) \
|
||
|
|
{ \
|
||
|
|
memmove( ((void**)(tab) + _i_index_), \
|
||
|
|
((void**)(tab) + _i_index_+1), \
|
||
|
|
( (count) - _i_index_ - 1 ) * sizeof( void* ) );\
|
||
|
|
} \
|
||
|
|
(count)--; \
|
||
|
|
if( (count) == 0 ) \
|
||
|
|
{ \
|
||
|
|
free( tab ); \
|
||
|
|
(tab) = NULL; \
|
||
|
|
} \
|
||
|
|
} \
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Binary search in an array
|
||
|
|
* \param entries array of entries
|
||
|
|
* \param count number of entries
|
||
|
|
* \param elem key to check within an entry (like .id, or ->i_id)
|
||
|
|
* \param zetype type of the key
|
||
|
|
* \param key value of the key
|
||
|
|
* \param answer index of answer within the array. -1 if not found
|
||
|
|
*/
|
||
|
|
#define BSEARCH( entries, count, elem, zetype, key, answer ) { \
|
||
|
|
int low = 0, high = count - 1; \
|
||
|
|
answer = -1; \
|
||
|
|
while( low <= high ) {\
|
||
|
|
int mid = (low + high ) / 2; /* Just don't care about 2^30 tables */ \
|
||
|
|
zetype mid_val = entries[mid] elem;\
|
||
|
|
if( mid_val < key ) \
|
||
|
|
low = mid + 1; \
|
||
|
|
else if ( mid_val > key ) \
|
||
|
|
high = mid -1; \
|
||
|
|
else \
|
||
|
|
{ \
|
||
|
|
answer = mid; break; \
|
||
|
|
}\
|
||
|
|
} \
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Dictionnary handling */
|
||
|
|
struct dict_entry_t
|
||
|
|
{
|
||
|
|
int i_int;
|
||
|
|
char *psz_string;
|
||
|
|
uint64_t i_hash;
|
||
|
|
void *p_data;
|
||
|
|
};
|
||
|
|
|
||
|
|
struct dict_t
|
||
|
|
{
|
||
|
|
dict_entry_t *p_entries;
|
||
|
|
int i_entries;
|
||
|
|
};
|
||
|
|
|
||
|
|
VLC_EXPORT( dict_t *, vlc_DictNew, (void) );
|
||
|
|
VLC_EXPORT( void, vlc_DictClear, (dict_t * ) );
|
||
|
|
VLC_EXPORT( void, vlc_DictInsert, (dict_t *, int, const char *, void * ) );
|
||
|
|
VLC_EXPORT( void*, vlc_DictGet, (dict_t *, int, const char * ) );
|
||
|
|
VLC_EXPORT( int, vlc_DictLookup, (dict_t *, int, const char * ) );
|
||
|
|
|
||
|
|
|
||
|
|
/************************************************************************
|
||
|
|
* Dynamic arrays with progressive allocation
|
||
|
|
************************************************************************/
|
||
|
|
|
||
|
|
/* Internal functions */
|
||
|
|
//printf("Realloc from %i to %i\n", array.i_alloc, newsize);
|
||
|
|
#define _ARRAY_ALLOC(array, newsize) { \
|
||
|
|
array.i_alloc = newsize; \
|
||
|
|
array.p_elems = VLCCVP realloc( array.p_elems, array.i_alloc * \
|
||
|
|
sizeof(*array.p_elems) ); \
|
||
|
|
assert(array.p_elems); \
|
||
|
|
}
|
||
|
|
|
||
|
|
#define _ARRAY_GROW1(array) { \
|
||
|
|
if( array.i_alloc < 10 ) \
|
||
|
|
_ARRAY_ALLOC(array, 10 ) \
|
||
|
|
else if( array.i_alloc == array.i_size ) \
|
||
|
|
_ARRAY_ALLOC(array, (int)(array.i_alloc * 1.5) ) \
|
||
|
|
}
|
||
|
|
|
||
|
|
#define _ARRAY_GROW(array,additional) { \
|
||
|
|
int i_first = array.i_alloc; \
|
||
|
|
while( array.i_alloc - i_first < additional ) \
|
||
|
|
{ \
|
||
|
|
if( array.i_alloc < 10 ) \
|
||
|
|
_ARRAY_ALLOC(array, 10 ) \
|
||
|
|
else if( array.i_alloc == array.i_size ) \
|
||
|
|
_ARRAY_ALLOC(array, (int)(array.i_alloc * 1.5) ) \
|
||
|
|
else break; \
|
||
|
|
} \
|
||
|
|
}
|
||
|
|
|
||
|
|
#define _ARRAY_SHRINK(array) { \
|
||
|
|
if( array.i_size > 10 && array.i_size < (int)(array.i_alloc / 1.5) ) { \
|
||
|
|
_ARRAY_ALLOC(array, array.i_size + 5); \
|
||
|
|
} \
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/* API */
|
||
|
|
#define DECL_ARRAY(type) struct { \
|
||
|
|
int i_alloc; \
|
||
|
|
int i_size; \
|
||
|
|
type *p_elems; \
|
||
|
|
}
|
||
|
|
|
||
|
|
#define TYPEDEF_ARRAY(type, name) typedef DECL_ARRAY(type) name;
|
||
|
|
|
||
|
|
#define ARRAY_INIT(array) \
|
||
|
|
array.i_alloc = 0; \
|
||
|
|
array.i_size = 0; \
|
||
|
|
array.p_elems = NULL;
|
||
|
|
|
||
|
|
#define ARRAY_APPEND(array, elem) { \
|
||
|
|
_ARRAY_GROW1(array); \
|
||
|
|
array.p_elems[array.i_size] = elem; \
|
||
|
|
array.i_size++; \
|
||
|
|
}
|
||
|
|
|
||
|
|
#define ARRAY_INSERT(array,elem,pos) { \
|
||
|
|
_ARRAY_GROW1(array); \
|
||
|
|
if( array.i_size - pos ) { \
|
||
|
|
memmove( array.p_elems + pos + 1, array.p_elems + pos, \
|
||
|
|
(array.i_size-pos) * sizeof(*array.p_elems) ); \
|
||
|
|
} \
|
||
|
|
array.p_elems[pos] = elem; \
|
||
|
|
array.i_size++; \
|
||
|
|
}
|
||
|
|
|
||
|
|
#define ARRAY_REMOVE(array,pos) { \
|
||
|
|
if( array.i_size - (pos) - 1 ) \
|
||
|
|
{ \
|
||
|
|
memmove( array.p_elems + pos, array.p_elems + pos + 1, \
|
||
|
|
( array.i_size - pos - 1 ) *sizeof(*array.p_elems) ); \
|
||
|
|
} \
|
||
|
|
array.i_size--; \
|
||
|
|
_ARRAY_SHRINK(array); \
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|