mirror of https://github.com/sipwise/kamailio.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
99 lines
3.3 KiB
99 lines
3.3 KiB
/*
|
|
* $Id$
|
|
*
|
|
* Copyright (C) 2012 Andrew Mortensen
|
|
*
|
|
* This file is part of the sca module for sip-router, a free SIP server.
|
|
*
|
|
* The sca module 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
|
|
*
|
|
* The sca module 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*
|
|
*
|
|
*/
|
|
#ifndef SCA_HASH_H
|
|
#define SCA_HASH_H
|
|
|
|
struct _sca_hash_slot;
|
|
struct _sca_hash_entry {
|
|
void *value;
|
|
int (*compare)( str *, void * );
|
|
void (*description)( void * );
|
|
void (*free_entry)( void * );
|
|
struct _sca_hash_slot *slot;
|
|
struct _sca_hash_entry *next;
|
|
};
|
|
typedef struct _sca_hash_entry sca_hash_entry;
|
|
|
|
struct _sca_hash_slot {
|
|
gen_lock_t lock;
|
|
sca_hash_entry *entries;
|
|
};
|
|
typedef struct _sca_hash_slot sca_hash_slot;
|
|
|
|
struct _sca_hash_table {
|
|
unsigned int size; /* power of two */
|
|
sca_hash_slot *slots;
|
|
};
|
|
typedef struct _sca_hash_table sca_hash_table;
|
|
|
|
#define sca_hash_table_index_for_key( ht1, str1 ) \
|
|
(get_hash1_raw((str1)->s, (str1)->len) & ((ht1)->size - 1 ))
|
|
|
|
#define sca_hash_table_slot_for_index( ht1, idx1 ) \
|
|
&(ht1)->slots[ (idx1) ]
|
|
|
|
#define sca_hash_table_lock_index( ht1, idx1 ) \
|
|
lock_get( &(ht1)->slots[ (idx1) ].lock )
|
|
|
|
#define sca_hash_table_unlock_index( ht1, idx1 ) \
|
|
lock_release( &(ht1)->slots[ (idx1) ].lock )
|
|
|
|
|
|
/* hash table operations */
|
|
int sca_hash_table_create( sca_hash_table **, unsigned int );
|
|
void sca_hash_table_print( sca_hash_table * );
|
|
void sca_hash_table_free( sca_hash_table * );
|
|
|
|
void sca_hash_entry_free( sca_hash_entry * );
|
|
|
|
/* key-value operations */
|
|
int sca_hash_table_slot_kv_insert_unsafe( sca_hash_slot *, void *,
|
|
int (*)(str *, void *),
|
|
void (*)(void *), void (*)(void *));
|
|
int sca_hash_table_slot_kv_insert( sca_hash_slot *, void *,
|
|
int (*)(str *, void *),
|
|
void (*)(void *), void (*)(void *));
|
|
int sca_hash_table_index_kv_insert( sca_hash_table *, int, void *,
|
|
int (*)(str *, void *),
|
|
void (*)(void *), void (*)(void *));
|
|
int sca_hash_table_kv_insert( sca_hash_table *, str *, void *,
|
|
int (*)(str *, void *),
|
|
void (*)(void *), void (*)(void *));
|
|
void *sca_hash_table_slot_kv_find_unsafe( sca_hash_slot *, str * );
|
|
void *sca_hash_table_slot_kv_find( sca_hash_slot *, str * );
|
|
void *sca_hash_table_index_kv_find_unsafe( sca_hash_table *, int, str * );
|
|
void *sca_hash_table_index_kv_find( sca_hash_table *, int, str * );
|
|
void *sca_hash_table_kv_find( sca_hash_table *, str * );
|
|
|
|
sca_hash_entry *sca_hash_table_slot_kv_find_entry_unsafe( sca_hash_slot *,
|
|
str * );
|
|
sca_hash_entry *sca_hash_table_slot_unlink_entry_unsafe( sca_hash_slot *,
|
|
sca_hash_entry * );
|
|
|
|
int sca_hash_table_slot_kv_delete( sca_hash_slot *, str * );
|
|
int sca_hash_table_index_kv_delete( sca_hash_table *, int, str * );
|
|
int sca_hash_table_kv_delete( sca_hash_table *, str * );
|
|
|
|
#endif /* SCA_HASH_H */
|