Home
last modified time | relevance | path

Searched refs:NEXTINDEX (Results 1 – 12 of 12) sorted by relevance

/freebsd/lib/libc/db/btree/
H A Dbt_delete.c98 if (NEXTINDEX(h) == 1) in __bt_delete()
104 if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) { in __bt_delete()
178 if (parent->index != NEXTINDEX(h) - 1) { in __bt_stkacq()
254 idx = NEXTINDEX(h) - 1; in __bt_stkacq()
308 if (NEXTINDEX(h) == 0) { in __bt_bdelete()
316 } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0); in __bt_bdelete()
319 if (e->index == NEXTINDEX(h)) in __bt_bdelete()
335 if (NEXTINDEX(h) == 0) { in __bt_bdelete()
405 if (NEXTINDEX(pg) == 1) { in __bt_pdelete()
427 for (cnt = NEXTINDEX(pg) - idx; --cnt; ++ip) in __bt_pdelete()
[all …]
H A Dbt_seq.c173 if (NEXTINDEX(h) == 0) { in __bt_seqset()
194 if (NEXTINDEX(h) == 0) { in __bt_seqset()
201 pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno; in __bt_seqset()
206 ep->index = NEXTINDEX(h) - 1; in __bt_seqset()
270 if (++idx == NEXTINDEX(h)) { in __bt_seqadv()
300 idx = NEXTINDEX(h) - 1; in __bt_seqadv()
380 ep->index = NEXTINDEX(h); in __bt_first()
398 if (ep->index == NEXTINDEX(ep->page)) { in __bt_first()
H A Dbt_split.c178 tbl = GETBLEAF(lchild, NEXTINDEX(lchild) - 1); in __bt_split()
213 if (skip < (nxtindex = NEXTINDEX(h))) in __bt_split()
249 dest = (char *)l + l->linp[NEXTINDEX(l) - 1]; in __bt_split()
267 dest = (char *)l + l->linp[NEXTINDEX(l) - 1]; in __bt_split()
268 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(lchild); in __bt_split()
274 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(rchild); in __bt_split()
361 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) { in bt_page()
482 l->flags & P_RLEAF ? NEXTINDEX(l) : rec_total(l), l->pgno); in bt_rroot()
487 r->flags & P_RLEAF ? NEXTINDEX(r) : rec_total(r), r->pgno); in bt_rroot()
613 for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) { in bt_psplit()
[all …]
H A Dbt_search.c74 for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) { in __bt_search()
103 if (base == NEXTINDEX(h) && in __bt_search()
187 e.index = NEXTINDEX(e.page) - 1; in __bt_sprev()
H A Dbt_put.c204 if (idx < (nxtindex = NEXTINDEX(h))) in __bt_put()
221 if (idx == NEXTINDEX(h) - 1) { in __bt_put()
284 if (t->bt_cur.index != NEXTINDEX(h) - 1) in bt_fast()
H A Dbt_conv.c77 top = NEXTINDEX(h); in __bt_pgin()
135 top = NEXTINDEX(h); in __bt_pgout()
H A Dbt_debug.c174 top = NEXTINDEX(h); in __bt_dpage()
265 nkeys += NEXTINDEX(h); in __bt_stat()
H A Dbtree.h86 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t)) macro
/freebsd/lib/libc/db/recno/
H A Drec_search.c78 for (idx = 0, top = NEXTINDEX(h);;) { in __rec_search()
H A Drec_delete.c178 for (cnt = &h->linp[NEXTINDEX(h)] - ip; --cnt; ++ip) in __rec_dleaf()
H A Drec_put.c256 if (idx < (nxtindex = NEXTINDEX(h))) in __rec_iput()
/freebsd/contrib/netbsd-tests/lib/libc/db/
H A Dh_db.c553 if (NEXTINDEX(h) == 0) in unlinkpg()