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 /* from: static char sccsid[] = "@(#)rec_close.c 8.2 (Berkeley) 9/7/93"; */ 36 static char *rcsid = "$Id: rec_close.c,v 1.4 1993/09/09 02:42:19 cgd Exp $"; 37 #endif /* LIBC_SCCS and not lint */ 38 39 #include <sys/types.h> 40 #include <sys/uio.h> 41 #include <sys/mman.h> 42 43 #include <errno.h> 44 #include <limits.h> 45 #include <stdio.h> 46 #include <unistd.h> 47 48 #include <db.h> 49 #include "recno.h" 50 51 /* 52 * __REC_CLOSE -- Close a recno tree. 53 * 54 * Parameters: 55 * dbp: pointer to access method 56 * 57 * Returns: 58 * RET_ERROR, RET_SUCCESS 59 */ 60 int 61 __rec_close(dbp) 62 DB *dbp; 63 { 64 BTREE *t; 65 int rval; 66 67 t = dbp->internal; 68 69 /* Toss any page pinned across calls. */ 70 if (t->bt_pinned != NULL) { 71 mpool_put(t->bt_mp, t->bt_pinned, 0); 72 t->bt_pinned = NULL; 73 } 74 75 if (__rec_sync(dbp, 0) == RET_ERROR) 76 return (RET_ERROR); 77 78 /* Committed to closing. */ 79 rval = RET_SUCCESS; 80 if (ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize)) 81 rval = RET_ERROR; 82 83 if (!ISSET(t, R_INMEM)) 84 if (ISSET(t, R_CLOSEFP)) { 85 if (fclose(t->bt_rfp)) 86 rval = RET_ERROR; 87 } else 88 if (close(t->bt_rfd)) 89 rval = RET_ERROR; 90 91 if (__bt_close(dbp) == RET_ERROR) 92 rval = RET_ERROR; 93 94 return (rval); 95 } 96 97 /* 98 * __REC_SYNC -- sync the recno tree to disk. 99 * 100 * Parameters: 101 * dbp: pointer to access method 102 * 103 * Returns: 104 * RET_SUCCESS, RET_ERROR. 105 */ 106 int 107 __rec_sync(dbp, flags) 108 const DB *dbp; 109 u_int flags; 110 { 111 struct iovec iov[2]; 112 BTREE *t; 113 DBT data, key; 114 off_t off; 115 recno_t scursor, trec; 116 int status; 117 118 t = dbp->internal; 119 120 /* Toss any page pinned across calls. */ 121 if (t->bt_pinned != NULL) { 122 mpool_put(t->bt_mp, t->bt_pinned, 0); 123 t->bt_pinned = NULL; 124 } 125 126 if (flags == R_RECNOSYNC) 127 return (__bt_sync(dbp, 0)); 128 129 if (ISSET(t, R_RDONLY | R_INMEM) || !ISSET(t, R_MODIFIED)) 130 return (RET_SUCCESS); 131 132 /* Read any remaining records into the tree. */ 133 if (!ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR) 134 return (RET_ERROR); 135 136 /* Rewind the file descriptor. */ 137 if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0) 138 return (RET_ERROR); 139 140 iov[1].iov_base = "\n"; 141 iov[1].iov_len = 1; 142 scursor = t->bt_rcursor; 143 144 key.size = sizeof(recno_t); 145 key.data = &trec; 146 147 status = (dbp->seq)(dbp, &key, &data, R_FIRST); 148 while (status == RET_SUCCESS) { 149 iov[0].iov_base = data.data; 150 iov[0].iov_len = data.size; 151 if (writev(t->bt_rfd, iov, 2) != data.size + 1) 152 return (RET_ERROR); 153 status = (dbp->seq)(dbp, &key, &data, R_NEXT); 154 } 155 t->bt_rcursor = scursor; 156 if (status == RET_ERROR) 157 return (RET_ERROR); 158 if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1) 159 return (RET_ERROR); 160 if (ftruncate(t->bt_rfd, off)) 161 return (RET_ERROR); 162 CLR(t, R_MODIFIED); 163 return (RET_SUCCESS); 164 } 165