db/recno/rec_close-fbsd.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 #include <sys/cdefs.h>
  38 __FBSDID("$FreeBSD: src/lib/libc/db/recno/rec_close.c,v 1.7 2003/02/16 17:29:09 nectar Exp $");
  39
  40 #include "namespace.h"
  41 #include <sys/types.h>
  42 #include <sys/uio.h>
  43 #include <sys/mman.h>
  44
  45 #include <errno.h>
  46 #include <limits.h>
  47 #include <stdio.h>
  48 #include <unistd.h>
  49 #include "un-namespace.h"
  50
  51 #include <db.h>
  52 #include "recno.h"
  53
  54 /*
  55  * __REC_CLOSE -- Close a recno tree.
  56  *
  57  * Parameters:
  58  *      dbp:    pointer to access method
  59  *
  60  * Returns:
  61  *      RET_ERROR, RET_SUCCESS
  62  */
  63 int
  64 __rec_close(dbp)
  65         DB *dbp;
  66 {
  67         BTREE *t;
  68         int status;
  69
  70         t = dbp->internal;
  71
  72         /* Toss any page pinned across calls. */
  73         if (t->bt_pinned != NULL) {
  74                 mpool_put(t->bt_mp, t->bt_pinned, 0);
  75                 t->bt_pinned = NULL;
  76         }
  77
  78         if (__rec_sync(dbp, 0) == RET_ERROR)
  79                 return (RET_ERROR);
  80
  81         /* Committed to closing. */
  82         status = RET_SUCCESS;
  83         if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
  84                 status = RET_ERROR;
  85
  86         if (!F_ISSET(t, R_INMEM)) {
  87                 if (F_ISSET(t, R_CLOSEFP)) {
  88                         if (fclose(t->bt_rfp))
  89                                 status = RET_ERROR;
  90                 } else
  91                         if (_close(t->bt_rfd))
  92                                 status = RET_ERROR;
  93         }
  94
  95         if (__bt_close(dbp) == RET_ERROR)
  96                 status = RET_ERROR;
  97
  98         return (status);
  99 }
 100
 101 /*
 102  * __REC_SYNC -- sync the recno tree to disk.
 103  *
 104  * Parameters:
 105  *      dbp:    pointer to access method
 106  *
 107  * Returns:
 108  *      RET_SUCCESS, RET_ERROR.
 109  */
 110 int
 111 __rec_sync(dbp, flags)
 112         const DB *dbp;
 113         u_int flags;
 114 {
 115         struct iovec iov[2];
 116         BTREE *t;
 117         DBT data, key;
 118         off_t off;
 119         recno_t scursor, trec;
 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         if (flags == R_RECNOSYNC)
 131                 return (__bt_sync(dbp, 0));
 132
 133         if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
 134                 return (RET_SUCCESS);
 135
 136         /* Read any remaining records into the tree. */
 137         if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
 138                 return (RET_ERROR);
 139
 140         /* Rewind the file descriptor. */
 141         if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
 142                 return (RET_ERROR);
 143
 144         /* Save the cursor. */
 145         scursor = t->bt_cursor.rcursor;
 146
 147         key.size = sizeof(recno_t);
 148         key.data = &trec;
 149
 150         if (F_ISSET(t, R_FIXLEN)) {
 151                 /*
 152                  * We assume that fixed length records are all fixed length.
 153                  * Any that aren't are either EINVAL'd or corrected by the
 154                  * record put code.
 155                  */
 156                 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
 157                 while (status == RET_SUCCESS) {
 158                         if (_write(t->bt_rfd, data.data, data.size) !=
 159                             data.size)
 160                                 return (RET_ERROR);
 161                         status = (dbp->seq)(dbp, &key, &data, R_NEXT);
 162                 }
 163         } else {
 164                 iov[1].iov_base = (char *)&t->bt_bval;
 165                 iov[1].iov_len = 1;
 166
 167                 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
 168                 while (status == RET_SUCCESS) {
 169                         iov[0].iov_base = data.data;
 170                         iov[0].iov_len = data.size;
 171                         if (_writev(t->bt_rfd, iov, 2) != data.size + 1)
 172                                 return (RET_ERROR);
 173                         status = (dbp->seq)(dbp, &key, &data, R_NEXT);
 174                 }
 175         }
 176
 177         /* Restore the cursor. */
 178         t->bt_cursor.rcursor = scursor;
 179
 180         if (status == RET_ERROR)
 181                 return (RET_ERROR);
 182         if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
 183                 return (RET_ERROR);
 184         if (ftruncate(t->bt_rfd, off))
 185                 return (RET_ERROR);
 186         F_CLR(t, R_MODIFIED);
 187         return (RET_SUCCESS);
 188 }