[e4e1746] | 1 | #include "port_before.h" |
---|
| 2 | |
---|
| 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 | * 4. 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 | __FBSDID("$FreeBSD$"); |
---|
| 37 | |
---|
| 38 | #include "namespace.h" |
---|
| 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 | #include "un-namespace.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(DB *dbp) |
---|
| 63 | { |
---|
| 64 | BTREE *t; |
---|
| 65 | int status; |
---|
| 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 | status = RET_SUCCESS; |
---|
| 80 | if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize)) |
---|
| 81 | status = RET_ERROR; |
---|
| 82 | |
---|
| 83 | if (!F_ISSET(t, R_INMEM)) { |
---|
| 84 | if (F_ISSET(t, R_CLOSEFP)) { |
---|
| 85 | if (fclose(t->bt_rfp)) |
---|
| 86 | status = RET_ERROR; |
---|
| 87 | } else { |
---|
| 88 | if (_close(t->bt_rfd)) |
---|
| 89 | status = RET_ERROR; |
---|
| 90 | } |
---|
| 91 | } |
---|
| 92 | |
---|
| 93 | if (__bt_close(dbp) == RET_ERROR) |
---|
| 94 | status = RET_ERROR; |
---|
| 95 | |
---|
| 96 | return (status); |
---|
| 97 | } |
---|
| 98 | |
---|
| 99 | /* |
---|
| 100 | * __REC_SYNC -- sync the recno tree to disk. |
---|
| 101 | * |
---|
| 102 | * Parameters: |
---|
| 103 | * dbp: pointer to access method |
---|
| 104 | * |
---|
| 105 | * Returns: |
---|
| 106 | * RET_SUCCESS, RET_ERROR. |
---|
| 107 | */ |
---|
| 108 | int |
---|
| 109 | __rec_sync(const DB *dbp, 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 (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED)) |
---|
| 130 | return (RET_SUCCESS); |
---|
| 131 | |
---|
| 132 | /* Read any remaining records into the tree. */ |
---|
| 133 | if (!F_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 | /* Save the cursor. */ |
---|
| 141 | scursor = t->bt_cursor.rcursor; |
---|
| 142 | |
---|
| 143 | key.size = sizeof(recno_t); |
---|
| 144 | key.data = &trec; |
---|
| 145 | |
---|
| 146 | if (F_ISSET(t, R_FIXLEN)) { |
---|
| 147 | /* |
---|
| 148 | * We assume that fixed length records are all fixed length. |
---|
| 149 | * Any that aren't are either EINVAL'd or corrected by the |
---|
| 150 | * record put code. |
---|
| 151 | */ |
---|
| 152 | status = (dbp->seq)(dbp, &key, &data, R_FIRST); |
---|
| 153 | while (status == RET_SUCCESS) { |
---|
| 154 | if (_write(t->bt_rfd, data.data, data.size) != |
---|
| 155 | (ssize_t)data.size) |
---|
| 156 | return (RET_ERROR); |
---|
| 157 | status = (dbp->seq)(dbp, &key, &data, R_NEXT); |
---|
| 158 | } |
---|
| 159 | } else { |
---|
| 160 | iov[1].iov_base = &t->bt_bval; |
---|
| 161 | iov[1].iov_len = 1; |
---|
| 162 | |
---|
| 163 | status = (dbp->seq)(dbp, &key, &data, R_FIRST); |
---|
| 164 | while (status == RET_SUCCESS) { |
---|
| 165 | iov[0].iov_base = data.data; |
---|
| 166 | iov[0].iov_len = data.size; |
---|
| 167 | if (_writev(t->bt_rfd, iov, 2) != (ssize_t)(data.size + 1)) |
---|
| 168 | return (RET_ERROR); |
---|
| 169 | status = (dbp->seq)(dbp, &key, &data, R_NEXT); |
---|
| 170 | } |
---|
| 171 | } |
---|
| 172 | |
---|
| 173 | /* Restore the cursor. */ |
---|
| 174 | t->bt_cursor.rcursor = scursor; |
---|
| 175 | |
---|
| 176 | if (status == RET_ERROR) |
---|
| 177 | return (RET_ERROR); |
---|
| 178 | if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1) |
---|
| 179 | return (RET_ERROR); |
---|
| 180 | if (ftruncate(t->bt_rfd, off)) |
---|
| 181 | return (RET_ERROR); |
---|
| 182 | F_CLR(t, R_MODIFIED); |
---|
| 183 | return (RET_SUCCESS); |
---|
| 184 | } |
---|