1997-08-27 22:26:10 +02:00
|
|
|
/*-
|
|
|
|
* See the file LICENSE for redistribution information.
|
|
|
|
*
|
|
|
|
* Copyright (c) 1996, 1997
|
|
|
|
* Sleepycat Software. All rights reserved.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
|
|
|
|
#ifndef lint
|
1998-01-25 18:01:47 +01:00
|
|
|
static const char sccsid[] = "@(#)db_dup.c 10.11 (Sleepycat) 1/8/98";
|
1997-08-27 22:26:10 +02:00
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
#ifndef NO_SYSTEM_INCLUDES
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
|
|
|
|
#include <errno.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "db_int.h"
|
|
|
|
#include "db_page.h"
|
|
|
|
#include "db_swap.h"
|
|
|
|
#include "btree.h"
|
|
|
|
#include "db_am.h"
|
|
|
|
#include "common_ext.h"
|
|
|
|
|
|
|
|
static int __db_addpage __P((DB *,
|
|
|
|
PAGE **, db_indx_t *, int (*)(DB *, u_int32_t, PAGE **)));
|
|
|
|
static int __db_dsplit __P((DB *,
|
|
|
|
PAGE **, db_indx_t *, u_int32_t, int (*)(DB *, u_int32_t, PAGE **)));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_dput --
|
|
|
|
* Put a duplicate item onto a duplicate page at the given index.
|
|
|
|
*
|
|
|
|
* PUBLIC: int __db_dput __P((DB *,
|
|
|
|
* PUBLIC: DBT *, PAGE **, db_indx_t *, int (*)(DB *, u_int32_t, PAGE **)));
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
__db_dput(dbp, dbt, pp, indxp, newfunc)
|
|
|
|
DB *dbp;
|
|
|
|
DBT *dbt;
|
|
|
|
PAGE **pp;
|
|
|
|
db_indx_t *indxp;
|
|
|
|
int (*newfunc) __P((DB *, u_int32_t, PAGE **));
|
|
|
|
{
|
|
|
|
BOVERFLOW bo;
|
|
|
|
DBT *data_dbtp, hdr_dbt, *hdr_dbtp;
|
|
|
|
PAGE *pagep;
|
|
|
|
db_indx_t size, isize;
|
|
|
|
db_pgno_t pgno;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We need some access method independent threshold for when we put
|
|
|
|
* a duplicate item onto an overflow page.
|
|
|
|
*/
|
|
|
|
if (dbt->size > 0.25 * dbp->pgsize) {
|
|
|
|
if ((ret = __db_poff(dbp, dbt, &pgno, newfunc)) != 0)
|
|
|
|
return (ret);
|
1997-09-05 03:43:20 +02:00
|
|
|
B_TSET(bo.type, B_OVERFLOW, 0);
|
1997-08-27 22:26:10 +02:00
|
|
|
bo.tlen = dbt->size;
|
|
|
|
bo.pgno = pgno;
|
|
|
|
hdr_dbt.data = &bo;
|
|
|
|
hdr_dbt.size = isize = BOVERFLOW_SIZE;
|
|
|
|
hdr_dbtp = &hdr_dbt;
|
|
|
|
size = BOVERFLOW_PSIZE;
|
|
|
|
data_dbtp = NULL;
|
|
|
|
} else {
|
|
|
|
size = BKEYDATA_PSIZE(dbt->size);
|
|
|
|
isize = BKEYDATA_SIZE(dbt->size);
|
|
|
|
hdr_dbtp = NULL;
|
|
|
|
data_dbtp = dbt;
|
|
|
|
}
|
|
|
|
|
|
|
|
pagep = *pp;
|
|
|
|
if (size > P_FREESPACE(pagep)) {
|
|
|
|
if (*indxp == NUM_ENT(*pp) && NEXT_PGNO(*pp) == PGNO_INVALID)
|
|
|
|
ret = __db_addpage(dbp, pp, indxp, newfunc);
|
|
|
|
else
|
|
|
|
ret = __db_dsplit(dbp, pp, indxp, isize, newfunc);
|
|
|
|
if (ret != 0)
|
|
|
|
/* XXX: Pages not returned to free list. */
|
|
|
|
return (ret);
|
|
|
|
pagep = *pp;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now, pagep references the page on which to insert and indx is the
|
|
|
|
* the location to insert.
|
|
|
|
*/
|
|
|
|
if ((ret = __db_pitem(dbp,
|
|
|
|
pagep, (u_int32_t)*indxp, isize, hdr_dbtp, data_dbtp)) != 0)
|
|
|
|
return (ret);
|
|
|
|
|
|
|
|
(void)memp_fset(dbp->mpf, pagep, DB_MPOOL_DIRTY);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_drem --
|
|
|
|
* Remove a duplicate at the given index on the given page.
|
|
|
|
*
|
|
|
|
* PUBLIC: int __db_drem __P((DB *,
|
|
|
|
* PUBLIC: PAGE **, u_int32_t, int (*)(DB *, PAGE *)));
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
__db_drem(dbp, pp, indx, freefunc)
|
|
|
|
DB *dbp;
|
|
|
|
PAGE **pp;
|
|
|
|
u_int32_t indx;
|
|
|
|
int (*freefunc) __P((DB *, PAGE *));
|
|
|
|
{
|
|
|
|
PAGE *pagep;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
pagep = *pp;
|
|
|
|
|
|
|
|
/* Check if we are freeing a big item. */
|
1997-09-05 03:43:20 +02:00
|
|
|
if (B_TYPE(GET_BKEYDATA(pagep, indx)->type) == B_OVERFLOW) {
|
1997-08-27 22:26:10 +02:00
|
|
|
if ((ret = __db_doff(dbp,
|
|
|
|
GET_BOVERFLOW(pagep, indx)->pgno, freefunc)) != 0)
|
|
|
|
return (ret);
|
|
|
|
ret = __db_ditem(dbp, pagep, indx, BOVERFLOW_SIZE);
|
|
|
|
} else
|
|
|
|
ret = __db_ditem(dbp, pagep, indx,
|
|
|
|
BKEYDATA_SIZE(GET_BKEYDATA(pagep, indx)->len));
|
|
|
|
if (ret != 0)
|
|
|
|
return (ret);
|
|
|
|
|
|
|
|
if (NUM_ENT(pagep) == 0) {
|
|
|
|
/*
|
|
|
|
* If the page is emptied, then the page is freed and the pp
|
|
|
|
* parameter is set to reference the next, locked page in the
|
|
|
|
* duplicate chain, if one exists. If there was no such page,
|
|
|
|
* then it is set to NULL.
|
|
|
|
*
|
|
|
|
* !!!
|
|
|
|
* __db_relink will set the dirty bit for us.
|
|
|
|
*/
|
|
|
|
if ((ret = __db_relink(dbp, pagep, pp, 0)) != 0)
|
|
|
|
return (ret);
|
|
|
|
if ((ret = freefunc(dbp, pagep)) != 0)
|
|
|
|
return (ret);
|
|
|
|
} else
|
|
|
|
(void)memp_fset(dbp->mpf, pagep, DB_MPOOL_DIRTY);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_dend --
|
|
|
|
* Find the last page in a set of offpage duplicates.
|
|
|
|
*
|
|
|
|
* PUBLIC: int __db_dend __P((DB *, db_pgno_t, PAGE **));
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
__db_dend(dbp, pgno, pagep)
|
|
|
|
DB *dbp;
|
|
|
|
db_pgno_t pgno;
|
|
|
|
PAGE **pagep;
|
|
|
|
{
|
|
|
|
PAGE *h;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This implements DB_KEYLAST. The last page is returned in pp; pgno
|
|
|
|
* should be the page number of the first page of the duplicate chain.
|
|
|
|
*/
|
|
|
|
for (;;) {
|
|
|
|
if ((ret = memp_fget(dbp->mpf, &pgno, 0, &h)) != 0) {
|
|
|
|
(void)__db_pgerr(dbp, pgno);
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
if ((pgno = NEXT_PGNO(h)) == PGNO_INVALID)
|
|
|
|
break;
|
|
|
|
(void)memp_fput(dbp->mpf, h, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
*pagep = h;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_dsplit --
|
|
|
|
* Split a page of duplicates, calculating the split point based
|
|
|
|
* on an element of size "size" being added at "*indxp".
|
|
|
|
* On entry hp contains a pointer to the page-pointer of the original
|
|
|
|
* page. On exit, it returns a pointer to the page containing "*indxp"
|
|
|
|
* and "indxp" has been modified to reflect the index on the new page
|
|
|
|
* where the element should be added. The function returns with
|
|
|
|
* the page on which the insert should happen, not yet put.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
__db_dsplit(dbp, hp, indxp, size, newfunc)
|
|
|
|
DB *dbp;
|
|
|
|
PAGE **hp;
|
|
|
|
db_indx_t *indxp;
|
|
|
|
u_int32_t size;
|
|
|
|
int (*newfunc) __P((DB *, u_int32_t, PAGE **));
|
|
|
|
{
|
|
|
|
PAGE *h, *np, *tp;
|
|
|
|
BKEYDATA *bk;
|
|
|
|
DBT page_dbt;
|
|
|
|
db_indx_t indx, nindex, oindex, sum;
|
|
|
|
db_indx_t halfbytes, i, lastsum;
|
|
|
|
int did_indx, ret, s;
|
|
|
|
|
|
|
|
h = *hp;
|
|
|
|
indx = *indxp;
|
|
|
|
|
|
|
|
/* Create a temporary page to do compaction onto. */
|
Update.
1997-11-11 21:30 Ulrich Drepper <drepper@cygnus.com>
* include/sys/stat.h: Define stat, fstat, lstat and *64 variants
as macros so the the library compiles correctly even without
optimization.
* io/fstat.c: Undef fstat.
* io/fstat64.c: Undef fstat64
* io/lstat.c: Undef lstat.
* io/lstat64.c: Undef lstat64
* io/stat.c: Undef stat.
* io/stat64.c: Undef stat64
* io/fts.c: Include <include/sys/stat.h> to get macro definitions.
* io/ftw.c: Likewise.
* io/getdirname.c: Likewise.
* Makefile (install): Run test-installation.pl if possible.
* db2/Makefile: Update from db-2.3.12.
* db2/db.h: Likewise.
* db2/db_int.h: Likewise.
* db2/btree/bt_cursor.c: Likewise.
* db2/btree/bt_delete.c: Likewise.
* db2/btree/bt_open.c: Likewise.
* db2/btree/bt_put.c: Likewise.
* db2/btree/bt_rec.c: Likewise.
* db2/btree/bt_recno.c: Likewise.
* db2/btree/bt_search.c: Likewise.
* db2/btree/bt_split.c: Likewise.
* db2/btree/bt_stat.c: Likewise.
* db2/btree/btree.src: Likewise.
* db2/btree/btree_auto.c: Likewise.
* db2/btree/bt_cursor.c: Likewise.
* db2/btree/bt_delete.c: Likewise.
* db2/btree/bt_open.c: Likewise.
* db2/btree/bt_put.c: Likewise.
* db2/btree/bt_rec.c: Likewise.
* db2/btree/bt_recno.c: Likewise.
* db2/btree/bt_search.c: Likewise.
* db2/btree/bt_split.c: Likewise.
* db2/btree/bt_stat.c: Likewise.
* db2/btree/btree.src: Likewise.
* db2/btree/btree_auto.c: Likewise.
* db2/common/db_appinit.c: Likewise.
* db2/common/db_apprec.c: Likewise.
* db2/common/db_byteorder.c: Likewise.
* db2/common/db_region.c: Likewise.
* db2/db/db.c: Likewise
* db2/db/db.src: Likewise
* db2/db/db_auto.c: Likewise
* db2/db/db_dispatch.c: Likewise
* db2/db/db_dup.c: Likewise
* db2/db/db_overflow.c: Likewise
* db2/db/db_pr.c: Likewise
* db2/db/db_rec.c: Likewise
* db2/db/db_ret.c: Likewise
* db2/db/db_thread.c: Likewise
* db2/db185/db185.c: Likewise.
* db2/hash/hash.c: Likewise.
* db2/hash/hash.src: Likewise.
* db2/hash/hash_auto.c: Likewise.
* db2/hash/hash_dup.c: Likewise.
* db2/hash/hash_page.c: Likewise.
* db2/hash/hash_rec.c: Likewise.
* db2/include/btree_auto.h: Likewise.
* db2/include/btree_ext.h: Likewise.
* db2/include/clib_ext.h: Likewise.
* db2/include/common_ext.h: Likewise.
* db2/include/db.h.src: Likewise.
* db2/include/db_am.h: Likewise.
* db2/include/db_auto.h: Likewise.
* db2/include/db_cxx.h: Likewise.
* db2/include/db_ext.h: Likewise.
* db2/include/db_int.h.src: Likewise.
* db2/include/hash.h: Likewise.
* db2/include/hash_auto.h: Likewise.
* db2/include/hash_ext.h: Likewise.
* db2/include/lock.h: Likewise.
* db2/include/lock_ext.h: Likewise.
* db2/include/log.h: Likewise.
* db2/include/log_ext.h: Likewise.
* db2/include/mp.h: Likewise.
* db2/include/mp_ext.h: Likewise.
* db2/include/mutex_ext.h: Likewise.
* db2/include/os_ext.h: Likewise.
* db2/include/os_func.h: Likewise.
* db2/include/txn.h: Likewise.
* db2/include/txn_ext.h: Likewise.
* db2/lock/lock.c: Likewise.
* db2/lock/lock_deadlock.c: Likewise.
* db2/log/log.c: Likewise.
* db2/log/log_archive.c: Likewise.
* db2/log/log_auto.c: Likewise.
* db2/log/log_findckp.c: Likewise.
* db2/log/log_get.c: Likewise.
* db2/log/log_put.c: Likewise.
* db2/log/log_rec.c: Likewise.
* db2/log/log_register.c: Likewise.
* db2/mp/mp_bh.c: Likewise.
* db2/mp/mp_fget.c: Likewise.
* db2/mp/mp_fopen.c: Likewise.
* db2/mp/mp_fput.c: Likewise.
* db2/mp/mp_fset.c: Likewise.
* db2/mp/mp_open.c: Likewise.
* db2/mp/mp_pr.c: Likewise.
* db2/mp/mp_region.c: Likewise.
* db2/mp/mp_sync.c: Likewise.
* db2/mutex/mutex.c: Likewise.
* db2/os/os_abs.c: Likewise.
* db2/os/os_dir.c: Likewise.
* db2/os/os_fid.c: Likewise.
* db2/os/os_fsync.c: Likewise.
* db2/os/os_func.c: Likewise.
* db2/os/os_map.c: Likewise.
* db2/os/os_oflags.c: Likewise.
* db2/os/os_open.c: Likewise.
* db2/os/os_rpath.c: Likewise.
* db2/os/os_rw.c: Likewise.
* db2/os/os_seek.c: Likewise.
* db2/os/os_sleep.c: Likewise.
* db2/os/os_stat.c: Likewise.
* db2/os/os_unlink.c: Likewise.
* db2/progs/db_deadlock/db_deadlock.c: Likewise.
* db2/progs/db_dump/db_dump.c: Likewise.
* db2/progs/db_load/db_load.c: Likewise.
* db2/progs/db_recover/db_recover.c: Likewise.
* db2/progs/db_stat/db_stat.c: Likewise.
* db2/txn/txn.c: Likewise.
* db2/txn/txn_auto.c: Likewise.
* db2/txn/txn_rec.c: Likewise.
* db2/os/db_os_abs.c: Removed.
* db2/os/db_os_dir.c: Removed.
* db2/os/db_os_fid.c: Removed.
* db2/os/db_os_lseek.c: Removed.
* db2/os/db_os_mmap.c: Removed.
* db2/os/db_os_open.c: Removed.
* db2/os/db_os_rw.c: Removed.
* db2/os/db_os_sleep.c: Removed.
* db2/os/db_os_stat.c: Removed.
* db2/os/db_os_unlink.c: Removed.
* libio/stdio.h (fopen): Add __restrict to parameters.
* manual/process.texi (system): Describe behaviour for NULL argument.
* stdio-common/printf-parse.h: Parse hh modifier.
* stdio-common/vfprintf.c: Handle hh modifier.
* stdio-common/vfscanf.c: Likewise.
* manual/stdio.texi: Describe hh modifier for scanf/printf.
* math/complex.h: Don't define _Imaginary_I, but instead _Complex_I.
gcc does no yet know the `imaginary' keyword.
* math/test-math.c: Add little test for know gcc bug.
* math/tgmath.h: Make complex versions of log10() only available
if __USE_GNU.
* stdlib/test-canon.c: Fix typo.
* sysdeps/generic/setenv.c: Avoid compilation warnings.
Reported by Jim Meyering.
* sysdeps/generic/bits/errno.h: EILSEQ is an ISO C error number.
* sysdeps/mach/hurd/bits/errno.h: Likewise.
* sysdeps/standalone/bits/errno.h: Likewise.
* sysdeps/unix/sysv/linux/bits/errno.h: Likewise.
* sysdeps/i386/i586/memcpy.S: New file.
* sysdeps/i386/i586/mempcpy.S: New file.
* sysdeps/i386/i586/memset.S: Fix typo.
* sysdeps/posix/getcwd.c: Define HAVE_MEMPCPY for _LIBC. Add casts.
* sysdeps/posix/system.c: Add comment to explain code.
* sysdeps/wordsize-32/inttypes.h: Include <stddef.h> for wchar_t.
Define PTRDIFF_{MIN,MAX}, SIG_ATOMIC_{MIN,MAX}, SIZE_MAX,
WCHAR_{MIN,MAX}, WINT_{MIN,MAX}.
Define wcstoimax, wcstoumax.
* sysdeps/wordsize-64/inttypes.h: Likewise.
* wcsmbs/wchar.h: Define WCHAR_{MIN,MAX} if not already defined.
Declare __wcsto{l,ul,ll,ull}_internal only if not already done.
* time/Makefile (routines): Add strfxtime.
* time/strftime.c: Implement %F and %f format.
* time/strfxtime.c: New file.
* time/time.h: Define new types and symbols from ISO C 9X.
* time/mktime.c: Little comment correction.
1997-11-10 Andreas Jaeger <aj@arthur.rhein-neckar.de>
* sysdeps/libm-ieee754/s_sincosl.c: Fix typo.
* sysdeps/libm-ieee754/s_tanl.c: Fix typo.
* sysdeps/libm-ieee754/s_floorl.c: Correct typos.
* sysdeps/libm-ieee754/e_remainderl.c: Replace
EXTRACT_LDOUBLE_WORDS by GET_LDOUBLE_WORDS.
* sysdeps/libm-ieee754/e_atan2l.c: Replace EXTRACT_LDOUBLE_WORDS
by GET_LDOUBLE_WORDS.
* sysdeps/libm-ieee754/s_scalbnl.c: Replace ";" by "," for correct
variable declaration.
* sysdeps/libm-ieee754/s_scalblnl.c: Likewise.
* sysdeps/libm-ieee754/s_lrint.c (__lrint): Correct function.
* math/libm-test.c (sqrt_test): Add test for sqrt (0.25).
(asin_test): Add more test.
1997-11-10 23:34 Ulrich Drepper <drepper@cygnus.com>
* sysdeps/libm-ieee754/e_asin.c: Add braces to make code clearer
and to not confuse the poor compiler.
* sysdeps/libm-ieee754/e_asinf.c: Likewise.
Reported by vertex@cagent.com.
1997-11-09 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de>
* elf/dl-lookup.c (do_lookup): Don't accept the base version if we
require a specific one.
* libio/oldfreopen.c: Bind old symbols to version GLIBC_2.0.
* libio/oldiofopen.c: Likewise.
* libio/oldstdfiles.c: Likewise.
* libc.map: Export them.
1997-11-10 07:40 H.J. Lu <hjl@gnu.ai.mit.edu>
* stdlib/exit.c (exit): Handle recursive calls to exit ().
1997-11-09 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de>
* sysdeps/m68k/fpu/s_llrint.c: Fixed to take double argument
instead of long double.
* sysdeps/m68k/fpu/s_llrintf.c: New file.
* sysdeps/m68k/fpu/s_llrintl.c: New file.
* sysdeps/libm-ieee754/s_llrint.c: Make compilable and fix
overflow condition.
* sysdeps/libm-ieee754/s_llrintf.c: Fix overflow condition.
* sysdeps/libm-ieee754/s_llrintl.c: Likewise.
* sysdeps/libm-ieee754/s_llround.c: Likewise.
* sysdeps/libm-ieee754/s_llroundf.c: Likewise.
* sysdeps/libm-ieee754/s_llroundl.c: Likewise.
* sysdeps/libm-ieee754/s_lrint.c: Likewise.
* sysdeps/libm-ieee754/s_lrintf.c: Likewise.
* sysdeps/libm-ieee754/s_lrintl.c: Likewise.
* sysdeps/libm-ieee754/s_lround.c: Likewise.
* sysdeps/libm-ieee754/s_lroundf.c: Likewise.
* sysdeps/libm-ieee754/s_lroundl.c: Likewise.
* math/libm-test.c: Test all three variants of lrint and llrint.
Fix typos in lround and llround tests. Add tests for boundary
cases for lrint and llround.
1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de>
* manual/arith.texi: Misc doc fixes.
* manual/ctype.texi: Likewise.
* manual/pattern.texi: Likewise.
* manual/terminal.texi: Likewise.
1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de>
* sysdeps/unix/sysv/linux/xstatconv.c: Use struct assignment
instead of memcpy to let the compiler use whatever it regards as
optimal.
* sysdeps/unix/sysv/linux/alpha/xstatconv.c: Likewise.
1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de>
* sysdeps/unix/sysv/linux/Makefile (sysdep_headers)
[$(subdir)=misc]: Add sys/prctl.h.
* sysdeps/unix/sysv/linux/Dist: Distribute it.
1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de>
* io/ftwtest-sh: Don't use the unknown which command, instead try
pwd as /bin/pwd and /usr/bin/pwd.
1997-11-08 Andreas Schwab <schwab@issan.informatik.uni-dortmund.de>
* manual/maint.texi (Tools for Installation): Don't recommend
broken version 3.76.1 of make.
(Porting): Fix wording.
1997-11-06 06:13 H.J. Lu <hjl@gnu.ai.mit.edu>
* config.make.in (build-pic-default): New, defined with
pic_default.
* configure.in (pic_default): New, set to yes if PIC is
default.
* Makeconfig (CPPFLAGS-.o, CPPFLAGS-.op, CPPFLAGS-.og,
CPPFLAGS-.ob): Add -DPIC if $(build-pic-default) is yes.
1997-11-09 18:15 Ulrich Drepper <drepper@cygnus.com>
* Makerules (libc.so): Fix typo.
* csu/Makefile (CFLAGS-initfini.s): Correctly fix moving function
definition. Patch by Zack Weinberg <zack@rabi.phys.columbia.edu>.
* stdlib/strtod.c: Handle numbers like 0.0e10000 correctly which
produce 0.0. Reported by Joe Keane <jgk@jgk.org>.
* sysdeps/libm-ieee754/s_ceill.c: Fix typos.
* sysdeps/libm-ieee754/s_llrint.c: Correct code, it never worked.
1997-11-06 07:00 H.J. Lu <hjl@gnu.ai.mit.edu>
* sysdeps/unix/sysv/i386/i686/time.S: Removed.
1997-11-08 14:07 Thorsten Kukuk <kukuk@vt.uni-paderborn.de>
* nis/libnsl.map: Add __do_niscall2 for nis_cachemgr.
* nis/nis_call.c: Set UDP resend timeout correct.
* nis/nss_compat/compat-grp.c: Rewritten to make it faster.
* nis/nss_compat/compat-pwd.c: Likewise.
* nis/nss_compat/compat-spwd.c: Likewise.
* nis/ypclnt.c: Fix UDP resend timeout, fix yp_bind/do_ypcall
interaction.
* inet/protocols/routed.h: Include sys/socket.h.
* inet/protocols/talkd.h: Likewise.
* inet/protocols/timed.h: Include rpc/types.h.
* sunrpc/rpc/pmap_clnt.h: Include rpc/clnt.h.
1997-11-06 01:39 Ulrich Drepper <drepper@cygnus.com>
* Makerules (libc.so): Add missing closing brace.
1997-11-05 Brendan Kehoe <brendan@lisa.cygnus.com>
* libio.h (__P): Name its arg `p' instead of `params'.
This was added solely to work around problems with
the definition of __P in the Solaris math.h header.
1997-11-12 01:06:02 +01:00
|
|
|
if ((tp = (PAGE *)__db_malloc(dbp->pgsize)) == NULL)
|
1997-08-27 22:26:10 +02:00
|
|
|
return (ENOMEM);
|
|
|
|
#ifdef DEBUG
|
|
|
|
memset(tp, 0xff, dbp->pgsize);
|
|
|
|
#endif
|
|
|
|
/* Create new page for the split. */
|
|
|
|
if ((ret = newfunc(dbp, P_DUPLICATE, &np)) != 0) {
|
|
|
|
FREE(tp, dbp->pgsize);
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
P_INIT(np, dbp->pgsize, PGNO(np), PGNO(h), NEXT_PGNO(h), 0,
|
|
|
|
P_DUPLICATE);
|
|
|
|
P_INIT(tp, dbp->pgsize, PGNO(h), PREV_PGNO(h), PGNO(np), 0,
|
|
|
|
P_DUPLICATE);
|
|
|
|
|
|
|
|
/* Figure out the split point */
|
|
|
|
halfbytes = (dbp->pgsize - HOFFSET(h)) / 2;
|
|
|
|
did_indx = 0;
|
|
|
|
for (sum = 0, lastsum = 0, i = 0; i < NUM_ENT(h); i++) {
|
|
|
|
if (i == indx) {
|
|
|
|
sum += size;
|
|
|
|
if (lastsum < halfbytes && sum >= halfbytes) {
|
|
|
|
/* We've crossed the halfway point. */
|
|
|
|
if ((db_indx_t)(halfbytes - lastsum) <
|
|
|
|
(db_indx_t)(sum - halfbytes)) {
|
|
|
|
*hp = np;
|
|
|
|
*indxp = 0;
|
|
|
|
i--;
|
|
|
|
} else
|
|
|
|
*indxp = i;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
*indxp = i;
|
|
|
|
lastsum = sum;
|
|
|
|
did_indx = 1;
|
|
|
|
}
|
1997-09-05 03:43:20 +02:00
|
|
|
if (B_TYPE(GET_BKEYDATA(h, i)->type) == B_KEYDATA)
|
1997-08-27 22:26:10 +02:00
|
|
|
sum += BKEYDATA_SIZE(GET_BKEYDATA(h, i)->len);
|
|
|
|
else
|
|
|
|
sum += BOVERFLOW_SIZE;
|
|
|
|
|
|
|
|
if (lastsum < halfbytes && sum >= halfbytes) {
|
|
|
|
/* We've crossed the halfway point. */
|
|
|
|
if ((db_indx_t)(halfbytes - lastsum) <
|
|
|
|
(db_indx_t)(sum - halfbytes))
|
|
|
|
i--;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if we have set the return values of the index pointer and
|
|
|
|
* page pointer.
|
|
|
|
*/
|
|
|
|
if (!did_indx) {
|
|
|
|
*hp = np;
|
|
|
|
*indxp = indx - i - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (DB_LOGGING(dbp)) {
|
|
|
|
page_dbt.size = dbp->pgsize;
|
|
|
|
page_dbt.data = h;
|
|
|
|
if ((ret = __db_split_log(dbp->dbenv->lg_info,
|
|
|
|
dbp->txn, &LSN(h), 0, DB_SPLITOLD, dbp->log_fileid,
|
|
|
|
PGNO(h), &page_dbt, &LSN(h))) != 0) {
|
|
|
|
FREE(tp, dbp->pgsize);
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
LSN(tp) = LSN(h);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If it's a btree, adjust the cursors.
|
|
|
|
*
|
|
|
|
* i is the index of the last element to stay on the page.
|
|
|
|
*/
|
|
|
|
if (dbp->type == DB_BTREE || dbp->type == DB_RECNO)
|
|
|
|
__bam_ca_split(dbp, PGNO(h), PGNO(h), PGNO(np), i + 1, 0);
|
|
|
|
|
|
|
|
for (nindex = 0, oindex = i + 1; oindex < NUM_ENT(h); oindex++) {
|
|
|
|
bk = GET_BKEYDATA(h, oindex);
|
1997-09-05 03:43:20 +02:00
|
|
|
if (B_TYPE(bk->type) == B_KEYDATA)
|
1997-08-27 22:26:10 +02:00
|
|
|
s = BKEYDATA_SIZE(bk->len);
|
|
|
|
else
|
|
|
|
s = BOVERFLOW_SIZE;
|
|
|
|
|
|
|
|
np->inp[nindex++] = HOFFSET(np) -= s;
|
|
|
|
memcpy((u_int8_t *)np + HOFFSET(np), bk, s);
|
|
|
|
NUM_ENT(np)++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now do data compaction by copying the remaining stuff onto the
|
|
|
|
* temporary page and then copying it back to the real page.
|
|
|
|
*/
|
|
|
|
for (nindex = 0, oindex = 0; oindex <= i; oindex++) {
|
|
|
|
bk = GET_BKEYDATA(h, oindex);
|
1997-09-05 03:43:20 +02:00
|
|
|
if (B_TYPE(bk->type) == B_KEYDATA)
|
1997-08-27 22:26:10 +02:00
|
|
|
s = BKEYDATA_SIZE(bk->len);
|
|
|
|
else
|
|
|
|
s = BOVERFLOW_SIZE;
|
|
|
|
|
|
|
|
tp->inp[nindex++] = HOFFSET(tp) -= s;
|
|
|
|
memcpy((u_int8_t *)tp + HOFFSET(tp), bk, s);
|
|
|
|
NUM_ENT(tp)++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This page (the temporary) should be only half full, so we do two
|
|
|
|
* memcpy's, one for the top of the page and one for the bottom of
|
|
|
|
* the page. This way we avoid copying the middle which should be
|
|
|
|
* about half a page.
|
|
|
|
*/
|
|
|
|
memcpy(h, tp, LOFFSET(tp));
|
|
|
|
memcpy((u_int8_t *)h + HOFFSET(tp),
|
|
|
|
(u_int8_t *)tp + HOFFSET(tp), dbp->pgsize - HOFFSET(tp));
|
|
|
|
FREE(tp, dbp->pgsize);
|
|
|
|
|
|
|
|
if (DB_LOGGING(dbp)) {
|
|
|
|
page_dbt.size = dbp->pgsize;
|
|
|
|
page_dbt.data = h;
|
|
|
|
if ((ret = __db_split_log(dbp->dbenv->lg_info,
|
|
|
|
dbp->txn, &LSN(h), 0, DB_SPLITNEW, dbp->log_fileid,
|
|
|
|
PGNO(h), &page_dbt, &LSN(h))) != 0)
|
|
|
|
return (ret);
|
|
|
|
|
|
|
|
page_dbt.size = dbp->pgsize;
|
|
|
|
page_dbt.data = np;
|
|
|
|
if ((ret = __db_split_log(dbp->dbenv->lg_info,
|
|
|
|
dbp->txn, &LSN(np), 0, DB_SPLITNEW, dbp->log_fileid,
|
|
|
|
PGNO(np), &page_dbt, &LSN(np))) != 0)
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Figure out if the location we're interested in is on the new
|
|
|
|
* page, and if so, reset the callers' pointer. Push the other
|
|
|
|
* page back to the store.
|
|
|
|
*/
|
|
|
|
if (*hp == h)
|
|
|
|
ret = memp_fput(dbp->mpf, np, DB_MPOOL_DIRTY);
|
|
|
|
else
|
|
|
|
ret = memp_fput(dbp->mpf, h, DB_MPOOL_DIRTY);
|
|
|
|
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_ditem --
|
|
|
|
* Remove an item from a page.
|
|
|
|
*
|
1998-01-25 18:01:47 +01:00
|
|
|
* PUBLIC: int __db_ditem __P((DB *, PAGE *, u_int32_t, u_int32_t));
|
1997-08-27 22:26:10 +02:00
|
|
|
*/
|
|
|
|
int
|
|
|
|
__db_ditem(dbp, pagep, indx, nbytes)
|
|
|
|
DB *dbp;
|
|
|
|
PAGE *pagep;
|
1998-01-25 18:01:47 +01:00
|
|
|
u_int32_t indx, nbytes;
|
1997-08-27 22:26:10 +02:00
|
|
|
{
|
|
|
|
DBT ldbt;
|
|
|
|
db_indx_t cnt, offset;
|
|
|
|
int ret;
|
|
|
|
u_int8_t *from;
|
|
|
|
|
|
|
|
if (DB_LOGGING(dbp)) {
|
|
|
|
ldbt.data = P_ENTRY(pagep, indx);
|
|
|
|
ldbt.size = nbytes;
|
|
|
|
if ((ret = __db_addrem_log(dbp->dbenv->lg_info, dbp->txn,
|
|
|
|
&LSN(pagep), 0, DB_REM_DUP, dbp->log_fileid, PGNO(pagep),
|
|
|
|
(u_int32_t)indx, nbytes, &ldbt, NULL, &LSN(pagep))) != 0)
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If there's only a single item on the page, we don't have to
|
|
|
|
* work hard.
|
|
|
|
*/
|
|
|
|
if (NUM_ENT(pagep) == 1) {
|
|
|
|
NUM_ENT(pagep) = 0;
|
|
|
|
HOFFSET(pagep) = dbp->pgsize;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pack the remaining key/data items at the end of the page. Use
|
|
|
|
* memmove(3), the regions may overlap.
|
|
|
|
*/
|
|
|
|
from = (u_int8_t *)pagep + HOFFSET(pagep);
|
|
|
|
memmove(from + nbytes, from, pagep->inp[indx] - HOFFSET(pagep));
|
|
|
|
HOFFSET(pagep) += nbytes;
|
|
|
|
|
|
|
|
/* Adjust the indices' offsets. */
|
|
|
|
offset = pagep->inp[indx];
|
|
|
|
for (cnt = 0; cnt < NUM_ENT(pagep); ++cnt)
|
|
|
|
if (pagep->inp[cnt] < offset)
|
|
|
|
pagep->inp[cnt] += nbytes;
|
|
|
|
|
|
|
|
/* Shift the indices down. */
|
|
|
|
--NUM_ENT(pagep);
|
|
|
|
if (indx != NUM_ENT(pagep))
|
|
|
|
memmove(&pagep->inp[indx], &pagep->inp[indx + 1],
|
|
|
|
sizeof(db_indx_t) * (NUM_ENT(pagep) - indx));
|
|
|
|
|
|
|
|
/* If it's a btree, adjust the cursors. */
|
|
|
|
if (dbp->type == DB_BTREE || dbp->type == DB_RECNO)
|
|
|
|
__bam_ca_di(dbp, PGNO(pagep), indx, -1);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_pitem --
|
|
|
|
* Put an item on a page.
|
|
|
|
*
|
|
|
|
* PUBLIC: int __db_pitem
|
|
|
|
* PUBLIC: __P((DB *, PAGE *, u_int32_t, u_int32_t, DBT *, DBT *));
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
__db_pitem(dbp, pagep, indx, nbytes, hdr, data)
|
|
|
|
DB *dbp;
|
|
|
|
PAGE *pagep;
|
|
|
|
u_int32_t indx;
|
|
|
|
u_int32_t nbytes;
|
|
|
|
DBT *hdr, *data;
|
|
|
|
{
|
|
|
|
BKEYDATA bk;
|
|
|
|
DBT thdr;
|
|
|
|
int ret;
|
|
|
|
u_int8_t *p;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Put a single item onto a page. The logic figuring out where to
|
|
|
|
* insert and whether it fits is handled in the caller. All we do
|
|
|
|
* here is manage the page shuffling. We cheat a little bit in that
|
|
|
|
* we don't want to copy the dbt on a normal put twice. If hdr is
|
|
|
|
* NULL, we create a BKEYDATA structure on the page, otherwise, just
|
|
|
|
* copy the caller's information onto the page.
|
|
|
|
*
|
|
|
|
* This routine is also used to put entries onto the page where the
|
|
|
|
* entry is pre-built, e.g., during recovery. In this case, the hdr
|
|
|
|
* will point to the entry, and the data argument will be NULL.
|
|
|
|
*
|
|
|
|
* !!!
|
|
|
|
* There's a tremendous potential for off-by-one errors here, since
|
|
|
|
* the passed in header sizes must be adjusted for the structure's
|
|
|
|
* placeholder for the trailing variable-length data field.
|
|
|
|
*/
|
|
|
|
if (DB_LOGGING(dbp))
|
|
|
|
if ((ret = __db_addrem_log(dbp->dbenv->lg_info, dbp->txn,
|
|
|
|
&LSN(pagep), 0, DB_ADD_DUP, dbp->log_fileid, PGNO(pagep),
|
|
|
|
(u_int32_t)indx, nbytes, hdr, data, &LSN(pagep))) != 0)
|
|
|
|
return (ret);
|
|
|
|
|
|
|
|
if (hdr == NULL) {
|
1997-09-05 03:43:20 +02:00
|
|
|
B_TSET(bk.type, B_KEYDATA, 0);
|
1997-08-27 22:26:10 +02:00
|
|
|
bk.len = data == NULL ? 0 : data->size;
|
|
|
|
|
|
|
|
thdr.data = &bk;
|
|
|
|
thdr.size = SSZA(BKEYDATA, data);
|
|
|
|
hdr = &thdr;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Adjust the index table, then put the item on the page. */
|
|
|
|
if (indx != NUM_ENT(pagep))
|
|
|
|
memmove(&pagep->inp[indx + 1], &pagep->inp[indx],
|
|
|
|
sizeof(db_indx_t) * (NUM_ENT(pagep) - indx));
|
|
|
|
HOFFSET(pagep) -= nbytes;
|
|
|
|
pagep->inp[indx] = HOFFSET(pagep);
|
|
|
|
++NUM_ENT(pagep);
|
|
|
|
|
|
|
|
p = P_ENTRY(pagep, indx);
|
|
|
|
memcpy(p, hdr->data, hdr->size);
|
|
|
|
if (data != NULL)
|
|
|
|
memcpy(p + hdr->size, data->data, data->size);
|
|
|
|
|
|
|
|
/* If it's a btree, adjust the cursors. */
|
|
|
|
if (dbp->type == DB_BTREE || dbp->type == DB_RECNO)
|
|
|
|
__bam_ca_di(dbp, PGNO(pagep), indx, 1);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_relink --
|
|
|
|
* Relink around a deleted page.
|
|
|
|
*
|
|
|
|
* PUBLIC: int __db_relink __P((DB *, PAGE *, PAGE **, int));
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
__db_relink(dbp, pagep, new_next, needlock)
|
|
|
|
DB *dbp;
|
|
|
|
PAGE *pagep, **new_next;
|
|
|
|
int needlock;
|
|
|
|
{
|
|
|
|
PAGE *np, *pp;
|
|
|
|
DB_LOCK npl, ppl;
|
|
|
|
DB_LSN *nlsnp, *plsnp;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
np = pp = NULL;
|
|
|
|
npl = ppl = LOCK_INVALID;
|
|
|
|
nlsnp = plsnp = NULL;
|
|
|
|
|
|
|
|
/* Retrieve and lock the two pages. */
|
|
|
|
if (pagep->next_pgno != PGNO_INVALID) {
|
|
|
|
if (needlock && (ret = __bam_lget(dbp,
|
|
|
|
0, pagep->next_pgno, DB_LOCK_WRITE, &npl)) != 0)
|
|
|
|
goto err;
|
|
|
|
if ((ret = memp_fget(dbp->mpf,
|
|
|
|
&pagep->next_pgno, 0, &np)) != 0) {
|
|
|
|
(void)__db_pgerr(dbp, pagep->next_pgno);
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
nlsnp = &np->lsn;
|
|
|
|
}
|
|
|
|
if (pagep->prev_pgno != PGNO_INVALID) {
|
|
|
|
if (needlock && (ret = __bam_lget(dbp,
|
|
|
|
0, pagep->prev_pgno, DB_LOCK_WRITE, &ppl)) != 0)
|
|
|
|
goto err;
|
|
|
|
if ((ret = memp_fget(dbp->mpf,
|
|
|
|
&pagep->prev_pgno, 0, &pp)) != 0) {
|
|
|
|
(void)__db_pgerr(dbp, pagep->next_pgno);
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
plsnp = &pp->lsn;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Log the change. */
|
|
|
|
if (DB_LOGGING(dbp)) {
|
|
|
|
if ((ret = __db_relink_log(dbp->dbenv->lg_info, dbp->txn,
|
|
|
|
&pagep->lsn, 0, dbp->log_fileid, pagep->pgno, &pagep->lsn,
|
|
|
|
pagep->prev_pgno, plsnp, pagep->next_pgno, nlsnp)) != 0)
|
|
|
|
goto err;
|
|
|
|
if (np != NULL)
|
|
|
|
np->lsn = pagep->lsn;
|
|
|
|
if (pp != NULL)
|
|
|
|
pp->lsn = pagep->lsn;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Modify and release the two pages.
|
|
|
|
*
|
|
|
|
* !!!
|
|
|
|
* The parameter new_next gets set to the page following the page we
|
|
|
|
* are removing. If there is no following page, then new_next gets
|
|
|
|
* set to NULL.
|
|
|
|
*/
|
|
|
|
if (np != NULL) {
|
|
|
|
np->prev_pgno = pagep->prev_pgno;
|
|
|
|
if (new_next == NULL)
|
|
|
|
ret = memp_fput(dbp->mpf, np, DB_MPOOL_DIRTY);
|
|
|
|
else {
|
|
|
|
*new_next = np;
|
|
|
|
ret = memp_fset(dbp->mpf, np, DB_MPOOL_DIRTY);
|
|
|
|
}
|
|
|
|
if (ret != 0)
|
|
|
|
goto err;
|
|
|
|
if (needlock)
|
|
|
|
(void)__bam_lput(dbp, npl);
|
|
|
|
} else if (new_next != NULL)
|
|
|
|
*new_next = NULL;
|
|
|
|
|
|
|
|
if (pp != NULL) {
|
|
|
|
pp->next_pgno = pagep->next_pgno;
|
|
|
|
if ((ret = memp_fput(dbp->mpf, pp, DB_MPOOL_DIRTY)) != 0)
|
|
|
|
goto err;
|
|
|
|
if (needlock)
|
|
|
|
(void)__bam_lput(dbp, ppl);
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
err: if (np != NULL)
|
|
|
|
(void)memp_fput(dbp->mpf, np, 0);
|
|
|
|
if (needlock && npl != LOCK_INVALID)
|
|
|
|
(void)__bam_lput(dbp, npl);
|
|
|
|
if (pp != NULL)
|
|
|
|
(void)memp_fput(dbp->mpf, pp, 0);
|
|
|
|
if (needlock && ppl != LOCK_INVALID)
|
|
|
|
(void)__bam_lput(dbp, ppl);
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_ddup --
|
|
|
|
* Delete an offpage chain of duplicates.
|
|
|
|
*
|
|
|
|
* PUBLIC: int __db_ddup __P((DB *, db_pgno_t, int (*)(DB *, PAGE *)));
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
__db_ddup(dbp, pgno, freefunc)
|
|
|
|
DB *dbp;
|
|
|
|
db_pgno_t pgno;
|
|
|
|
int (*freefunc) __P((DB *, PAGE *));
|
|
|
|
{
|
|
|
|
PAGE *pagep;
|
|
|
|
DBT tmp_dbt;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
do {
|
|
|
|
if ((ret = memp_fget(dbp->mpf, &pgno, 0, &pagep)) != 0) {
|
|
|
|
(void)__db_pgerr(dbp, pgno);
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (DB_LOGGING(dbp)) {
|
|
|
|
tmp_dbt.data = pagep;
|
|
|
|
tmp_dbt.size = dbp->pgsize;
|
|
|
|
if ((ret = __db_split_log(dbp->dbenv->lg_info, dbp->txn,
|
|
|
|
&LSN(pagep), 0, DB_SPLITOLD, dbp->log_fileid,
|
|
|
|
PGNO(pagep), &tmp_dbt, &LSN(pagep))) != 0)
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
pgno = pagep->next_pgno;
|
|
|
|
if ((ret = freefunc(dbp, pagep)) != 0)
|
|
|
|
return (ret);
|
|
|
|
} while (pgno != PGNO_INVALID);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __db_addpage --
|
|
|
|
* Create a new page and link it onto the next_pgno field of the
|
|
|
|
* current page.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
__db_addpage(dbp, hp, indxp, newfunc)
|
|
|
|
DB *dbp;
|
|
|
|
PAGE **hp;
|
|
|
|
db_indx_t *indxp;
|
|
|
|
int (*newfunc) __P((DB *, u_int32_t, PAGE **));
|
|
|
|
{
|
|
|
|
PAGE *newpage;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if ((ret = newfunc(dbp, P_DUPLICATE, &newpage)) != 0)
|
|
|
|
return (ret);
|
|
|
|
|
|
|
|
if (DB_LOGGING(dbp)) {
|
|
|
|
if ((ret = __db_addpage_log(dbp->dbenv->lg_info,
|
|
|
|
dbp->txn, &LSN(*hp), 0, dbp->log_fileid,
|
|
|
|
PGNO(*hp), &LSN(*hp), PGNO(newpage), &LSN(newpage))) != 0) {
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
LSN(newpage) = LSN(*hp);
|
|
|
|
}
|
|
|
|
|
|
|
|
PREV_PGNO(newpage) = PGNO(*hp);
|
|
|
|
NEXT_PGNO(*hp) = PGNO(newpage);
|
|
|
|
|
|
|
|
if ((ret = memp_fput(dbp->mpf, *hp, DB_MPOOL_DIRTY)) != 0)
|
|
|
|
return (ret);
|
|
|
|
*hp = newpage;
|
|
|
|
*indxp = 0;
|
|
|
|
return (0);
|
|
|
|
}
|