xref: /openbsd-src/lib/libc/db/btree/bt_close.c (revision b2ea75c1b17e1a9a339660e7ed45cd24946b230e)
1 /*	$OpenBSD: bt_close.c,v 1.4 1999/02/15 05:11:22 millert 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. All advertising materials mentioning features or use of this software
19  *    must display the following acknowledgement:
20  *	This product includes software developed by the University of
21  *	California, Berkeley and its contributors.
22  * 4. Neither the name of the University nor the names of its contributors
23  *    may be used to endorse or promote products derived from this software
24  *    without specific prior written permission.
25  *
26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36  * SUCH DAMAGE.
37  */
38 
39 #if defined(LIBC_SCCS) && !defined(lint)
40 #if 0
41 static char sccsid[] = "@(#)bt_close.c	8.7 (Berkeley) 8/17/94";
42 #else
43 static char rcsid[] = "$OpenBSD: bt_close.c,v 1.4 1999/02/15 05:11:22 millert Exp $";
44 #endif
45 #endif /* LIBC_SCCS and not lint */
46 
47 #include <sys/param.h>
48 
49 #include <errno.h>
50 #include <stdio.h>
51 #include <stdlib.h>
52 #include <string.h>
53 #include <unistd.h>
54 
55 #include <db.h>
56 #include "btree.h"
57 
58 static int bt_meta __P((BTREE *));
59 
60 /*
61  * BT_CLOSE -- Close a btree.
62  *
63  * Parameters:
64  *	dbp:	pointer to access method
65  *
66  * Returns:
67  *	RET_ERROR, RET_SUCCESS
68  */
69 int
70 __bt_close(dbp)
71 	DB *dbp;
72 {
73 	BTREE *t;
74 	int fd;
75 
76 	t = dbp->internal;
77 
78 	/* Toss any page pinned across calls. */
79 	if (t->bt_pinned != NULL) {
80 		mpool_put(t->bt_mp, t->bt_pinned, 0);
81 		t->bt_pinned = NULL;
82 	}
83 
84 	/* Sync the tree. */
85 	if (__bt_sync(dbp, 0) == RET_ERROR)
86 		return (RET_ERROR);
87 
88 	/* Close the memory pool. */
89 	if (mpool_close(t->bt_mp) == RET_ERROR)
90 		return (RET_ERROR);
91 
92 	/* Free random memory. */
93 	if (t->bt_cursor.key.data != NULL) {
94 		free(t->bt_cursor.key.data);
95 		t->bt_cursor.key.size = 0;
96 		t->bt_cursor.key.data = NULL;
97 	}
98 	if (t->bt_rkey.data) {
99 		free(t->bt_rkey.data);
100 		t->bt_rkey.size = 0;
101 		t->bt_rkey.data = NULL;
102 	}
103 	if (t->bt_rdata.data) {
104 		free(t->bt_rdata.data);
105 		t->bt_rdata.size = 0;
106 		t->bt_rdata.data = NULL;
107 	}
108 
109 	fd = t->bt_fd;
110 	free(t);
111 	free(dbp);
112 	return (close(fd) ? RET_ERROR : RET_SUCCESS);
113 }
114 
115 /*
116  * BT_SYNC -- sync the btree to disk.
117  *
118  * Parameters:
119  *	dbp:	pointer to access method
120  *
121  * Returns:
122  *	RET_SUCCESS, RET_ERROR.
123  */
124 int
125 __bt_sync(dbp, flags)
126 	const DB *dbp;
127 	u_int flags;
128 {
129 	BTREE *t;
130 	int status;
131 
132 	t = dbp->internal;
133 
134 	/* Toss any page pinned across calls. */
135 	if (t->bt_pinned != NULL) {
136 		mpool_put(t->bt_mp, t->bt_pinned, 0);
137 		t->bt_pinned = NULL;
138 	}
139 
140 	/* Sync doesn't currently take any flags. */
141 	if (flags != 0) {
142 		errno = EINVAL;
143 		return (RET_ERROR);
144 	}
145 
146 	if (F_ISSET(t, B_INMEM | B_RDONLY) || !F_ISSET(t, B_MODIFIED))
147 		return (RET_SUCCESS);
148 
149 	if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
150 		return (RET_ERROR);
151 
152 	if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS)
153 		F_CLR(t, B_MODIFIED);
154 
155 	return (status);
156 }
157 
158 /*
159  * BT_META -- write the tree meta data to disk.
160  *
161  * Parameters:
162  *	t:	tree
163  *
164  * Returns:
165  *	RET_ERROR, RET_SUCCESS
166  */
167 static int
168 bt_meta(t)
169 	BTREE *t;
170 {
171 	BTMETA m;
172 	void *p;
173 
174 	if ((p = mpool_get(t->bt_mp, P_META, 0)) == NULL)
175 		return (RET_ERROR);
176 
177 	/* Fill in metadata. */
178 	m.magic = BTREEMAGIC;
179 	m.version = BTREEVERSION;
180 	m.psize = t->bt_psize;
181 	m.free = t->bt_free;
182 	m.nrecs = t->bt_nrecs;
183 	m.flags = F_ISSET(t, SAVEMETA);
184 
185 	memmove(p, &m, sizeof(BTMETA));
186 	mpool_put(t->bt_mp, p, MPOOL_DIRTY);
187 	return (RET_SUCCESS);
188 }
189