db.1.85/recno/rec_close.c

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