lib/libc/db/btree/bt_conv.c

132

indx_t i, top;

lib/libc/db/btree/bt_conv.c

65

indx_t i, top;

lib/libc/db/btree/bt_debug.c

206

indx_t cur, top;

lib/libc/db/btree/bt_delete.c

150

indx_t idx = 0; /* Pacify gcc */

lib/libc/db/btree/bt_delete.c

378

indx_t cnt, idx, *ip, offset;

lib/libc/db/btree/bt_delete.c

439

pg->lower -= sizeof(indx_t);

lib/libc/db/btree/bt_delete.c

471

indx_t cnt, *ip, offset;

lib/libc/db/btree/bt_delete.c

504

h->lower -= sizeof(indx_t);

lib/libc/db/btree/bt_open.c

130

b.psize & (sizeof(indx_t) - 1)))

lib/libc/db/btree/bt_open.c

244

m.psize & (sizeof(indx_t) - 1))

lib/libc/db/btree/bt_open.c

297

(sizeof(indx_t) + NBLEAFDBT(0, 0));

lib/libc/db/btree/bt_open.c

298

_DBFIT(temp, indx_t);

lib/libc/db/btree/bt_open.c

299

t->bt_ovflsize = (indx_t)temp;

lib/libc/db/btree/bt_open.c

300

if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t)) {

lib/libc/db/btree/bt_open.c

301

size_t l = NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t);

lib/libc/db/btree/bt_open.c

302

_DBFIT(l, indx_t);

lib/libc/db/btree/bt_open.c

303

t->bt_ovflsize = (indx_t)l;

lib/libc/db/btree/bt_put.c

205

if ((uint32_t)h->upper - (uint32_t)h->lower < nbytes + sizeof(indx_t)) {

lib/libc/db/btree/bt_put.c

214

(nxtindex - idx) * sizeof(indx_t));

lib/libc/db/btree/bt_put.c

215

h->lower += sizeof(indx_t);

lib/libc/db/btree/bt_put.c

286

if ((uint32_t)h->upper - (uint32_t)h->lower < nbytes + sizeof(indx_t))

lib/libc/db/btree/bt_put.c

76

indx_t idx, nxtindex;

lib/libc/db/btree/bt_search.c

156

indx_t idx = 0;

lib/libc/db/btree/bt_search.c

233

indx_t idx = 0;

lib/libc/db/btree/bt_search.c

72

indx_t base, idx, lim;

lib/libc/db/btree/bt_seq.c

250

indx_t idx = 0; /* pacify gcc */

lib/libc/db/btree/bt_seq.c

378

indx_t idx;

lib/libc/db/btree/bt_seq.c

417

indx_t idx;

lib/libc/db/btree/bt_split.c

113

_DBFIT(ilen, indx_t);

lib/libc/db/btree/bt_split.c

114

h->upper -= (indx_t)ilen;

lib/libc/db/btree/bt_split.c

218

if ((uint32_t)h->upper - (uint32_t)h->lower < nbytes + sizeof(indx_t)) {

lib/libc/db/btree/bt_split.c

229

(nxtindex - skip) * sizeof(indx_t));

lib/libc/db/btree/bt_split.c

230

h->lower += sizeof(indx_t);

lib/libc/db/btree/bt_split.c

347

bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)

lib/libc/db/btree/bt_split.c

380

r->lower = BTDATAOFF + sizeof(indx_t);

lib/libc/db/btree/bt_split.c

448

bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)

lib/libc/db/btree/bt_split.c

502

_DBFIT(sz, indx_t);

lib/libc/db/btree/bt_split.c

503

h->linp[0] = h->upper = (indx_t)sz;

lib/libc/db/btree/bt_split.c

513

h->lower = BTDATAOFF + 2 * sizeof(indx_t);

lib/libc/db/btree/bt_split.c

55

static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);

lib/libc/db/btree/bt_split.c

57

static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);

lib/libc/db/btree/bt_split.c

58

static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);

lib/libc/db/btree/bt_split.c

589

h->lower = BTDATAOFF + 2 * sizeof(indx_t);

lib/libc/db/btree/bt_split.c

614

bt_psplit(BTREE *t, PAGE *h, PAGE *l, PAGE *r, indx_t *pskip, size_t ilen)

lib/libc/db/btree/bt_split.c

622

indx_t full, half, nxt, off, skip, top, used;

lib/libc/db/btree/bt_split.c

636

_DBFIT(temp, indx_t);

lib/libc/db/btree/bt_split.c

637

full = (indx_t)temp;

lib/libc/db/btree/bt_split.c

677

if ((skip <= off && used + nbytes + sizeof(indx_t) >= full) ||

lib/libc/db/btree/bt_split.c

691

temp = nbytes + sizeof(indx_t);

lib/libc/db/btree/bt_split.c

692

_DBFIT(temp, indx_t);

lib/libc/db/btree/bt_split.c

693

used += (indx_t)temp;

lib/libc/db/btree/bt_split.c

706

temp = (off + 1) * sizeof(indx_t);

lib/libc/db/btree/bt_split.c

707

_DBFIT(temp, indx_t);

lib/libc/db/btree/bt_split.c

708

l->lower += (indx_t)temp;

lib/libc/db/btree/bt_split.c

771

temp = off * sizeof(indx_t);

lib/libc/db/btree/bt_split.c

772

_DBFIT(temp, indx_t);

lib/libc/db/btree/bt_split.c

773

r->lower += (indx_t)temp;

lib/libc/db/btree/bt_split.c

777

r->lower += sizeof(indx_t);

lib/libc/db/btree/bt_split.c

827

indx_t nxt, top;

lib/libc/db/btree/bt_split.c

90

indx_t nxtindex;

lib/libc/db/btree/btree.h

102

#define NEXTINDEX(p) (indx_t)_NEXTINDEX(p)

lib/libc/db/btree/btree.h

293

indx_t index; /* the index on the page */

lib/libc/db/btree/btree.h

298

indx_t index; /* the index on the page */

lib/libc/db/btree/btree.h

381

indx_t bt_ovflsize; /* cut-off for key/data overflow */

lib/libc/db/btree/btree.h

83

indx_t lower; /* lower bound of free space on page */

lib/libc/db/btree/btree.h

84

indx_t upper; /* upper bound of free space on page */

lib/libc/db/btree/btree.h

85

indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */

lib/libc/db/btree/btree.h

91

sizeof(uint32_t) + sizeof(indx_t) + sizeof(indx_t))

lib/libc/db/btree/btree.h

93

#define _NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))

lib/libc/db/btree/btree.h

95

static __inline indx_t

lib/libc/db/btree/btree.h

98

_DBFIT(x, indx_t);

lib/libc/db/btree/btree.h

99

return (indx_t)x;

lib/libc/db/recno/rec_delete.c

155

indx_t *ip, cnt, offset;

lib/libc/db/recno/rec_delete.c

194

h->lower -= sizeof(indx_t);

lib/libc/db/recno/rec_put.c

198

indx_t idx, nxtindex;

lib/libc/db/recno/rec_put.c

260

if ((uint32_t) (h->upper - h->lower) < nbytes + sizeof(indx_t)) {

lib/libc/db/recno/rec_put.c

270

(nxtindex - idx) * sizeof(indx_t));

lib/libc/db/recno/rec_put.c

271

h->lower += sizeof(indx_t);

lib/libc/db/recno/rec_search.c

69

indx_t idx;

lib/libc/db/recno/rec_search.c

74

indx_t top;