2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)rec_close.c 8.6 (Berkeley) 8/18/94
30 * $FreeBSD: head/lib/libc/db/recno/rec_close.c 190484 2009-03-28 05:45:29Z delphij $
33 #include "namespace.h"
34 #include <sys/types.h>
42 #include "un-namespace.h"
48 * __REC_CLOSE -- Close a recno tree.
51 * dbp: pointer to access method
54 * RET_ERROR, RET_SUCCESS
64 /* Toss any page pinned across calls. */
65 if (t->bt_pinned != NULL) {
66 mpool_put(t->bt_mp, t->bt_pinned, 0);
70 if (__rec_sync(dbp, 0) == RET_ERROR)
73 /* Committed to closing. */
75 if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
78 if (!F_ISSET(t, R_INMEM)) {
79 if (F_ISSET(t, R_CLOSEFP)) {
80 if (fclose(t->bt_rfp))
83 if (_close(t->bt_rfd))
88 if (__bt_close(dbp) == RET_ERROR)
95 * __REC_SYNC -- sync the recno tree to disk.
98 * dbp: pointer to access method
101 * RET_SUCCESS, RET_ERROR.
104 __rec_sync(const DB *dbp, unsigned int flags)
110 recno_t scursor, trec;
115 /* Toss any page pinned across calls. */
116 if (t->bt_pinned != NULL) {
117 mpool_put(t->bt_mp, t->bt_pinned, 0);
121 if (flags == R_RECNOSYNC)
122 return (__bt_sync(dbp, 0));
124 if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
125 return (RET_SUCCESS);
127 /* Read any remaining records into the tree. */
128 if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
131 /* Rewind the file descriptor. */
132 if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
135 /* Save the cursor. */
136 scursor = t->bt_cursor.rcursor;
138 key.size = sizeof(recno_t);
141 if (F_ISSET(t, R_FIXLEN)) {
143 * We assume that fixed length records are all fixed length.
144 * Any that aren't are either EINVAL'd or corrected by the
147 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
148 while (status == RET_SUCCESS) {
149 if (_write(t->bt_rfd, data.data, data.size) !=
152 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
155 iov[1].iov_base = &t->bt_bval;
158 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
159 while (status == RET_SUCCESS) {
160 iov[0].iov_base = data.data;
161 iov[0].iov_len = data.size;
162 if (_writev(t->bt_rfd, iov, 2) != (ssize_t)(data.size + 1))
164 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
168 /* Restore the cursor. */
169 t->bt_cursor.rcursor = scursor;
171 if (status == RET_ERROR)
173 if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
175 if (ftruncate(t->bt_rfd, off))
177 F_CLR(t, R_MODIFIED);
178 return (RET_SUCCESS);