Lines Matching defs:idx
145 indx_t idx;
183 idx = parent->index + 1;
184 BT_PUSH(t, h->pgno, idx);
193 bi = GETBINTERNAL(h, idx);
203 idx = 0;
238 idx = parent->index - 1;
239 BT_PUSH(t, h->pgno, idx);
248 bi = GETBINTERNAL(h, idx);
258 idx = NEXTINDEX(h) - 1;
259 BT_PUSH(t, pgno, idx);
373 indx_t cnt, idx, *ip, offset;
394 idx = parent->index;
395 bi = GETBINTERNAL(pg, idx);
427 offset = pg->linp[idx];
428 for (cnt = idx, ip = &pg->linp[0]; cnt--; ++ip)
431 for (cnt = NEXTINDEX(pg) - idx; --cnt; ++ip)
456 * idx: index on page to delete
462 __bt_dleaf(BTREE *t, const DBT *key, PAGE *h, u_int idx)
473 t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index == idx &&
474 __bt_curdel(t, key, h, idx))
478 to = bl = GETBLEAF(h, idx);
492 offset = h->linp[idx];
493 for (cnt = idx, ip = &h->linp[0]; cnt--; ++ip)
496 for (cnt = NEXTINDEX(h) - idx; --cnt; ++ip)
503 t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index > idx)
517 * idx: index on page to delete
523 __bt_curdel(BTREE *t, const DBT *key, PAGE *h, u_int idx)
546 e.index = idx;
554 if (idx > 0) {
556 e.index = idx - 1;
563 if (idx < NEXTINDEX(h) - 1) {
565 e.index = idx + 1;
572 if (idx == 0 && h->prevpg != P_INVALID) {
584 if (idx == NEXTINDEX(h) - 1 && h->nextpg != P_INVALID) {
600 e.index = idx;