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
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 1996, 1997, 1998, 1999
* Sleepycat Software. All rights reserved.
*/
#include "db_config.h"
#ifndef lint
static const char sccsid[] = "@(#)hash_reclaim.c 11.1 (Sleepycat) 7/24/99";
#endif /* not lint */
#ifndef NO_SYSTEM_INCLUDES
#include <sys/types.h>
#include <errno.h>
#include <string.h>
#endif
#include "db_int.h"
#include "db_page.h"
#include "db_shash.h"
#include "hash.h"
#include "lock.h"
/*
* CDB___ham_reclaim --
* Reclaim the pages from a subdatabase and return them to the
* parent free list. For now, we link each freed page on the list
* separately. If people really store hash databases in subdatabases
* and do a lot of creates and deletes, this is going to be a problem,
* because hash needs chunks of contiguous storage. We may eventually
* need to go to a model where we maintain the free list with chunks of
* contiguous pages as well.
*
* PUBLIC: int CDB___ham_reclaim __P((DB *, DB_TXN *txn));
*/
int
CDB___ham_reclaim(dbp, txn)
DB *dbp;
DB_TXN *txn;
{
DBC *dbc;
HASH_CURSOR *hcp;
int ret;
/* Open up a cursor that we'll use for traversing. */
if ((ret = dbp->cursor(dbp, txn, &dbc, 0)) != 0)
return (ret);
hcp = (HASH_CURSOR *)dbc->internal;
if ((ret = CDB___ham_get_meta(dbc)) != 0)
goto err;
if ((ret = CDB___ham_traverse(dbp,
dbc, DB_LOCK_WRITE, CDB___db_reclaim_callback, dbc)) != 0)
goto err;
if ((ret = dbc->c_close(dbc)) != 0)
goto err;
if ((ret = CDB___ham_release_meta(dbc)) != 0)
goto err;
return (0);
err: if (hcp->hdr != NULL)
(void)CDB___ham_release_meta(dbc);
(void)dbc->c_close(dbc);
return (ret);
}
|
