Searched refs:indx_t (Results 1 – 13 of 13) sorted by relevance
| /freebsd-9-stable/lib/libc/db/btree/ |
| D | bt_split.c | 51 static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t); 53 static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t); 54 static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t); 86 indx_t nxtindex; in __bt_split() 209 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) { in __bt_split() 220 (nxtindex - skip) * sizeof(indx_t)); in __bt_split() 221 h->lower += sizeof(indx_t); in __bt_split() 335 bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_page() 368 r->lower = BTDATAOFF + sizeof(indx_t); in bt_page() 433 bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_root() [all …]
|
| D | btree.h | 78 indx_t lower; /* lower bound of free space on page */ 79 indx_t upper; /* upper bound of free space on page */ 80 indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */ 86 sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t)) 87 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t)) 240 indx_t index; /* the index on the page */ 245 indx_t index; /* the index on the page */ 328 indx_t bt_ovflsize; /* cut-off for key/data overflow */
|
| D | bt_put.c | 71 indx_t idx, nxtindex; in __bt_put() 200 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) { in __bt_put() 209 (nxtindex - idx) * sizeof(indx_t)); in __bt_put() 210 h->lower += sizeof(indx_t); in __bt_put() 281 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) in bt_fast()
|
| D | bt_open.c | 125 b.psize & (sizeof(indx_t) - 1) )) in __bt_open() 243 m.psize & (sizeof(indx_t) - 1) ) in __bt_open() 296 (sizeof(indx_t) + NBLEAFDBT(0, 0)); in __bt_open() 297 if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t)) in __bt_open() 299 NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t); in __bt_open()
|
| D | bt_delete.c | 145 indx_t idx; in __bt_stkacq() 373 indx_t cnt, idx, *ip, offset; in __bt_pdelete() 433 pg->lower -= sizeof(indx_t); in __bt_pdelete() 465 indx_t cnt, *ip, offset; in __bt_dleaf() 498 h->lower -= sizeof(indx_t); in __bt_dleaf()
|
| D | bt_conv.c | 62 indx_t i, top; in __bt_pgin() 127 indx_t i, top; in __bt_pgout()
|
| D | bt_search.c | 67 indx_t base, idx, lim; in __bt_search()
|
| D | bt_debug.c | 154 indx_t cur, top; in __bt_dpage()
|
| D | bt_seq.c | 235 indx_t idx; in __bt_seqadv()
|
| /freebsd-9-stable/lib/libc/db/recno/ |
| D | rec_put.c | 194 indx_t idx, nxtindex; in __rec_iput() 254 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) { in __rec_iput() 263 (nxtindex - idx) * sizeof(indx_t)); in __rec_iput() 264 h->lower += sizeof(indx_t); in __rec_iput()
|
| D | rec_search.c | 64 indx_t idx; in __rec_search() 69 indx_t top; in __rec_search()
|
| D | rec_delete.c | 150 indx_t *ip, cnt, offset; in __rec_dleaf() 184 h->lower -= sizeof(indx_t); in __rec_dleaf()
|
| /freebsd-9-stable/include/ |
| D | db.h | 48 typedef uint16_t indx_t; typedef
|