Home | History | Annotate | Line # | Download | only in btree
bt_page.c revision 1.6.2.1
      1  1.6.2.1  jtc /*	$NetBSD: bt_page.c,v 1.6.2.1 1996/09/16 18:39:42 jtc 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.1  cgd  * 3. All advertising materials mentioning features or use of this software
     16      1.1  cgd  *    must display the following acknowledgement:
     17      1.1  cgd  *	This product includes software developed by the University of
     18      1.1  cgd  *	California, Berkeley and its contributors.
     19      1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     20      1.1  cgd  *    may be used to endorse or promote products derived from this software
     21      1.1  cgd  *    without specific prior written permission.
     22      1.1  cgd  *
     23      1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24      1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25      1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26      1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27      1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28      1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29      1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30      1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31      1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32      1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33      1.1  cgd  * SUCH DAMAGE.
     34      1.1  cgd  */
     35      1.1  cgd 
     36      1.1  cgd #if defined(LIBC_SCCS) && !defined(lint)
     37      1.5  cgd #if 0
     38      1.6  cgd static char sccsid[] = "@(#)bt_page.c	8.3 (Berkeley) 7/14/94";
     39      1.5  cgd #else
     40  1.6.2.1  jtc static char rcsid[] = "$NetBSD: bt_page.c,v 1.6.2.1 1996/09/16 18:39:42 jtc Exp $";
     41      1.5  cgd #endif
     42      1.1  cgd #endif /* LIBC_SCCS and not lint */
     43      1.1  cgd 
     44  1.6.2.1  jtc #include "namespace.h"
     45      1.1  cgd #include <sys/types.h>
     46      1.1  cgd 
     47      1.1  cgd #include <stdio.h>
     48      1.1  cgd 
     49      1.1  cgd #include <db.h>
     50      1.1  cgd #include "btree.h"
     51      1.1  cgd 
     52      1.1  cgd /*
     53      1.6  cgd  * __bt_free --
     54      1.6  cgd  *	Put a page on the freelist.
     55      1.1  cgd  *
     56      1.1  cgd  * Parameters:
     57      1.1  cgd  *	t:	tree
     58      1.1  cgd  *	h:	page to free
     59      1.1  cgd  *
     60      1.1  cgd  * Returns:
     61      1.1  cgd  *	RET_ERROR, RET_SUCCESS
     62      1.6  cgd  *
     63      1.6  cgd  * Side-effect:
     64      1.6  cgd  *	mpool_put's the page.
     65      1.1  cgd  */
     66      1.1  cgd int
     67      1.1  cgd __bt_free(t, h)
     68      1.1  cgd 	BTREE *t;
     69      1.1  cgd 	PAGE *h;
     70      1.1  cgd {
     71      1.6  cgd 	/* Insert the page at the head of the free list. */
     72      1.1  cgd 	h->prevpg = P_INVALID;
     73      1.1  cgd 	h->nextpg = t->bt_free;
     74      1.1  cgd 	t->bt_free = h->pgno;
     75      1.1  cgd 
     76      1.1  cgd 	/* Make sure the page gets written back. */
     77      1.1  cgd 	return (mpool_put(t->bt_mp, h, MPOOL_DIRTY));
     78      1.1  cgd }
     79      1.1  cgd 
     80      1.1  cgd /*
     81      1.6  cgd  * __bt_new --
     82      1.6  cgd  *	Get a new page, preferably from the freelist.
     83      1.1  cgd  *
     84      1.1  cgd  * Parameters:
     85      1.1  cgd  *	t:	tree
     86      1.1  cgd  *	npg:	storage for page number.
     87      1.1  cgd  *
     88      1.1  cgd  * Returns:
     89      1.1  cgd  *	Pointer to a page, NULL on error.
     90      1.1  cgd  */
     91      1.1  cgd PAGE *
     92      1.1  cgd __bt_new(t, npg)
     93      1.1  cgd 	BTREE *t;
     94      1.1  cgd 	pgno_t *npg;
     95      1.1  cgd {
     96      1.1  cgd 	PAGE *h;
     97      1.1  cgd 
     98      1.1  cgd 	if (t->bt_free != P_INVALID &&
     99      1.1  cgd 	    (h = mpool_get(t->bt_mp, t->bt_free, 0)) != NULL) {
    100      1.6  cgd 		*npg = t->bt_free;
    101      1.6  cgd 		t->bt_free = h->nextpg;
    102      1.6  cgd 		return (h);
    103      1.1  cgd 	}
    104      1.1  cgd 	return (mpool_new(t->bt_mp, npg));
    105      1.1  cgd }
    106