Home
last modified time | relevance | path

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

/titanic_50/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/
H A Dpage.h99 #define PAGE_OVERHEAD (I_HF_OFFSET + sizeof(indx_t))
102 #define PAIR_OVERHEAD ((sizeof(indx_t) << 1))
110 #define NUM_ENT(P) (REFERENCE((P), indx_t, I_ENTRIES))
114 #define OFFSET(P) (REFERENCE((P), indx_t, I_HF_OFFSET))
124 REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD + sizeof(indx_t))
126 REFERENCE(P, indx_t, PAGE_OVERHEAD + N * PAIR_OVERHEAD)
H A Dhash.h69 indx_t ndx;
70 indx_t pgndx;
188 indx_t ndx;
189 indx_t pgndx;
193 indx_t key_off;
194 indx_t data_off;
H A Dhash_page.c74 static int32_t add_bigptr __P((HTAB *, ITEM_INFO *, indx_t));
77 static indx_t next_realkey __P((PAGE16 *, indx_t));
80 static indx_t prev_realkey __P((PAGE16 *, indx_t));
257 static indx_t
259 next_realkey(PAGE16 * pagep, indx_t n) in next_realkey()
266 indx_t i;
278 static indx_t
280 prev_realkey(PAGE16 * pagep, indx_t n) in prev_realkey()
308 indx_t ndx;
635 add_bigptr(HTAB * hashp, ITEM_INFO * item_info, indx_t big_pgno) in add_bigptr()
[all …]
H A Dextern.h83 PAGE16 *__add_bigpage __P((HTAB *, PAGE16 *, indx_t, const u_int8_t));
88 int32_t __big_delete __P((HTAB *, PAGE16 *, indx_t));
99 int32_t __get_bigkey __P((HTAB *, PAGE16 *, indx_t, DBT *));
H A Dhash_bigkey.c94 indx_t key_move_bytes, val_move_bytes;
148 __big_delete(HTAB *hashp, PAGE16 *pagep, indx_t ndx) in __big_delete()
295 __get_bigkey(HTAB *hashp, PAGE16 *pagep, indx_t ndx, DBT *key) in __get_bigkey()
/titanic_50/usr/src/lib/krb5/plugins/kdb/db2/libdb2/btree/
H A Dbt_split.c55 __P((BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t));
58 __P((BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t));
60 __P((BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t));
97 indx_t nxtindex;
220 if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
231 (nxtindex - skip) * sizeof(indx_t));
232 h->lower += sizeof(indx_t);
349 indx_t *skip;
383 r->lower = BTDATAOFF + sizeof(indx_t);
454 indx_t *skip;
[all …]
H A Dbtree.h96 indx_t lower; /* lower bound of free space on page */
97 indx_t upper; /* upper bound of free space on page */
98 indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */
104 sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t))
105 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))
258 indx_t index; /* the index on the page */
263 indx_t index; /* the index on the page */
346 indx_t bt_ovflsize; /* cut-off for key/data overflow */
H A Dbt_put.c79 indx_t idx, nxtindex;
213 if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
222 (nxtindex - idx) * sizeof(indx_t));
223 h->lower += sizeof(indx_t);
297 if (h->upper - h->lower < nbytes + sizeof(indx_t))
H A Dbt_open.c130 b.psize & (sizeof(indx_t) - 1)))
250 m.psize & (sizeof(indx_t) - 1))
303 (sizeof(indx_t) + NBLEAFDBT(0, 0));
304 if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t))
306 NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t);
H A Dbt_search.c74 indx_t base, idx, lim;
162 indx_t idx;
242 indx_t idx;
H A Dbt_delete.c155 indx_t idx;
387 indx_t cnt, idx, *ip, offset;
447 pg->lower -= sizeof(indx_t);
483 indx_t cnt, *ip, offset;
516 h->lower -= sizeof(indx_t);
H A Dbt_conv.c69 indx_t i, top;
137 indx_t i, top;
H A Dbt_debug.c210 indx_t cur, top, lim;
237 lim = (pgsize - BTDATAOFF) / sizeof(indx_t);
H A Dbt_seq.c279 indx_t idx;
828 indx_t idx;
/titanic_50/usr/src/lib/krb5/plugins/kdb/db2/libdb2/recno/
H A Drec_put.c201 indx_t idx, nxtindex;
261 if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
270 (nxtindex - idx) * sizeof(indx_t));
271 h->lower += sizeof(indx_t);
H A Drec_search.c71 register indx_t idx;
76 indx_t top;
H A Drec_delete.c162 indx_t *ip, cnt, offset;
196 h->lower -= sizeof(indx_t);
H A Drec_get.c186 indx_t len;
/titanic_50/usr/src/lib/krb5/plugins/kdb/db2/libdb2/include/
H A Ddb-int.h173 typedef u_int16_t indx_t; typedef