1 /*****************************************************************************
2 * vlc_arrays.h : Arrays and data structures handling
3 *****************************************************************************
4 * Copyright (C) 1999-2004 the VideoLAN team
7 * Authors: Samuel Hocevar <sam@zoy.org>
8 * Clément Stenac <zorglub@videolan.org>
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2 of the License, or
13 * (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA. *****************************************************************************/
24 #if !defined( __LIBVLC__ )
25 #error You are not libvlc or one of its plugins. You cannot include this file
28 #ifndef _VLC_ARRAYS_H_
29 #define _VLC_ARRAYS_H_
34 * Simple dynamic array handling. Array is realloced at each insert/removal
36 #if defined( _MSC_VER ) && _MSC_VER < 1300 && !defined( UNDER_CE )
37 # define VLCCVP (void**) /* Work-around for broken compiler */
41 #define INSERT_ELEM( p_ar, i_oldsize, i_pos, elem ) \
44 if( !i_oldsize ) (p_ar) = NULL; \
45 (p_ar) = VLCCVP realloc( p_ar, ((i_oldsize) + 1) * sizeof(*(p_ar)) ); \
46 if( (i_oldsize) - (i_pos) ) \
48 memmove( (p_ar) + (i_pos) + 1, (p_ar) + (i_pos), \
49 ((i_oldsize) - (i_pos)) * sizeof( *(p_ar) ) ); \
51 (p_ar)[i_pos] = elem; \
56 #define REMOVE_ELEM( p_ar, i_oldsize, i_pos ) \
59 if( (i_oldsize) - (i_pos) - 1 ) \
61 memmove( (p_ar) + (i_pos), \
62 (p_ar) + (i_pos) + 1, \
63 ((i_oldsize) - (i_pos) - 1) * sizeof( *(p_ar) ) ); \
67 (p_ar) = realloc( p_ar, ((i_oldsize) - 1) * sizeof( *(p_ar) ) ); \
78 #define TAB_INIT( count, tab ) \
84 #define TAB_CLEAN( count, tab ) \
86 if( tab ) free( tab ); \
91 #define TAB_APPEND_CAST( cast, count, tab, p ) \
94 (tab) = cast realloc( tab, sizeof( void ** ) * ( (count) + 1 ) ); \
96 (tab) = cast malloc( sizeof( void ** ) ); \
101 #define TAB_APPEND( count, tab, p ) \
102 TAB_APPEND_CAST( , count, tab, p )
103 #define TAB_APPEND_CPP( type, count, tab, p ) \
104 TAB_APPEND_CAST( (type**), count, tab, p )
106 #define TAB_FIND( count, tab, p, index ) \
110 for( _i_ = 0; _i_ < (count); _i_++ ) \
112 if( (tab)[_i_] == (p) ) \
121 #define TAB_REMOVE( count, tab, p ) \
124 TAB_FIND( count, tab, p, _i_index_ ); \
125 if( _i_index_ >= 0 ) \
129 memmove( ((void**)(tab) + _i_index_), \
130 ((void**)(tab) + _i_index_+1), \
131 ( (count) - _i_index_ - 1 ) * sizeof( void* ) );\
142 #define TAB_INSERT_CAST( cast, count, tab, p, index ) do { \
144 (tab) = cast realloc( tab, sizeof( void ** ) * ( (count) + 1 ) ); \
146 (tab) = cast malloc( sizeof( void ** ) ); \
147 if( (count) - (index) > 0 ) \
148 memmove( (void**)(tab) + (index) + 1, \
149 (void**)(tab) + (index), \
150 ((count) - (index)) * sizeof(*(tab)) );\
151 (tab)[(index)] = (p); \
155 #define TAB_INSERT( count, tab, p, index ) \
156 TAB_INSERT_CAST( , count, tab, p, index )
159 * Binary search in a sorted array. The key must be comparable by < and >
160 * \param entries array of entries
161 * \param count number of entries
162 * \param elem key to check within an entry (like .id, or ->i_id)
163 * \param zetype type of the key
164 * \param key value of the key
165 * \param answer index of answer within the array. -1 if not found
167 #define BSEARCH( entries, count, elem, zetype, key, answer ) \
169 int low = 0, high = count - 1; \
171 while( low <= high ) {\
172 int mid = (low + high ) / 2; /* Just don't care about 2^30 tables */ \
173 zetype mid_val = entries[mid] elem;\
174 if( mid_val < key ) \
176 else if ( mid_val > key ) \
180 answer = mid; break; \
186 /************************************************************************
187 * Dynamic arrays with progressive allocation
188 ************************************************************************/
190 /* Internal functions */
191 #define _ARRAY_ALLOC(array, newsize) { \
192 array.i_alloc = newsize; \
193 array.p_elems = VLCCVP realloc( array.p_elems, array.i_alloc * \
194 sizeof(*array.p_elems) ); \
195 assert(array.p_elems); \
198 #define _ARRAY_GROW1(array) { \
199 if( array.i_alloc < 10 ) \
200 _ARRAY_ALLOC(array, 10 ) \
201 else if( array.i_alloc == array.i_size ) \
202 _ARRAY_ALLOC(array, (int)(array.i_alloc * 1.5) ) \
205 #define _ARRAY_GROW(array,additional) { \
206 int i_first = array.i_alloc; \
207 while( array.i_alloc - i_first < additional ) \
209 if( array.i_alloc < 10 ) \
210 _ARRAY_ALLOC(array, 10 ) \
211 else if( array.i_alloc == array.i_size ) \
212 _ARRAY_ALLOC(array, (int)(array.i_alloc * 1.5) ) \
217 #define _ARRAY_SHRINK(array) { \
218 if( array.i_size > 10 && array.i_size < (int)(array.i_alloc / 1.5) ) { \
219 _ARRAY_ALLOC(array, array.i_size + 5); \
223 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
226 #define DECL_ARRAY(type) struct { \
232 #define TYPEDEF_ARRAY(type, name) typedef DECL_ARRAY(type) name;
234 #define ARRAY_INIT(array) \
237 array.p_elems = NULL;
239 #define ARRAY_RESET(array) \
242 free( array.p_elems ); array.p_elems = NULL;
244 #define ARRAY_APPEND(array, elem) { \
245 _ARRAY_GROW1(array); \
246 array.p_elems[array.i_size] = elem; \
250 #define ARRAY_INSERT(array,elem,pos) { \
251 _ARRAY_GROW1(array); \
252 if( array.i_size - pos ) { \
253 memmove( array.p_elems + pos + 1, array.p_elems + pos, \
254 (array.i_size-pos) * sizeof(*array.p_elems) ); \
256 array.p_elems[pos] = elem; \
260 #define ARRAY_REMOVE(array,pos) { \
261 if( array.i_size - (pos) - 1 ) \
263 memmove( array.p_elems + pos, array.p_elems + pos + 1, \
264 ( array.i_size - pos - 1 ) *sizeof(*array.p_elems) ); \
267 _ARRAY_SHRINK(array); \
270 #define ARRAY_VAL(array, pos) array.p_elems[pos]
272 #define ARRAY_BSEARCH(array, elem, zetype, key, answer) \
273 BSEARCH( array.p_elems, array.i_size, elem, zetype, key, answer)
275 #define FOREACH_ARRAY( item, array ) { \
277 for( fe_idx = 0 ; fe_idx < array.i_size ; fe_idx++ ) \
279 item = array.p_elems[fe_idx];
281 #define FOREACH_END() } }
284 /************************************************************************
285 * Dynamic arrays with progressive allocation (Prefered API)
286 ************************************************************************/
287 typedef struct vlc_array_t
293 static inline vlc_array_t * vlc_array_new( void )
295 return calloc( 1, sizeof(vlc_array_t) );
299 static inline void vlc_array_init( vlc_array_t * p_array )
301 memset( p_array, 0, sizeof(vlc_array_t) );
304 static inline void vlc_array_clear( vlc_array_t * p_array )
306 free( p_array->pp_elems );
307 memset( p_array, 0, sizeof(vlc_array_t) );
310 static inline void vlc_array_destroy( vlc_array_t * p_array )
312 vlc_array_clear( p_array );
319 vlc_array_count( vlc_array_t * p_array )
321 return p_array->i_count;
325 vlc_array_item_at_index( vlc_array_t * p_array, int i_index )
327 return p_array->pp_elems[i_index];
331 vlc_array_index_of_item( vlc_array_t * p_array, void * item )
334 for( i = 0; i < p_array->i_count; i++)
336 if( p_array->pp_elems[i] == item )
344 vlc_array_insert( vlc_array_t * p_array, void * p_elem, int i_index )
346 TAB_INSERT_CAST( (void **), p_array->i_count, p_array->pp_elems, p_elem, i_index );
350 vlc_array_append( vlc_array_t * p_array, void * p_elem )
352 vlc_array_insert( p_array, p_elem, p_array->i_count );
356 vlc_array_remove( vlc_array_t * p_array, int i_index )
360 if( p_array->i_count > 1 )
362 memmove( p_array->pp_elems + i_index,
363 p_array->pp_elems + i_index+1,
364 ( p_array->i_count - i_index - 1 ) * sizeof( void* ) );
367 if( p_array->i_count == 0 )
369 free( p_array->pp_elems );
370 p_array->pp_elems = NULL;
376 /************************************************************************
378 ************************************************************************/
380 /* This function is not intended to be crypto-secure, we only want it to be
381 * fast and not suck too much. This one is pretty fast and did 0 collisions
382 * in wenglish's dictionary.
384 static inline uint64_t DictHash( const char *psz_string, int hashsize )
391 i_hash += *psz_string++;
392 i_hash += i_hash << 10;
393 i_hash ^= i_hash >> 8;
396 return i_hash % hashsize;
399 struct vlc_dictionary_entry_t
403 struct vlc_dictionary_entry_t * p_next;
406 typedef struct vlc_dictionary_t
409 struct vlc_dictionary_entry_t ** p_entries;
412 static void * const kVLCDictionaryNotFound = NULL;
414 static inline void vlc_dictionary_init( vlc_dictionary_t * p_dict, int i_size )
418 p_dict->p_entries = (struct vlc_dictionary_entry_t **)malloc(sizeof(struct vlc_dictionary_entry_t *) * i_size);
419 assert( p_dict->p_entries );
420 memset( p_dict->p_entries, 0, sizeof(struct vlc_dictionary_entry_t *) * i_size );
423 p_dict->p_entries = NULL;
424 p_dict->i_size = i_size;
427 static inline void vlc_dictionary_clear( vlc_dictionary_t * p_dict )
430 struct vlc_dictionary_entry_t * p_current, * p_next;
431 for( i = 0; i < p_dict->i_size; i++ )
433 p_current = p_dict->p_entries[i];
436 p_next = p_dict->p_entries[i]->p_next;
437 free( p_dict->p_entries[i]->psz_key );
442 free( p_dict->p_entries );
449 vlc_dictionary_value_for_key( const vlc_dictionary_t * p_dict, const char * psz_key )
451 if( !p_dict->p_entries )
452 return kVLCDictionaryNotFound;
454 int i_pos = DictHash( psz_key, p_dict->i_size );
455 struct vlc_dictionary_entry_t * p_entry = p_dict->p_entries[i_pos];
457 if( p_entry && !p_entry->p_next )
458 return p_entry->p_value;
461 return kVLCDictionaryNotFound;
465 if( !strcmp( psz_key, p_entry->psz_key ) )
466 return p_entry->p_value;
467 p_entry = p_entry->p_next;
470 return kVLCDictionaryNotFound;
474 vlc_dictionary_keys_count( const vlc_dictionary_t * p_dict )
476 struct vlc_dictionary_entry_t * p_entry;
478 for( i = 0; i < p_dict->i_size; i++ )
480 for( p_entry = p_dict->p_entries[i]; p_entry; p_entry = p_entry->p_next ) count++;
485 static inline char **
486 vlc_dictionary_all_keys( const vlc_dictionary_t * p_dict )
488 struct vlc_dictionary_entry_t * p_entry;
490 int i, count = vlc_dictionary_keys_count( p_dict );
492 ppsz_ret = (char**)malloc(sizeof(char *) * (count + 1));
496 for( i = 0; i < p_dict->i_size; i++ )
498 for( p_entry = p_dict->p_entries[i]; p_entry; p_entry = p_entry->p_next )
500 ppsz_ret[count++] = strdup( p_entry->psz_key );
504 ppsz_ret[count] = NULL;
509 __vlc_dictionary_insert( vlc_dictionary_t * p_dict, const char * psz_key,
510 void * p_value, vlc_bool_t rebuild )
512 if( !p_dict->p_entries )
513 vlc_dictionary_init( p_dict, 1 );
515 int i_pos = DictHash( psz_key, p_dict->i_size );
516 struct vlc_dictionary_entry_t * p_entry = p_dict->p_entries[i_pos];
520 p_entry = p_dict->p_entries[i_pos] = (struct vlc_dictionary_entry_t *)malloc(
521 sizeof(struct vlc_dictionary_entry_t));
524 p_entry->psz_key = strdup( psz_key );
525 assert( p_entry->psz_key );
526 p_entry->p_value = p_value;
527 p_dict->p_entries[i_pos]->p_next = NULL;
530 if( p_entry->p_value == kVLCDictionaryNotFound )
532 /* This one is fine, just high jack */
533 p_entry->psz_key = strdup( psz_key );
534 p_entry->p_value = p_value;
538 /* Hash collision here */
539 p_entry = (struct vlc_dictionary_entry_t *)malloc(sizeof(struct vlc_dictionary_entry_t));
541 p_entry->psz_key = strdup( psz_key );
542 p_entry->p_value = p_value;
543 p_entry->p_next = p_dict->p_entries[i_pos];
544 p_dict->p_entries[i_pos] = p_entry;
548 /* Count how many items there was */
550 for( count = 1; p_entry->p_next; count++ ) p_entry = p_entry->p_next;
551 if( count > 3 ) /* XXX: this need tuning */
553 /* Here it starts to be not good, rebuild a bigger dictionary */
554 struct vlc_dictionary_t new_dict;
555 int i_new_size = ( (p_dict->i_size+2) * 3) / 2; /* XXX: this need tuning */
558 vlc_dictionary_init( &new_dict, i_new_size );
559 for( i = 0; i < p_dict->i_size; i++ )
561 p_entry = p_dict->p_entries[i];
564 __vlc_dictionary_insert( &new_dict, p_entry->psz_key,
566 0 /* To avoid multiple rebuild loop */);
567 p_entry = p_entry->p_next;
570 vlc_dictionary_clear( p_dict );
571 p_dict->i_size = new_dict.i_size;
572 p_dict->p_entries= new_dict.p_entries;
578 vlc_dictionary_insert( vlc_dictionary_t * p_dict, const char * psz_key, void * p_value )
580 __vlc_dictionary_insert( p_dict, psz_key, p_value, 1 );
584 vlc_dictionary_remove_value_for_key( const vlc_dictionary_t * p_dict, const char * psz_key )
586 if( !p_dict->p_entries )
589 int i_pos = DictHash( psz_key, p_dict->i_size );
590 struct vlc_dictionary_entry_t * p_entry = p_dict->p_entries[i_pos];
591 struct vlc_dictionary_entry_t * p_prev;
594 return; /* Not found, nothing to do */
596 if( !p_entry->p_next )
598 free( p_entry->psz_key );
600 p_dict->p_entries[i_pos] = NULL;
607 if( !strcmp( psz_key, p_entry->psz_key ) )
610 p_dict->p_entries[i_pos] = p_entry->p_next;
612 p_prev->p_next = p_entry->p_next;
613 free( p_entry->psz_key );
618 p_entry = p_entry->p_next;
621 /* No key was found */