Home | History | Annotate | Download | only in btree

Lines Matching defs:skip

76  *	skip:	index to leave open
91 uint16_t skip;
99 * skip set to the offset which should be used. Additionally, l and r
102 skip = argskip;
104 bt_root(t, sp, &l, &r, &skip, ilen) :
105 bt_page(t, sp, &l, &r, &skip, ilen);
115 h->linp[skip] = h->upper;
163 skip = parent->index + 1;
188 (h->prevpg != P_INVALID || skip > 1)) {
221 bt_root(t, h, &l, &r, &skip, nbytes) :
222 bt_page(t, h, &l, &r, &skip, nbytes);
227 if (skip < (nxtindex = NEXTINDEX(h)))
228 memmove(h->linp + skip + 1, h->linp + skip,
229 (nxtindex - skip) * sizeof(indx_t));
237 h->linp[skip] = h->upper -= nbytes;
238 dest = (char *)(void *)h + h->linp[skip];
243 h->linp[skip] = h->upper -= nbytes;
244 dest = (char *)(void *)h + h->linp[skip];
260 if (skip > 0)
261 dest = (char *)(void *)h + h->linp[skip - 1];
268 h->linp[skip] = h->upper -= nbytes;
269 dest = (char *)(void *)h + h->linp[skip];
278 if (skip > 0)
279 dest = (char *)(void *)h + h->linp[skip - 1];
286 h->linp[skip] = h->upper -= nbytes;
287 dest = (char *)(void *)h + h->linp[skip];
340 * skip: pointer to index to leave open
347 bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
367 * a key to it (skip is NEXTINDEX()), it's likely that the data is
375 if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) {
381 *skip = 0;
420 tp = bt_psplit(t, h, l, r, skip, ilen);
441 * skip: pointer to index to leave open
448 bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)
471 tp = bt_psplit(t, h, l, r, skip, ilen);
622 indx_t full, half, nxt, off, skip, top, used;
628 * Split the data to the left and right pages. Leave the skip index
634 skip = *pskip;
641 if (skip == off) {
677 if ((skip <= off && used + nbytes + sizeof(indx_t) >= full) ||
684 if (skip != off) {
719 if (c->pg.index >= skip)
731 * Otherwise, adjust the skip index to reflect the new position on
734 if (skip <= off) {
735 skip = MAX_PAGE_OFFSET;
743 if (skip == nxt) {
745 skip = MAX_PAGE_OFFSET;
776 if (skip == top)