2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1990, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 #if defined(LIBC_SCCS) && !defined(lint)
33 static char sccsid[] = "@(#)rec_close.c 8.6 (Berkeley) 8/18/94";
34 #endif /* LIBC_SCCS and not lint */
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
38 #include "namespace.h"
39 #include <sys/types.h>
47 #include "un-namespace.h"
53 * __REC_CLOSE -- Close a recno tree.
56 * dbp: pointer to access method
59 * RET_ERROR, RET_SUCCESS
69 /* Toss any page pinned across calls. */
70 if (t->bt_pinned != NULL) {
71 mpool_put(t->bt_mp, t->bt_pinned, 0);
75 if (__rec_sync(dbp, 0) == RET_ERROR)
78 /* Committed to closing. */
80 if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
83 if (!F_ISSET(t, R_INMEM)) {
84 if (F_ISSET(t, R_CLOSEFP)) {
85 if (fclose(t->bt_rfp))
88 if (_close(t->bt_rfd))
93 if (__bt_close(dbp) == RET_ERROR)
100 * __REC_SYNC -- sync the recno tree to disk.
103 * dbp: pointer to access method
106 * RET_SUCCESS, RET_ERROR.
109 __rec_sync(const DB *dbp, u_int flags)
115 recno_t scursor, trec;
120 /* Toss any page pinned across calls. */
121 if (t->bt_pinned != NULL) {
122 mpool_put(t->bt_mp, t->bt_pinned, 0);
126 if (flags == R_RECNOSYNC)
127 return (__bt_sync(dbp, 0));
129 if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
130 return (RET_SUCCESS);
132 /* Read any remaining records into the tree. */
133 if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
136 /* Rewind the file descriptor. */
137 if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
140 /* Save the cursor. */
141 scursor = t->bt_cursor.rcursor;
143 key.size = sizeof(recno_t);
146 if (F_ISSET(t, R_FIXLEN)) {
148 * We assume that fixed length records are all fixed length.
149 * Any that aren't are either EINVAL'd or corrected by the
152 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
153 while (status == RET_SUCCESS) {
154 if (_write(t->bt_rfd, data.data, data.size) !=
157 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
160 iov[1].iov_base = &t->bt_bval;
163 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
164 while (status == RET_SUCCESS) {
165 iov[0].iov_base = data.data;
166 iov[0].iov_len = data.size;
167 if (_writev(t->bt_rfd, iov, 2) != (ssize_t)(data.size + 1))
169 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
173 /* Restore the cursor. */
174 t->bt_cursor.rcursor = scursor;
176 if (status == RET_ERROR)
178 if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
180 if (ftruncate(t->bt_rfd, off))
182 F_CLR(t, R_MODIFIED);
183 return (RET_SUCCESS);