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