db/recno/rec_close.c

   1 /*
   2  * Copyright (c) 2003 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_HEADER_START@
   5  *
   6  * Copyright (c) 1999-2003 Apple Computer, Inc.  All Rights Reserved.
   7  *
   8  * This file contains Original Code and/or Modifications of Original Code
   9  * as defined in and that are subject to the Apple Public Source License
  10  * Version 2.0 (the 'License'). You may not use this file except in
  11  * compliance with the License. Please obtain a copy of the License at
  12  * http://www.opensource.apple.com/apsl/ and read it before using this
  13  * file.
  14  *
  15  * The Original Code and all software distributed under the License are
  16  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  17  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  18  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  19  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  20  * Please see the License for the specific language governing rights and
  21  * limitations under the License.
  22  *
  23  * @APPLE_LICENSE_HEADER_END@
  24  */
  25 /*-
  26  * Copyright (c) 1990, 1993, 1994
  27  *      The Regents of the University of California.  All rights reserved.
  28  *
  29  * Redistribution and use in source and binary forms, with or without
  30  * modification, are permitted provided that the following conditions
  31  * are met:
  32  * 1. Redistributions of source code must retain the above copyright
  33  *    notice, this list of conditions and the following disclaimer.
  34  * 2. Redistributions in binary form must reproduce the above copyright
  35  *    notice, this list of conditions and the following disclaimer in the
  36  *    documentation and/or other materials provided with the distribution.
  37  * 3. All advertising materials mentioning features or use of this software
  38  *    must display the following acknowledgement:
  39  *      This product includes software developed by the University of
  40  *      California, Berkeley and its contributors.
  41  * 4. Neither the name of the University nor the names of its contributors
  42  *    may be used to endorse or promote products derived from this software
  43  *    without specific prior written permission.
  44  *
  45  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  46  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  47  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  48  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  49  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  50  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  51  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  52  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  53  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  54  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  55  * SUCH DAMAGE.
  56  */
  57
  58 #if defined(LIBC_SCCS) && !defined(lint)
  59 static char sccsid[] = "@(#)rec_close.c 8.6 (Berkeley) 8/18/94";
  60 #endif /* LIBC_SCCS and not lint */
  61 #include <sys/cdefs.h>
  62
  63 #include <sys/types.h>
  64 #include <sys/uio.h>
  65 #include <sys/mman.h>
  66
  67 #include <errno.h>
  68 #include <limits.h>
  69 #include <stdio.h>
  70 #include <unistd.h>
  71
  72 #include <db.h>
  73 #include "recno.h"
  74
  75 /*
  76  * __REC_CLOSE -- Close a recno tree.
  77  *
  78  * Parameters:
  79  *      dbp:    pointer to access method
  80  *
  81  * Returns:
  82  *      RET_ERROR, RET_SUCCESS
  83  */
  84 int
  85 __rec_close(dbp)
  86         DB *dbp;
  87 {
  88         BTREE *t;
  89         int status;
  90
  91         t = dbp->internal;
  92
  93         /* Toss any page pinned across calls. */
  94         if (t->bt_pinned != NULL) {
  95                 mpool_put(t->bt_mp, t->bt_pinned, 0);
  96                 t->bt_pinned = NULL;
  97         }
  98
  99         if (__rec_sync(dbp, 0) == RET_ERROR)
 100                 return (RET_ERROR);
 101
 102         /* Committed to closing. */
 103         status = RET_SUCCESS;
 104         if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
 105                 status = RET_ERROR;
 106
 107         if (!F_ISSET(t, R_INMEM)) {
 108                 if (F_ISSET(t, R_CLOSEFP)) {
 109                         if (fclose(t->bt_rfp))
 110                                 status = RET_ERROR;
 111                 } else
 112                         if (close(t->bt_rfd))
 113                                 status = RET_ERROR;
 114         }
 115
 116         if (__bt_close(dbp) == RET_ERROR)
 117                 status = RET_ERROR;
 118
 119         return (status);
 120 }
 121
 122 /*
 123  * __REC_SYNC -- sync the recno tree to disk.
 124  *
 125  * Parameters:
 126  *      dbp:    pointer to access method
 127  *
 128  * Returns:
 129  *      RET_SUCCESS, RET_ERROR.
 130  */
 131 int
 132 __rec_sync(dbp, flags)
 133         const DB *dbp;
 134         u_int flags;
 135 {
 136         struct iovec iov[2];
 137         BTREE *t;
 138         DBT data, key;
 139         off_t off;
 140         recno_t scursor, trec;
 141         int status;
 142
 143         t = dbp->internal;
 144
 145         /* Toss any page pinned across calls. */
 146         if (t->bt_pinned != NULL) {
 147                 mpool_put(t->bt_mp, t->bt_pinned, 0);
 148                 t->bt_pinned = NULL;
 149         }
 150
 151         if (flags == R_RECNOSYNC)
 152                 return (__bt_sync(dbp, 0));
 153
 154         if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
 155                 return (RET_SUCCESS);
 156
 157         /* Read any remaining records into the tree. */
 158         if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
 159                 return (RET_ERROR);
 160
 161         /* Rewind the file descriptor. */
 162         if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
 163                 return (RET_ERROR);
 164
 165         /* Save the cursor. */
 166         scursor = t->bt_cursor.rcursor;
 167
 168         key.size = sizeof(recno_t);
 169         key.data = &trec;
 170
 171         if (F_ISSET(t, R_FIXLEN)) {
 172                 /*
 173                  * We assume that fixed length records are all fixed length.
 174                  * Any that aren't are either EINVAL'd or corrected by the
 175                  * record put code.
 176                  */
 177                 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
 178                 while (status == RET_SUCCESS) {
 179                         if (write(t->bt_rfd, data.data, data.size) !=
 180                             data.size)
 181                                 return (RET_ERROR);
 182                         status = (dbp->seq)(dbp, &key, &data, R_NEXT);
 183                 }
 184         } else {
 185                 iov[1].iov_base = (char *)&t->bt_bval;
 186                 iov[1].iov_len = 1;
 187
 188                 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
 189                 while (status == RET_SUCCESS) {
 190                         iov[0].iov_base = data.data;
 191                         iov[0].iov_len = data.size;
 192                         if (writev(t->bt_rfd, iov, 2) != data.size + 1)
 193                                 return (RET_ERROR);
 194                         status = (dbp->seq)(dbp, &key, &data, R_NEXT);
 195                 }
 196         }
 197
 198         /* Restore the cursor. */
 199         t->bt_cursor.rcursor = scursor;
 200
 201         if (status == RET_ERROR)
 202                 return (RET_ERROR);
 203         if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
 204                 return (RET_ERROR);
 205         if (ftruncate(t->bt_rfd, off))
 206                 return (RET_ERROR);
 207         F_CLR(t, R_MODIFIED);
 208         return (RET_SUCCESS);
 209 }