rec_close.c revision 56698
10Sstevel@tonic-gate/*-
20Sstevel@tonic-gate * Copyright (c) 1990, 1993, 1994
30Sstevel@tonic-gate *	The Regents of the University of California.  All rights reserved.
40Sstevel@tonic-gate *
50Sstevel@tonic-gate * Redistribution and use in source and binary forms, with or without
60Sstevel@tonic-gate * modification, are permitted provided that the following conditions
70Sstevel@tonic-gate * are met:
80Sstevel@tonic-gate * 1. Redistributions of source code must retain the above copyright
90Sstevel@tonic-gate *    notice, this list of conditions and the following disclaimer.
100Sstevel@tonic-gate * 2. Redistributions in binary form must reproduce the above copyright
110Sstevel@tonic-gate *    notice, this list of conditions and the following disclaimer in the
120Sstevel@tonic-gate *    documentation and/or other materials provided with the distribution.
130Sstevel@tonic-gate * 3. All advertising materials mentioning features or use of this software
140Sstevel@tonic-gate *    must display the following acknowledgement:
150Sstevel@tonic-gate *	This product includes software developed by the University of
160Sstevel@tonic-gate *	California, Berkeley and its contributors.
170Sstevel@tonic-gate * 4. Neither the name of the University nor the names of its contributors
180Sstevel@tonic-gate *    may be used to endorse or promote products derived from this software
190Sstevel@tonic-gate *    without specific prior written permission.
200Sstevel@tonic-gate *
210Sstevel@tonic-gate * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
220Sstevel@tonic-gate * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
230Sstevel@tonic-gate * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
240Sstevel@tonic-gate * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
250Sstevel@tonic-gate * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
260Sstevel@tonic-gate * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
270Sstevel@tonic-gate * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
280Sstevel@tonic-gate * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
290Sstevel@tonic-gate * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
300Sstevel@tonic-gate * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
310Sstevel@tonic-gate * SUCH DAMAGE.
320Sstevel@tonic-gate *
330Sstevel@tonic-gate * $FreeBSD: head/lib/libc/db/recno/rec_close.c 56698 2000-01-27 23:07:25Z jasone $
340Sstevel@tonic-gate */
350Sstevel@tonic-gate
360Sstevel@tonic-gate#if defined(LIBC_SCCS) && !defined(lint)
370Sstevel@tonic-gatestatic char sccsid[] = "@(#)rec_close.c	8.6 (Berkeley) 8/18/94";
380Sstevel@tonic-gate#endif /* LIBC_SCCS and not lint */
390Sstevel@tonic-gate
400Sstevel@tonic-gate#include <sys/types.h>
410Sstevel@tonic-gate#include <sys/uio.h>
420Sstevel@tonic-gate#include <sys/mman.h>
430Sstevel@tonic-gate
440Sstevel@tonic-gate#include <errno.h>
450Sstevel@tonic-gate#include <limits.h>
460Sstevel@tonic-gate#include <stdio.h>
470Sstevel@tonic-gate#include <unistd.h>
480Sstevel@tonic-gate
490Sstevel@tonic-gate#include <db.h>
500Sstevel@tonic-gate#include "recno.h"
510Sstevel@tonic-gate
520Sstevel@tonic-gate/*
530Sstevel@tonic-gate * __REC_CLOSE -- Close a recno tree.
540Sstevel@tonic-gate *
550Sstevel@tonic-gate * Parameters:
560Sstevel@tonic-gate *	dbp:	pointer to access method
570Sstevel@tonic-gate *
580Sstevel@tonic-gate * Returns:
590Sstevel@tonic-gate *	RET_ERROR, RET_SUCCESS
600Sstevel@tonic-gate */
610Sstevel@tonic-gateint
620Sstevel@tonic-gate__rec_close(dbp)
630Sstevel@tonic-gate	DB *dbp;
640Sstevel@tonic-gate{
650Sstevel@tonic-gate	BTREE *t;
660Sstevel@tonic-gate	int status;
670Sstevel@tonic-gate
680Sstevel@tonic-gate	t = dbp->internal;
690Sstevel@tonic-gate
700Sstevel@tonic-gate	/* Toss any page pinned across calls. */
710Sstevel@tonic-gate	if (t->bt_pinned != NULL) {
720Sstevel@tonic-gate		mpool_put(t->bt_mp, t->bt_pinned, 0);
730Sstevel@tonic-gate		t->bt_pinned = NULL;
740Sstevel@tonic-gate	}
750Sstevel@tonic-gate
760Sstevel@tonic-gate	if (__rec_sync(dbp, 0) == RET_ERROR)
770Sstevel@tonic-gate		return (RET_ERROR);
78
79	/* Committed to closing. */
80	status = RET_SUCCESS;
81	if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
82		status = RET_ERROR;
83
84	if (!F_ISSET(t, R_INMEM))
85		if (F_ISSET(t, R_CLOSEFP)) {
86			if (fclose(t->bt_rfp))
87				status = RET_ERROR;
88		} else
89			if (_close(t->bt_rfd))
90				status = RET_ERROR;
91
92	if (__bt_close(dbp) == RET_ERROR)
93		status = RET_ERROR;
94
95	return (status);
96}
97
98/*
99 * __REC_SYNC -- sync the recno tree to disk.
100 *
101 * Parameters:
102 *	dbp:	pointer to access method
103 *
104 * Returns:
105 *	RET_SUCCESS, RET_ERROR.
106 */
107int
108__rec_sync(dbp, flags)
109	const DB *dbp;
110	u_int flags;
111{
112	struct iovec iov[2];
113	BTREE *t;
114	DBT data, key;
115	off_t off;
116	recno_t scursor, trec;
117	int status;
118
119	t = dbp->internal;
120
121	/* Toss any page pinned across calls. */
122	if (t->bt_pinned != NULL) {
123		mpool_put(t->bt_mp, t->bt_pinned, 0);
124		t->bt_pinned = NULL;
125	}
126
127	if (flags == R_RECNOSYNC)
128		return (__bt_sync(dbp, 0));
129
130	if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
131		return (RET_SUCCESS);
132
133	/* Read any remaining records into the tree. */
134	if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
135		return (RET_ERROR);
136
137	/* Rewind the file descriptor. */
138	if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
139		return (RET_ERROR);
140
141	/* Save the cursor. */
142	scursor = t->bt_cursor.rcursor;
143
144	key.size = sizeof(recno_t);
145	key.data = &trec;
146
147	if (F_ISSET(t, R_FIXLEN)) {
148		/*
149		 * We assume that fixed length records are all fixed length.
150		 * Any that aren't are either EINVAL'd or corrected by the
151		 * record put code.
152		 */
153		status = (dbp->seq)(dbp, &key, &data, R_FIRST);
154		while (status == RET_SUCCESS) {
155			if (_write(t->bt_rfd, data.data, data.size) !=
156			    data.size)
157				return (RET_ERROR);
158			status = (dbp->seq)(dbp, &key, &data, R_NEXT);
159		}
160	} else {
161		iov[1].iov_base = (char *)&t->bt_bval;
162		iov[1].iov_len = 1;
163
164		status = (dbp->seq)(dbp, &key, &data, R_FIRST);
165		while (status == RET_SUCCESS) {
166			iov[0].iov_base = data.data;
167			iov[0].iov_len = data.size;
168			if (writev(t->bt_rfd, iov, 2) != data.size + 1)
169				return (RET_ERROR);
170			status = (dbp->seq)(dbp, &key, &data, R_NEXT);
171		}
172	}
173
174	/* Restore the cursor. */
175	t->bt_cursor.rcursor = scursor;
176
177	if (status == RET_ERROR)
178		return (RET_ERROR);
179	if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
180		return (RET_ERROR);
181	if (ftruncate(t->bt_rfd, off))
182		return (RET_ERROR);
183	F_CLR(t, R_MODIFIED);
184	return (RET_SUCCESS);
185}
186