mirror of
https://sourceware.org/git/glibc.git
synced 2024-12-22 19:00:07 +00:00
bf7997b65c
1998-06-09 Ulrich Drepper <drepper@cygnus.com> * sysdeps/unix/sysv/linux/netinet/ip.h (struct ip_options): Define __data member only for gcc. Reported by ak@muc.de. * misc/mntent.h: Undo last patch. * sysdeps/unix/sysv/linux/fstatvfs.c (fstatvfs): Undo last patch. * misc/tst/mntent.c: Adjust code for this change. * io/fts.c: Updated from a slightly more recent BSD version. * io/fts.h: Likewise. * libc.map: Add __libc_stack_end. * db2/Makefile (routines): Add lock_region. * db2/config.h: Update from db-2.4.14. * db2/db.h: Likewise. * db2/db_185.h: Likewise. * db2/db_int.h: Likewise. * db2/bt_close.c: Likewise. * db2/bt_compare.c: Likewise. * db2/bt_conv.c: Likewise. * db2/bt_cursor.c: Likewise. * db2/bt_delete.c: Likewise. * db2/bt_open.c: Likewise. * db2/bt_page.c: Likewise. * db2/bt_put.c: Likewise. * db2/bt_rec.c: Likewise. * db2/bt_recno.c: Likewise. * db2/bt_rsearch.c: Likewise. * db2/bt_search.c: Likewise. * db2/bt_split.c: Likewise. * db2/bt_stat.c: Likewise. * db2/btree.src: Likewise. * db2/btree_auto.c: Likewise. * db2/getlong.c: Likewise. * db2/db_appinit.c: Likewise. * db2/db_apprec.c: Likewise. * db2/db_byteorder.c: Likewise. * db2/db_err.c: Likewise. * db2/db_log2.c: Likewise. * db2/db_region.c: Likewise. * db2/db_salloc.c: Likewise. * db2/db_shash.c: Likewise. * db2/db.c: Likewise. * db2/db.src: Likewise. * db2/db_auto.c: Likewise. * db2/db_conv.c: Likewise. * db2/db_dispatch.c: Likewise. * db2/db_dup.c: Likewise. * db2/db_overflow.c: Likewise. * db2/db_pr.c: Likewise. * db2/db_rec.c: Likewise. * db2/db_ret.c: Likewise. * db2/db_thread.c: Likewise. * db2/db185.c: Likewise. * db2/db185_int.h: Likewise. * db2/dbm.c: Likewise. * db2/hash.c: Likewise. * db2/hash.src: Likewise. * db2/hash_auto.c: Likewise. * db2/hash_conv.c: Likewise. * db2/hash_debug.c: Likewise. * db2/hash_dup.c: Likewise. * db2/hash_func.c: Likewise. * db2/hash_page.c: Likewise. * db2/hash_rec.c: Likewise. * db2/hash_stat.c: Likewise. * db2/btree.h: Likewise. * db2/btree_ext.h: Likewise. * db2/clib_ext.h: Likewise. * db2/common_ext.h: Likewise. * db2/cxx_int.h: Likewise. * db2/db.h.src: Likewise. * db2/db_185.h.src: Likewise. * db2/db_am.h: Likewise. * db2/db_auto.h: Likewise. * db2/db_cxx.h: Likewise. * db2/db_dispatch.h: Likewise. * db2/db_ext.h: Likewise. * db2/db_int.h.src: Likewise. * db2/db_page.h: Likewise. * db2/db_shash.h: Likewise. * db2/db_swap.h: Likewise. * db2/hash.h: Likewise. * db2/hash_ext.h: Likewise. * db2/lock.h: Likewise. * db2/lock_ext.h: Likewise. * db2/log.h: Likewise. * db2/log_ext.h: Likewise. * db2/mp.h: Likewise. * db2/mp_ext.h: Likewise. * db2/mutex_ext.h: Likewise. * db2/os_ext.h: Likewise. * db2/os_func.h: Likewise. * db2/queue.h: Likewise. * db2/shqueue.h: Likewise. * db2/txn.h: Likewise. * db2/lock.c: Likewise. * db2/lock_conflict.c: Likewise. * db2/lock_deadlock.c: Likewise. * db2/lock_region.c: Likewise. * db2/lock_util.c: Likewise. * db2/log.c: Likewise. * db2/log.src: Likewise. * db2/log_archive.c: Likewise. * db2/log_auto.c: Likewise. * db2/log_compare.c: Likewise. * db2/log_findckp.c: Likewise. * db2/log_get.c: Likewise. * db2/log_put.c: Likewise. * db2/log_rec.c: Likewise. * db2/log_register.c: Likewise. * db2/mp_bh.c: Likewise. * db2/mp_fget.c: Likewise. * db2/mp_fopen.c: Likewise. * db2/mp_fput.c: Likewise. * db2/mp_fset.c: Likewise. * db2/mp_open.c: Likewise. * db2/mp_pr.c: Likewise. * db2/mp_region.c: Likewise. * db2/mp_sync.c: Likewise. * db2/68020.gcc: Likewise. * db2/mutex.c: Likewise. * db2/parisc.gcc: Likewise. * db2/parisc.hp: Likewise. * db2/sco.cc: Likewise. * db2/os_abs.c: Likewise. * db2/os_alloc.c: Likewise. * db2/os_config.c: Likewise. * db2/os_dir.c: Likewise. * db2/os_fid.c: Likewise. * db2/os_fsync.c: Likewise. * db2/os_map.c: Likewise. * db2/os_oflags.c: Likewise. * db2/os_open.c: Likewise. * db2/os_rpath.c: Likewise. * db2/os_rw.c: Likewise. * db2/os_seek.c: Likewise. * db2/os_sleep.c: Likewise. * db2/os_spin.c: Likewise. * db2/os_stat.c: Likewise. * db2/os_unlink.c: Likewise. * db2/db_archive.c: Likewise. * db2/db_checkpoint.c: Likewise. * db2/db_deadlock.c: Likewise. * db2/db_dump.c: Likewise. * db2/db_dump185.c: Likewise. * db2/db_load.c: Likewise. * db2/db_printlog.c: Likewise. * db2/db_recover.c: Likewise. * db2/db_stat.c: Likewise. * db2/txn.c: Likewise. * db2/txn.src: Likewise. * db2/txn_auto.c: Likewise. * db2/txn_rec.c: Likewise. * elf/rtld.c: Move definition of __libc_stack_end to ... * sysdeps/generic/dl-sysdep.h: ...here. * sysdeps/unix/sysv/linux/fstatvfs.c: Handle nodiratime option. * sysdeps/unix/sysv/linux/bits/statvfs.h: Define ST_NODIRATIME. * sysdeps/unix/sysv/linux/sys/mount.h: Define MS_NODIRATIME. 1998-06-08 21:44 Ulrich Drepper <drepper@cygnus.com> * sysdeps/unix/sysv/linux/fstatvfs.c: Handle constant option string from mntent correctly. 1998-06-06 Andreas Jaeger <aj@arthur.rhein-neckar.de> * sunrpc/Makefile (generated): Correct typo. 1998-06-04 Philip Blundell <philb@gnu.org> * elf/elf.h (EM_ARM, et al.): New definitions. * sysdeps/arm/dl-machine.h: Update for new draft ARM ELF ABI.
384 lines
9.6 KiB
C
384 lines
9.6 KiB
C
/*-
|
|
* See the file LICENSE for redistribution information.
|
|
*
|
|
* Copyright (c) 1996, 1997, 1998
|
|
* Sleepycat Software. All rights reserved.
|
|
*/
|
|
/*
|
|
* Copyright (c) 1990, 1993, 1994, 1995, 1996
|
|
* Keith Bostic. All rights reserved.
|
|
*/
|
|
/*
|
|
* Copyright (c) 1990, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#ifndef lint
|
|
static const char sccsid[] = "@(#)bt_rsearch.c 10.15 (Sleepycat) 5/6/98";
|
|
#endif /* not lint */
|
|
|
|
#ifndef NO_SYSTEM_INCLUDES
|
|
#include <sys/types.h>
|
|
#endif
|
|
|
|
#include "db_int.h"
|
|
#include "db_page.h"
|
|
#include "btree.h"
|
|
|
|
/*
|
|
* __bam_rsearch --
|
|
* Search a btree for a record number.
|
|
*
|
|
* PUBLIC: int __bam_rsearch __P((DB *, db_recno_t *, u_int32_t, int, int *));
|
|
*/
|
|
int
|
|
__bam_rsearch(dbp, recnop, flags, stop, exactp)
|
|
DB *dbp;
|
|
db_recno_t *recnop;
|
|
u_int32_t flags;
|
|
int stop, *exactp;
|
|
{
|
|
BINTERNAL *bi;
|
|
BTREE *t;
|
|
DB_LOCK lock;
|
|
PAGE *h;
|
|
RINTERNAL *ri;
|
|
db_indx_t indx, top;
|
|
db_pgno_t pg;
|
|
db_recno_t i, recno, total;
|
|
int isappend, ret, stack;
|
|
|
|
t = dbp->internal;
|
|
|
|
/*
|
|
* We test for groups of flags, S_APPEND is the only one that can be
|
|
* OR'd into the set. Clear it now so that the tests for equality
|
|
* will work.
|
|
*/
|
|
if ((isappend = LF_ISSET(S_APPEND)) != 0)
|
|
LF_CLR(S_APPEND);
|
|
|
|
/*
|
|
* There are several ways we search a btree tree. The flags argument
|
|
* specifies if we're acquiring read or write locks and if we are
|
|
* locking pairs of pages. See btree.h for more details.
|
|
*
|
|
* If write-locking pages, we need to know whether or not to acquire a
|
|
* write lock on a page before getting it. This depends on how deep it
|
|
* is in tree, which we don't know until we acquire the root page. So,
|
|
* if we need to lock the root page we may have to upgrade it later,
|
|
* because we won't get the correct lock initially.
|
|
*
|
|
* Retrieve the root page.
|
|
*/
|
|
pg = PGNO_ROOT;
|
|
if ((ret = __bam_lget(dbp, 0, PGNO_ROOT,
|
|
flags == S_INSERT || flags == S_DELETE ?
|
|
DB_LOCK_WRITE : DB_LOCK_READ, &lock)) != 0)
|
|
return (ret);
|
|
if ((ret = __bam_pget(dbp, &h, &pg, 0)) != 0) {
|
|
(void)__BT_LPUT(dbp, lock);
|
|
return (ret);
|
|
}
|
|
total = RE_NREC(h);
|
|
|
|
/*
|
|
* If appending to the tree, set the record number now -- we have the
|
|
* root page locked.
|
|
*
|
|
* Delete only deletes exact matches, read only returns exact matches.
|
|
* Note, this is different from __bam_search(), which returns non-exact
|
|
* matches for read.
|
|
*
|
|
* The record may not exist. We can only return the correct location
|
|
* for the record immediately after the last record in the tree, so do
|
|
* a fast check now.
|
|
*/
|
|
if (isappend) {
|
|
*exactp = 0;
|
|
*recnop = recno = total + 1;
|
|
} else {
|
|
recno = *recnop;
|
|
if (recno <= total)
|
|
*exactp = 1;
|
|
else {
|
|
*exactp = 0;
|
|
if (!PAST_END_OK(flags) || recno > total + 1) {
|
|
(void)memp_fput(dbp->mpf, h, 0);
|
|
(void)__BT_LPUT(dbp, lock);
|
|
return (DB_NOTFOUND);
|
|
}
|
|
}
|
|
}
|
|
|
|
/* Decide if we're building a stack based on the operation. */
|
|
BT_STK_CLR(t);
|
|
stack = flags == S_DELETE || flags == S_INSERT;
|
|
|
|
/*
|
|
* Decide if we need to save this page; if we do, write lock it, and
|
|
* start to build a stack.
|
|
*/
|
|
if (LF_ISSET(S_PARENT) && (u_int8_t)(stop + 1) >= h->level) {
|
|
(void)memp_fput(dbp->mpf, h, 0);
|
|
if ((ret = __bam_lget(dbp, 1, pg, DB_LOCK_WRITE, &lock)) != 0)
|
|
return (ret);
|
|
if ((ret = __bam_pget(dbp, &h, &pg, 0)) != 0) {
|
|
(void)__BT_LPUT(dbp, lock);
|
|
return (ret);
|
|
}
|
|
stack = 1;
|
|
}
|
|
|
|
/*
|
|
* !!!
|
|
* Record numbers in the tree are 0-based, but the recno is
|
|
* 1-based. All of the calculations below have to take this
|
|
* into account.
|
|
*/
|
|
for (total = 0;;) {
|
|
switch (TYPE(h)) {
|
|
case P_LBTREE:
|
|
recno -= total;
|
|
|
|
/*
|
|
* There may be logically deleted records on the page,
|
|
* walk the page correcting for them. The record may
|
|
* not exist if there are enough deleted records in the
|
|
* page.
|
|
*/
|
|
if (recno <= NUM_ENT(h))
|
|
for (i = recno - 1;; --i) {
|
|
if (B_DISSET(GET_BKEYDATA(h,
|
|
i * P_INDX + O_INDX)->type))
|
|
++recno;
|
|
if (i == 0)
|
|
break;
|
|
}
|
|
if (recno > NUM_ENT(h)) {
|
|
*exactp = 0;
|
|
if (!PAST_END_OK(flags) ||
|
|
recno > (db_recno_t)(NUM_ENT(h) + 1)) {
|
|
ret = DB_NOTFOUND;
|
|
goto err;
|
|
}
|
|
|
|
}
|
|
|
|
/* Correct from 1-based to 0-based for a page offset. */
|
|
--recno;
|
|
BT_STK_ENTER(t, h, recno * P_INDX, lock, ret);
|
|
return (ret);
|
|
case P_IBTREE:
|
|
for (indx = 0, top = NUM_ENT(h);;) {
|
|
bi = GET_BINTERNAL(h, indx);
|
|
if (++indx == top || total + bi->nrecs >= recno)
|
|
break;
|
|
total += bi->nrecs;
|
|
}
|
|
pg = bi->pgno;
|
|
break;
|
|
case P_LRECNO:
|
|
recno -= total;
|
|
|
|
/* Correct from 1-based to 0-based for a page offset. */
|
|
--recno;
|
|
BT_STK_ENTER(t, h, recno, lock, ret);
|
|
return (ret);
|
|
case P_IRECNO:
|
|
for (indx = 0, top = NUM_ENT(h);;) {
|
|
ri = GET_RINTERNAL(h, indx);
|
|
if (++indx == top || total + ri->nrecs >= recno)
|
|
break;
|
|
total += ri->nrecs;
|
|
}
|
|
pg = ri->pgno;
|
|
break;
|
|
default:
|
|
return (__db_pgfmt(dbp, h->pgno));
|
|
}
|
|
--indx;
|
|
|
|
if (stack) {
|
|
/* Return if this is the lowest page wanted. */
|
|
if (LF_ISSET(S_PARENT) && stop == h->level) {
|
|
BT_STK_ENTER(t, h, indx, lock, ret);
|
|
return (ret);
|
|
}
|
|
BT_STK_PUSH(t, h, indx, lock, ret);
|
|
if (ret)
|
|
goto err;
|
|
|
|
if ((ret = __bam_lget(dbp, 0, pg,
|
|
LF_ISSET(S_WRITE) ? DB_LOCK_WRITE : DB_LOCK_READ,
|
|
&lock)) != 0)
|
|
goto err;
|
|
} else {
|
|
(void)memp_fput(dbp->mpf, h, 0);
|
|
|
|
/*
|
|
* Decide if we want to return a pointer to the next
|
|
* page in the stack. If we do, write lock it and
|
|
* never unlock it.
|
|
*/
|
|
if (LF_ISSET(S_PARENT) &&
|
|
(u_int8_t)(stop + 1) >= (u_int8_t)(h->level - 1))
|
|
stack = 1;
|
|
|
|
if ((ret = __bam_lget(dbp, 1, pg,
|
|
LF_ISSET(S_WRITE) ? DB_LOCK_WRITE : DB_LOCK_READ,
|
|
&lock)) != 0)
|
|
goto err;
|
|
}
|
|
|
|
if ((ret = __bam_pget(dbp, &h, &pg, 0)) != 0)
|
|
goto err;
|
|
}
|
|
/* NOTREACHED */
|
|
|
|
err: BT_STK_POP(t);
|
|
__bam_stkrel(dbp);
|
|
return (ret);
|
|
}
|
|
|
|
/*
|
|
* __bam_adjust --
|
|
* Adjust the tree after adding or deleting a record.
|
|
*
|
|
* PUBLIC: int __bam_adjust __P((DB *, BTREE *, int32_t));
|
|
*/
|
|
int
|
|
__bam_adjust(dbp, t, adjust)
|
|
DB *dbp;
|
|
BTREE *t;
|
|
int32_t adjust;
|
|
{
|
|
EPG *epg;
|
|
PAGE *h;
|
|
int ret;
|
|
|
|
/* Update the record counts for the tree. */
|
|
for (epg = t->bt_sp; epg <= t->bt_csp; ++epg) {
|
|
h = epg->page;
|
|
if (TYPE(h) == P_IBTREE || TYPE(h) == P_IRECNO) {
|
|
if (DB_LOGGING(dbp) &&
|
|
(ret = __bam_cadjust_log(dbp->dbenv->lg_info,
|
|
dbp->txn, &LSN(h), 0, dbp->log_fileid,
|
|
PGNO(h), &LSN(h), (u_int32_t)epg->indx,
|
|
adjust, 1)) != 0)
|
|
return (ret);
|
|
|
|
if (TYPE(h) == P_IBTREE)
|
|
GET_BINTERNAL(h, epg->indx)->nrecs += adjust;
|
|
else
|
|
GET_RINTERNAL(h, epg->indx)->nrecs += adjust;
|
|
|
|
if (PGNO(h) == PGNO_ROOT)
|
|
RE_NREC_ADJ(h, adjust);
|
|
|
|
if ((ret = memp_fset(dbp->mpf, h, DB_MPOOL_DIRTY)) != 0)
|
|
return (ret);
|
|
}
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __bam_nrecs --
|
|
* Return the number of records in the tree.
|
|
*
|
|
* PUBLIC: int __bam_nrecs __P((DB *, db_recno_t *));
|
|
*/
|
|
int
|
|
__bam_nrecs(dbp, rep)
|
|
DB *dbp;
|
|
db_recno_t *rep;
|
|
{
|
|
DB_LOCK lock;
|
|
PAGE *h;
|
|
db_pgno_t pgno;
|
|
int ret;
|
|
|
|
pgno = PGNO_ROOT;
|
|
if ((ret = __bam_lget(dbp, 0, pgno, DB_LOCK_READ, &lock)) != 0)
|
|
return (ret);
|
|
if ((ret = __bam_pget(dbp, &h, &pgno, 0)) != 0)
|
|
return (ret);
|
|
|
|
*rep = RE_NREC(h);
|
|
|
|
(void)memp_fput(dbp->mpf, h, 0);
|
|
(void)__BT_TLPUT(dbp, lock);
|
|
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* __bam_total --
|
|
* Return the number of records below a page.
|
|
*
|
|
* PUBLIC: db_recno_t __bam_total __P((PAGE *));
|
|
*/
|
|
db_recno_t
|
|
__bam_total(h)
|
|
PAGE *h;
|
|
{
|
|
db_recno_t nrecs;
|
|
db_indx_t indx, top;
|
|
|
|
nrecs = 0;
|
|
top = NUM_ENT(h);
|
|
|
|
switch (TYPE(h)) {
|
|
case P_LBTREE:
|
|
/* Check for logically deleted records. */
|
|
for (indx = 0; indx < top; indx += P_INDX)
|
|
if (!B_DISSET(GET_BKEYDATA(h, indx + O_INDX)->type))
|
|
++nrecs;
|
|
break;
|
|
case P_IBTREE:
|
|
for (indx = 0; indx < top; indx += O_INDX)
|
|
nrecs += GET_BINTERNAL(h, indx)->nrecs;
|
|
break;
|
|
case P_LRECNO:
|
|
nrecs = NUM_ENT(h);
|
|
break;
|
|
case P_IRECNO:
|
|
for (indx = 0; indx < top; indx += O_INDX)
|
|
nrecs += GET_RINTERNAL(h, indx)->nrecs;
|
|
break;
|
|
}
|
|
|
|
return (nrecs);
|
|
}
|