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
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 1996-2002
* Sleepycat Software. All rights reserved.
*/
#include "db_config.h"
#ifndef lint
static const char revid[] = "$Id: db_reclaim.c,v 11.28 2002/08/06 06:11:17 bostic Exp $";
#endif /* not lint */
#ifndef NO_SYSTEM_INCLUDES
#include <sys/types.h>
#include <string.h>
#endif
#include "db_int.h"
#include "dbinc/db_page.h"
#include "dbinc/db_shash.h"
#include "dbinc/btree.h"
#include "dbinc/lock.h"
/*
* __db_traverse_big
* Traverse a chain of overflow pages and call the callback routine
* on each one. The calling convention for the callback is:
* callback(dbp, page, cookie, did_put),
* where did_put is a return value indicating if the page in question has
* already been returned to the mpool.
*
* PUBLIC: int __db_traverse_big __P((DB *,
* PUBLIC: db_pgno_t, int (*)(DB *, PAGE *, void *, int *), void *));
*/
int
__db_traverse_big(dbp, pgno, callback, cookie)
DB *dbp;
db_pgno_t pgno;
int (*callback) __P((DB *, PAGE *, void *, int *));
void *cookie;
{
DB_MPOOLFILE *mpf;
PAGE *p;
int did_put, ret;
mpf = dbp->mpf;
do {
did_put = 0;
if ((ret = mpf->get(mpf, &pgno, 0, &p)) != 0)
return (ret);
pgno = NEXT_PGNO(p);
if ((ret = callback(dbp, p, cookie, &did_put)) == 0 &&
!did_put)
ret = mpf->put(mpf, p, 0);
} while (ret == 0 && pgno != PGNO_INVALID);
return (ret);
}
/*
* __db_reclaim_callback
* This is the callback routine used during a delete of a subdatabase.
* we are traversing a btree or hash table and trying to free all the
* pages. Since they share common code for duplicates and overflow
* items, we traverse them identically and use this routine to do the
* actual free. The reason that this is callback is because hash uses
* the same traversal code for statistics gathering.
*
* PUBLIC: int __db_reclaim_callback __P((DB *, PAGE *, void *, int *));
*/
int
__db_reclaim_callback(dbp, p, cookie, putp)
DB *dbp;
PAGE *p;
void *cookie;
int *putp;
{
int ret;
COMPQUIET(dbp, NULL);
if ((ret = __db_free(cookie, p)) != 0)
return (ret);
*putp = 1;
return (0);
}
/*
* __db_truncate_callback
* This is the callback routine used during a truncate.
* we are traversing a btree or hash table and trying to free all the
* pages.
*
* PUBLIC: int __db_truncate_callback __P((DB *, PAGE *, void *, int *));
*/
int
__db_truncate_callback(dbp, p, cookie, putp)
DB *dbp;
PAGE *p;
void *cookie;
int *putp;
{
DBMETA *meta;
DBT ldbt;
DB_LOCK metalock;
DB_MPOOLFILE *mpf;
db_indx_t indx, len, off, tlen, top;
db_pgno_t pgno;
db_trunc_param *param;
u_int8_t *hk, type;
int ret;
top = NUM_ENT(p);
mpf = dbp->mpf;
param = cookie;
*putp = 1;
switch (TYPE(p)) {
case P_LBTREE:
/* Skip for off-page duplicates and deleted items. */
for (indx = 0; indx < top; indx += P_INDX) {
type = GET_BKEYDATA(dbp, p, indx + O_INDX)->type;
if (!B_DISSET(type) && B_TYPE(type) != B_DUPLICATE)
++param->count;
}
/* FALLTHROUGH */
case P_IBTREE:
case P_IRECNO:
case P_INVALID:
if (dbp->type != DB_HASH &&
((BTREE *)dbp->bt_internal)->bt_root == PGNO(p)) {
type = dbp->type == DB_RECNO ? P_LRECNO : P_LBTREE;
goto reinit;
}
break;
case P_OVERFLOW:
if (DBC_LOGGING(param->dbc)) {
if ((ret = __db_ovref_log(dbp, param->dbc->txn,
&LSN(p), 0, p->pgno, -1, &LSN(p))) != 0)
return (ret);
} else
LSN_NOT_LOGGED(LSN(p));
if (--OV_REF(p) != 0)
*putp = 0;
break;
case P_LRECNO:
param->count += top;
if (((BTREE *)dbp->bt_internal)->bt_root == PGNO(p)) {
type = P_LRECNO;
goto reinit;
}
break;
case P_LDUP:
/* Correct for deleted items. */
for (indx = 0; indx < top; indx += O_INDX)
if (!B_DISSET(GET_BKEYDATA(dbp, p, indx)->type))
++param->count;
break;
case P_HASH:
/* Correct for on-page duplicates and deleted items. */
for (indx = 0; indx < top; indx += P_INDX) {
switch (*H_PAIRDATA(dbp, p, indx)) {
case H_OFFDUP:
case H_OFFPAGE:
break;
case H_KEYDATA:
++param->count;
break;
case H_DUPLICATE:
tlen = LEN_HDATA(dbp, p, 0, indx);
hk = H_PAIRDATA(dbp, p, indx);
for (off = 0; off < tlen;
off += len + 2 * sizeof (db_indx_t)) {
++param->count;
memcpy(&len,
HKEYDATA_DATA(hk)
+ off, sizeof(db_indx_t));
}
}
}
/* Don't free the head of the bucket. */
if (PREV_PGNO(p) == PGNO_INVALID) {
type = P_HASH;
reinit: *putp = 0;
if (DBC_LOGGING(param->dbc)) {
pgno = PGNO_BASE_MD;
if ((ret = __db_lget(param->dbc, LCK_ALWAYS,
pgno, DB_LOCK_WRITE, 0, &metalock)) != 0)
return (ret);
if ((ret = mpf->get(mpf,
&pgno, 0, (PAGE **)&meta)) != 0) {
goto err;
}
memset(&ldbt, 0, sizeof(ldbt));
ldbt.data = p;
ldbt.size = P_OVERHEAD(dbp);
if ((ret = __db_pg_free_log(dbp,
param->dbc->txn, &LSN(meta), 0,
p->pgno, &LSN(meta),
PGNO_BASE_MD, &ldbt, meta->free)) != 0)
goto err;
LSN(p) = LSN(meta);
if ((ret =
__db_pg_alloc_log(dbp,
param->dbc->txn, &LSN(meta), 0,
&LSN(meta), PGNO_BASE_MD,
&p->lsn, p->pgno, type, meta->free)) != 0) {
err: (void)mpf->put(mpf, (PAGE *)meta, 0);
(void)__TLPUT(param->dbc, metalock);
return (ret);
}
LSN(p) = LSN(meta);
if ((ret = mpf->put(mpf,
(PAGE *)meta, DB_MPOOL_DIRTY)) != 0) {
(void)__TLPUT(param->dbc, metalock);
return (ret);
}
if ((ret = __TLPUT(param->dbc, metalock)) != 0)
return (ret);
} else
LSN_NOT_LOGGED(LSN(p));
P_INIT(p, dbp->pgsize, PGNO(p), PGNO_INVALID,
PGNO_INVALID, type == P_HASH ? 0 : 1, type);
}
break;
default:
return (__db_pgfmt(dbp->dbenv, p->pgno));
}
if (*putp == 1) {
if ((ret = __db_free(param->dbc, p)) != 0)
return (ret);
} else {
if ((ret = mpf->put(mpf, p, DB_MPOOL_DIRTY)) != 0)
return (ret);
*putp = 1;
}
return (0);
}
|
