db/recno/rec_close.c

   1 /*
   2  * Copyright (c) 1999 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
  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
  59 #include <sys/types.h>
  60 #include <sys/uio.h>
  61
  62 #include <mach/mach.h>
  63
  64 #include <errno.h>
  65 #include <limits.h>
  66 #include <stdio.h>
  67 #include <unistd.h>
  68
  69 #include <db.h>
  70 #include "recno.h"
  71
  72 /*
  73  * __REC_CLOSE -- Close a recno tree.
  74  *
  75  * Parameters:
  76  *      dbp:    pointer to access method
  77  *
  78  * Returns:
  79  *      RET_ERROR, RET_SUCCESS
  80  */
  81 int
  82 __rec_close(dbp)
  83         DB *dbp;
  84 {
  85         BTREE *t;
  86         int status;
  87
  88         t = dbp->internal;
  89
  90         /* Toss any page pinned across calls. */
  91         if (t->bt_pinned != NULL) {
  92                 mpool_put(t->bt_mp, t->bt_pinned, 0);
  93                 t->bt_pinned = NULL;
  94         }
  95
  96         if (__rec_sync(dbp, 0) == RET_ERROR)
  97                 return (RET_ERROR);
  98
  99         /* Committed to closing. */
 100         status = RET_SUCCESS;
 101         if (ISSET(t, R_MEMMAPPED)
 102         &&  vm_deallocate(mach_task_self(), (vm_offset_t) t->bt_smap, t->bt_msize))
 103                 status = RET_ERROR;
 104
 105         if (!ISSET(t, R_INMEM))
 106                 if (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         if (__bt_close(dbp) == RET_ERROR)
 114                 status = RET_ERROR;
 115
 116         return (status);
 117 }
 118
 119 /*
 120  * __REC_SYNC -- sync the recno tree to disk.
 121  *
 122  * Parameters:
 123  *      dbp:    pointer to access method
 124  *
 125  * Returns:
 126  *      RET_SUCCESS, RET_ERROR.
 127  */
 128 int
 129 __rec_sync(dbp, flags)
 130         const DB *dbp;
 131         u_int flags;
 132 {
 133         struct iovec iov[2];
 134         BTREE *t;
 135         DBT data, key;
 136         off_t off;
 137         recno_t scursor, trec;
 138         int status;
 139
 140         t = dbp->internal;
 141
 142         /* Toss any page pinned across calls. */
 143         if (t->bt_pinned != NULL) {
 144                 mpool_put(t->bt_mp, t->bt_pinned, 0);
 145                 t->bt_pinned = NULL;
 146         }
 147
 148         if (flags == R_RECNOSYNC)
 149                 return (__bt_sync(dbp, 0));
 150
 151         if (ISSET(t, R_RDONLY | R_INMEM) || !ISSET(t, R_MODIFIED))
 152                 return (RET_SUCCESS);
 153
 154         /* Read any remaining records into the tree. */
 155         if (!ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
 156                 return (RET_ERROR);
 157
 158         /* Rewind the file descriptor. */
 159         if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
 160                 return (RET_ERROR);
 161
 162         iov[1].iov_base = "\n";
 163         iov[1].iov_len = 1;
 164         scursor = t->bt_rcursor;
 165
 166         key.size = sizeof(recno_t);
 167         key.data = &trec;
 168
 169         status = (dbp->seq)(dbp, &key, &data, R_FIRST);
 170         while (status == RET_SUCCESS) {
 171                 iov[0].iov_base = data.data;
 172                 iov[0].iov_len = data.size;
 173                 if (writev(t->bt_rfd, iov, 2) != data.size + 1)
 174                         return (RET_ERROR);
 175                 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
 176         }
 177         t->bt_rcursor = scursor;
 178         if (status == RET_ERROR)
 179                 return (RET_ERROR);
 180         if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
 181                 return (RET_ERROR);
 182         if (ftruncate(t->bt_rfd, off))
 183                 return (RET_ERROR);
 184         CLR(t, R_MODIFIED);
 185         return (RET_SUCCESS);
 186 }