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 "namespace.h" 36 #include <sys/types.h> 37 #include <sys/uio.h> 38 #include <sys/mman.h> 39 40 #include <errno.h> 41 #include <limits.h> 42 #include <stdio.h> 43 #include <unistd.h> 44 #include "un-namespace.h" 45 46 #include <db.h> 47 #include "recno.h" 48 49 /* 50 * __REC_CLOSE -- Close a recno tree. 51 * 52 * Parameters: 53 * dbp: pointer to access method 54 * 55 * Returns: 56 * RET_ERROR, RET_SUCCESS 57 */ 58 int 59 __rec_close(DB *dbp) 60 { 61 BTREE *t; 62 int status; 63 64 t = dbp->internal; 65 66 /* Toss any page pinned across calls. */ 67 if (t->bt_pinned != NULL) { 68 mpool_put(t->bt_mp, t->bt_pinned, 0); 69 t->bt_pinned = NULL; 70 } 71 72 if (__rec_sync(dbp, 0) == RET_ERROR) 73 return (RET_ERROR); 74 75 /* Committed to closing. */ 76 status = RET_SUCCESS; 77 if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize)) 78 status = RET_ERROR; 79 80 if (!F_ISSET(t, R_INMEM)) { 81 if (F_ISSET(t, R_CLOSEFP)) { 82 if (fclose(t->bt_rfp)) 83 status = RET_ERROR; 84 } else { 85 if (_close(t->bt_rfd)) 86 status = RET_ERROR; 87 } 88 } 89 90 if (__bt_close(dbp) == RET_ERROR) 91 status = RET_ERROR; 92 93 return (status); 94 } 95 96 /* 97 * __REC_SYNC -- sync the recno tree to disk. 98 * 99 * Parameters: 100 * dbp: pointer to access method 101 * 102 * Returns: 103 * RET_SUCCESS, RET_ERROR. 104 */ 105 int 106 __rec_sync(const DB *dbp, u_int flags) 107 { 108 struct iovec iov[2]; 109 BTREE *t; 110 DBT data, key; 111 off_t off; 112 recno_t scursor, trec; 113 int status; 114 115 t = dbp->internal; 116 117 /* Toss any page pinned across calls. */ 118 if (t->bt_pinned != NULL) { 119 mpool_put(t->bt_mp, t->bt_pinned, 0); 120 t->bt_pinned = NULL; 121 } 122 123 if (flags == R_RECNOSYNC) 124 return (__bt_sync(dbp, 0)); 125 126 if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED)) 127 return (RET_SUCCESS); 128 129 /* Read any remaining records into the tree. */ 130 if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR) 131 return (RET_ERROR); 132 133 /* Rewind the file descriptor. */ 134 if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0) 135 return (RET_ERROR); 136 137 /* Save the cursor. */ 138 scursor = t->bt_cursor.rcursor; 139 140 key.size = sizeof(recno_t); 141 key.data = &trec; 142 143 if (F_ISSET(t, R_FIXLEN)) { 144 /* 145 * We assume that fixed length records are all fixed length. 146 * Any that aren't are either EINVAL'd or corrected by the 147 * record put code. 148 */ 149 status = (dbp->seq)(dbp, &key, &data, R_FIRST); 150 while (status == RET_SUCCESS) { 151 if (_write(t->bt_rfd, data.data, data.size) != 152 (ssize_t)data.size) 153 return (RET_ERROR); 154 status = (dbp->seq)(dbp, &key, &data, R_NEXT); 155 } 156 } else { 157 iov[1].iov_base = &t->bt_bval; 158 iov[1].iov_len = 1; 159 160 status = (dbp->seq)(dbp, &key, &data, R_FIRST); 161 while (status == RET_SUCCESS) { 162 iov[0].iov_base = data.data; 163 iov[0].iov_len = data.size; 164 if (_writev(t->bt_rfd, iov, 2) != (ssize_t)(data.size + 1)) 165 return (RET_ERROR); 166 status = (dbp->seq)(dbp, &key, &data, R_NEXT); 167 } 168 } 169 170 /* Restore the cursor. */ 171 t->bt_cursor.rcursor = scursor; 172 173 if (status == RET_ERROR) 174 return (RET_ERROR); 175 if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1) 176 return (RET_ERROR); 177 if (ftruncate(t->bt_rfd, off)) 178 return (RET_ERROR); 179 F_CLR(t, R_MODIFIED); 180 return (RET_SUCCESS); 181 } 182