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