Searched refs:next_pgno (Results 1 - 25 of 28) sorted by relevance

12

/macosx-10.10/BerkeleyDB-21/db/dbinc/
H A Ddb_verify.h102 db_pgno_t next_pgno; member in struct:__vrfy_dbinfo
139 db_pgno_t next_pgno; member in struct:__vrfy_pageinfo
H A Ddb_page.h230 db_pgno_t next_pgno; /* 16-19: Next page number. */ member in struct:_db_page
280 #define NEXT_PGNO(p) (((PAGE *)p)->next_pgno)
314 * The next_pgno and prev_pgno fields are not maintained for btree and recno
373 * some number of overflow pages, linked by the next_pgno field of the page.
374 * A next_pgno field of PGNO_INVALID flags the end of the overflow item.
/macosx-10.10/BerkeleyDB-21/db/btree/
H A Dbt_delete.c525 if (pagep->next_pgno != PGNO_INVALID) {
527 0, pagep->next_pgno, DB_LOCK_WRITE, 0, &npl)) != 0)
529 if ((ret = __memp_fget(mpf, &pagep->next_pgno,
531 ret = __db_pgerr(dbp, pagep->next_pgno, ret);
552 pagep->next_pgno, nlsnp)) != 0)
578 pp->next_pgno = pagep->next_pgno;
580 pp->next_pgno = new_pgno;
H A Dbt_verify.c334 * next_pgno field. Save it off; we'll verify it when we check
1284 db_pgno_t next_pgno, prev_pgno; local
1299 next_pgno = prev_pgno = PGNO_INVALID;
1323 * vdp->prev_pgno is the same as pip->prev_pgno and vdp->next_pgno is
1324 * our page number. Then, we'll set vdp->next_pgno to pip->next_pgno
1335 next_pgno = vdp->next_pgno;
1337 vdp->next_pgno = vdp->prev_pgno = PGNO_INVALID;
1388 * page's next_pgno, an
[all...]
H A Dbt_rec.c1060 pagep->next_pgno = argp->next;
1062 pagep->next_pgno = argp->new_pgno;
1068 pagep->next_pgno = argp->pgno;
1581 pagep->next_pgno = argp->next;
1638 pagep->next_pgno = argp->next;
1643 pagep->next_pgno = argp->pgno;
H A Dbt_stat.c80 pgno = h->next_pgno;
/macosx-10.10/BerkeleyDB-21/db/dbinc_auto/
H A Dhash_auto.h30 db_pgno_t next_pgno; member in struct:___ham_newpage_args
69 db_pgno_t next_pgno; member in struct:___ham_copypage_args
H A Ddb_auto.h29 db_pgno_t next_pgno; member in struct:___db_big_args
/macosx-10.10/BerkeleyDB-21/db/db/
H A Ddb_meta.c141 * then set meta->free to the that page's next_pgno, but
144 newnext = h->next_pgno;
268 db_pgno_t last_pgno, next_pgno, pgno, prev_pgno; local
314 next_pgno = meta->free;
321 DB_ASSERT(dbp->env, h->pgno != next_pgno);
384 next_pgno = NEXT_PGNO(prev);
428 &ldbt, next_pgno, last_pgno, &ddbt)) != 0)
448 lsnp, pgno, &ldbt, next_pgno, last_pgno)) != 0)
466 h->pgno, PGNO_INVALID, next_pgno, 0, P_INVALID);
489 h->pgno, PGNO_INVALID, next_pgno,
[all...]
H A Ddb_vrfy.c1116 pip->next_pgno = pip->prev_pgno = 0;
1119 EPRINT((env, "Page %lu: invalid next_pgno %lu",
1123 pip->next_pgno = NEXT_PGNO(h);
1163 * prev_pgno and next_pgno: store for inter-page checks,
1178 EPRINT((env, "Page %lu: invalid next_pgno %lu",
1182 pip->next_pgno = NEXT_PGNO(h);
1428 db_pgno_t cur_pgno, next_pgno; local
1437 for (next_pgno = pip->free;
1438 next_pgno != PGNO_INVALID; next_pgno
[all...]
H A Ddb_overflow.c179 pgno = h->next_pgno;
270 lastp->next_pgno = PGNO(pagep);
389 pgno = pagep->next_pgno;
H A Ddb_ovfl_vrfy.c237 next = pip->next_pgno;
249 "Page %lu: bad next_pgno %lu on overflow page",
H A Ddb_rec.c138 argp->next_pgno, 0, P_OVERFLOW);
188 NEXT_PGNO(pagep) = argp->next_pgno;
201 npage: if (argp->next_pgno != PGNO_INVALID) {
202 REC_FGET(mpf, ip, argp->next_pgno, &pagep, done);
1555 pagep->next_pgno = argp->next;
1613 pagep->next_pgno = argp->next;
1618 pagep->next_pgno = argp->pgno;
H A Ddb.src55 * next_pgno: the page after the one we are logging.
59 * nextlsn: former lsn of the next_pgno. This is not currently used, but
68 ARG next_pgno db_pgno_t lu
H A Ddb_conv.c460 M_32_SWAP(h->next_pgno);
631 M_32_SWAP(h->next_pgno);
H A Ddb_auto.c353 argp->next_pgno = (db_pgno_t)uinttmp;
382 opcode, pgno, prev_pgno, next_pgno, dbt,
391 db_pgno_t next_pgno;
507 uinttmp = (u_int32_t)next_pgno;
/macosx-10.10/BerkeleyDB-21/db/hash/
H A Dhash.src85 * next_pgno is the page that follows this one. On allocation,
96 ARG next_pgno db_pgno_t lu
143 * next_pgno: the page number of the next page
144 * nnext_pgno: page after next_pgno (may need to change its prev)
151 ARG next_pgno db_pgno_t lu
H A Dhash_verify.c529 db_pgno_t pgno, next_pgno; local
674 next_pgno = pip->next_pgno;
681 if (next_pgno == PGNO_INVALID)
685 if (!IS_VALID_PGNO(next_pgno)) {
687 "Page %lu: hash page has bad next_pgno",
693 if ((ret = __db_vrfy_getpageinfo(vdp, next_pgno, &pip)) != 0)
699 (u_long)next_pgno));
702 pgno = next_pgno;
H A Dhash_page.c78 db_pgno_t next_pgno; local
129 next_pgno = NEXT_PGNO(hcp->page);
131 if ((ret = __ham_next_cpage(dbc, next_pgno)) != 0)
270 db_pgno_t next_pgno; local
355 for (next_pgno = NEXT_PGNO(hcp->page);
356 next_pgno != PGNO_INVALID;
357 next_pgno = NEXT_PGNO(hcp->page)) {
358 if ((ret = __ham_next_cpage(dbc, next_pgno)) != 0)
1032 page->pgno, page->prev_pgno, page->next_pgno, 0, P_HASH);
1715 db_pgno_t bucket_pgno, npgno, next_pgno; local
2005 db_pgno_t next_pgno, pgno; local
[all...]
H A Dhash_rec.c213 argp->prev_pgno, argp->next_pgno, 0, P_HASH);
245 pagep->next_pgno = argp->new_pgno;
252 pagep->next_pgno = argp->next_pgno;
266 npage: if (argp->next_pgno != PGNO_INVALID) {
267 REC_FGET(mpf, ip, argp->next_pgno, &pagep, done);
558 argp->next_pgno, 0, P_HASH);
566 REC_FGET(mpf, ip, argp->next_pgno, &pagep, do_nn);
602 PREV_PGNO(pagep) = argp->next_pgno;
H A Dhash_dup.c457 db_pgno_t next_pgno; local
511 for (next_pgno = NEXT_PGNO(hcp->page); next_pgno != PGNO_INVALID;
512 next_pgno = NEXT_PGNO(next_pagep)) {
518 &next_pgno, dbc->thread_info, dbc->txn,
H A Dhash_autop.c104 (void)printf("\tnext_pgno: %lu\n", (u_long)argp->next_pgno);
246 (void)printf("\tnext_pgno: %lu\n", (u_long)argp->next_pgno);
H A Dhash_stat.c86 pgno = h->next_pgno;
H A Dhash_auto.c352 argp->next_pgno = (db_pgno_t)uinttmp;
370 next_pgno, nextlsn)
380 db_pgno_t next_pgno;
516 uinttmp = (u_int32_t)next_pgno;
1173 argp->next_pgno = (db_pgno_t)uinttmp;
1208 __ham_copypage_log(dbp, txnp, ret_lsnp, flags, pgno, pagelsn, next_pgno, nextlsn, nnext_pgno,
1216 db_pgno_t next_pgno;
1336 uinttmp = (u_int32_t)next_pgno;
H A Dhash.c1732 db_pgno_t next_pgno; local
1791 next_pgno = NEXT_PGNO(hcp->page);
1793 if ((ret = __ham_next_cpage(dbc, next_pgno)) != 0)

Completed in 187 milliseconds

12