Home
last modified time | relevance | path

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

/netbsd/src/lib/libc/db/btree/
Dbt_split.c55 static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
57 static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
58 static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
90 indx_t nxtindex; in __bt_split()
113 _DBFIT(ilen, indx_t); in __bt_split()
114 h->upper -= (indx_t)ilen; in __bt_split()
218 if ((uint32_t)h->upper - (uint32_t)h->lower < nbytes + sizeof(indx_t)) { in __bt_split()
229 (nxtindex - skip) * sizeof(indx_t)); in __bt_split()
230 h->lower += sizeof(indx_t); in __bt_split()
347 bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_page()
[all …]
Dbtree.h83 indx_t lower; /* lower bound of free space on page */
84 indx_t upper; /* upper bound of free space on page */
85 indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */
91 sizeof(uint32_t) + sizeof(indx_t) + sizeof(indx_t))
93 #define _NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))
95 static __inline indx_t
98 _DBFIT(x, indx_t); in NEXTINDEX()
99 return (indx_t)x; in NEXTINDEX()
102 #define NEXTINDEX(p) (indx_t)_NEXTINDEX(p)
293 indx_t index; /* the index on the page */
[all …]
Dbt_open.c129 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 _DBFIT(temp, indx_t); in __bt_open()
298 t->bt_ovflsize = (indx_t)temp; in __bt_open()
299 if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t)) { in __bt_open()
300 size_t l = NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t); in __bt_open()
301 _DBFIT(l, indx_t); in __bt_open()
302 t->bt_ovflsize = (indx_t)l; in __bt_open()
Dbt_put.c76 indx_t idx, nxtindex; in __bt_put()
205 if ((uint32_t)h->upper - (uint32_t)h->lower < nbytes + sizeof(indx_t)) { in __bt_put()
214 (nxtindex - idx) * sizeof(indx_t)); in __bt_put()
215 h->lower += sizeof(indx_t); in __bt_put()
286 if ((uint32_t)h->upper - (uint32_t)h->lower < nbytes + sizeof(indx_t)) in bt_fast()
Dbt_search.c72 indx_t base, idx, lim; in __bt_search()
156 indx_t idx = 0; in __bt_snext()
233 indx_t idx = 0; in __bt_sprev()
Dbt_delete.c150 indx_t idx = 0; /* Pacify gcc */ in __bt_stkacq()
378 indx_t cnt, idx, *ip, offset; in __bt_pdelete()
439 pg->lower -= sizeof(indx_t); in __bt_pdelete()
471 indx_t cnt, *ip, offset; in __bt_dleaf()
504 h->lower -= sizeof(indx_t); in __bt_dleaf()
Dbt_conv.c65 indx_t i, top; in __bt_pgin()
132 indx_t i, top; in __bt_pgout()
Dbt_seq.c250 indx_t idx = 0; /* pacify gcc */ in __bt_seqadv()
378 indx_t idx; in __bt_rseq_next()
417 indx_t idx; in __bt_rseq_prev()
Dbt_debug.c206 indx_t cur, top; in __bt_dpage()
/netbsd/src/lib/libc/db/recno/
Drec_put.c198 indx_t idx, nxtindex; in __rec_iput()
260 if ((uint32_t) (h->upper - h->lower) < nbytes + sizeof(indx_t)) { in __rec_iput()
270 (nxtindex - idx) * sizeof(indx_t)); in __rec_iput()
271 h->lower += sizeof(indx_t); in __rec_iput()
Drec_search.c69 indx_t idx; in __rec_search()
74 indx_t top; in __rec_search()
Drec_delete.c155 indx_t *ip, cnt, offset; in __rec_dleaf()
194 h->lower -= sizeof(indx_t); in __rec_dleaf()
/netbsd/src/include/
Ddb.h49 typedef uint16_t indx_t; typedef