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