Home
last modified time | relevance | path

Searched refs:indx_t (Results 1 – 13 of 13) sorted by relevance

/freebsd/lib/libc/db/btree/
H A Dbt_split.c81 indx_t nxtindex; in __bt_split()
215 (nxtindex - skip) * sizeof(indx_t)); in __bt_split()
216 h->lower += sizeof(indx_t); in __bt_split()
366 r->lower = BTDATAOFF + sizeof(indx_t); in bt_page()
489 h->lower = BTDATAOFF + 2 * sizeof(indx_t); in bt_rroot()
565 h->lower = BTDATAOFF + 2 * sizeof(indx_t); in bt_broot()
663 used += nbytes + sizeof(indx_t); in bt_psplit()
676 l->lower += (off + 1) * sizeof(indx_t); in bt_psplit()
739 r->lower += off * sizeof(indx_t); in bt_psplit()
743 r->lower += sizeof(indx_t); in bt_psplit()
[all …]
H A Dbtree.h77 indx_t lower; /* lower bound of free space on page */
78 indx_t upper; /* upper bound of free space on page */
79 indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */
85 sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t))
86 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))
239 indx_t index; /* the index on the page */
244 indx_t index; /* the index on the page */
327 indx_t bt_ovflsize; /* cut-off for key/data overflow */
H A Dbt_put.c67 indx_t idx, nxtindex; in __bt_put()
197 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) { in __bt_put()
206 (nxtindex - idx) * sizeof(indx_t)); in __bt_put()
207 h->lower += sizeof(indx_t); in __bt_put()
278 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) in bt_fast()
H A Dbt_open.c122 b.psize & (sizeof(indx_t) - 1) )) in __bt_open()
237 m.psize & (sizeof(indx_t) - 1) ) in __bt_open()
290 (sizeof(indx_t) + NBLEAFDBT(0, 0)); in __bt_open()
291 if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t)) in __bt_open()
293 NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t); in __bt_open()
H A Dbt_delete.c141 indx_t idx; in __bt_stkacq()
369 indx_t cnt, idx, *ip, offset; in __bt_pdelete()
429 pg->lower -= sizeof(indx_t); in __bt_pdelete()
461 indx_t cnt, *ip, offset; in __bt_dleaf()
494 h->lower -= sizeof(indx_t); in __bt_dleaf()
H A Dbt_conv.c58 indx_t i, top; in __bt_pgin()
123 indx_t i, top; in __bt_pgout()
H A Dbt_search.c63 indx_t base, idx, lim; in __bt_search()
H A Dbt_debug.c150 indx_t cur, top; in __bt_dpage()
H A Dbt_seq.c231 indx_t idx; in __bt_seqadv()
/freebsd/lib/libc/db/recno/
H A Drec_put.c189 indx_t idx, nxtindex; in __rec_iput()
249 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) { in __rec_iput()
258 (nxtindex - idx) * sizeof(indx_t)); in __rec_iput()
259 h->lower += sizeof(indx_t); in __rec_iput()
H A Drec_search.c60 indx_t idx; in __rec_search()
65 indx_t top; in __rec_search()
H A Drec_delete.c146 indx_t *ip, cnt, offset; in __rec_dleaf()
180 h->lower -= sizeof(indx_t); in __rec_dleaf()
/freebsd/include/
H A Ddb.h47 typedef uint16_t indx_t; typedef