Home | History | Annotate | Line # | Download | only in btree
bt_page.c revision 1.1 
      1 /*-
      2  * Copyright (c) 1990, 1993
      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[] = "@(#)bt_page.c	8.1 (Berkeley) 6/4/93";
     36 #endif /* LIBC_SCCS and not lint */
     37 
     38 #include <sys/types.h>
     39 
     40 #define	__DBINTERFACE_PRIVATE
     41 #include <stdio.h>
     42 
     43 #include <db.h>
     44 #include "btree.h"
     45 
     46 /*
     47  * __BT_FREE -- Put a page on the freelist.
     48  *
     49  * Parameters:
     50  *	t:	tree
     51  *	h:	page to free
     52  *
     53  * Returns:
     54  *	RET_ERROR, RET_SUCCESS
     55  */
     56 int
     57 __bt_free(t, h)
     58 	BTREE *t;
     59 	PAGE *h;
     60 {
     61 	/* Insert the page at the start of the free list. */
     62 	h->prevpg = P_INVALID;
     63 	h->nextpg = t->bt_free;
     64 	t->bt_free = h->pgno;
     65 
     66 	/* Make sure the page gets written back. */
     67 	return (mpool_put(t->bt_mp, h, MPOOL_DIRTY));
     68 }
     69 
     70 /*
     71  * __BT_NEW -- Get a new page, preferably from the freelist.
     72  *
     73  * Parameters:
     74  *	t:	tree
     75  *	npg:	storage for page number.
     76  *
     77  * Returns:
     78  *	Pointer to a page, NULL on error.
     79  */
     80 PAGE *
     81 __bt_new(t, npg)
     82 	BTREE *t;
     83 	pgno_t *npg;
     84 {
     85 	PAGE *h;
     86 
     87 	if (t->bt_free != P_INVALID &&
     88 	    (h = mpool_get(t->bt_mp, t->bt_free, 0)) != NULL) {
     89 			*npg = t->bt_free;
     90 			t->bt_free = h->nextpg;
     91 			return (h);
     92 	}
     93 	return (mpool_new(t->bt_mp, npg));
     94 }
     95