index 712 htags/htags.c fputs(index, op); index 722 htags/htags.c fputs(index, op); index 749 htags/htags.c fputs(index, op); index 1437 htags/htags.c const char *index = NULL; index 1943 htags/htags.c index = makecommonpart(title, strbuf_value(defines), strbuf_value(files)); index 1952 htags/htags.c makeindex("index.html", title, index); index 1957 htags/htags.c makemainindex("mains.html", index); index 114 libdb/bt_delete.c status = __bt_dleaf(t, NULL, h, c->pg.index); index 156 libdb/bt_delete.c indx_t index = 0; index 193 libdb/bt_delete.c if (parent->index != NEXTINDEX(h) - 1) { index 194 libdb/bt_delete.c index = parent->index + 1; index 195 libdb/bt_delete.c BT_PUSH(t, h->pgno, index); index 204 libdb/bt_delete.c bi = GETBINTERNAL(h, index); index 214 libdb/bt_delete.c index = 0; index 248 libdb/bt_delete.c if (parent->index != 0) { index 249 libdb/bt_delete.c index = parent->index - 1; index 250 libdb/bt_delete.c BT_PUSH(t, h->pgno, index); index 259 libdb/bt_delete.c bi = GETBINTERNAL(h, index); index 269 libdb/bt_delete.c index = NEXTINDEX(h) - 1; index 270 libdb/bt_delete.c BT_PUSH(t, pgno, index); index 320 libdb/bt_delete.c if (__bt_dleaf(t, key, h, e->index)) { index 333 libdb/bt_delete.c } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0); index 336 libdb/bt_delete.c if (e->index == NEXTINDEX(h)) index 340 libdb/bt_delete.c while (e->index-- > 0) { index 343 libdb/bt_delete.c if (__bt_dleaf(t, key, h, e->index) == RET_ERROR) { index 347 libdb/bt_delete.c if (e->index == 0) index 388 libdb/bt_delete.c indx_t cnt, index, *ip, offset; index 409 libdb/bt_delete.c index = parent->index; index 410 libdb/bt_delete.c bi = GETBINTERNAL(pg, index); index 442 libdb/bt_delete.c offset = pg->linp[index]; index 443 libdb/bt_delete.c for (cnt = index, ip = &pg->linp[0]; cnt--; ++ip) index 446 libdb/bt_delete.c for (cnt = NEXTINDEX(pg) - index; --cnt; ++ip) index 492 libdb/bt_delete.c t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index == index && index 493 libdb/bt_delete.c __bt_curdel(t, key, h, index)) index 497 libdb/bt_delete.c to = bl = GETBLEAF(h, index); index 511 libdb/bt_delete.c offset = h->linp[index]; index 512 libdb/bt_delete.c for (cnt = index, ip = &h->linp[0]; cnt--; ++ip) index 515 libdb/bt_delete.c for (cnt = NEXTINDEX(h) - index; --cnt; ++ip) index 522 libdb/bt_delete.c t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index > index) index 523 libdb/bt_delete.c --t->bt_cursor.pg.index; index 569 libdb/bt_delete.c e.index = index; index 577 libdb/bt_delete.c if (index > 0) { index 579 libdb/bt_delete.c e.index = index - 1; index 586 libdb/bt_delete.c if (index < NEXTINDEX(h) - 1) { index 588 libdb/bt_delete.c e.index = index + 1; index 595 libdb/bt_delete.c if (index == 0 && h->prevpg != P_INVALID) { index 599 libdb/bt_delete.c e.index = NEXTINDEX(pg) - 1; index 607 libdb/bt_delete.c if (index == NEXTINDEX(h) - 1 && h->nextpg != P_INVALID) { index 611 libdb/bt_delete.c e.index = 0; index 616 libdb/bt_delete.c c->pg.index = e.index; index 623 libdb/bt_delete.c e.index = index; index 82 libdb/bt_put.c indx_t index, nxtindex; index 161 libdb/bt_put.c index = t->bt_cursor.pg.index; index 173 libdb/bt_put.c index = e->index; index 195 libdb/bt_put.c delete: if (__bt_dleaf(t, key, h, index) == RET_ERROR) { index 211 libdb/bt_put.c data, dflags, nbytes, index)) != RET_SUCCESS) index 216 libdb/bt_put.c if (index < (nxtindex = NEXTINDEX(h))) index 217 libdb/bt_put.c memmove(h->linp + index + 1, h->linp + index, index 218 libdb/bt_put.c (nxtindex - index) * sizeof(indx_t)); index 221 libdb/bt_put.c h->linp[index] = h->upper -= nbytes; index 228 libdb/bt_put.c t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index >= index) index 229 libdb/bt_put.c ++t->bt_cursor.pg.index; index 233 libdb/bt_put.c if (index == NEXTINDEX(h) - 1) { index 235 libdb/bt_put.c t->bt_last.index = index; index 239 libdb/bt_put.c if (index == 0) { index 241 libdb/bt_put.c t->bt_last.index = 0; index 250 libdb/bt_put.c __bt_setcur(t, e->page->pgno, e->index); index 283 libdb/bt_put.c t->bt_cur.index = t->bt_last.index; index 296 libdb/bt_put.c if (t->bt_cur.index != NEXTINDEX(h) - 1) index 300 libdb/bt_put.c t->bt_last.index = cmp ? ++t->bt_cur.index : t->bt_cur.index; index 304 libdb/bt_put.c if (t->bt_cur.index != 0) index 308 libdb/bt_put.c t->bt_last.index = 0; index 71 libdb/bt_search.c indx_t base, index, lim; index 83 libdb/bt_search.c t->bt_cur.index = index = base + (lim >> 1); index 92 libdb/bt_search.c base = index + 1; index 117 libdb/bt_search.c t->bt_cur.index = base; index 128 libdb/bt_search.c index = base ? base - 1 : base; index 130 libdb/bt_search.c next: BT_PUSH(t, h->pgno, index); index 131 libdb/bt_search.c pg = GETBINTERNAL(h, index)->pgno; index 164 libdb/bt_search.c e.index = 0; index 203 libdb/bt_search.c e.index = NEXTINDEX(e.page) - 1; index 119 libdb/bt_seq.c __bt_setcur(t, e.page->pgno, e.index); index 198 libdb/bt_seq.c ep->index = 0; index 220 libdb/bt_seq.c ep->index = NEXTINDEX(h) - 1; index 248 libdb/bt_seq.c indx_t index = 0; index 286 libdb/bt_seq.c index = c->pg.index; index 287 libdb/bt_seq.c if (++index == NEXTINDEX(h)) { index 294 libdb/bt_seq.c index = 0; index 306 libdb/bt_seq.c ep->index = c->pg.index; index 309 libdb/bt_seq.c index = c->pg.index; index 310 libdb/bt_seq.c if (index == 0) { index 317 libdb/bt_seq.c index = NEXTINDEX(h) - 1; index 319 libdb/bt_seq.c --index; index 324 libdb/bt_seq.c ep->index = index; index 381 libdb/bt_seq.c save.index = ep->index; index 388 libdb/bt_seq.c if (ep->index == 0) { index 401 libdb/bt_seq.c ep->index = NEXTINDEX(h); index 403 libdb/bt_seq.c --ep->index; index 419 libdb/bt_seq.c if (ep->index == NEXTINDEX(ep->page)) { index 427 libdb/bt_seq.c ep->index = 0; index 459 libdb/bt_seq.c t->bt_cursor.pg.index = index; index 167 libdb/bt_split.c skip = parent->index + 1; index 715 libdb/bt_split.c if (c->pg.index >= skip) index 716 libdb/bt_split.c ++c->pg.index; index 717 libdb/bt_split.c if (c->pg.index < nxt) /* Left page. */ index 721 libdb/bt_split.c c->pg.index -= nxt; index 79 libdb/bt_utils.c bl = GETBLEAF(e->page, e->index); index 175 libdb/bt_utils.c if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & P_BLEAF)) index 180 libdb/bt_utils.c bl = GETBLEAF(h, e->index); index 188 libdb/bt_utils.c bi = GETBINTERNAL(h, e->index); index 239 libdb/btree.h indx_t index; /* the index on the page */ index 244 libdb/btree.h indx_t index; /* the index on the page */ index 312 libdb/btree.h t->bt_sp->index = i; \ index 117 libdb/compat.h #define strchr(a, b) index(a, b) index 116 libutil/varray.c if (index < 0) index 118 libutil/varray.c if (index >= vb->length) { index 120 libutil/varray.c vb->length = index + 1; index 121 libutil/varray.c else if (index == 0 && vb->length == 0) index 124 libutil/varray.c die("varray_assign: index(=%d) is out of range.", index); index 129 libutil/varray.c if (index >= vb->alloced) { index 132 libutil/varray.c while (index >= vb->alloced) index 146 libutil/varray.c return (void *)(vb->vbuf + vb->size * index);