vlc_arrays.h 20.5 KB
Newer Older
1 2 3
/*****************************************************************************
 * vlc_arrays.h : Arrays and data structures handling
 *****************************************************************************
Jean-Baptiste Kempf's avatar
LGPL  
Jean-Baptiste Kempf committed
4
 * Copyright (C) 1999-2004 VLC authors and VideoLAN
5
 * $Id$
6 7 8 9
 *
 * Authors: Samuel Hocevar <sam@zoy.org>
 *          Clément Stenac <zorglub@videolan.org>
 *
Jean-Baptiste Kempf's avatar
LGPL  
Jean-Baptiste Kempf committed
10 11 12
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or
13 14 15 16
 * (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
Jean-Baptiste Kempf's avatar
LGPL  
Jean-Baptiste Kempf committed
17 18
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Lesser General Public License for more details.
19
 *
Jean-Baptiste Kempf's avatar
LGPL  
Jean-Baptiste Kempf committed
20 21 22
 * You should have received a copy of the GNU Lesser 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.
Rémi Duraffort's avatar
Rémi Duraffort committed
23
 *****************************************************************************/
24

25 26
#ifndef VLC_ARRAYS_H_
#define VLC_ARRAYS_H_
27

28 29 30 31 32
/**
 * \file
 * This file defines functions, structures and macros for handling arrays in vlc
 */

Rémi Denis-Courmont's avatar
Rémi Denis-Courmont committed
33 34 35 36 37 38 39
/* realloc() that never fails *if* downsizing */
static inline void *realloc_down( void *ptr, size_t size )
{
    void *ret = realloc( ptr, size );
    return ret ? ret : ptr;
}

40 41 42 43 44 45 46 47
#define TAB_INIT( count, tab )                  \
  do {                                          \
    (count) = 0;                                \
    (tab) = NULL;                               \
  } while(0)

#define TAB_CLEAN( count, tab )                 \
  do {                                          \
48
    free( tab );                                \
49 50 51
    (count)= 0;                                 \
    (tab)= NULL;                                \
  } while(0)
52

53
#define TAB_APPEND_CAST( cast, count, tab, p )             \
54
  do {                                          \
55
    if( (count) > 0 )                           \
56
        (tab) = cast realloc( tab, sizeof( *(tab) ) * ( (count) + 1 ) ); \
57
    else                                        \
58
        (tab) = cast malloc( sizeof( *(tab) ) );    \
59
    if( !(tab) ) abort();                       \
60 61 62
    (tab)[count] = (p);                         \
    (count)++;                                  \
  } while(0)
63

64 65 66
#define TAB_APPEND( count, tab, p )             \
    TAB_APPEND_CAST( , count, tab, p )

67
#define TAB_FIND( count, tab, p, idx )          \
68
  do {                                          \
69 70
    for( (idx) = 0; (idx) < (count); (idx)++ )  \
        if( (tab)[(idx)] == (p) )               \
71
            break;                              \
72 73
    if( (idx) >= (count) )                      \
        (idx) = -1;                             \
74
  } while(0)
75

76

77 78 79
#define TAB_ERASE( count, tab, index )      \
  do {                                      \
        if( (count) > 1 )                   \
80 81 82
            memmove( (tab) + (index),       \
                     (tab) + (index) + 1,   \
                     ((count) - (index) - 1 ) * sizeof( *(tab) ) );\
83 84 85 86 87 88 89 90
        (count)--;                          \
        if( (count) == 0 )                  \
        {                                   \
            free( tab );                    \
            (tab) = NULL;                   \
        }                                   \
  } while(0)

91
#define TAB_REMOVE( count, tab, p )             \
92
  do {                                          \
93 94 95
        int i_index;                            \
        TAB_FIND( count, tab, p, i_index );     \
        if( i_index >= 0 )                      \
96
            TAB_ERASE( count, tab, i_index );   \
97
  } while(0)
98

Laurent Aimar's avatar
Laurent Aimar committed
99 100
#define TAB_INSERT_CAST( cast, count, tab, p, index ) do { \
    if( (count) > 0 )                           \
101
        (tab) = cast realloc( tab, sizeof( *(tab) ) * ( (count) + 1 ) ); \
Laurent Aimar's avatar
Laurent Aimar committed
102
    else                                        \
103
        (tab) = cast malloc( sizeof( *(tab) ) );       \
104
    if( !(tab) ) abort();                       \
Laurent Aimar's avatar
Laurent Aimar committed
105
    if( (count) - (index) > 0 )                 \
106 107 108
        memmove( (tab) + (index) + 1,           \
                 (tab) + (index),               \
                 ((count) - (index)) * sizeof( *(tab) ) );\
Laurent Aimar's avatar
Laurent Aimar committed
109 110 111 112 113 114 115
    (tab)[(index)] = (p);                       \
    (count)++;                                  \
} while(0)

#define TAB_INSERT( count, tab, p, index )      \
    TAB_INSERT_CAST( , count, tab, p, index )

116
/**
Clément Stenac's avatar
Clément Stenac committed
117
 * Binary search in a sorted array. The key must be comparable by < and >
118 119 120 121 122 123 124
 * \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
 */
125 126
#define BSEARCH( entries, count, elem, zetype, key, answer ) \
   do {  \
127 128 129
    int low = 0, high = count - 1;   \
    answer = -1; \
    while( low <= high ) {\
130
        int mid = ((unsigned int)low + (unsigned int)high) >> 1;\
131 132 133 134 135 136 137 138 139 140
        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;   \
        }\
    } \
141
 } while(0)
142

143

144 145 146 147 148 149
/************************************************************************
 * Dynamic arrays with progressive allocation
 ************************************************************************/

/* Internal functions */
#define _ARRAY_ALLOC(array, newsize) {                                      \
Rémi Duraffort's avatar
Rémi Duraffort committed
150
    (array).i_alloc = newsize;                                              \
151 152
    (array).p_elems = realloc( (array).p_elems, (array).i_alloc *           \
                               sizeof(*(array).p_elems) );                  \
153
    if( !(array).p_elems ) abort();                                         \
154 155 156
}

#define _ARRAY_GROW1(array) {                                               \
Rémi Duraffort's avatar
Rémi Duraffort committed
157
    if( (array).i_alloc < 10 )                                              \
158
        _ARRAY_ALLOC(array, 10 )                                            \
Rémi Duraffort's avatar
Rémi Duraffort committed
159
    else if( (array).i_alloc == (array).i_size )                            \
160
        _ARRAY_ALLOC(array, (int)((array).i_alloc * 1.5) )                    \
161 162
}

163
#define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
164 165 166 167 168 169 170 171 172 173 174

/* 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)                                                   \
Rémi Duraffort's avatar
Rémi Duraffort committed
175
  do {                                                                      \
Rémi Duraffort's avatar
Rémi Duraffort committed
176 177
    (array).i_alloc = 0;                                                    \
    (array).i_size = 0;                                                     \
Rémi Duraffort's avatar
Rémi Duraffort committed
178 179
    (array).p_elems = NULL;                                                 \
  } while(0)
180

Clément Stenac's avatar
Clément Stenac committed
181
#define ARRAY_RESET(array)                                                  \
Rémi Duraffort's avatar
Rémi Duraffort committed
182
  do {                                                                      \
Rémi Duraffort's avatar
Rémi Duraffort committed
183 184
    (array).i_alloc = 0;                                                    \
    (array).i_size = 0;                                                     \
Rémi Duraffort's avatar
Rémi Duraffort committed
185 186
    free( (array).p_elems ); (array).p_elems = NULL;                        \
  } while(0)
Clément Stenac's avatar
Clément Stenac committed
187

Rémi Duraffort's avatar
Rémi Duraffort committed
188 189
#define ARRAY_APPEND(array, elem)                                           \
  do {                                                                      \
190
    _ARRAY_GROW1(array);                                                    \
Rémi Duraffort's avatar
Rémi Duraffort committed
191 192
    (array).p_elems[(array).i_size] = elem;                                 \
    (array).i_size++;                                                       \
Rémi Duraffort's avatar
Rémi Duraffort committed
193
  } while(0)
194

Rémi Duraffort's avatar
Rémi Duraffort committed
195 196
#define ARRAY_INSERT(array,elem,pos)                                        \
  do {                                                                      \
197
    _ARRAY_GROW1(array);                                                    \
Rémi Duraffort's avatar
Rémi Duraffort committed
198 199 200
    if( (array).i_size - pos ) {                                            \
        memmove( (array).p_elems + pos + 1, (array).p_elems + pos,          \
                 ((array).i_size-pos) * sizeof(*(array).p_elems) );         \
201
    }                                                                       \
Rémi Duraffort's avatar
Rémi Duraffort committed
202 203
    (array).p_elems[pos] = elem;                                            \
    (array).i_size++;                                                       \
Rémi Duraffort's avatar
Rémi Duraffort committed
204
  } while(0)
205

206 207 208 209 210 211
#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);                            \
    }                                                                       \
}

Rémi Duraffort's avatar
Rémi Duraffort committed
212 213
#define ARRAY_REMOVE(array,pos)                                             \
  do {                                                                      \
Rémi Duraffort's avatar
Rémi Duraffort committed
214
    if( (array).i_size - (pos) - 1 )                                        \
215
    {                                                                       \
Rémi Duraffort's avatar
Rémi Duraffort committed
216 217
        memmove( (array).p_elems + pos, (array).p_elems + pos + 1,          \
                 ( (array).i_size - pos - 1 ) *sizeof(*(array).p_elems) );  \
218
    }                                                                       \
Rémi Duraffort's avatar
Rémi Duraffort committed
219
    (array).i_size--;                                                       \
220
    _ARRAY_SHRINK(array);                                                   \
Rémi Duraffort's avatar
Rémi Duraffort committed
221
  } while(0)
222

Clément Stenac's avatar
Clément Stenac committed
223 224 225
#define ARRAY_VAL(array, pos) array.p_elems[pos]

#define ARRAY_BSEARCH(array, elem, zetype, key, answer) \
Rémi Duraffort's avatar
Rémi Duraffort committed
226
    BSEARCH( (array).p_elems, (array).i_size, elem, zetype, key, answer)
Clément Stenac's avatar
Clément Stenac committed
227 228 229

#define FOREACH_ARRAY( item, array ) { \
    int fe_idx; \
230
    for( fe_idx = 0 ; fe_idx < (array).i_size ; fe_idx++ ) \
Clément Stenac's avatar
Clément Stenac committed
231
    { \
232
        item = (array).p_elems[fe_idx];
Clément Stenac's avatar
Clément Stenac committed
233 234 235

#define FOREACH_END() } }

236 237

/************************************************************************
Sam Hocevar's avatar
Sam Hocevar committed
238
 * Dynamic arrays with progressive allocation (Preferred API)
239 240 241
 ************************************************************************/
typedef struct vlc_array_t
{
242
    size_t i_count;
243 244 245 246 247
    void ** pp_elems;
} vlc_array_t;

static inline void vlc_array_init( vlc_array_t * p_array )
{
248 249
    p_array->i_count = 0;
    p_array->pp_elems = NULL;
250 251 252 253 254
}

static inline void vlc_array_clear( vlc_array_t * p_array )
{
    free( p_array->pp_elems );
255
    vlc_array_init( p_array );
256 257 258
}

/* Read */
259
static inline size_t vlc_array_count( vlc_array_t * p_array )
260 261 262 263
{
    return p_array->i_count;
}

264 265 266 267 268 269 270
#if defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L)
# define vlc_array_item_at_index(ar, idx) \
    _Generic((ar), \
        const vlc_array_t *: ((ar)->pp_elems[idx]), \
        vlc_array_t *: ((ar)->pp_elems[idx]))
#elif defined (__cplusplus)
static inline void *vlc_array_item_at_index( vlc_array_t *ar, size_t idx )
271
{
272
    return ar->pp_elems[idx];
273 274
}

275 276
static inline const void *vlc_array_item_at_index( const vlc_array_t *ar,
                                                   size_t idx )
277
{
278 279 280 281 282 283 284 285
    return ar->pp_elems[idx];
}
#endif

static inline ssize_t vlc_array_index_of_item( const vlc_array_t *ar,
                                               const void *elem )
{
    for( size_t i = 0; i < ar->i_count; i++ )
286
    {
287
        if( ar->pp_elems[i] == elem )
288 289 290 291 292
            return i;
    }
    return -1;
}

293
/* Write */
294
static inline int vlc_array_insert( vlc_array_t *ar, void *elem, int idx )
295
{
296 297 298
    void **pp = (void **)realloc( ar->pp_elems,
                                  sizeof( void * ) * (ar->i_count + 1) );
    if( unlikely(pp == NULL) )
299
        return -1;
300 301 302 303 304 305 306 307

    size_t tail = ar->i_count - idx;
    if( tail > 0 )
        memmove( pp + idx + 1, pp + idx, sizeof( void * ) * tail );

    pp[idx] = elem;
    ar->i_count++;
    ar->pp_elems = pp;
308 309 310 311 312 313 314
    return 0;
}

static inline void vlc_array_insert_or_abort( vlc_array_t *ar, void *elem, int idx )
{
    if( vlc_array_insert( ar, elem, idx ) )
        abort();
315 316
}

317
static inline int vlc_array_append( vlc_array_t *ar, void *elem )
318
{
319 320 321
    void **pp = (void **)realloc( ar->pp_elems,
                                  sizeof( void * ) * (ar->i_count + 1) );
    if( unlikely(pp == NULL) )
322
        return -1;
323 324 325

    pp[ar->i_count++] = elem;
    ar->pp_elems = pp;
326 327 328 329 330 331 332
    return 0;
}

static inline void vlc_array_append_or_abort( vlc_array_t *ar, void *elem )
{
    if( vlc_array_append( ar, elem ) != 0 )
        abort();
333 334
}

335
static inline void vlc_array_remove( vlc_array_t *ar, size_t idx )
336
{
337 338 339 340 341 342 343 344 345 346 347 348 349 350 351
    void **pp = ar->pp_elems;
    size_t tail = ar->i_count - idx - 1;

    if( tail > 0 )
        memmove( pp + idx, pp + idx + 1, sizeof( void * ) * tail );

    ar->i_count--;

    if( ar->i_count > 0 )
    {
        pp = (void **)realloc( pp, sizeof( void * ) * ar->i_count );
        if( likely(pp != NULL) )
            ar->pp_elems = pp;
    }
    else
352
    {
353 354
        free( pp );
        ar->pp_elems = NULL;
355 356 357 358
    }
}


359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381
/************************************************************************
 * Dictionaries
 ************************************************************************/

/* This function is not intended to be crypto-secure, we only want it to be
 * fast and not suck too much. This one is pretty fast and did 0 collisions
 * in wenglish's dictionary.
 */
static inline uint64_t DictHash( const char *psz_string, int hashsize )
{
    uint64_t i_hash = 0;
    if( psz_string )
    {
        while( *psz_string )
        {
            i_hash += *psz_string++;
            i_hash += i_hash << 10;
            i_hash ^= i_hash >> 8;
        }
    }
    return i_hash % hashsize;
}

Laurent Aimar's avatar
Laurent Aimar committed
382
typedef struct vlc_dictionary_entry_t
383 384 385 386
{
    char *   psz_key;
    void *   p_value;
    struct vlc_dictionary_entry_t * p_next;
Laurent Aimar's avatar
Laurent Aimar committed
387
} vlc_dictionary_entry_t;
388 389 390 391

typedef struct vlc_dictionary_t
{
    int i_size;
Laurent Aimar's avatar
Laurent Aimar committed
392
    vlc_dictionary_entry_t ** p_entries;
393 394 395 396 397 398
} vlc_dictionary_t;

static void * const kVLCDictionaryNotFound = NULL;

static inline void vlc_dictionary_init( vlc_dictionary_t * p_dict, int i_size )
{
Laurent Aimar's avatar
Laurent Aimar committed
399 400
    p_dict->p_entries = NULL;

401 402
    if( i_size > 0 )
    {
Laurent Aimar's avatar
Laurent Aimar committed
403 404 405
        p_dict->p_entries = (vlc_dictionary_entry_t **)calloc( i_size, sizeof(*p_dict->p_entries) );
        if( !p_dict->p_entries )
            i_size = 0;
406
    }
407 408 409
    p_dict->i_size = i_size;
}

410 411 412
static inline void vlc_dictionary_clear( vlc_dictionary_t * p_dict,
                                         void ( * pf_free )( void * p_data, void * p_obj ),
                                         void * p_obj )
413
{
414
    if( p_dict->p_entries )
415
    {
Laurent Aimar's avatar
Laurent Aimar committed
416
        for( int i = 0; i < p_dict->i_size; i++ )
417
        {
Laurent Aimar's avatar
Laurent Aimar committed
418
            vlc_dictionary_entry_t * p_current, * p_next;
419 420 421
            p_current = p_dict->p_entries[i];
            while( p_current )
            {
422
                p_next = p_current->p_next;
423 424
                if( pf_free != NULL )
                    ( * pf_free )( p_current->p_value, p_obj );
425
                free( p_current->psz_key );
426 427 428
                free( p_current );
                p_current = p_next;
            }
429
        }
430
        free( p_dict->p_entries );
431
        p_dict->p_entries = NULL;
432 433 434 435
    }
    p_dict->i_size = 0;
}

436 437 438 439 440
static inline int
vlc_dictionary_has_key( const vlc_dictionary_t * p_dict, const char * psz_key )
{
    if( !p_dict->p_entries )
        return 0;
441

442
    int i_pos = DictHash( psz_key, p_dict->i_size );
443 444 445 446 447 448 449
    const vlc_dictionary_entry_t * p_entry = p_dict->p_entries[i_pos];
    for( ; p_entry != NULL; p_entry = p_entry->p_next )
    {
        if( !strcmp( psz_key, p_entry->psz_key ) )
            break;
    }
    return p_entry != NULL;
450
}
451 452 453 454

static inline void *
vlc_dictionary_value_for_key( const vlc_dictionary_t * p_dict, const char * psz_key )
{
455 456 457
    if( !p_dict->p_entries )
        return kVLCDictionaryNotFound;

458
    int i_pos = DictHash( psz_key, p_dict->i_size );
Laurent Aimar's avatar
Laurent Aimar committed
459
    vlc_dictionary_entry_t * p_entry = p_dict->p_entries[i_pos];
460 461 462 463

    if( !p_entry )
        return kVLCDictionaryNotFound;

464
    /* Make sure we return the right item. (Hash collision) */
465 466 467 468 469 470
    do {
        if( !strcmp( psz_key, p_entry->psz_key ) )
            return p_entry->p_value;
        p_entry = p_entry->p_next;
    } while( p_entry );

471
    return kVLCDictionaryNotFound;
472 473 474 475 476
}

static inline int
vlc_dictionary_keys_count( const vlc_dictionary_t * p_dict )
{
Laurent Aimar's avatar
Laurent Aimar committed
477
    vlc_dictionary_entry_t * p_entry;
478
    int i, count = 0;
479 480 481 482

    if( !p_dict->p_entries )
        return 0;

483 484 485 486 487 488 489
    for( i = 0; i < p_dict->i_size; i++ )
    {
        for( p_entry = p_dict->p_entries[i]; p_entry; p_entry = p_entry->p_next ) count++;
    }
    return count;
}

490 491 492 493 494 495 496 497 498 499
static inline bool
vlc_dictionary_is_empty( const vlc_dictionary_t * p_dict )
{
    if( p_dict->p_entries )
        for( int i = 0; i < p_dict->i_size; i++ )
            if( p_dict->p_entries[i] )
                return false;
    return true;
}

500 501 502
static inline char **
vlc_dictionary_all_keys( const vlc_dictionary_t * p_dict )
{
Laurent Aimar's avatar
Laurent Aimar committed
503
    vlc_dictionary_entry_t * p_entry;
504 505 506
    char ** ppsz_ret;
    int i, count = vlc_dictionary_keys_count( p_dict );

507
    ppsz_ret = (char**)malloc(sizeof(char *) * (count + 1));
508
    if( unlikely(!ppsz_ret) )
509
        return NULL;
510

511 512 513 514 515 516 517 518 519 520 521
    count = 0;
    for( i = 0; i < p_dict->i_size; i++ )
    {
        for( p_entry = p_dict->p_entries[i]; p_entry; p_entry = p_entry->p_next )
            ppsz_ret[count++] = strdup( p_entry->psz_key );
    }
    ppsz_ret[count] = NULL;
    return ppsz_ret;
}

static inline void
522 523
vlc_dictionary_insert_impl_( vlc_dictionary_t * p_dict, const char * psz_key,
                             void * p_value, bool rebuild )
524
{
525 526 527
    if( !p_dict->p_entries )
        vlc_dictionary_init( p_dict, 1 );

528
    int i_pos = DictHash( psz_key, p_dict->i_size );
Laurent Aimar's avatar
Laurent Aimar committed
529
    vlc_dictionary_entry_t * p_entry;
530

Laurent Aimar's avatar
Laurent Aimar committed
531
    p_entry = (vlc_dictionary_entry_t *)malloc(sizeof(*p_entry));
532 533 534 535 536 537 538 539
    p_entry->psz_key = strdup( psz_key );
    p_entry->p_value = p_value;
    p_entry->p_next = p_dict->p_entries[i_pos];
    p_dict->p_entries[i_pos] = p_entry;
    if( rebuild )
    {
        /* Count how many items there was */
        int count;
Laurent Aimar's avatar
Laurent Aimar committed
540 541
        for( count = 1; p_entry->p_next; count++ )
            p_entry = p_entry->p_next;
542 543 544 545
        if( count > 3 ) /* XXX: this need tuning */
        {
            /* Here it starts to be not good, rebuild a bigger dictionary */
            struct vlc_dictionary_t new_dict;
546
            int i_new_size = ( (p_dict->i_size+2) * 3) / 2; /* XXX: this need tuning */
547 548 549 550 551
            int i;
            vlc_dictionary_init( &new_dict, i_new_size );
            for( i = 0; i < p_dict->i_size; i++ )
            {
                p_entry = p_dict->p_entries[i];
552
                while( p_entry )
553
                {
554
                    vlc_dictionary_insert_impl_( &new_dict, p_entry->psz_key,
555
                                             p_entry->p_value,
Laurent Aimar's avatar
Laurent Aimar committed
556
                                             false /* To avoid multiple rebuild loop */);
557
                    p_entry = p_entry->p_next;
558
                }
559
            }
560

561
            vlc_dictionary_clear( p_dict, NULL, NULL );
562
            p_dict->i_size = new_dict.i_size;
563
            p_dict->p_entries = new_dict.p_entries;
564 565 566 567 568 569 570
        }
    }
}

static inline void
vlc_dictionary_insert( vlc_dictionary_t * p_dict, const char * psz_key, void * p_value )
{
571
    vlc_dictionary_insert_impl_( p_dict, psz_key, p_value, true );
572 573 574
}

static inline void
575 576 577
vlc_dictionary_remove_value_for_key( const vlc_dictionary_t * p_dict, const char * psz_key,
                                     void ( * pf_free )( void * p_data, void * p_obj ),
                                     void * p_obj )
578
{
579 580 581
    if( !p_dict->p_entries )
        return;

582
    int i_pos = DictHash( psz_key, p_dict->i_size );
Laurent Aimar's avatar
Laurent Aimar committed
583 584
    vlc_dictionary_entry_t * p_entry = p_dict->p_entries[i_pos];
    vlc_dictionary_entry_t * p_prev;
585 586 587 588 589 590 591 592 593

    if( !p_entry )
        return; /* Not found, nothing to do */

    /* Hash collision */
    p_prev = NULL;
    do {
        if( !strcmp( psz_key, p_entry->psz_key ) )
        {
594 595
            if( pf_free != NULL )
                ( * pf_free )( p_entry->p_value, p_obj );
596 597 598 599 600 601 602 603 604 605 606 607 608 609 610
            if( !p_prev )
                p_dict->p_entries[i_pos] = p_entry->p_next;
            else
                p_prev->p_next = p_entry->p_next;
            free( p_entry->psz_key );
            free( p_entry );
            return;
        }
        p_prev = p_entry;
        p_entry = p_entry->p_next;
    } while( p_entry );

    /* No key was found */
}

611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626
#ifdef __cplusplus
// C++ helpers
template <typename T>
void vlc_delete_all( T &container )
{
    typename T::iterator it = container.begin();
    while ( it != container.end() )
    {
        delete *it;
        ++it;
    }
    container.clear();
}

#endif

627
#endif