/dports/misc/rump/buildrump.sh-b914579/src/lib/libc/db/btree/ |
H A D | bt_split.c | 90 indx_t nxtindex; in __bt_split() 113 _DBFIT(ilen, indx_t); in __bt_split() 114 h->upper -= (indx_t)ilen; in __bt_split() 502 _DBFIT(sz, indx_t); in bt_rroot() 636 _DBFIT(temp, indx_t); in bt_psplit() 637 full = (indx_t)temp; in bt_psplit() 692 _DBFIT(temp, indx_t); in bt_psplit() 693 used += (indx_t)temp; in bt_psplit() 707 _DBFIT(temp, indx_t); in bt_psplit() 772 _DBFIT(temp, indx_t); in bt_psplit() [all …]
|
H A D | btree.h | 83 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)) 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 */ 298 indx_t index; /* the index on the page */ [all …]
|
H A D | bt_open.c | 129 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()
|
H A D | bt_put.c | 76 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()
|
/dports/sysutils/vector/vector-0.10.0/cargo-crates/krb5-src-0.2.4+1.18.2/krb5/src/plugins/kdb/db2/libdb2/hash/ |
H A D | page.h | 85 #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 D | hash.h | 55 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 D | hash_page.c | 72 static int32_t add_bigptr __P((HTAB *, ITEM_INFO *, indx_t)); 75 static indx_t next_realkey __P((PAGE16 *, indx_t)); 78 static indx_t prev_realkey __P((PAGE16 *, indx_t)); 255 static indx_t 257 next_realkey(PAGE16 * pagep, indx_t n) in next_realkey() 264 indx_t i; 276 static indx_t 278 prev_realkey(PAGE16 * pagep, indx_t n) in prev_realkey() 306 indx_t ndx; 757 DATA_OFF(pagep, ndx) = (indx_t)ovfl_num; [all …]
|
/dports/security/krb5/krb5-1.19.2/src/plugins/kdb/db2/libdb2/hash/ |
H A D | page.h | 85 #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 D | hash.h | 55 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 D | hash_page.c | 72 static int32_t add_bigptr __P((HTAB *, ITEM_INFO *, indx_t)); 75 static indx_t next_realkey __P((PAGE16 *, indx_t)); 78 static indx_t prev_realkey __P((PAGE16 *, indx_t)); 255 static indx_t 257 next_realkey(PAGE16 * pagep, indx_t n) in next_realkey() 264 indx_t i; 276 static indx_t 278 prev_realkey(PAGE16 * pagep, indx_t n) in prev_realkey() 306 indx_t ndx; 757 DATA_OFF(pagep, ndx) = (indx_t)ovfl_num; [all …]
|
/dports/sysutils/vector/vector-0.10.0/cargo-crates/krb5-src-0.2.4+1.18.2/krb5/src/plugins/kdb/db2/libdb2/btree/ |
H A D | bt_split.c | 95 indx_t nxtindex; 219 < nbytes + sizeof(indx_t)) { 231 h->lower += sizeof(indx_t); 351 indx_t *skip; 456 indx_t *skip; 623 indx_t *pskip; 698 used += nbytes + sizeof(indx_t); 738 skip = (indx_t)-1; 748 skip = (indx_t)-1; 778 r->lower += sizeof(indx_t); [all …]
|
H A D | btree.h | 81 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 D | bt_put.c | 77 indx_t idx, nxtindex; 212 < nbytes + sizeof(indx_t)) { 221 (nxtindex - idx) * sizeof(indx_t)); 222 h->lower += sizeof(indx_t); 296 if ((u_int32_t)h->upper - (u_int32_t)h->lower < nbytes + sizeof(indx_t))
|
/dports/security/krb5/krb5-1.19.2/src/plugins/kdb/db2/libdb2/btree/ |
H A D | bt_split.c | 95 indx_t nxtindex; 219 < nbytes + sizeof(indx_t)) { 231 h->lower += sizeof(indx_t); 351 indx_t *skip; 456 indx_t *skip; 623 indx_t *pskip; 698 used += nbytes + sizeof(indx_t); 738 skip = (indx_t)-1; 748 skip = (indx_t)-1; 778 r->lower += sizeof(indx_t); [all …]
|
H A D | btree.h | 81 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 D | bt_put.c | 77 indx_t idx, nxtindex; 212 < nbytes + sizeof(indx_t)) { 221 (nxtindex - idx) * sizeof(indx_t)); 222 h->lower += sizeof(indx_t); 296 if ((u_int32_t)h->upper - (u_int32_t)h->lower < nbytes + sizeof(indx_t))
|
/dports/devel/global/global-6.6.7/libdb/ |
H A D | bt_split.c | 95 indx_t nxtindex; 230 h->lower += sizeof(indx_t); 346 indx_t *skip; 380 r->lower = BTDATAOFF + sizeof(indx_t); 450 indx_t *skip; 611 indx_t *pskip; 685 used += nbytes + sizeof(indx_t); 698 l->lower += (off + 1) * sizeof(indx_t); 761 r->lower += off * sizeof(indx_t); 765 r->lower += sizeof(indx_t); [all …]
|
H A D | btree.h | 92 indx_t lower; /**< lower bound of free space on page */ 93 indx_t upper; /**< upper bound of free space on page */ 94 indx_t linp[1]; /**< indx_t-aligned VAR. LENGTH DATA */ 100 sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t)) 101 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t)) 257 indx_t index; /**< the index on the page */ 262 indx_t index; /**< the index on the page */ 351 indx_t bt_ovflsize; /**< cut-off for key/data overflow */
|
H A D | bt_put.c | 81 indx_t index, nxtindex; 208 if (h->upper - h->lower < nbytes + sizeof(indx_t)) { 217 (nxtindex - index) * sizeof(indx_t)); 218 h->lower += sizeof(indx_t); 289 if (h->upper - h->lower < nbytes + sizeof(indx_t))
|
/dports/lang/micropython/berkeley-db-1.xx-35aaec4/btree/ |
H A D | bt_split.c | 95 indx_t nxtindex; 231 h->lower += sizeof(indx_t); 350 indx_t *skip; 384 r->lower = BTDATAOFF + sizeof(indx_t); 455 indx_t *skip; 622 indx_t *pskip; 696 used += nbytes + sizeof(indx_t); 709 l->lower += (off + 1) * sizeof(indx_t); 772 r->lower += off * sizeof(indx_t); 776 r->lower += sizeof(indx_t); [all …]
|
H A D | btree.h | 86 indx_t lower; /* lower bound of free space on page */ 87 indx_t upper; /* upper bound of free space on page */ 88 indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */ 94 sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t)) 95 #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t)) 248 indx_t index; /* the index on the page */ 253 indx_t index; /* the index on the page */ 336 indx_t bt_ovflsize; /* cut-off for key/data overflow */
|
H A D | bt_put.c | 77 indx_t index, nxtindex; 204 if (h->upper - h->lower < nbytes + sizeof(indx_t)) { 213 (nxtindex - index) * sizeof(indx_t)); 214 h->lower += sizeof(indx_t); 288 if (h->upper - h->lower < nbytes + sizeof(indx_t))
|
/dports/editors/vigor/vigor-0.016/db/btree/ |
H A D | btree.h | 81 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 D | bt_split.c | 95 indx_t nxtindex; 229 (nxtindex - skip) * sizeof(indx_t)); 230 h->lower += sizeof(indx_t); 347 indx_t *skip; 381 r->lower = BTDATAOFF + sizeof(indx_t); 452 indx_t *skip; 616 indx_t *pskip; 702 l->lower += (off + 1) * sizeof(indx_t); 765 r->lower += off * sizeof(indx_t); 769 r->lower += sizeof(indx_t); [all …]
|
H A D | bt_put.c | 77 indx_t index, nxtindex; 204 if (h->upper - h->lower < nbytes + sizeof(indx_t)) { 213 (nxtindex - index) * sizeof(indx_t)); 214 h->lower += sizeof(indx_t); 287 if (h->upper - h->lower < nbytes + sizeof(indx_t))
|