Home
last modified time | relevance | path

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

/trueos/lib/libc/db/btree/
HDbt_delete.c102 if (NEXTINDEX(h) == 1) in __bt_delete()
108 if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) { in __bt_delete()
182 if (parent->index != NEXTINDEX(h) - 1) { in __bt_stkacq()
258 idx = NEXTINDEX(h) - 1; in __bt_stkacq()
312 if (NEXTINDEX(h) == 0) { in __bt_bdelete()
320 } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0); in __bt_bdelete()
323 if (e->index == NEXTINDEX(h)) in __bt_bdelete()
339 if (NEXTINDEX(h) == 0) { in __bt_bdelete()
409 if (NEXTINDEX(pg) == 1) { in __bt_pdelete()
431 for (cnt = NEXTINDEX(pg) - idx; --cnt; ++ip) in __bt_pdelete()
[all …]
HDbt_seq.c177 if (NEXTINDEX(h) == 0) { in __bt_seqset()
198 if (NEXTINDEX(h) == 0) { in __bt_seqset()
205 pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno; in __bt_seqset()
210 ep->index = NEXTINDEX(h) - 1; in __bt_seqset()
274 if (++idx == NEXTINDEX(h)) { in __bt_seqadv()
304 idx = NEXTINDEX(h) - 1; in __bt_seqadv()
384 ep->index = NEXTINDEX(h); in __bt_first()
402 if (ep->index == NEXTINDEX(ep->page)) { in __bt_first()
HDbt_split.c183 tbl = GETBLEAF(lchild, NEXTINDEX(lchild) - 1); in __bt_split()
218 if (skip < (nxtindex = NEXTINDEX(h))) in __bt_split()
251 dest = (char *)l + l->linp[NEXTINDEX(l) - 1]; in __bt_split()
269 dest = (char *)l + l->linp[NEXTINDEX(l) - 1]; in __bt_split()
270 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(lchild); in __bt_split()
276 ((RINTERNAL *)dest)->nrecs = NEXTINDEX(rchild); in __bt_split()
363 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) { in bt_page()
484 l->flags & P_RLEAF ? NEXTINDEX(l) : rec_total(l), l->pgno); in bt_rroot()
489 r->flags & P_RLEAF ? NEXTINDEX(r) : rec_total(r), r->pgno); in bt_rroot()
612 for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) { in bt_psplit()
[all …]
HDbt_search.c78 for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) { in __bt_search()
107 if (base == NEXTINDEX(h) && in __bt_search()
191 e.index = NEXTINDEX(e.page) - 1; in __bt_sprev()
HDbt_put.c207 if (idx < (nxtindex = NEXTINDEX(h))) in __bt_put()
224 if (idx == NEXTINDEX(h) - 1) { in __bt_put()
287 if (t->bt_cur.index != NEXTINDEX(h) - 1) in bt_fast()
HDbt_conv.c81 top = NEXTINDEX(h); in __bt_pgin()
139 top = NEXTINDEX(h); in __bt_pgout()
HDbt_debug.c178 top = NEXTINDEX(h); in __bt_dpage()
269 nkeys += NEXTINDEX(h); in __bt_stat()
HDbtree.h87 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t)) macro
/trueos/lib/libc/db/recno/
HDrec_search.c82 for (idx = 0, top = NEXTINDEX(h);;) { in __rec_search()
HDrec_delete.c182 for (cnt = &h->linp[NEXTINDEX(h)] - ip; --cnt; ++ip) in __rec_dleaf()
HDrec_put.c261 if (idx < (nxtindex = NEXTINDEX(h))) in __rec_iput()