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