Home | History | Annotate | Line # | Download | only in recno
rec_close.c revision 1.9
      1  1.9       jtc /*	$NetBSD: rec_close.c,v 1.9 1997/07/21 14:06:43 jtc Exp $	*/
      2  1.6       cgd 
      3  1.1       cgd /*-
      4  1.7       cgd  * Copyright (c) 1990, 1993, 1994
      5  1.1       cgd  *	The Regents of the University of California.  All rights reserved.
      6  1.1       cgd  *
      7  1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8  1.1       cgd  * modification, are permitted provided that the following conditions
      9  1.1       cgd  * are met:
     10  1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11  1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12  1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14  1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15  1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1       cgd  *    must display the following acknowledgement:
     17  1.1       cgd  *	This product includes software developed by the University of
     18  1.1       cgd  *	California, Berkeley and its contributors.
     19  1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1       cgd  *    may be used to endorse or promote products derived from this software
     21  1.1       cgd  *    without specific prior written permission.
     22  1.1       cgd  *
     23  1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1       cgd  * SUCH DAMAGE.
     34  1.1       cgd  */
     35  1.1       cgd 
     36  1.8  christos #include <sys/cdefs.h>
     37  1.1       cgd #if defined(LIBC_SCCS) && !defined(lint)
     38  1.6       cgd #if 0
     39  1.7       cgd static char sccsid[] = "@(#)rec_close.c	8.6 (Berkeley) 8/18/94";
     40  1.6       cgd #else
     41  1.9       jtc __RCSID("$NetBSD: rec_close.c,v 1.9 1997/07/21 14:06:43 jtc Exp $");
     42  1.6       cgd #endif
     43  1.1       cgd #endif /* LIBC_SCCS and not lint */
     44  1.1       cgd 
     45  1.9       jtc #include "namespace.h"
     46  1.1       cgd #include <sys/types.h>
     47  1.1       cgd #include <sys/uio.h>
     48  1.1       cgd #include <sys/mman.h>
     49  1.1       cgd 
     50  1.1       cgd #include <errno.h>
     51  1.1       cgd #include <limits.h>
     52  1.1       cgd #include <stdio.h>
     53  1.1       cgd #include <unistd.h>
     54  1.1       cgd 
     55  1.1       cgd #include <db.h>
     56  1.1       cgd #include "recno.h"
     57  1.1       cgd 
     58  1.1       cgd /*
     59  1.1       cgd  * __REC_CLOSE -- Close a recno tree.
     60  1.1       cgd  *
     61  1.1       cgd  * Parameters:
     62  1.1       cgd  *	dbp:	pointer to access method
     63  1.1       cgd  *
     64  1.1       cgd  * Returns:
     65  1.1       cgd  *	RET_ERROR, RET_SUCCESS
     66  1.1       cgd  */
     67  1.1       cgd int
     68  1.1       cgd __rec_close(dbp)
     69  1.1       cgd 	DB *dbp;
     70  1.1       cgd {
     71  1.1       cgd 	BTREE *t;
     72  1.5       cgd 	int status;
     73  1.1       cgd 
     74  1.4       cgd 	t = dbp->internal;
     75  1.4       cgd 
     76  1.4       cgd 	/* Toss any page pinned across calls. */
     77  1.4       cgd 	if (t->bt_pinned != NULL) {
     78  1.4       cgd 		mpool_put(t->bt_mp, t->bt_pinned, 0);
     79  1.4       cgd 		t->bt_pinned = NULL;
     80  1.4       cgd 	}
     81  1.4       cgd 
     82  1.1       cgd 	if (__rec_sync(dbp, 0) == RET_ERROR)
     83  1.1       cgd 		return (RET_ERROR);
     84  1.1       cgd 
     85  1.1       cgd 	/* Committed to closing. */
     86  1.5       cgd 	status = RET_SUCCESS;
     87  1.7       cgd 	if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
     88  1.5       cgd 		status = RET_ERROR;
     89  1.1       cgd 
     90  1.7       cgd 	if (!F_ISSET(t, R_INMEM))
     91  1.7       cgd 		if (F_ISSET(t, R_CLOSEFP)) {
     92  1.1       cgd 			if (fclose(t->bt_rfp))
     93  1.5       cgd 				status = RET_ERROR;
     94  1.1       cgd 		} else
     95  1.1       cgd 			if (close(t->bt_rfd))
     96  1.5       cgd 				status = RET_ERROR;
     97  1.1       cgd 
     98  1.1       cgd 	if (__bt_close(dbp) == RET_ERROR)
     99  1.5       cgd 		status = RET_ERROR;
    100  1.1       cgd 
    101  1.5       cgd 	return (status);
    102  1.1       cgd }
    103  1.1       cgd 
    104  1.1       cgd /*
    105  1.1       cgd  * __REC_SYNC -- sync the recno tree to disk.
    106  1.1       cgd  *
    107  1.1       cgd  * Parameters:
    108  1.1       cgd  *	dbp:	pointer to access method
    109  1.1       cgd  *
    110  1.1       cgd  * Returns:
    111  1.1       cgd  *	RET_SUCCESS, RET_ERROR.
    112  1.1       cgd  */
    113  1.1       cgd int
    114  1.1       cgd __rec_sync(dbp, flags)
    115  1.1       cgd 	const DB *dbp;
    116  1.1       cgd 	u_int flags;
    117  1.1       cgd {
    118  1.1       cgd 	struct iovec iov[2];
    119  1.1       cgd 	BTREE *t;
    120  1.1       cgd 	DBT data, key;
    121  1.1       cgd 	off_t off;
    122  1.1       cgd 	recno_t scursor, trec;
    123  1.1       cgd 	int status;
    124  1.1       cgd 
    125  1.1       cgd 	t = dbp->internal;
    126  1.4       cgd 
    127  1.4       cgd 	/* Toss any page pinned across calls. */
    128  1.4       cgd 	if (t->bt_pinned != NULL) {
    129  1.4       cgd 		mpool_put(t->bt_mp, t->bt_pinned, 0);
    130  1.4       cgd 		t->bt_pinned = NULL;
    131  1.4       cgd 	}
    132  1.1       cgd 
    133  1.1       cgd 	if (flags == R_RECNOSYNC)
    134  1.1       cgd 		return (__bt_sync(dbp, 0));
    135  1.1       cgd 
    136  1.7       cgd 	if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
    137  1.1       cgd 		return (RET_SUCCESS);
    138  1.1       cgd 
    139  1.1       cgd 	/* Read any remaining records into the tree. */
    140  1.7       cgd 	if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
    141  1.1       cgd 		return (RET_ERROR);
    142  1.1       cgd 
    143  1.1       cgd 	/* Rewind the file descriptor. */
    144  1.1       cgd 	if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
    145  1.1       cgd 		return (RET_ERROR);
    146  1.1       cgd 
    147  1.7       cgd 	/* Save the cursor. */
    148  1.7       cgd 	scursor = t->bt_cursor.rcursor;
    149  1.1       cgd 
    150  1.1       cgd 	key.size = sizeof(recno_t);
    151  1.1       cgd 	key.data = &trec;
    152  1.1       cgd 
    153  1.7       cgd 	if (F_ISSET(t, R_FIXLEN)) {
    154  1.7       cgd 		/*
    155  1.7       cgd 		 * We assume that fixed length records are all fixed length.
    156  1.7       cgd 		 * Any that aren't are either EINVAL'd or corrected by the
    157  1.7       cgd 		 * record put code.
    158  1.7       cgd 		 */
    159  1.7       cgd 		status = (dbp->seq)(dbp, &key, &data, R_FIRST);
    160  1.7       cgd 		while (status == RET_SUCCESS) {
    161  1.7       cgd 			if (write(t->bt_rfd, data.data, data.size) != data.size)
    162  1.7       cgd 				return (RET_ERROR);
    163  1.7       cgd 			status = (dbp->seq)(dbp, &key, &data, R_NEXT);
    164  1.7       cgd 		}
    165  1.7       cgd 	} else {
    166  1.7       cgd 		iov[1].iov_base = &t->bt_bval;
    167  1.7       cgd 		iov[1].iov_len = 1;
    168  1.7       cgd 
    169  1.7       cgd 		status = (dbp->seq)(dbp, &key, &data, R_FIRST);
    170  1.7       cgd 		while (status == RET_SUCCESS) {
    171  1.7       cgd 			iov[0].iov_base = data.data;
    172  1.7       cgd 			iov[0].iov_len = data.size;
    173  1.7       cgd 			if (writev(t->bt_rfd, iov, 2) != data.size + 1)
    174  1.7       cgd 				return (RET_ERROR);
    175  1.7       cgd 			status = (dbp->seq)(dbp, &key, &data, R_NEXT);
    176  1.7       cgd 		}
    177  1.7       cgd 	}
    178  1.7       cgd 
    179  1.7       cgd 	/* Restore the cursor. */
    180  1.7       cgd 	t->bt_cursor.rcursor = scursor;
    181  1.7       cgd 
    182  1.1       cgd 	if (status == RET_ERROR)
    183  1.1       cgd 		return (RET_ERROR);
    184  1.1       cgd 	if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
    185  1.1       cgd 		return (RET_ERROR);
    186  1.1       cgd 	if (ftruncate(t->bt_rfd, off))
    187  1.1       cgd 		return (RET_ERROR);
    188  1.7       cgd 	F_CLR(t, R_MODIFIED);
    189  1.1       cgd 	return (RET_SUCCESS);
    190  1.1       cgd }
    191