Home | History | Annotate | Line # | Download | only in btree
bt_page.c revision 1.11
      1  1.11  christos /*	$NetBSD: bt_page.c,v 1.11 2007/02/03 23:46:09 christos Exp $	*/
      2   1.5       cgd 
      3   1.1       cgd /*-
      4   1.6       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.10       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.7  christos #include <sys/cdefs.h>
     33   1.1       cgd #if defined(LIBC_SCCS) && !defined(lint)
     34   1.5       cgd #if 0
     35   1.6       cgd static char sccsid[] = "@(#)bt_page.c	8.3 (Berkeley) 7/14/94";
     36   1.5       cgd #else
     37  1.11  christos __RCSID("$NetBSD: bt_page.c,v 1.11 2007/02/03 23:46:09 christos Exp $");
     38   1.5       cgd #endif
     39   1.1       cgd #endif /* LIBC_SCCS and not lint */
     40   1.1       cgd 
     41   1.8       jtc #include "namespace.h"
     42   1.1       cgd #include <sys/types.h>
     43   1.1       cgd 
     44  1.11  christos #include <assert.h>
     45   1.1       cgd #include <stdio.h>
     46   1.1       cgd 
     47   1.1       cgd #include <db.h>
     48   1.1       cgd #include "btree.h"
     49   1.1       cgd 
     50   1.1       cgd /*
     51   1.6       cgd  * __bt_free --
     52   1.6       cgd  *	Put a page on the freelist.
     53   1.1       cgd  *
     54   1.1       cgd  * Parameters:
     55   1.1       cgd  *	t:	tree
     56   1.1       cgd  *	h:	page to free
     57   1.1       cgd  *
     58   1.1       cgd  * Returns:
     59   1.1       cgd  *	RET_ERROR, RET_SUCCESS
     60   1.6       cgd  *
     61   1.6       cgd  * Side-effect:
     62   1.6       cgd  *	mpool_put's the page.
     63   1.1       cgd  */
     64   1.1       cgd int
     65  1.11  christos __bt_free(BTREE *t, PAGE *h)
     66   1.1       cgd {
     67   1.6       cgd 	/* Insert the page at the head of the free list. */
     68   1.1       cgd 	h->prevpg = P_INVALID;
     69   1.1       cgd 	h->nextpg = t->bt_free;
     70   1.1       cgd 	t->bt_free = h->pgno;
     71   1.9        is 	F_SET(t, B_METADIRTY);
     72   1.1       cgd 
     73   1.1       cgd 	/* Make sure the page gets written back. */
     74   1.1       cgd 	return (mpool_put(t->bt_mp, h, MPOOL_DIRTY));
     75   1.1       cgd }
     76   1.1       cgd 
     77   1.1       cgd /*
     78   1.6       cgd  * __bt_new --
     79   1.6       cgd  *	Get a new page, preferably from the freelist.
     80   1.1       cgd  *
     81   1.1       cgd  * Parameters:
     82   1.1       cgd  *	t:	tree
     83   1.1       cgd  *	npg:	storage for page number.
     84   1.1       cgd  *
     85   1.1       cgd  * Returns:
     86   1.1       cgd  *	Pointer to a page, NULL on error.
     87   1.1       cgd  */
     88   1.1       cgd PAGE *
     89  1.11  christos __bt_new(BTREE *t, pgno_t *npg)
     90   1.1       cgd {
     91   1.1       cgd 	PAGE *h;
     92   1.1       cgd 
     93   1.1       cgd 	if (t->bt_free != P_INVALID &&
     94   1.1       cgd 	    (h = mpool_get(t->bt_mp, t->bt_free, 0)) != NULL) {
     95   1.6       cgd 		*npg = t->bt_free;
     96   1.6       cgd 		t->bt_free = h->nextpg;
     97   1.9        is 		F_SET(t, B_METADIRTY);
     98   1.6       cgd 		return (h);
     99   1.1       cgd 	}
    100   1.1       cgd 	return (mpool_new(t->bt_mp, npg));
    101   1.1       cgd }
    102