Lines Matching defs:indx
81 db_indx_t cnt, indx;
94 indx = cp->indx;
114 __bam_partsize(dbp, op, data, h, indx) : data->size;
134 __bam_build(dbc, op, &tdbt, h, indx, data_size)) != 0)
148 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0),
193 indx + (TYPE(h) == P_LBTREE ? O_INDX : 0));
226 __bam_dup_check(dbc, op, h, indx, needed, &cnt)) {
268 B_OVERFLOW, PGNO_INVALID, h, indx, key)) != 0)
271 if ((ret = __db_pitem(dbc, h, indx,
275 if ((ret = __bam_ca_di(dbc, PGNO(h), indx, 1)) != 0)
277 ++indx;
283 __bam_adjindx(dbc, h, indx + P_INDX, indx, 1)) != 0)
286 __bam_ca_di(dbc, PGNO(h), indx + P_INDX, 1)) != 0)
289 indx += 3;
291 cp->indx += 2;
293 ++indx;
294 cp->indx += 1;
300 if ((ret = __bam_adjindx(dbc, h, indx, indx, 1)) != 0)
302 if ((ret = __bam_ca_di(dbc, PGNO(h), indx, 1)) != 0)
305 ++indx;
316 if ((ret = __bam_ca_delete(dbp, PGNO(h), indx, 0, NULL)) != 0)
320 ++indx;
321 bk = GET_BKEYDATA(dbp, h, indx);
343 if ((ret = __bam_ditem(dbc, h, indx)) != 0)
364 B_OVERFLOW, PGNO_INVALID, h, indx, data);
371 ret = __db_pitem(dbc, h, indx,
374 ret = __bam_ritem(dbc, h, indx, data);
376 ret = __db_pitem(dbc, h, indx,
381 __bam_ca_di(dbc, PGNO(h), indx + 1, -1)) != 0) {
394 if ((ret = __bam_ca_di(dbc, PGNO(h), indx, 1)) != 0)
396 cp->indx = TYPE(h) == P_LBTREE ? indx - O_INDX : indx;
415 (ret = __bam_dup_convert(dbc, h, indx - O_INDX, cnt)) != 0)
430 __bam_partsize(dbp, op, data, h, indx)
432 u_int32_t op, indx;
450 bk = GET_BKEYDATA(dbp, h, indx + (TYPE(h) == P_LBTREE ? O_INDX : 0));
462 __bam_build(dbc, op, dbt, h, indx, nbytes)
464 u_int32_t op, indx, nbytes;
517 if (indx < NUM_ENT(h)) {
518 bk = GET_BKEYDATA(dbp, h, indx + (TYPE(h) == P_LBTREE ?
596 __bam_ritem(dbc, h, indx, data)
599 u_int32_t indx;
618 bk = GET_BKEYDATA(dbp, h, indx);
646 &LSN(h), (u_int32_t)indx, (u_int32_t)B_DISSET(bk->type),
671 inp[indx] += nbytes;
676 off = inp[indx];
698 * Check to see if the duplicate set at indx should have its own page.
701 __bam_dup_check(dbc, op, h, indx, sz, cntp)
705 u_int32_t indx, sz;
719 while (indx > 0 && inp[indx] == inp[indx - P_INDX])
720 indx -= P_INDX;
723 bk = GET_BKEYDATA(dbp, h, indx);
728 first = indx;
734 * We execute the loop with first == indx to get the size of the
738 for (first = indx;
739 indx < NUM_ENT(h) && inp[first] == inp[indx];
740 ++cnt, indx += P_INDX) {
741 bk = GET_BKEYDATA(dbp, h, indx + O_INDX);
774 __bam_dup_convert(dbc, h, indx, cnt)
777 u_int32_t indx, cnt;
792 while (indx > 0 && inp[indx] == inp[indx - P_INDX])
793 indx -= P_INDX;
808 first = indx;
809 dindx = indx;
814 PGNO(h), indx, PGNO(dp), cpindx)) != 0)
857 indx += P_INDX;
867 PGNO(h), first + P_INDX, (int)(first + P_INDX - indx));
882 __bam_ovput(dbc, type, pgno, h, indx, item)
884 u_int32_t type, indx;
915 return (__db_pitem(dbc, h, indx, BOVERFLOW_SIZE, &hdr, NULL));