db/recno/rec_close.c

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