db_overflow.c 17.5 KB
Newer Older
unknown's avatar
unknown committed
1 2 3
/*-
 * See the file LICENSE for redistribution information.
 *
unknown's avatar
unknown committed
4
 * Copyright (c) 1996-2002
unknown's avatar
unknown committed
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45
 *	Sleepycat Software.  All rights reserved.
 */
/*
 * Copyright (c) 1990, 1993, 1994, 1995, 1996
 *	Keith Bostic.  All rights reserved.
 */
/*
 * Copyright (c) 1990, 1993, 1994, 1995
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Mike Olson.
 *
 * 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. 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 "db_config.h"

#ifndef lint
unknown's avatar
unknown committed
46
static const char revid[] = "$Id: db_overflow.c,v 11.46 2002/08/08 03:57:48 bostic Exp $";
unknown's avatar
unknown committed
47 48 49 50 51 52 53 54 55
#endif /* not lint */

#ifndef NO_SYSTEM_INCLUDES
#include <sys/types.h>

#include <string.h>
#endif

#include "db_int.h"
unknown's avatar
unknown committed
56 57 58
#include "dbinc/db_page.h"
#include "dbinc/db_am.h"
#include "dbinc/db_verify.h"
unknown's avatar
unknown committed
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85

/*
 * Big key/data code.
 *
 * Big key and data entries are stored on linked lists of pages.  The initial
 * reference is a structure with the total length of the item and the page
 * number where it begins.  Each entry in the linked list contains a pointer
 * to the next page of data, and so on.
 */

/*
 * __db_goff --
 *	Get an offpage item.
 *
 * PUBLIC: int __db_goff __P((DB *, DBT *,
 * PUBLIC:     u_int32_t, db_pgno_t, void **, u_int32_t *));
 */
int
__db_goff(dbp, dbt, tlen, pgno, bpp, bpsz)
	DB *dbp;
	DBT *dbt;
	u_int32_t tlen;
	db_pgno_t pgno;
	void **bpp;
	u_int32_t *bpsz;
{
	DB_ENV *dbenv;
unknown's avatar
unknown committed
86
	DB_MPOOLFILE *mpf;
unknown's avatar
unknown committed
87 88 89 90 91 92 93
	PAGE *h;
	db_indx_t bytes;
	u_int32_t curoff, needed, start;
	u_int8_t *p, *src;
	int ret;

	dbenv = dbp->dbenv;
unknown's avatar
unknown committed
94
	mpf = dbp->mpf;
unknown's avatar
unknown committed
95 96 97 98 99 100 101 102 103

	/*
	 * Check if the buffer is big enough; if it is not and we are
	 * allowed to malloc space, then we'll malloc it.  If we are
	 * not (DB_DBT_USERMEM), then we'll set the dbt and return
	 * appropriately.
	 */
	if (F_ISSET(dbt, DB_DBT_PARTIAL)) {
		start = dbt->doff;
unknown's avatar
unknown committed
104 105 106 107 108 109
		if (start > tlen)
			needed = 0;
		else if (dbt->dlen > tlen - start)
			needed = tlen - start;
		else
			needed = dbt->dlen;
unknown's avatar
unknown committed
110 111 112 113 114 115 116 117 118 119 120 121
	} else {
		start = 0;
		needed = tlen;
	}

	/* Allocate any necessary memory. */
	if (F_ISSET(dbt, DB_DBT_USERMEM)) {
		if (needed > dbt->ulen) {
			dbt->size = needed;
			return (ENOMEM);
		}
	} else if (F_ISSET(dbt, DB_DBT_MALLOC)) {
unknown's avatar
unknown committed
122
		if ((ret = __os_umalloc(dbenv, needed, &dbt->data)) != 0)
unknown's avatar
unknown committed
123 124
			return (ret);
	} else if (F_ISSET(dbt, DB_DBT_REALLOC)) {
unknown's avatar
unknown committed
125
		if ((ret = __os_urealloc(dbenv, needed, &dbt->data)) != 0)
unknown's avatar
unknown committed
126 127
			return (ret);
	} else if (*bpsz == 0 || *bpsz < needed) {
unknown's avatar
unknown committed
128
		if ((ret = __os_realloc(dbenv, needed, bpp)) != 0)
unknown's avatar
unknown committed
129 130 131 132 133 134 135 136 137 138 139 140
			return (ret);
		*bpsz = needed;
		dbt->data = *bpp;
	} else
		dbt->data = *bpp;

	/*
	 * Step through the linked list of pages, copying the data on each
	 * one into the buffer.  Never copy more than the total data length.
	 */
	dbt->size = needed;
	for (curoff = 0, p = dbt->data; pgno != PGNO_INVALID && needed > 0;) {
unknown's avatar
unknown committed
141
		if ((ret = mpf->get(mpf, &pgno, 0, &h)) != 0)
unknown's avatar
unknown committed
142
			return (ret);
unknown's avatar
unknown committed
143

unknown's avatar
unknown committed
144 145
		/* Check if we need any bytes from this page. */
		if (curoff + OV_LEN(h) >= start) {
unknown's avatar
unknown committed
146
			src = (u_int8_t *)h + P_OVERHEAD(dbp);
unknown's avatar
unknown committed
147 148 149 150 151 152 153 154 155 156 157 158 159
			bytes = OV_LEN(h);
			if (start > curoff) {
				src += start - curoff;
				bytes -= start - curoff;
			}
			if (bytes > needed)
				bytes = needed;
			memcpy(p, src, bytes);
			p += bytes;
			needed -= bytes;
		}
		curoff += OV_LEN(h);
		pgno = h->next_pgno;
unknown's avatar
unknown committed
160
		(void)mpf->put(mpf, h, 0);
unknown's avatar
unknown committed
161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178
	}
	return (0);
}

/*
 * __db_poff --
 *	Put an offpage item.
 *
 * PUBLIC: int __db_poff __P((DBC *, const DBT *, db_pgno_t *));
 */
int
__db_poff(dbc, dbt, pgnop)
	DBC *dbc;
	const DBT *dbt;
	db_pgno_t *pgnop;
{
	DB *dbp;
	DBT tmp_dbt;
unknown's avatar
unknown committed
179 180 181
	DB_LSN new_lsn, null_lsn;
	DB_MPOOLFILE *mpf;
	PAGE *pagep, *lastp;
unknown's avatar
unknown committed
182 183 184
	db_indx_t pagespace;
	u_int32_t sz;
	u_int8_t *p;
unknown's avatar
unknown committed
185
	int ret, t_ret;
unknown's avatar
unknown committed
186 187 188 189 190 191 192

	/*
	 * Allocate pages and copy the key/data item into them.  Calculate the
	 * number of bytes we get for pages we fill completely with a single
	 * item.
	 */
	dbp = dbc->dbp;
unknown's avatar
unknown committed
193 194
	mpf = dbp->mpf;
	pagespace = P_MAXSPACE(dbp, dbp->pgsize);
unknown's avatar
unknown committed
195

unknown's avatar
unknown committed
196
	ret = 0;
unknown's avatar
unknown committed
197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212
	lastp = NULL;
	for (p = dbt->data,
	    sz = dbt->size; sz > 0; p += pagespace, sz -= pagespace) {
		/*
		 * Reduce pagespace so we terminate the loop correctly and
		 * don't copy too much data.
		 */
		if (sz < pagespace)
			pagespace = sz;

		/*
		 * Allocate and initialize a new page and copy all or part of
		 * the item onto the page.  If sz is less than pagespace, we
		 * have a partial record.
		 */
		if ((ret = __db_new(dbc, P_OVERFLOW, &pagep)) != 0)
unknown's avatar
unknown committed
213 214
			break;
		if (DBC_LOGGING(dbc)) {
unknown's avatar
unknown committed
215 216 217
			tmp_dbt.data = p;
			tmp_dbt.size = pagespace;
			ZERO_LSN(null_lsn);
unknown's avatar
unknown committed
218 219 220
			if ((ret = __db_big_log(dbp, dbc->txn,
			    &new_lsn, 0, DB_ADD_BIG, PGNO(pagep),
			    lastp ? PGNO(lastp) : PGNO_INVALID,
unknown's avatar
unknown committed
221 222
			    PGNO_INVALID, &tmp_dbt, &LSN(pagep),
			    lastp == NULL ? &null_lsn : &LSN(lastp),
unknown's avatar
unknown committed
223 224 225 226 227 228 229 230 231
			    &null_lsn)) != 0) {
				if (lastp != NULL)
					(void)mpf->put(mpf,
					    lastp, DB_MPOOL_DIRTY);
				lastp = pagep;
				break;
			}
		} else
			LSN_NOT_LOGGED(new_lsn);
unknown's avatar
unknown committed
232

unknown's avatar
unknown committed
233 234 235 236
		/* Move LSN onto page. */
		if (lastp != NULL)
			LSN(lastp) = new_lsn;
		LSN(pagep) = new_lsn;
unknown's avatar
unknown committed
237 238 239 240 241

		P_INIT(pagep, dbp->pgsize,
		    PGNO(pagep), PGNO_INVALID, PGNO_INVALID, 0, P_OVERFLOW);
		OV_LEN(pagep) = pagespace;
		OV_REF(pagep) = 1;
unknown's avatar
unknown committed
242
		memcpy((u_int8_t *)pagep + P_OVERHEAD(dbp), p, pagespace);
unknown's avatar
unknown committed
243 244 245 246 247 248 249 250 251 252 253

		/*
		 * If this is the first entry, update the user's info.
		 * Otherwise, update the entry on the last page filled
		 * in and release that page.
		 */
		if (lastp == NULL)
			*pgnop = PGNO(pagep);
		else {
			lastp->next_pgno = PGNO(pagep);
			pagep->prev_pgno = PGNO(lastp);
unknown's avatar
unknown committed
254
			(void)mpf->put(mpf, lastp, DB_MPOOL_DIRTY);
unknown's avatar
unknown committed
255 256 257
		}
		lastp = pagep;
	}
unknown's avatar
unknown committed
258 259 260 261
	if (lastp != NULL &&
	    (t_ret = mpf->put(mpf, lastp, DB_MPOOL_DIRTY)) != 0 && ret == 0)
		ret = t_ret;
	return (ret);
unknown's avatar
unknown committed
262 263 264 265 266 267 268 269 270 271 272 273 274 275 276
}

/*
 * __db_ovref --
 *	Increment/decrement the reference count on an overflow page.
 *
 * PUBLIC: int __db_ovref __P((DBC *, db_pgno_t, int32_t));
 */
int
__db_ovref(dbc, pgno, adjust)
	DBC *dbc;
	db_pgno_t pgno;
	int32_t adjust;
{
	DB *dbp;
unknown's avatar
unknown committed
277
	DB_MPOOLFILE *mpf;
unknown's avatar
unknown committed
278 279 280 281
	PAGE *h;
	int ret;

	dbp = dbc->dbp;
unknown's avatar
unknown committed
282 283 284 285
	mpf = dbp->mpf;

	if ((ret = mpf->get(mpf, &pgno, 0, &h)) != 0) {
		__db_pgerr(dbp, pgno, ret);
unknown's avatar
unknown committed
286 287 288
		return (ret);
	}

unknown's avatar
unknown committed
289 290 291 292
	if (DBC_LOGGING(dbc)) {
		if ((ret = __db_ovref_log(dbp,
		    dbc->txn, &LSN(h), 0, h->pgno, adjust, &LSN(h))) != 0) {
			(void)mpf->put(mpf, h, 0);
unknown's avatar
unknown committed
293
			return (ret);
unknown's avatar
unknown committed
294 295 296
		}
	} else
		LSN_NOT_LOGGED(LSN(h));
unknown's avatar
unknown committed
297 298
	OV_REF(h) += adjust;

unknown's avatar
unknown committed
299
	(void)mpf->put(mpf, h, DB_MPOOL_DIRTY);
unknown's avatar
unknown committed
300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
	return (0);
}

/*
 * __db_doff --
 *	Delete an offpage chain of overflow pages.
 *
 * PUBLIC: int __db_doff __P((DBC *, db_pgno_t));
 */
int
__db_doff(dbc, pgno)
	DBC *dbc;
	db_pgno_t pgno;
{
	DB *dbp;
	PAGE *pagep;
	DB_LSN null_lsn;
unknown's avatar
unknown committed
317
	DB_MPOOLFILE *mpf;
unknown's avatar
unknown committed
318 319 320 321
	DBT tmp_dbt;
	int ret;

	dbp = dbc->dbp;
unknown's avatar
unknown committed
322 323
	mpf = dbp->mpf;

unknown's avatar
unknown committed
324
	do {
unknown's avatar
unknown committed
325 326
		if ((ret = mpf->get(mpf, &pgno, 0, &pagep)) != 0) {
			__db_pgerr(dbp, pgno, ret);
unknown's avatar
unknown committed
327 328 329 330 331 332 333 334 335
			return (ret);
		}

		DB_ASSERT(TYPE(pagep) == P_OVERFLOW);
		/*
		 * If it's referenced by more than one key/data item,
		 * decrement the reference count and return.
		 */
		if (OV_REF(pagep) > 1) {
unknown's avatar
unknown committed
336
			(void)mpf->put(mpf, pagep, 0);
unknown's avatar
unknown committed
337 338 339
			return (__db_ovref(dbc, pgno, -1));
		}

unknown's avatar
unknown committed
340 341
		if (DBC_LOGGING(dbc)) {
			tmp_dbt.data = (u_int8_t *)pagep + P_OVERHEAD(dbp);
unknown's avatar
unknown committed
342 343
			tmp_dbt.size = OV_LEN(pagep);
			ZERO_LSN(null_lsn);
unknown's avatar
unknown committed
344 345 346 347 348 349
			if ((ret = __db_big_log(dbp, dbc->txn,
			    &LSN(pagep), 0, DB_REM_BIG,
			    PGNO(pagep), PREV_PGNO(pagep),
			    NEXT_PGNO(pagep), &tmp_dbt,
			    &LSN(pagep), &null_lsn, &null_lsn)) != 0) {
				(void)mpf->put(mpf, pagep, 0);
unknown's avatar
unknown committed
350
				return (ret);
unknown's avatar
unknown committed
351 352 353
			}
		} else
			LSN_NOT_LOGGED(LSN(pagep));
unknown's avatar
unknown committed
354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
		pgno = pagep->next_pgno;
		if ((ret = __db_free(dbc, pagep)) != 0)
			return (ret);
	} while (pgno != PGNO_INVALID);

	return (0);
}

/*
 * __db_moff --
 *	Match on overflow pages.
 *
 * Given a starting page number and a key, return <0, 0, >0 to indicate if the
 * key on the page is less than, equal to or greater than the key specified.
 * We optimize this by doing chunk at a time comparison unless the user has
 * specified a comparison function.  In this case, we need to materialize
 * the entire object and call their comparison routine.
 *
 * PUBLIC: int __db_moff __P((DB *, const DBT *, db_pgno_t, u_int32_t,
 * PUBLIC:     int (*)(DB *, const DBT *, const DBT *), int *));
 */
int
__db_moff(dbp, dbt, pgno, tlen, cmpfunc, cmpp)
	DB *dbp;
	const DBT *dbt;
	db_pgno_t pgno;
	u_int32_t tlen;
	int (*cmpfunc) __P((DB *, const DBT *, const DBT *)), *cmpp;
{
	DBT local_dbt;
unknown's avatar
unknown committed
384 385
	DB_MPOOLFILE *mpf;
	PAGE *pagep;
unknown's avatar
unknown committed
386 387 388 389 390
	void *buf;
	u_int32_t bufsize, cmp_bytes, key_left;
	u_int8_t *p1, *p2;
	int ret;

unknown's avatar
unknown committed
391 392
	mpf = dbp->mpf;

unknown's avatar
unknown committed
393 394 395 396 397 398 399 400 401 402 403 404 405 406
	/*
	 * If there is a user-specified comparison function, build a
	 * contiguous copy of the key, and call it.
	 */
	if (cmpfunc != NULL) {
		memset(&local_dbt, 0, sizeof(local_dbt));
		buf = NULL;
		bufsize = 0;

		if ((ret = __db_goff(dbp,
		    &local_dbt, tlen, pgno, &buf, &bufsize)) != 0)
			return (ret);
		/* Pass the key as the first argument */
		*cmpp = cmpfunc(dbp, dbt, &local_dbt);
unknown's avatar
unknown committed
407
		__os_free(dbp->dbenv, buf);
unknown's avatar
unknown committed
408 409 410 411 412 413
		return (0);
	}

	/* While there are both keys to compare. */
	for (*cmpp = 0, p1 = dbt->data,
	    key_left = dbt->size; key_left > 0 && pgno != PGNO_INVALID;) {
unknown's avatar
unknown committed
414
		if ((ret = mpf->get(mpf, &pgno, 0, &pagep)) != 0)
unknown's avatar
unknown committed
415 416 417 418 419
			return (ret);

		cmp_bytes = OV_LEN(pagep) < key_left ? OV_LEN(pagep) : key_left;
		tlen -= cmp_bytes;
		key_left -= cmp_bytes;
unknown's avatar
unknown committed
420 421
		for (p2 = (u_int8_t *)pagep + P_OVERHEAD(dbp);
		    cmp_bytes-- > 0; ++p1, ++p2)
unknown's avatar
unknown committed
422 423 424 425 426
			if (*p1 != *p2) {
				*cmpp = (long)*p1 - (long)*p2;
				break;
			}
		pgno = NEXT_PGNO(pagep);
unknown's avatar
unknown committed
427
		if ((ret = mpf->put(mpf, pagep, 0)) != 0)
unknown's avatar
unknown committed
428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473
			return (ret);
		if (*cmpp != 0)
			return (0);
	}
	if (key_left > 0)		/* DBT is longer than the page key. */
		*cmpp = 1;
	else if (tlen > 0)		/* DBT is shorter than the page key. */
		*cmpp = -1;
	else
		*cmpp = 0;

	return (0);
}

/*
 * __db_vrfy_overflow --
 *	Verify overflow page.
 *
 * PUBLIC: int __db_vrfy_overflow __P((DB *, VRFY_DBINFO *, PAGE *, db_pgno_t,
 * PUBLIC:     u_int32_t));
 */
int
__db_vrfy_overflow(dbp, vdp, h, pgno, flags)
	DB *dbp;
	VRFY_DBINFO *vdp;
	PAGE *h;
	db_pgno_t pgno;
	u_int32_t flags;
{
	VRFY_PAGEINFO *pip;
	int isbad, ret, t_ret;

	isbad = 0;
	if ((ret = __db_vrfy_getpageinfo(vdp, pgno, &pip)) != 0)
		return (ret);

	if ((ret = __db_vrfy_datapage(dbp, vdp, h, pgno, flags)) != 0) {
		if (ret == DB_VERIFY_BAD)
			isbad = 1;
		else
			goto err;
	}

	pip->refcount = OV_REF(h);
	if (pip->refcount < 1) {
		EPRINT((dbp->dbenv,
unknown's avatar
unknown committed
474
		    "Page %lu: overflow page has zero reference count",
unknown's avatar
unknown committed
475 476 477 478 479 480 481
		    (u_long)pgno));
		isbad = 1;
	}

	/* Just store for now. */
	pip->olen = HOFFSET(h);

unknown's avatar
unknown committed
482
err:	if ((t_ret = __db_vrfy_putpageinfo(dbp->dbenv, vdp, pip)) != 0)
unknown's avatar
unknown committed
483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528
		ret = t_ret;
	return ((ret == 0 && isbad == 1) ? DB_VERIFY_BAD : ret);
}

/*
 * __db_vrfy_ovfl_structure --
 *	Walk a list of overflow pages, avoiding cycles and marking
 *	pages seen.
 *
 * PUBLIC: int __db_vrfy_ovfl_structure
 * PUBLIC:     __P((DB *, VRFY_DBINFO *, db_pgno_t, u_int32_t, u_int32_t));
 */
int
__db_vrfy_ovfl_structure(dbp, vdp, pgno, tlen, flags)
	DB *dbp;
	VRFY_DBINFO *vdp;
	db_pgno_t pgno;
	u_int32_t tlen;
	u_int32_t flags;
{
	DB *pgset;
	VRFY_PAGEINFO *pip;
	db_pgno_t next, prev;
	int isbad, p, ret, t_ret;
	u_int32_t refcount;

	pgset = vdp->pgset;
	DB_ASSERT(pgset != NULL);
	isbad = 0;

	/* This shouldn't happen, but just to be sure. */
	if (!IS_VALID_PGNO(pgno))
		return (DB_VERIFY_BAD);

	/*
	 * Check the first prev_pgno;  it ought to be PGNO_INVALID,
	 * since there's no prev page.
	 */
	if ((ret = __db_vrfy_getpageinfo(vdp, pgno, &pip)) != 0)
		return (ret);

	/* The refcount is stored on the first overflow page. */
	refcount = pip->refcount;

	if (pip->type != P_OVERFLOW) {
		EPRINT((dbp->dbenv,
unknown's avatar
unknown committed
529
		    "Page %lu: overflow page of invalid type %lu",
unknown's avatar
unknown committed
530 531 532 533 534 535 536 537
		    (u_long)pgno, (u_long)pip->type));
		ret = DB_VERIFY_BAD;
		goto err;		/* Unsafe to continue. */
	}

	prev = pip->prev_pgno;
	if (prev != PGNO_INVALID) {
		EPRINT((dbp->dbenv,
unknown's avatar
unknown committed
538 539
	    "Page %lu: first page in overflow chain has a prev_pgno %lu",
		    (u_long)pgno, (u_long)prev));
unknown's avatar
unknown committed
540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577
		isbad = 1;
	}

	for (;;) {
		/*
		 * This is slightly gross.  Btree leaf pages reference
		 * individual overflow trees multiple times if the overflow page
		 * is the key to a duplicate set.  The reference count does not
		 * reflect this multiple referencing.  Thus, if this is called
		 * during the structure verification of a btree leaf page, we
		 * check to see whether we've seen it from a leaf page before
		 * and, if we have, adjust our count of how often we've seen it
		 * accordingly.
		 *
		 * (This will screw up if it's actually referenced--and
		 * correctly refcounted--from two different leaf pages, but
		 * that's a very unlikely brokenness that we're not checking for
		 * anyway.)
		 */

		if (LF_ISSET(ST_OVFL_LEAF)) {
			if (F_ISSET(pip, VRFY_OVFL_LEAFSEEN)) {
				if ((ret =
				    __db_vrfy_pgset_dec(pgset, pgno)) != 0)
					goto err;
			} else
				F_SET(pip, VRFY_OVFL_LEAFSEEN);
		}

		if ((ret = __db_vrfy_pgset_get(pgset, pgno, &p)) != 0)
			goto err;

		/*
		 * We may have seen this elsewhere, if the overflow entry
		 * has been promoted to an internal page.
		 */
		if ((u_int32_t)p > refcount) {
			EPRINT((dbp->dbenv,
unknown's avatar
unknown committed
578
			    "Page %lu: encountered twice in overflow traversal",
unknown's avatar
unknown committed
579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605
			    (u_long)pgno));
			ret = DB_VERIFY_BAD;
			goto err;
		}
		if ((ret = __db_vrfy_pgset_inc(pgset, pgno)) != 0)
			goto err;

		/* Keep a running tab on how much of the item we've seen. */
		tlen -= pip->olen;

		/* Send feedback to the application about our progress. */
		if (!LF_ISSET(DB_SALVAGE))
			__db_vrfy_struct_feedback(dbp, vdp);

		next = pip->next_pgno;

		/* Are we there yet? */
		if (next == PGNO_INVALID)
			break;

		/*
		 * We've already checked this when we saved it, but just
		 * to be sure...
		 */
		if (!IS_VALID_PGNO(next)) {
			DB_ASSERT(0);
			EPRINT((dbp->dbenv,
unknown's avatar
unknown committed
606 607
			    "Page %lu: bad next_pgno %lu on overflow page",
			    (u_long)pgno, (u_long)next));
unknown's avatar
unknown committed
608 609 610 611
			ret = DB_VERIFY_BAD;
			goto err;
		}

unknown's avatar
unknown committed
612
		if ((ret = __db_vrfy_putpageinfo(dbp->dbenv, vdp, pip)) != 0 ||
unknown's avatar
unknown committed
613 614 615 616
		    (ret = __db_vrfy_getpageinfo(vdp, next, &pip)) != 0)
			return (ret);
		if (pip->prev_pgno != pgno) {
			EPRINT((dbp->dbenv,
unknown's avatar
unknown committed
617 618 619
		"Page %lu: bad prev_pgno %lu on overflow page (should be %lu)",
			    (u_long)next, (u_long)pip->prev_pgno,
			    (u_long)pgno));
unknown's avatar
unknown committed
620 621 622 623 624 625 626 627 628 629 630 631 632
			isbad = 1;
			/*
			 * It's safe to continue because we have separate
			 * cycle detection.
			 */
		}

		pgno = next;
	}

	if (tlen > 0) {
		isbad = 1;
		EPRINT((dbp->dbenv,
unknown's avatar
unknown committed
633
		    "Page %lu: overflow item incomplete", (u_long)pgno));
unknown's avatar
unknown committed
634 635
	}

unknown's avatar
unknown committed
636 637
err:	if ((t_ret =
	    __db_vrfy_putpageinfo(dbp->dbenv, vdp, pip)) != 0 && ret == 0)
unknown's avatar
unknown committed
638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658
		ret = t_ret;
	return ((ret == 0 && isbad == 1) ? DB_VERIFY_BAD : ret);
}

/*
 * __db_safe_goff --
 *	Get an overflow item, very carefully, from an untrusted database,
 *	in the context of the salvager.
 *
 * PUBLIC: int __db_safe_goff __P((DB *, VRFY_DBINFO *, db_pgno_t,
 * PUBLIC:     DBT *, void **, u_int32_t));
 */
int
__db_safe_goff(dbp, vdp, pgno, dbt, buf, flags)
	DB *dbp;
	VRFY_DBINFO *vdp;
	db_pgno_t pgno;
	DBT *dbt;
	void **buf;
	u_int32_t flags;
{
unknown's avatar
unknown committed
659
	DB_MPOOLFILE *mpf;
unknown's avatar
unknown committed
660
	PAGE *h;
unknown's avatar
unknown committed
661
	int ret, t_ret;
unknown's avatar
unknown committed
662 663 664
	u_int32_t bytesgot, bytes;
	u_int8_t *src, *dest;

unknown's avatar
unknown committed
665 666 667
	mpf = dbp->mpf;
	h = NULL;
	ret = t_ret = 0;
unknown's avatar
unknown committed
668 669 670 671 672 673 674 675 676 677
	bytesgot = bytes = 0;

	while ((pgno != PGNO_INVALID) && (IS_VALID_PGNO(pgno))) {
		/*
		 * Mark that we're looking at this page;  if we've seen it
		 * already, quit.
		 */
		if ((ret = __db_salvage_markdone(vdp, pgno)) != 0)
			break;

unknown's avatar
unknown committed
678
		if ((ret = mpf->get(mpf, &pgno, 0, &h)) != 0)
unknown's avatar
unknown committed
679 680 681 682 683 684 685 686 687 688 689
			break;

		/*
		 * Make sure it's really an overflow page, unless we're
		 * being aggressive, in which case we pretend it is.
		 */
		if (!LF_ISSET(DB_AGGRESSIVE) && TYPE(h) != P_OVERFLOW) {
			ret = DB_VERIFY_BAD;
			break;
		}

unknown's avatar
unknown committed
690
		src = (u_int8_t *)h + P_OVERHEAD(dbp);
unknown's avatar
unknown committed
691 692
		bytes = OV_LEN(h);

unknown's avatar
unknown committed
693 694
		if (bytes + P_OVERHEAD(dbp) > dbp->pgsize)
			bytes = dbp->pgsize - P_OVERHEAD(dbp);
unknown's avatar
unknown committed
695 696

		if ((ret = __os_realloc(dbp->dbenv,
unknown's avatar
unknown committed
697
		    bytesgot + bytes, buf)) != 0)
unknown's avatar
unknown committed
698 699 700 701 702 703 704 705
			break;

		dest = (u_int8_t *)*buf + bytesgot;
		bytesgot += bytes;

		memcpy(dest, src, bytes);

		pgno = NEXT_PGNO(h);
unknown's avatar
unknown committed
706 707 708 709

		if ((ret = mpf->put(mpf, h, 0)) != 0)
			break;
		h = NULL;
unknown's avatar
unknown committed
710 711
	}

unknown's avatar
unknown committed
712 713 714 715 716
	/*
	 * If we're being aggressive, salvage a partial datum if there
	 * was an error somewhere along the way.
	 */
	if (ret == 0 || LF_ISSET(DB_AGGRESSIVE)) {
unknown's avatar
unknown committed
717 718 719 720
		dbt->size = bytesgot;
		dbt->data = *buf;
	}

unknown's avatar
unknown committed
721 722 723 724 725
	/* If we broke out on error, don't leave pages pinned. */
	if (h != NULL && (t_ret = mpf->put(mpf, h, 0)) != 0 && ret == 0)
		ret = t_ret;

	return (ret);
unknown's avatar
unknown committed
726
}