Home
last modified time | relevance | path

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

12

/freebsd/crypto/krb5/src/plugins/kdb/db2/libdb2/btree/
H A Dbt_split.c53 __P((BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t));
56 __P((BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t));
58 __P((BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t));
90 indx_t nxtindex; in __bt_split()
214 < nbytes + sizeof(indx_t)) { in __bt_split()
225 (nxtindex - skip) * sizeof(indx_t)); in __bt_split()
226 h->lower += sizeof(indx_t); in __bt_split()
343 bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_page()
376 r->lower = BTDATAOFF + sizeof(indx_t); in bt_page()
444 bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_root()
[all …]
H A Dbtree.h81 indx_t lower; /* lower bound of free space on page */
82 indx_t upper; /* upper bound of free space on page */
83 indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */
89 sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t))
90 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))
243 indx_t index; /* the index on the page */
248 indx_t index; /* the index on the page */
331 indx_t bt_ovflsize; /* cut-off for key/data overflow */
H A Dbt_put.c73 indx_t idx, nxtindex; in __bt_put()
208 < nbytes + sizeof(indx_t)) { in __bt_put()
217 (nxtindex - idx) * sizeof(indx_t)); in __bt_put()
218 h->lower += sizeof(indx_t); in __bt_put()
289 if ((u_int32_t)h->upper - (u_int32_t)h->lower < nbytes + sizeof(indx_t)) in bt_fast()
H A Dbt_open.c128 b.psize & (sizeof(indx_t) - 1))) in __bt_open()
248 m.psize & (sizeof(indx_t) - 1)) in __bt_open()
301 (sizeof(indx_t) + NBLEAFDBT(0, 0)); in __bt_open()
302 if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t)) in __bt_open()
304 NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t); in __bt_open()
H A Dbt_search.c69 indx_t base, idx, lim; in __bt_search()
153 indx_t idx = 0; in __bt_snext()
229 indx_t idx = 0; in __bt_sprev()
H A Dbt_delete.c146 indx_t idx = 0; in __bt_stkacq()
375 indx_t cnt, idx, *ip, offset; in __bt_pdelete()
435 pg->lower -= sizeof(indx_t); in __bt_pdelete()
467 indx_t cnt, *ip, offset; in __bt_dleaf()
500 h->lower -= sizeof(indx_t); in __bt_dleaf()
H A Dbt_conv.c65 indx_t i, top; in __bt_pgin()
131 indx_t i, top; in __bt_pgout()
H A Dbt_seq.c273 indx_t idx = 0; in __bt_seqadv()
402 indx_t idx; in bt_rseq_next()
441 indx_t idx; in bt_rseq_prev()
/freebsd/crypto/krb5/src/plugins/kdb/db2/libdb2/hash/
H A Dpage.h85 #define PAGE_OVERHEAD (I_HF_OFFSET + sizeof(indx_t))
88 #define PAIR_OVERHEAD ((sizeof(indx_t) << 1))
96 #define NUM_ENT(P) (REFERENCE((P), indx_t, I_ENTRIES))
100 #define OFFSET(P) (REFERENCE((P), indx_t, I_HF_OFFSET))
110 REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD + sizeof(indx_t))
112 REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD)
H A Dhash.h55 indx_t ndx;
56 indx_t pgndx;
174 indx_t ndx;
175 indx_t pgndx;
179 indx_t key_off;
180 indx_t data_off;
H A Dextern.h69 PAGE16 *__add_bigpage __P((HTAB *, PAGE16 *, indx_t, const u_int8_t));
74 int32_t __big_delete __P((HTAB *, PAGE16 *, indx_t));
85 int32_t __get_bigkey __P((HTAB *, PAGE16 *, indx_t, DBT *));
H A Dhash_page.c72 static int32_t add_bigptr __P((HTAB *, ITEM_INFO *, indx_t));
77 static indx_t prev_realkey __P((PAGE16 *, indx_t));
239 static indx_t
241 prev_realkey(PAGE16 * pagep, indx_t n) in prev_realkey()
266 indx_t ndx; in __delpair()
587 add_bigptr(HTAB * hashp, ITEM_INFO * item_info, indx_t big_pgno) in add_bigptr()
684 __add_bigpage(HTAB * hashp, PAGE16 * pagep, indx_t ndx, const u_int8_t in __add_bigpage()
709 DATA_OFF(pagep, ndx) = (indx_t)ovfl_num;
1184 static indx_t
H A Dhash_bigkey.c89 indx_t key_move_bytes, val_move_bytes; in __big_insert()
143 __big_delete(HTAB *hashp, PAGE16 *pagep, indx_t ndx) in __big_delete()
280 __get_bigkey(HTAB *hashp, PAGE16 *pagep, indx_t ndx, DBT *key) in __get_bigkey()
/freebsd/lib/libc/db/btree/
H A Dbt_split.c46 static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
48 static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
49 static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
81 indx_t nxtindex; in __bt_split()
204 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) { in __bt_split()
215 (nxtindex - skip) * sizeof(indx_t)); in __bt_split()
216 h->lower += sizeof(indx_t); in __bt_split()
333 bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_page()
366 r->lower = BTDATAOFF + sizeof(indx_t); in bt_page()
431 bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen) in bt_root()
[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()
/freebsd/crypto/krb5/src/plugins/kdb/db2/libdb2/recno/
H A Drec_put.c191 indx_t idx, nxtindex; in __rec_iput()
252 < nbytes + sizeof(indx_t)) { in __rec_iput()
261 (nxtindex - idx) * sizeof(indx_t)); in __rec_iput()
262 h->lower += sizeof(indx_t); in __rec_iput()
H A Drec_search.c66 indx_t idx; in __rec_search()
71 indx_t top; in __rec_search()
H A Drec_delete.c152 indx_t *ip, cnt, offset; in __rec_dleaf()
186 h->lower -= sizeof(indx_t); in __rec_dleaf()
/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()

12