2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #if defined(LIBC_SCCS) && !defined(lint)
38 static char sccsid
[] = "@(#)bt_close.c 8.7 (Berkeley) 8/17/94";
39 #endif /* LIBC_SCCS and not lint */
41 #include <sys/param.h>
52 static int bt_meta
__P((BTREE
*));
55 * BT_CLOSE -- Close a btree.
58 * dbp: pointer to access method
61 * RET_ERROR, RET_SUCCESS
72 /* Toss any page pinned across calls. */
73 if (t
->bt_pinned
!= NULL
) {
74 mpool_put(t
->bt_mp
, t
->bt_pinned
, 0);
79 if (__bt_sync(dbp
, 0) == RET_ERROR
)
82 /* Close the memory pool. */
83 if (mpool_close(t
->bt_mp
) == RET_ERROR
)
86 /* Free random memory. */
87 if (t
->bt_cursor
.key
.data
!= NULL
) {
88 free(t
->bt_cursor
.key
.data
);
89 t
->bt_cursor
.key
.size
= 0;
90 t
->bt_cursor
.key
.data
= NULL
;
92 if (t
->bt_rkey
.data
) {
93 free(t
->bt_rkey
.data
);
95 t
->bt_rkey
.data
= NULL
;
97 if (t
->bt_rdata
.data
) {
98 free(t
->bt_rdata
.data
);
100 t
->bt_rdata
.data
= NULL
;
106 return (close(fd
) ? RET_ERROR
: RET_SUCCESS
);
110 * BT_SYNC -- sync the btree to disk.
113 * dbp: pointer to access method
116 * RET_SUCCESS, RET_ERROR.
119 __bt_sync(dbp
, flags
)
128 /* Toss any page pinned across calls. */
129 if (t
->bt_pinned
!= NULL
) {
130 mpool_put(t
->bt_mp
, t
->bt_pinned
, 0);
134 /* Sync doesn't currently take any flags. */
140 if (F_ISSET(t
, B_INMEM
| B_RDONLY
) || !F_ISSET(t
, B_MODIFIED
))
141 return (RET_SUCCESS
);
143 if (F_ISSET(t
, B_METADIRTY
) && bt_meta(t
) == RET_ERROR
)
146 if ((status
= mpool_sync(t
->bt_mp
)) == RET_SUCCESS
)
147 F_CLR(t
, B_MODIFIED
);
153 * BT_META -- write the tree meta data to disk.
159 * RET_ERROR, RET_SUCCESS
168 if ((p
= mpool_get(t
->bt_mp
, P_META
, 0)) == NULL
)
171 /* Fill in metadata. */
172 m
.magic
= BTREEMAGIC
;
173 m
.version
= BTREEVERSION
;
174 m
.psize
= t
->bt_psize
;
176 m
.nrecs
= t
->bt_nrecs
;
177 m
.flags
= F_ISSET(t
, SAVEMETA
);
179 memmove(p
, &m
, sizeof(BTMETA
));
180 mpool_put(t
->bt_mp
, p
, MPOOL_DIRTY
);
181 return (RET_SUCCESS
);