Deleted Added
sdiff udiff text old ( 1573 ) new ( 14272 )
full compact
bt_page.c (1573) bt_page.c (14272)
1/*-
1/*-
2 * Copyright (c) 1990, 1993
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

--- 16 unchanged lines hidden (view full) ---

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)
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

--- 16 unchanged lines hidden (view full) ---

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