1/*-
2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Mike Olson.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
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.
23 *
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
34 * SUCH DAMAGE.
35 */
36
37#if defined(LIBC_SCCS) && !defined(lint)
38static char sccsid[] = "@(#)bt_close.c 8.7 (Berkeley) 8/17/94";
39#endif /* LIBC_SCCS and not lint */
40
41#include <sys/param.h>
42
43#include <errno.h>
44#include <stdio.h>
45#include <stdlib.h>
46#include <string.h>
47
48#include <db.h>
49#include "btree.h"
50
51static int bt_meta __P((BTREE *));
52
53/*
54 * BT_CLOSE -- Close a btree.
55 *
56 * Parameters:
57 * dbp: pointer to access method
58 *
59 * Returns:
60 * RET_ERROR, RET_SUCCESS
61 */
62int
63__bt_close(dbp)
64 DB *dbp;
65{
66 BTREE *t;
67
68 t = dbp->internal;
69
70 /* Toss any page pinned across calls. */
71 if (t->bt_pinned != NULL) {
72 mpool_put(t->bt_mp, t->bt_pinned, 0);
73 t->bt_pinned = NULL;
74 }
75
76 /* Sync the tree. */
77 if (__bt_sync(dbp, 0) == RET_ERROR)
78 return (RET_ERROR);
79
80 /* Close the memory pool. */
81 if (mpool_close(t->bt_mp) == RET_ERROR)
82 return (RET_ERROR);
83
84 /* Free random memory. */
85 if (t->bt_cursor.key.data != NULL) {
86 free(t->bt_cursor.key.data);
87 t->bt_cursor.key.size = 0;
88 t->bt_cursor.key.data = NULL;
89 }
90 if (t->bt_rkey.data) {
91 free(t->bt_rkey.data);
92 t->bt_rkey.size = 0;
93 t->bt_rkey.data = NULL;
94 }
95 if (t->bt_rdata.data) {
96 free(t->bt_rdata.data);
97 t->bt_rdata.size = 0;
98 t->bt_rdata.data = NULL;
99 }
100
101 free(t);
102 free(dbp);
103 return RET_SUCCESS;
104}
105
106/*
107 * BT_SYNC -- sync the btree to disk.
108 *
109 * Parameters:
110 * dbp: pointer to access method
111 *
112 * Returns:
113 * RET_SUCCESS, RET_ERROR.
114 */
115int
116__bt_sync(dbp, flags)
117 const DB *dbp;
118 u_int flags;
119{
120 BTREE *t;
121 int status;
122
123 t = dbp->internal;
124
125 /* Toss any page pinned across calls. */
126 if (t->bt_pinned != NULL) {
127 mpool_put(t->bt_mp, t->bt_pinned, 0);
128 t->bt_pinned = NULL;
129 }
130
131 /* Sync doesn't currently take any flags. */
132 if (flags != 0) {
133 errno = EINVAL;
134 return (RET_ERROR);
135 }
136
137 if (F_ISSET(t, B_INMEM | B_RDONLY) || !F_ISSET(t, B_MODIFIED))
138 return (RET_SUCCESS);
139
140 if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
141 return (RET_ERROR);
142
143 if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS)
144 F_CLR(t, B_MODIFIED);
145
146 return (status);
147}
148
149/*
150 * BT_META -- write the tree meta data to disk.
151 *
152 * Parameters:
153 * t: tree
154 *
155 * Returns:
156 * RET_ERROR, RET_SUCCESS
157 */
158static int
159bt_meta(t)
160 BTREE *t;
161{
162 BTMETA m;
163 void *p;
164
165 if ((p = mpool_get(t->bt_mp, P_META, 0)) == NULL)
166 return (RET_ERROR);
167
168 /* Fill in metadata. */
169 m.magic = BTREEMAGIC;
170 m.version = BTREEVERSION;
171 m.psize = t->bt_psize;
172 m.free = t->bt_free;
173 m.nrecs = t->bt_nrecs;
174 m.flags = F_ISSET(t, SAVEMETA);
175
176 memmove(p, &m, sizeof(BTMETA));
177 mpool_put(t->bt_mp, p, MPOOL_DIRTY);
178 return (RET_SUCCESS);
179}
180