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