1N/A * See the file LICENSE for redistribution information. 1N/A * Copyright (c) 1996, 1997, 1998 1N/A * Sleepycat Software. All rights reserved. 1N/A * Copyright (c) 1990, 1993, 1994, 1995, 1996 1N/A * Keith Bostic. All rights reserved. 1N/A * Copyright (c) 1990, 1993, 1994, 1995 1N/A * The Regents of the University of California. All rights reserved. 1N/A * This code is derived from software contributed to Berkeley by 1N/A * Redistribution and use in source and binary forms, with or without 1N/A * modification, are permitted provided that the following conditions 1N/A * 1. Redistributions of source code must retain the above copyright 1N/A * notice, this list of conditions and the following disclaimer. 1N/A * 2. Redistributions in binary form must reproduce the above copyright 1N/A * notice, this list of conditions and the following disclaimer in the 1N/A * documentation and/or other materials provided with the distribution. 1N/A * 3. All advertising materials mentioning features or use of this software 1N/A * must display the following acknowledgement: 1N/A * This product includes software developed by the University of 1N/A * California, Berkeley and its contributors. 1N/A * 4. Neither the name of the University nor the names of its contributors 1N/A * may be used to endorse or promote products derived from this software 1N/A * without specific prior written permission. 1N/A * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 1N/A * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 1N/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 1N/A * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 1N/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 1N/A * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 1N/A * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 1N/A * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 1N/A * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 1N/A * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 1N/A#
endif /* not lint */ 1N/A * Get a new page, preferably from the freelist. 1N/A * PUBLIC: int __bam_new __P((DBC *, u_int32_t, PAGE **)); 1N/A /* Log the change. */ 1N/A * The standard lock put call. 1N/A * PUBLIC: int __bam_lput __P((DBC *, DB_LOCK)); 1N/A * Add a page to the head of the freelist. 1N/A * PUBLIC: int __bam_free __P((DBC *, PAGE *)); 1N/A * Retrieve the metadata page and insert the page at the head of 1N/A * the free list. If either the lock get or page get routines 1N/A * fail, then we need to put the page with which we were called 1N/A * back because our caller assumes we take care of it. 1N/A /* Log the change. */ 1N/A * The page should have nothing interesting on it, re-initialize it, 1N/A * leaving only the page number and the LSN. 1N/A /* Link the page on the metadata free list. */ 1N/A /* Discard the metadata page. */ 1N/A /* Discard the caller's page reference. */ 1N/A * We have to unlock the caller's page in the caller! 1N/A * Print out the list of locks currently held by a cursor. 1N/A * PUBLIC: int __bam_lt __P((DBC *)); 1N/A * The standard lock get call. 1N/A * PUBLIC: int __bam_lget 1N/A * PUBLIC: __P((DBC *, int, db_pgno_t, db_lockmode_t, DB_LOCK *)); 1N/A * If the object not currently locked, acquire the lock and return, 1N/A * otherwise, lock couple. If we fail and it's not a system error, 1N/A * convert to EAGAIN. 1N/A /* If we fail, discard the lock we held. */