bt_close.c revision 1.2 1 /*-
2 * Copyright (c) 1990, 1993
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)
38 /*static char sccsid[] = "from: @(#)bt_close.c 8.1 (Berkeley) 6/4/93";*/
39 static char rcsid[] = "$Id: bt_close.c,v 1.2 1993/08/01 18:44:00 mycroft Exp $";
40 #endif /* LIBC_SCCS and not lint */
41
42 #include <sys/param.h>
43
44 #include <errno.h>
45 #include <stdio.h>
46 #include <stdlib.h>
47 #include <string.h>
48 #include <unistd.h>
49
50 #include <db.h>
51 #include "btree.h"
52
53 static int bt_meta __P((BTREE *));
54
55 /*
56 * BT_CLOSE -- Close a btree.
57 *
58 * Parameters:
59 * dbp: pointer to access method
60 *
61 * Returns:
62 * RET_ERROR, RET_SUCCESS
63 */
64 int
65 __bt_close(dbp)
66 DB *dbp;
67 {
68 BTREE *t;
69 int fd;
70
71 t = dbp->internal;
72
73 /*
74 * Delete any already deleted record that we've been saving
75 * because the cursor pointed to it.
76 */
77 if (ISSET(t, B_DELCRSR) && __bt_crsrdel(t, &t->bt_bcursor))
78 return (RET_ERROR);
79
80 if (__bt_sync(dbp, 0) == RET_ERROR)
81 return (RET_ERROR);
82
83 if (mpool_close(t->bt_mp) == RET_ERROR)
84 return (RET_ERROR);
85
86 if (t->bt_stack)
87 free(t->bt_stack);
88 if (t->bt_kbuf)
89 free(t->bt_kbuf);
90 if (t->bt_dbuf)
91 free(t->bt_dbuf);
92
93 fd = t->bt_fd;
94 free(t);
95 free(dbp);
96 return (close(fd) ? RET_ERROR : RET_SUCCESS);
97 }
98
99 /*
100 * BT_SYNC -- sync the btree to disk.
101 *
102 * Parameters:
103 * dbp: pointer to access method
104 *
105 * Returns:
106 * RET_SUCCESS, RET_ERROR.
107 */
108 int
109 __bt_sync(dbp, flags)
110 const DB *dbp;
111 u_int flags;
112 {
113 BTREE *t;
114 int status;
115 PAGE *h;
116 void *p;
117
118 if (flags != 0) {
119 errno = EINVAL;
120 return (RET_ERROR);
121 }
122
123 t = dbp->internal;
124
125 if (ISSET(t, B_INMEM | B_RDONLY) || !ISSET(t, B_MODIFIED))
126 return (RET_SUCCESS);
127
128 if (ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
129 return (RET_ERROR);
130
131 /*
132 * Nastiness. If the cursor has been marked for deletion, but not
133 * actually deleted, we have to make a copy of the page, delete the
134 * key/data item, sync the file, and then restore the original page
135 * contents.
136 */
137 if (ISSET(t, B_DELCRSR)) {
138 if ((p = malloc(t->bt_psize)) == NULL)
139 return (RET_ERROR);
140 if ((h = mpool_get(t->bt_mp, t->bt_bcursor.pgno, 0)) == NULL)
141 return (RET_ERROR);
142 memmove(p, h, t->bt_psize);
143 if ((status =
144 __bt_dleaf(t, h, t->bt_bcursor.index)) == RET_ERROR)
145 goto ecrsr;
146 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
147 }
148
149 if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS)
150 CLR(t, B_MODIFIED);
151
152 ecrsr: if (ISSET(t, B_DELCRSR)) {
153 if ((h = mpool_get(t->bt_mp, t->bt_bcursor.pgno, 0)) == NULL)
154 return (RET_ERROR);
155 memmove(h, p, t->bt_psize);
156 free(p);
157 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
158 }
159 return (status);
160 }
161
162 /*
163 * BT_META -- write the tree meta data to disk.
164 *
165 * Parameters:
166 * t: tree
167 *
168 * Returns:
169 * RET_ERROR, RET_SUCCESS
170 */
171 static int
172 bt_meta(t)
173 BTREE *t;
174 {
175 BTMETA m;
176 void *p;
177
178 if ((p = mpool_get(t->bt_mp, P_META, 0)) == NULL)
179 return (RET_ERROR);
180
181 /* Fill in metadata. */
182 m.m_magic = BTREEMAGIC;
183 m.m_version = BTREEVERSION;
184 m.m_psize = t->bt_psize;
185 m.m_free = t->bt_free;
186 m.m_nrecs = t->bt_nrecs;
187 m.m_flags = t->bt_flags & SAVEMETA;
188
189 memmove(p, &m, sizeof(BTMETA));
190 mpool_put(t->bt_mp, p, MPOOL_DIRTY);
191 return (RET_SUCCESS);
192 }
193