lib/libc/db/btree/bt_close.c

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