1 /*- 2 * Copyright (c) 1990, 1993, 1994 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 * $FreeBSD: src/lib/libc/db/recno/rec_close.c,v 1.4 2000/01/27 23:06:11 jasone Exp $ 34 */ 35 36 #if defined(LIBC_SCCS) && !defined(lint) 37 static char sccsid[] = "@(#)rec_close.c 8.6 (Berkeley) 8/18/94"; 38 #endif /* LIBC_SCCS and not lint */ 39 40 #include <sys/types.h> 41 #include <sys/uio.h> 42 #include <sys/mman.h> 43 44 #include <errno.h> 45 #include <limits.h> 46 #include <stdio.h> 47 #include <unistd.h> 48 49 #include <db.h> 50 #include "recno.h" 51 52 /* 53 * __REC_CLOSE -- Close a recno tree. 54 * 55 * Parameters: 56 * dbp: pointer to access method 57 * 58 * Returns: 59 * RET_ERROR, RET_SUCCESS 60 */ 61 int 62 __rec_close(dbp) 63 DB *dbp; 64 { 65 BTREE *t; 66 int status; 67 68 t = dbp->internal; 69 70 /* Toss any page pinned across calls. */ 71 if (t->bt_pinned != NULL) { 72 mpool_put(t->bt_mp, t->bt_pinned, 0); 73 t->bt_pinned = NULL; 74 } 75 76 if (__rec_sync(dbp, 0) == RET_ERROR) 77 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 */ 107 int 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