1 #pragma ident "%Z%%M% %I% %E% SMI" 2 3 /*- 4 * Copyright (c) 1990, 1993, 1994 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Mike Olson. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #if defined(LIBC_SCCS) && !defined(lint) 40 static char sccsid[] = "@(#)bt_close.c 8.7 (Berkeley) 8/17/94"; 41 #endif /* LIBC_SCCS and not lint */ 42 43 #include <sys/param.h> 44 45 #include <errno.h> 46 #include <stdio.h> 47 #include <stdlib.h> 48 #include <string.h> 49 #include <unistd.h> 50 51 #include "db-int.h" 52 #include "btree.h" 53 54 static int bt_meta __P((BTREE *)); 55 56 /* 57 * BT_CLOSE -- Close a btree. 58 * 59 * Parameters: 60 * dbp: pointer to access method 61 * 62 * Returns: 63 * RET_ERROR, RET_SUCCESS 64 */ 65 int 66 __bt_close(dbp) 67 DB *dbp; 68 { 69 BTREE *t; 70 int fd; 71 72 t = dbp->internal; 73 74 /* Toss any page pinned across calls. */ 75 if (t->bt_pinned != NULL) { 76 mpool_put(t->bt_mp, t->bt_pinned, 0); 77 t->bt_pinned = NULL; 78 } 79 80 /* Sync the tree. */ 81 if (__bt_sync(dbp, 0) == RET_ERROR) 82 return (RET_ERROR); 83 84 /* Close the memory pool. */ 85 if (mpool_close(t->bt_mp) == RET_ERROR) 86 return (RET_ERROR); 87 88 /* Free random memory. */ 89 if (t->bt_cursor.key.data != NULL) { 90 free(t->bt_cursor.key.data); 91 t->bt_cursor.key.size = 0; 92 t->bt_cursor.key.data = NULL; 93 } 94 if (t->bt_rkey.data) { 95 free(t->bt_rkey.data); 96 t->bt_rkey.size = 0; 97 t->bt_rkey.data = NULL; 98 } 99 if (t->bt_rdata.data) { 100 free(t->bt_rdata.data); 101 t->bt_rdata.size = 0; 102 t->bt_rdata.data = NULL; 103 } 104 105 fd = t->bt_fd; 106 free(t); 107 free(dbp); 108 return (close(fd) ? RET_ERROR : RET_SUCCESS); 109 } 110 111 /* 112 * BT_SYNC -- sync the btree to disk. 113 * 114 * Parameters: 115 * dbp: pointer to access method 116 * 117 * Returns: 118 * RET_SUCCESS, RET_ERROR. 119 */ 120 int 121 __bt_sync(dbp, flags) 122 const DB *dbp; 123 u_int flags; 124 { 125 BTREE *t; 126 int status; 127 128 t = dbp->internal; 129 130 /* Toss any page pinned across calls. */ 131 if (t->bt_pinned != NULL) { 132 mpool_put(t->bt_mp, t->bt_pinned, 0); 133 t->bt_pinned = NULL; 134 } 135 136 /* Sync doesn't currently take any flags. */ 137 if (flags != 0) { 138 errno = EINVAL; 139 return (RET_ERROR); 140 } 141 142 if (F_ISSET(t, B_INMEM | B_RDONLY) 143 || !F_ISSET(t, B_MODIFIED | B_METADIRTY)) 144 return (RET_SUCCESS); 145 146 if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR) 147 return (RET_ERROR); 148 149 if ((status = mpool_sync(t->bt_mp)) == RET_SUCCESS) 150 F_CLR(t, B_MODIFIED); 151 152 return (status); 153 } 154 155 /* 156 * BT_META -- write the tree meta data to disk. 157 * 158 * Parameters: 159 * t: tree 160 * 161 * Returns: 162 * RET_ERROR, RET_SUCCESS 163 */ 164 static int 165 bt_meta(t) 166 BTREE *t; 167 { 168 BTMETA m; 169 void *p; 170 171 if ((p = mpool_get(t->bt_mp, P_META, 0)) == NULL) 172 return (RET_ERROR); 173 174 /* Fill in metadata. */ 175 m.magic = BTREEMAGIC; 176 m.version = BTREEVERSION; 177 m.psize = t->bt_psize; 178 m.free = t->bt_free; 179 m.nrecs = t->bt_nrecs; 180 m.flags = F_ISSET(t, SAVEMETA); 181 182 memmove(p, &m, sizeof(BTMETA)); 183 mpool_put(t->bt_mp, p, MPOOL_DIRTY); 184 return (RET_SUCCESS); 185 } 186