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