Home | History | Annotate | Line # | Download | only in recno
rec_close.c revision 1.1 
      1 /*-
      2  * Copyright (c) 1990, 1993
      3  *	The Regents of the University of California.  All rights reserved.
      4  *
      5  * Redistribution and use in source and binary forms, with or without
      6  * modification, are permitted provided that the following conditions
      7  * are met:
      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. All advertising materials mentioning features or use of this software
     14  *    must display the following acknowledgement:
     15  *	This product includes software developed by the University of
     16  *	California, Berkeley and its contributors.
     17  * 4. Neither the name of the University nor the names of its contributors
     18  *    may be used to endorse or promote products derived from this software
     19  *    without specific prior written permission.
     20  *
     21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  * SUCH DAMAGE.
     32  */
     33 
     34 #if defined(LIBC_SCCS) && !defined(lint)
     35 static char sccsid[] = "@(#)rec_close.c	8.1 (Berkeley) 6/4/93";
     36 #endif /* LIBC_SCCS and not lint */
     37 
     38 #include <sys/types.h>
     39 #include <sys/uio.h>
     40 #include <sys/mman.h>
     41 
     42 #include <errno.h>
     43 #include <limits.h>
     44 #include <stdio.h>
     45 #include <unistd.h>
     46 
     47 #include <db.h>
     48 #include "recno.h"
     49 
     50 /*
     51  * __REC_CLOSE -- Close a recno tree.
     52  *
     53  * Parameters:
     54  *	dbp:	pointer to access method
     55  *
     56  * Returns:
     57  *	RET_ERROR, RET_SUCCESS
     58  */
     59 int
     60 __rec_close(dbp)
     61 	DB *dbp;
     62 {
     63 	BTREE *t;
     64 	int rval;
     65 
     66 	if (__rec_sync(dbp, 0) == RET_ERROR)
     67 		return (RET_ERROR);
     68 
     69 	/* Committed to closing. */
     70 	t = dbp->internal;
     71 
     72 	rval = RET_SUCCESS;
     73 	if (ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
     74 		rval = RET_ERROR;
     75 
     76 	if (!ISSET(t, R_INMEM))
     77 		if (ISSET(t, R_CLOSEFP)) {
     78 			if (fclose(t->bt_rfp))
     79 				rval = RET_ERROR;
     80 		} else
     81 			if (close(t->bt_rfd))
     82 				rval = RET_ERROR;
     83 
     84 	if (__bt_close(dbp) == RET_ERROR)
     85 		rval = RET_ERROR;
     86 
     87 	return (rval);
     88 }
     89 
     90 /*
     91  * __REC_SYNC -- sync the recno tree to disk.
     92  *
     93  * Parameters:
     94  *	dbp:	pointer to access method
     95  *
     96  * Returns:
     97  *	RET_SUCCESS, RET_ERROR.
     98  */
     99 int
    100 __rec_sync(dbp, flags)
    101 	const DB *dbp;
    102 	u_int flags;
    103 {
    104 	struct iovec iov[2];
    105 	BTREE *t;
    106 	DBT data, key;
    107 	off_t off;
    108 	recno_t scursor, trec;
    109 	int status;
    110 
    111 	t = dbp->internal;
    112 
    113 	if (flags == R_RECNOSYNC)
    114 		return (__bt_sync(dbp, 0));
    115 
    116 	if (ISSET(t, R_RDONLY | R_INMEM) || !ISSET(t, R_MODIFIED))
    117 		return (RET_SUCCESS);
    118 
    119 	/* Read any remaining records into the tree. */
    120 	if (!ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
    121 		return (RET_ERROR);
    122 
    123 	/* Rewind the file descriptor. */
    124 	if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
    125 		return (RET_ERROR);
    126 
    127 	iov[1].iov_base = "\n";
    128 	iov[1].iov_len = 1;
    129 	scursor = t->bt_rcursor;
    130 
    131 	key.size = sizeof(recno_t);
    132 	key.data = &trec;
    133 
    134 	status = (dbp->seq)(dbp, &key, &data, R_FIRST);
    135         while (status == RET_SUCCESS) {
    136 		iov[0].iov_base = data.data;
    137 		iov[0].iov_len = data.size;
    138 		if (writev(t->bt_rfd, iov, 2) != data.size + 1)
    139 			return (RET_ERROR);
    140                 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
    141         }
    142 	t->bt_rcursor = scursor;
    143 	if (status == RET_ERROR)
    144 		return (RET_ERROR);
    145 	if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
    146 		return (RET_ERROR);
    147 	if (ftruncate(t->bt_rfd, off))
    148 		return (RET_ERROR);
    149 	CLR(t, R_MODIFIED);
    150 	return (RET_SUCCESS);
    151 }
    152