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
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
|
/*
Copyright (c) 2008-2009 Z RESEARCH, Inc. <http://www.zresearch.com>
This file is part of GlusterFS.
GlusterFS 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 3 of the License,
or (at your option) any later version.
GlusterFS 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, see
<http://www.gnu.org/licenses/>.
*/
#include <list.h>
#include <bdb.h>
#include <libgen.h> /* for dirname */
static void
__destroy_bctx (bctx_t *bctx)
{
if (bctx->directory)
FREE (bctx->directory);
if (bctx->db_path)
FREE (bctx->db_path);
FREE (bctx);
}
static void
__unhash_bctx (bctx_t *bctx)
{
list_del_init (&bctx->b_hash);
}
static int32_t
bctx_table_prune (bctx_table_t *table)
{
int32_t ret = 0;
struct list_head purge = {0,};
struct list_head *next = NULL;
bctx_t *entry = NULL;
bctx_t *del = NULL, *tmp = NULL;
if (!table)
return 0;
INIT_LIST_HEAD (&purge);
LOCK (&table->lock);
{
if ((table->lru_limit) &&
(table->lru_size > table->lru_limit)) {
while (table->lru_size > table->lru_limit) {
next = table->b_lru.next;
entry = list_entry (next, bctx_t, list);
list_move_tail (next, &table->purge);
__unhash_bctx (entry);
table->lru_size--;
ret++;
}
}
list_move_tail (&purge, &table->purge);
list_del_init (&table->purge);
}
UNLOCK (&table->lock);
list_for_each_entry_safe (del, tmp, &purge, list) {
list_del_init (&del->list);
if (del->dbp) {
ret = del->dbp->close (del->dbp, 0);
if (ret != 0) {
gf_log (table->this->name, GF_LOG_ERROR,
"failed to close db on path (%s): %s",
del->directory, db_strerror (ret));
} else {
gf_log (table->this->name, GF_LOG_WARNING,
"close db for path %s; "
"table->lru_count = %d",
del->directory, table->lru_size);
}
}
__destroy_bctx (del);
}
return ret;
}
/* struct bdb_ctx related */
static inline uint32_t
bdb_key_hash (char *key, uint32_t hash_size)
{
uint32_t hash = 0;
hash = *key;
if (hash) {
for (key += 1; *key != '\0'; key++) {
hash = (hash << 5) - hash + *key;
}
}
return (hash + *key) % hash_size;
}
static void
__hash_bctx (bctx_t *bctx)
{
bctx_table_t *table = NULL;
char *key = NULL;
table = bctx->table;
MAKE_KEY_FROM_PATH (key, bctx->directory);
bctx->key_hash = bdb_key_hash (key, table->hash_size);
list_del_init (&bctx->b_hash);
list_add (&bctx->b_hash, &table->b_hash[bctx->key_hash]);
}
static inline bctx_t *
__bctx_passivate (bctx_t *bctx)
{
if (bctx->dbp) {
list_move_tail (&bctx->list, &(bctx->table->b_lru));
bctx->table->lru_size++;
} else {
list_move_tail (&bctx->list, &bctx->table->purge);
__unhash_bctx (bctx);
}
return bctx;
}
static inline bctx_t *
__bctx_activate (bctx_t *bctx)
{
list_move (&bctx->list, &bctx->table->active);
bctx->table->lru_size--;
return bctx;
}
static bctx_t *
__bdb_ctx_unref (bctx_t *bctx)
{
assert (bctx->ref);
--bctx->ref;
if (!bctx->ref)
bctx = __bctx_passivate (bctx);
return bctx;
}
bctx_t *
bctx_unref (bctx_t *bctx)
{
bctx_table_t *table = NULL;
if (!bctx && !bctx->table)
return NULL;
table = bctx->table;
LOCK (&table->lock);
{
bctx = __bdb_ctx_unref (bctx);
}
UNLOCK (&table->lock);
bctx_table_prune (table);
return bctx;
}
/*
* NOTE: __bdb_ctx_ref() is called only after holding table->lock and
* bctx->lock, in that order
*/
static inline bctx_t *
__bctx_ref (bctx_t *bctx)
{
if (!bctx->ref)
__bctx_activate (bctx);
bctx->ref++;
return bctx;
}
bctx_t *
bctx_ref (bctx_t *bctx)
{
LOCK (&(bctx->table->lock));
{
__bctx_ref (bctx);
}
UNLOCK (&(bctx->table->lock));
return bctx;
}
#define BDB_THIS(table) (table->this)
static inline bctx_t *
__create_bctx (bctx_table_t *table,
const char *path)
{
bctx_t *bctx = NULL;
char *db_path = NULL;
bctx = CALLOC (1, sizeof (*bctx));
GF_VALIDATE_OR_GOTO ("bctx", bctx, out);
bctx->table = table;
bctx->directory = strdup (path);
GF_VALIDATE_OR_GOTO ("bctx", bctx->directory, out);
MAKE_REAL_PATH_TO_STORAGE_DB (db_path, BDB_THIS (table), path);
bctx->db_path = strdup (db_path);
GF_VALIDATE_OR_GOTO ("bctx", bctx->directory, out);
INIT_LIST_HEAD (&bctx->c_list);
INIT_LIST_HEAD (&bctx->list);
INIT_LIST_HEAD (&bctx->b_hash);
LOCK_INIT (&bctx->lock);
__hash_bctx (bctx);
list_add (&bctx->list, &table->b_lru);
table->lru_size++;
out:
return bctx;
}
/* bctx_lookup - lookup bctx_t for the directory @directory.
* (see description of bctx_t in bdb.h)
*
* @table: bctx_table_t for this instance of bdb.
* @directory: directory for which bctx_t is being looked up.
*/
bctx_t *
bctx_lookup (bctx_table_t *table,
const char *directory)
{
char *key = NULL;
uint32_t key_hash = 0;
bctx_t *trav = NULL, *bctx = NULL, *tmp = NULL;
int32_t need_break = 0;
GF_VALIDATE_OR_GOTO ("bctx", table, out);
GF_VALIDATE_OR_GOTO ("bctx", directory, out);
MAKE_KEY_FROM_PATH (key, directory);
key_hash = bdb_key_hash (key, table->hash_size);
LOCK (&table->lock);
{
if (list_empty (&table->b_hash[key_hash])) {
goto creat_bctx;
}
list_for_each_entry_safe (trav, tmp, &table->b_hash[key_hash],
b_hash) {
LOCK(&trav->lock);
{
if (!strcmp(trav->directory, directory)) {
bctx = __bctx_ref (trav);
need_break = 1;
}
}
UNLOCK(&trav->lock);
if (need_break)
break;
}
creat_bctx:
if (!bctx) {
bctx = __create_bctx (table, directory);
bctx = __bctx_ref (bctx);
}
}
UNLOCK (&table->lock);
out:
return bctx;
}
bctx_t *
bctx_parent (bctx_table_t *table,
const char *path)
{
char *pathname = NULL, *directory = NULL;
bctx_t *bctx = NULL;
GF_VALIDATE_OR_GOTO ("bctx", table, out);
GF_VALIDATE_OR_GOTO ("bctx", path, out);
pathname = strdup (path);
GF_VALIDATE_OR_GOTO ("bctx", pathname, out);
directory = dirname (pathname);
bctx = bctx_lookup (table, directory);
GF_VALIDATE_OR_GOTO ("bctx", bctx, out);
out:
if (pathname)
free (pathname);
return bctx;
}
|