1 /* $OpenBSD: bt_close.c,v 1.9 2005/08/05 13:02:59 espie Exp $ */
2
3 /*-
4 * Copyright (c) 1990, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Mike Olson.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 */
34
35 #include <sys/param.h>
36
37 #include <errno.h>
38 #include <stdio.h>
39 #include <stdlib.h>
40 #include <string.h>
41 #include <unistd.h>
42
43 #include <db.h>
44 #include "btree.h"
45
46 static int bt_meta(BTREE *);
47
48 /*
49 * BT_CLOSE -- Close a btree.
50 *
51 * Parameters:
52 * dbp: pointer to access method
53 *
54 * Returns:
55 * RET_ERROR, RET_SUCCESS
56 */
57 int
__bt_close(DB * dbp)58 __bt_close(DB *dbp)
59 {
60 BTREE *t;
61 int fd;
62
63 t = dbp->internal;
64
65 /* Toss any page pinned across calls. */
66 if (t->bt_pinned != NULL) {
67 mpool_put(t->bt_mp, t->bt_pinned, 0);
68 t->bt_pinned = NULL;
69 }
70
71 /* Sync the tree. */
72 if (__bt_sync(dbp, 0) == RET_ERROR)
73 return (RET_ERROR);
74
75 /* Close the memory pool. */
76 if (mpool_close(t->bt_mp) == RET_ERROR)
77 return (RET_ERROR);
78
79 /* Free random memory. */
80 if (t->bt_cursor.key.data != NULL) {
81 free(t->bt_cursor.key.data);
82 t->bt_cursor.key.size = 0;
83 t->bt_cursor.key.data = NULL;
84 }
85 if (t->bt_rkey.data) {
86 free(t->bt_rkey.data);
87 t->bt_rkey.size = 0;
88 t->bt_rkey.data = NULL;
89 }
90 if (t->bt_rdata.data) {
91 free(t->bt_rdata.data);
92 t->bt_rdata.size = 0;
93 t->bt_rdata.data = NULL;
94 }
95
96 fd = t->bt_fd;
97 free(t);
98 free(dbp);
99 return (close(fd) ? RET_ERROR : RET_SUCCESS);
100 }
101
102 /*
103 * BT_SYNC -- sync the btree to disk.
104 *
105 * Parameters:
106 * dbp: pointer to access method
107 *
108 * Returns:
109 * RET_SUCCESS, RET_ERROR.
110 */
111 int
__bt_sync(const DB * dbp,u_int flags)112 __bt_sync(const DB *dbp, u_int flags)
113 {
114 BTREE *t;
115 int status;
116
117 t = dbp->internal;
118
119 /* Toss any page pinned across calls. */
120 if (t->bt_pinned != NULL) {
121 mpool_put(t->bt_mp, t->bt_pinned, 0);
122 t->bt_pinned = NULL;
123 }
124
125 /* Sync doesn't currently take any flags. */
126 if (flags != 0) {
127 errno = EINVAL;
128 return (RET_ERROR);
129 }
130
131 if (F_ISSET(t, B_INMEM | B_RDONLY) || !F_ISSET(t, B_MODIFIED))
132 return (RET_SUCCESS);
133
134 if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
135 return (RET_ERROR);
136
137 if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS)
138 F_CLR(t, B_MODIFIED);
139
140 return (status);
141 }
142
143 /*
144 * BT_META -- write the tree meta data to disk.
145 *
146 * Parameters:
147 * t: tree
148 *
149 * Returns:
150 * RET_ERROR, RET_SUCCESS
151 */
152 static int
bt_meta(BTREE * t)153 bt_meta(BTREE *t)
154 {
155 BTMETA m;
156 void *p;
157
158 if ((p = mpool_get(t->bt_mp, P_META, 0)) == NULL)
159 return (RET_ERROR);
160
161 /* Fill in metadata. */
162 m.magic = BTREEMAGIC;
163 m.version = BTREEVERSION;
164 m.psize = t->bt_psize;
165 m.free = t->bt_free;
166 m.nrecs = t->bt_nrecs;
167 m.flags = F_ISSET(t, SAVEMETA);
168
169 memmove(p, &m, sizeof(BTMETA));
170 mpool_put(t->bt_mp, p, MPOOL_DIRTY);
171 return (RET_SUCCESS);
172 }
173