1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
/*
* $Id: hslot.c 5241 2008-11-21 12:52:25Z henningw $
*
* Copyright (C) 2001-2003 FhG Fokus
*
* This file is part of Kamailio, a free SIP server.
*
* Kamailio 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
*
* Kamailio 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
*/
/*! \file
* \brief USRLOC - Hash table collision slot related functions
* \ingroup usrloc
*
* - Module: \ref usrloc
*/
#include "hslot.h"
/*! number of locks */
int ul_locks_no=4;
/*! global list of locks */
gen_lock_set_t* ul_locks=0;
/*!
* \brief Initialize locks for the hash table
* \return 0 on success, -1 on failure
*/
int ul_init_locks(void)
{
int i;
i = ul_locks_no;
do {
if ((( ul_locks=lock_set_alloc(i))!=0)&&
(lock_set_init(ul_locks)!=0))
{
ul_locks_no = i;
LM_INFO("locks array size %d\n", ul_locks_no);
return 0;
}
if (ul_locks){
lock_set_dealloc(ul_locks);
ul_locks=0;
}
i--;
if(i==0)
{
LM_ERR("failed to allocate locks\n");
return -1;
}
} while (1);
}
/*!
* \brief Unlock all locks on the list
*/
void ul_unlock_locks(void)
{
unsigned int i;
if (ul_locks==0)
return;
for (i=0;i<ul_locks_no;i++) {
#ifdef GEN_LOCK_T_PREFERED
lock_release(&ul_locks->locks[i]);
#else
ul_release_idx(i);
#endif
};
}
/*!
* \brief Destroy all locks on the list
*/
void ul_destroy_locks(void)
{
if (ul_locks !=0){
lock_set_destroy(ul_locks);
lock_set_dealloc(ul_locks);
};
}
#ifndef GEN_LOCK_T_PREFERED
/*!
* \brief Lock a lock with a certain index
* \param idx lock index
*/
void ul_lock_idx(int idx)
{
lock_set_get(ul_locks, idx);
}
/*!
* \brief Release a lock with a certain index
* \param idx lock index
*/
void ul_release_idx(int idx)
{
lock_set_release(ul_locks, idx);
}
#endif
/*!
* \brief Initialize cache slot structure
* \param _d domain for the hash slot
* \param _s hash slot
* \param n used to get the slot number (modulo number or locks)
*/
void init_slot(struct udomain* _d, hslot_t* _s, int n)
{
_s->n = 0;
_s->first = 0;
_s->last = 0;
_s->d = _d;
#ifdef GEN_LOCK_T_PREFERED
_s->lock = &ul_locks->locks[n%ul_locks_no];
#else
_s->lockidx = n%ul_locks_no;
#endif
}
/*!
* \brief Deinitialize given slot structure
* \param _s hash slot
*/
void deinit_slot(hslot_t* _s)
{
struct urecord* ptr;
/* Remove all elements */
while(_s->first) {
ptr = _s->first;
_s->first = _s->first->next;
free_urecord(ptr);
}
_s->n = 0;
_s->last = 0;
_s->d = 0;
}
/*!
* \brief Add an element to an slot's linked list
* \param _s hash slot
* \param _r added record
*/
void slot_add(hslot_t* _s, struct urecord* _r)
{
if (_s->n == 0) {
_s->first = _s->last = _r;
} else {
_r->prev = _s->last;
_s->last->next = _r;
_s->last = _r;
}
_s->n++;
_r->slot = _s;
}
/*!
* \brief Remove an element from slot linked list
* \param _s hash slot
* \param _r removed record
*/
void slot_rem(hslot_t* _s, struct urecord* _r)
{
if (_r->prev) {
_r->prev->next = _r->next;
} else {
_s->first = _r->next;
}
if (_r->next) {
_r->next->prev = _r->prev;
} else {
_s->last = _r->prev;
}
_r->prev = _r->next = 0;
_r->slot = 0;
_s->n--;
}
|
