?? vlc_arrays.h
字號:
/***************************************************************************** * vlc_arrays.h : Arrays and data structures handling ***************************************************************************** * Copyright (C) 1999-2004 the VideoLAN team * $Id: e085f0378b432ed56392241bc3017a57c6f81c85 $ * * 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_/** * \file * This file defines functions, structures and macros for handling arrays in vlc *//** * 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_INIT( count, tab ) \ do { \ (count) = 0; \ (tab) = NULL; \ } while(0)#define TAB_CLEAN( count, tab ) \ do { \ free( tab ); \ (count)= 0; \ (tab)= NULL; \ } while(0)#define TAB_APPEND_CAST( cast, count, tab, p ) \ do { \ if( (count) > 0 ) \ (tab) = cast realloc( tab, sizeof( void ** ) * ( (count) + 1 ) ); \ else \ (tab) = cast malloc( sizeof( void ** ) ); \ (tab)[count] = (p); \ (count)++; \ } while(0)#define TAB_APPEND( count, tab, p ) \ TAB_APPEND_CAST( , count, tab, p )#define TAB_APPEND_CPP( type, count, tab, p ) \ TAB_APPEND_CAST( (type**), count, tab, p )#define TAB_FIND( count, tab, p, index ) \ do { \ int _i_; \ (index) = -1; \ for( _i_ = 0; _i_ < (count); _i_++ ) \ { \ if( (tab)[_i_] == (p) ) \ { \ (index) = _i_; \ break; \ } \ } \ } while(0)#define TAB_REMOVE( count, tab, p ) \ do { \ 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; \ } \ } \ } while(0)#define TAB_INSERT_CAST( cast, count, tab, p, index ) do { \ if( (count) > 0 ) \ (tab) = cast realloc( tab, sizeof( void ** ) * ( (count) + 1 ) ); \ else \ (tab) = cast malloc( sizeof( void ** ) ); \ if( (count) - (index) > 0 ) \ memmove( (void**)(tab) + (index) + 1, \ (void**)(tab) + (index), \ ((count) - (index)) * sizeof(*(tab)) );\ (tab)[(index)] = (p); \ (count)++; \} while(0)#define TAB_INSERT( count, tab, p, index ) \ TAB_INSERT_CAST( , count, tab, p, index )/** * Binary search in a sorted array. The key must be comparable by < and > * \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 ) \ do { \ 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; \ }\ } \ } while(0)/************************************************************************ * Dynamic arrays with progressive allocation ************************************************************************//* Internal functions */#define _ARRAY_ALLOC(array, newsize) { \ (array).i_alloc = newsize; \ (array).p_elems = VLCCVP realloc( (array).p_elems, (array).i_alloc * \ sizeof(*(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); \ } \}#define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))/* 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) \ do { \ (array).i_alloc = 0; \ (array).i_size = 0; \ (array).p_elems = NULL; \ } while(0)#define ARRAY_RESET(array) \ do { \ (array).i_alloc = 0; \ (array).i_size = 0; \ free( (array).p_elems ); (array).p_elems = NULL; \ } while(0)#define ARRAY_APPEND(array, elem) \ do { \ _ARRAY_GROW1(array); \ (array).p_elems[(array).i_size] = elem; \ (array).i_size++; \ } while(0)#define ARRAY_INSERT(array,elem,pos) \ do { \ _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++; \ } while(0)#define ARRAY_REMOVE(array,pos) \ do { \ 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); \ } while(0)#define ARRAY_VAL(array, pos) array.p_elems[pos]#define ARRAY_BSEARCH(array, elem, zetype, key, answer) \ BSEARCH( (array).p_elems, (array).i_size, elem, zetype, key, answer)#define FOREACH_ARRAY( item, array ) { \ int fe_idx; \ for( fe_idx = 0 ; fe_idx < (array).i_size ; fe_idx++ ) \ { \ item = (array).p_elems[fe_idx];#define FOREACH_END() } }/************************************************************************ * Dynamic arrays with progressive allocation (Preferred API) ************************************************************************/typedef struct vlc_array_t{ int i_count; void ** pp_elems;} vlc_array_t;static inline void vlc_array_init( vlc_array_t * p_array ){ memset( p_array, 0, sizeof(vlc_array_t) );}static inline void vlc_array_clear( vlc_array_t * p_array ){ free( p_array->pp_elems );?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -