h 37 htags/lexcommon.h lexcommon.h requires the lex_symbol_generation_rule(x) macro for each language h 63 libdb/bt_conv.c PAGE *h; h 75 libdb/bt_conv.c h = pp; h 76 libdb/bt_conv.c M_32_SWAP(h->pgno); h 77 libdb/bt_conv.c M_32_SWAP(h->prevpg); h 78 libdb/bt_conv.c M_32_SWAP(h->nextpg); h 79 libdb/bt_conv.c M_32_SWAP(h->flags); h 80 libdb/bt_conv.c M_16_SWAP(h->lower); h 81 libdb/bt_conv.c M_16_SWAP(h->upper); h 83 libdb/bt_conv.c top = NEXTINDEX(h); h 84 libdb/bt_conv.c if ((h->flags & P_TYPE) == P_BINTERNAL) h 86 libdb/bt_conv.c M_16_SWAP(h->linp[i]); h 87 libdb/bt_conv.c p = (char *)GETBINTERNAL(h, i); h 99 libdb/bt_conv.c else if ((h->flags & P_TYPE) == P_BLEAF) h 101 libdb/bt_conv.c M_16_SWAP(h->linp[i]); h 102 libdb/bt_conv.c p = (char *)GETBLEAF(h, i); h 131 libdb/bt_conv.c PAGE *h; h 143 libdb/bt_conv.c h = pp; h 144 libdb/bt_conv.c top = NEXTINDEX(h); h 145 libdb/bt_conv.c if ((h->flags & P_TYPE) == P_BINTERNAL) h 147 libdb/bt_conv.c p = (char *)GETBINTERNAL(h, i); h 158 libdb/bt_conv.c M_16_SWAP(h->linp[i]); h 160 libdb/bt_conv.c else if ((h->flags & P_TYPE) == P_BLEAF) h 162 libdb/bt_conv.c p = (char *)GETBLEAF(h, i); h 182 libdb/bt_conv.c M_16_SWAP(h->linp[i]); h 185 libdb/bt_conv.c M_32_SWAP(h->pgno); h 186 libdb/bt_conv.c M_32_SWAP(h->prevpg); h 187 libdb/bt_conv.c M_32_SWAP(h->nextpg); h 188 libdb/bt_conv.c M_32_SWAP(h->flags); h 189 libdb/bt_conv.c M_16_SWAP(h->lower); h 190 libdb/bt_conv.c M_16_SWAP(h->upper); h 64 libdb/bt_debug.c PAGE *h; h 91 libdb/bt_debug.c for (i = P_ROOT; (h = mpool_get(t->bt_mp, i, 0)) != NULL; ++i) { h 92 libdb/bt_debug.c __bt_dpage(h); h 93 libdb/bt_debug.c (void)mpool_put(t->bt_mp, h, 0); h 104 libdb/bt_debug.c __bt_dmpage(h) h 105 libdb/bt_debug.c PAGE *h; h 110 libdb/bt_debug.c m = (BTMETA *)h; h 143 libdb/bt_debug.c PAGE *h; h 146 libdb/bt_debug.c if ((h = mpool_get(t->bt_mp, pgno, 0)) != NULL) { h 147 libdb/bt_debug.c __bt_dpage(h); h 148 libdb/bt_debug.c (void)mpool_put(t->bt_mp, h, 0); h 159 libdb/bt_debug.c __bt_dpage(h) h 160 libdb/bt_debug.c PAGE *h; h 169 libdb/bt_debug.c (void)fprintf(stderr, " page %d: (", h->pgno); h 172 libdb/bt_debug.c if (h->flags & flag) { \ h 186 libdb/bt_debug.c (void)fprintf(stderr, "\tprev %2d next %2d", h->prevpg, h->nextpg); h 187 libdb/bt_debug.c if (h->flags & P_OVERFLOW) h 190 libdb/bt_debug.c top = NEXTINDEX(h); h 192 libdb/bt_debug.c h->lower, h->upper, top); h 194 libdb/bt_debug.c (void)fprintf(stderr, "\t[%03d] %4d ", cur, h->linp[cur]); h 195 libdb/bt_debug.c switch (h->flags & P_TYPE) { h 197 libdb/bt_debug.c bi = GETBINTERNAL(h, cur); h 207 libdb/bt_debug.c ri = GETRINTERNAL(h, cur); h 212 libdb/bt_debug.c bl = GETBLEAF(h, cur); h 231 libdb/bt_debug.c rl = GETRLEAF(h, cur); h 259 libdb/bt_debug.c PAGE *h; h 267 libdb/bt_debug.c for (i = P_ROOT; (h = mpool_get(t->bt_mp, i, 0)) != NULL; ++i) { h 268 libdb/bt_debug.c switch (h->flags & P_TYPE) { h 272 libdb/bt_debug.c ifree += h->upper - h->lower; h 277 libdb/bt_debug.c lfree += h->upper - h->lower; h 278 libdb/bt_debug.c nkeys += NEXTINDEX(h); h 284 libdb/bt_debug.c (void)mpool_put(t->bt_mp, h, 0); h 289 libdb/bt_debug.c h = mpool_get(t->bt_mp, i, 0); h 290 libdb/bt_debug.c if (h->flags & (P_BLEAF|P_RLEAF)) { h 293 libdb/bt_debug.c (void)mpool_put(t->bt_mp, h, 0); h 297 libdb/bt_debug.c GETRINTERNAL(h, 0)->pgno : h 298 libdb/bt_debug.c GETBINTERNAL(h, 0)->pgno; h 299 libdb/bt_debug.c (void)mpool_put(t->bt_mp, h, 0); h 73 libdb/bt_delete.c PAGE *h; h 103 libdb/bt_delete.c if ((h = mpool_get(t->bt_mp, c->pg.pgno, 0)) == NULL) h 110 libdb/bt_delete.c if (NEXTINDEX(h) == 1) h 111 libdb/bt_delete.c if (__bt_stkacq(t, &h, &t->bt_cursor)) h 114 libdb/bt_delete.c status = __bt_dleaf(t, NULL, h, c->pg.index); h 116 libdb/bt_delete.c if (NEXTINDEX(h) == 0 && status == RET_SUCCESS) { h 117 libdb/bt_delete.c if (__bt_pdelete(t, h)) h 121 libdb/bt_delete.c h, status == RET_SUCCESS ? MPOOL_DIRTY : 0); h 155 libdb/bt_delete.c PAGE *h; h 165 libdb/bt_delete.c h = *hp; h 166 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 169 libdb/bt_delete.c h = e->page; h 172 libdb/bt_delete.c if (h->pgno == c->pg.pgno) h 181 libdb/bt_delete.c while (h->pgno != c->pg.pgno) { h 182 libdb/bt_delete.c if ((nextpg = h->nextpg) == P_INVALID) h 184 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 189 libdb/bt_delete.c if ((h = mpool_get(t->bt_mp, parent->pgno, 0)) == NULL) h 193 libdb/bt_delete.c if (parent->index != NEXTINDEX(h) - 1) { h 195 libdb/bt_delete.c BT_PUSH(t, h->pgno, index); h 198 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 204 libdb/bt_delete.c bi = GETBINTERNAL(h, index); h 209 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 212 libdb/bt_delete.c if ((h = mpool_get(t->bt_mp, pgno, 0)) == NULL) h 216 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 217 libdb/bt_delete.c if ((h = mpool_get(t->bt_mp, nextpg, 0)) == NULL) h 221 libdb/bt_delete.c if (h->pgno == c->pg.pgno) h 225 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 228 libdb/bt_delete.c h = e->page; h 236 libdb/bt_delete.c while (h->pgno != c->pg.pgno) { h 237 libdb/bt_delete.c if ((prevpg = h->prevpg) == P_INVALID) h 239 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 244 libdb/bt_delete.c if ((h = mpool_get(t->bt_mp, parent->pgno, 0)) == NULL) h 250 libdb/bt_delete.c BT_PUSH(t, h->pgno, index); h 253 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 259 libdb/bt_delete.c bi = GETBINTERNAL(h, index); h 263 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 266 libdb/bt_delete.c if ((h = mpool_get(t->bt_mp, pgno, 0)) == NULL) h 269 libdb/bt_delete.c index = NEXTINDEX(h) - 1; h 272 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 273 libdb/bt_delete.c if ((h = mpool_get(t->bt_mp, prevpg, 0)) == NULL) h 278 libdb/bt_delete.c ret: mpool_put(t->bt_mp, h, 0); h 299 libdb/bt_delete.c PAGE *h; h 318 libdb/bt_delete.c h = e->page; h 320 libdb/bt_delete.c if (__bt_dleaf(t, key, h, e->index)) { h 321 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 325 libdb/bt_delete.c if (NEXTINDEX(h) == 0) { h 326 libdb/bt_delete.c if (__bt_pdelete(t, h)) h 329 libdb/bt_delete.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 333 libdb/bt_delete.c } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0); h 336 libdb/bt_delete.c if (e->index == NEXTINDEX(h)) h 343 libdb/bt_delete.c if (__bt_dleaf(t, key, h, e->index) == RET_ERROR) { h 344 libdb/bt_delete.c mpool_put(t->bt_mp, h, 0); h 352 libdb/bt_delete.c if (NEXTINDEX(h) == 0) { h 353 libdb/bt_delete.c if (__bt_pdelete(t, h)) h 359 libdb/bt_delete.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 381 libdb/bt_delete.c __bt_pdelete(t, h) h 383 libdb/bt_delete.c PAGE *h; h 456 libdb/bt_delete.c if (h->pgno == P_ROOT) { h 457 libdb/bt_delete.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 460 libdb/bt_delete.c return (__bt_relink(t, h) || __bt_free(t, h)); h 477 libdb/bt_delete.c __bt_dleaf(t, key, h, index) h 480 libdb/bt_delete.c PAGE *h; h 492 libdb/bt_delete.c t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index == index && h 493 libdb/bt_delete.c __bt_curdel(t, key, h, index)) h 497 libdb/bt_delete.c to = bl = GETBLEAF(h, index); h 506 libdb/bt_delete.c from = (char *)h + h->upper; h 508 libdb/bt_delete.c h->upper += nbytes; h 511 libdb/bt_delete.c offset = h->linp[index]; h 512 libdb/bt_delete.c for (cnt = index, ip = &h->linp[0]; cnt--; ++ip) h 515 libdb/bt_delete.c for (cnt = NEXTINDEX(h) - index; --cnt; ++ip) h 517 libdb/bt_delete.c h->lower -= sizeof(indx_t); h 522 libdb/bt_delete.c t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index > index) h 542 libdb/bt_delete.c __bt_curdel(t, key, h, index) h 545 libdb/bt_delete.c PAGE *h; h 568 libdb/bt_delete.c e.page = h; h 578 libdb/bt_delete.c e.page = h; h 586 libdb/bt_delete.c if (index < NEXTINDEX(h) - 1) { h 587 libdb/bt_delete.c e.page = h; h 595 libdb/bt_delete.c if (index == 0 && h->prevpg != P_INVALID) { h 596 libdb/bt_delete.c if ((pg = mpool_get(t->bt_mp, h->prevpg, 0)) == NULL) h 607 libdb/bt_delete.c if (index == NEXTINDEX(h) - 1 && h->nextpg != P_INVALID) { h 608 libdb/bt_delete.c if ((pg = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL) h 622 libdb/bt_delete.c e.page = h; h 641 libdb/bt_delete.c __bt_relink(t, h) h 643 libdb/bt_delete.c PAGE *h; h 647 libdb/bt_delete.c if (h->nextpg != P_INVALID) { h 648 libdb/bt_delete.c if ((pg = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL) h 650 libdb/bt_delete.c pg->prevpg = h->prevpg; h 653 libdb/bt_delete.c if (h->prevpg != P_INVALID) { h 654 libdb/bt_delete.c if ((pg = mpool_get(t->bt_mp, h->prevpg, 0)) == NULL) h 656 libdb/bt_delete.c pg->nextpg = h->nextpg; h 90 libdb/bt_overflow.c PAGE *h; h 116 libdb/bt_overflow.c for (p = *buf;; p = (char *)p + nb, pg = h->nextpg) { h 117 libdb/bt_overflow.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 121 libdb/bt_overflow.c memmove(p, (char *)h + BTDATAOFF, nb); h 122 libdb/bt_overflow.c mpool_put(t->bt_mp, h, 0); h 147 libdb/bt_overflow.c PAGE *h, *last; h 159 libdb/bt_overflow.c p = (char *)p + plen, last = h) { h 160 libdb/bt_overflow.c if ((h = __bt_new(t, &npg)) == NULL) h 163 libdb/bt_overflow.c h->pgno = npg; h 164 libdb/bt_overflow.c h->nextpg = h->prevpg = P_INVALID; h 165 libdb/bt_overflow.c h->flags = P_OVERFLOW; h 166 libdb/bt_overflow.c h->lower = h->upper = 0; h 169 libdb/bt_overflow.c memmove((char *)h + BTDATAOFF, p, nb); h 172 libdb/bt_overflow.c last->nextpg = h->pgno; h 175 libdb/bt_overflow.c *pg = h->pgno; h 178 libdb/bt_overflow.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 200 libdb/bt_overflow.c PAGE *h; h 212 libdb/bt_overflow.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 216 libdb/bt_overflow.c if (h->flags & P_PRESERVE) { h 217 libdb/bt_overflow.c mpool_put(t->bt_mp, h, 0); h 223 libdb/bt_overflow.c pg = h->nextpg; h 224 libdb/bt_overflow.c __bt_free(t, h); h 227 libdb/bt_overflow.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 59 libdb/bt_page.c __bt_free(t, h) h 61 libdb/bt_page.c PAGE *h; h 64 libdb/bt_page.c h->prevpg = P_INVALID; h 65 libdb/bt_page.c h->nextpg = t->bt_free; h 66 libdb/bt_page.c t->bt_free = h->pgno; h 70 libdb/bt_page.c return (mpool_put(t->bt_mp, h, MPOOL_DIRTY)); h 89 libdb/bt_page.c PAGE *h; h 92 libdb/bt_page.c (h = mpool_get(t->bt_mp, t->bt_free, 0)) != NULL) { h 94 libdb/bt_page.c t->bt_free = h->nextpg; h 96 libdb/bt_page.c return (h); h 81 libdb/bt_put.c PAGE *h; h 159 libdb/bt_put.c if ((h = mpool_get(t->bt_mp, t->bt_cursor.pg.pgno, 0)) == NULL) h 172 libdb/bt_put.c h = e->page; h 185 libdb/bt_put.c mpool_put(t->bt_mp, h, 0); h 195 libdb/bt_put.c delete: if (__bt_dleaf(t, key, h, index) == RET_ERROR) { h 196 libdb/bt_put.c mpool_put(t->bt_mp, h, 0); h 209 libdb/bt_put.c if (h->upper - h->lower < nbytes + sizeof(indx_t)) { h 210 libdb/bt_put.c if ((status = __bt_split(t, h, key, h 216 libdb/bt_put.c if (index < (nxtindex = NEXTINDEX(h))) h 217 libdb/bt_put.c memmove(h->linp + index + 1, h->linp + index, h 219 libdb/bt_put.c h->lower += sizeof(indx_t); h 221 libdb/bt_put.c h->linp[index] = h->upper -= nbytes; h 222 libdb/bt_put.c dest = (char *)h + h->upper; h 228 libdb/bt_put.c t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index >= index) h 232 libdb/bt_put.c if (h->nextpg == P_INVALID) { h 233 libdb/bt_put.c if (index == NEXTINDEX(h) - 1) { h 236 libdb/bt_put.c t->bt_last.pgno = h->pgno; h 238 libdb/bt_put.c } else if (h->prevpg == P_INVALID) { h 242 libdb/bt_put.c t->bt_last.pgno = h->pgno; h 246 libdb/bt_put.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 274 libdb/bt_put.c PAGE *h; h 278 libdb/bt_put.c if ((h = mpool_get(t->bt_mp, t->bt_last.pgno, 0)) == NULL) { h 282 libdb/bt_put.c t->bt_cur.page = h; h 290 libdb/bt_put.c if (h->upper - h->lower < nbytes + sizeof(indx_t)) h 296 libdb/bt_put.c if (t->bt_cur.index != NEXTINDEX(h) - 1) h 321 libdb/bt_put.c mpool_put(t->bt_mp, h, 0); h 70 libdb/bt_search.c PAGE *h; h 77 libdb/bt_search.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 81 libdb/bt_search.c t->bt_cur.page = h; h 82 libdb/bt_search.c for (base = 0, lim = NEXTINDEX(h); lim; lim >>= 1) { h 85 libdb/bt_search.c if (h->flags & P_BLEAF) { h 105 libdb/bt_search.c if (h->flags & P_BLEAF) { h 108 libdb/bt_search.c h->prevpg != P_INVALID && h 109 libdb/bt_search.c __bt_sprev(t, h, key, exactp)) h 111 libdb/bt_search.c if (base == NEXTINDEX(h) && h 112 libdb/bt_search.c h->nextpg != P_INVALID && h 113 libdb/bt_search.c __bt_snext(t, h, key, exactp)) h 130 libdb/bt_search.c next: BT_PUSH(t, h->pgno, index); h 131 libdb/bt_search.c pg = GETBINTERNAL(h, index)->pgno; h 132 libdb/bt_search.c mpool_put(t->bt_mp, h, 0); h 150 libdb/bt_search.c __bt_snext(t, h, key, exactp) h 152 libdb/bt_search.c PAGE *h; h 162 libdb/bt_search.c if ((e.page = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL) h 166 libdb/bt_search.c mpool_put(t->bt_mp, h, 0); h 189 libdb/bt_search.c __bt_sprev(t, h, key, exactp) h 191 libdb/bt_search.c PAGE *h; h 201 libdb/bt_search.c if ((e.page = mpool_get(t->bt_mp, h->prevpg, 0)) == NULL) h 205 libdb/bt_search.c mpool_put(t->bt_mp, h, 0); h 159 libdb/bt_seq.c PAGE *h; h 183 libdb/bt_seq.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 187 libdb/bt_seq.c if (NEXTINDEX(h) == 0) { h 188 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 192 libdb/bt_seq.c if (h->flags & (P_BLEAF | P_RLEAF)) h 194 libdb/bt_seq.c pg = GETBINTERNAL(h, 0)->pgno; h 195 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 197 libdb/bt_seq.c ep->page = h; h 204 libdb/bt_seq.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 208 libdb/bt_seq.c if (NEXTINDEX(h) == 0) { h 209 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 213 libdb/bt_seq.c if (h->flags & (P_BLEAF | P_RLEAF)) h 215 libdb/bt_seq.c pg = GETBINTERNAL(h, NEXTINDEX(h) - 1)->pgno; h 216 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 219 libdb/bt_seq.c ep->page = h; h 220 libdb/bt_seq.c ep->index = NEXTINDEX(h) - 1; h 247 libdb/bt_seq.c PAGE *h; h 270 libdb/bt_seq.c if ((h = mpool_get(t->bt_mp, c->pg.pgno, 0)) == NULL) h 287 libdb/bt_seq.c if (++index == NEXTINDEX(h)) { h 288 libdb/bt_seq.c pg = h->nextpg; h 289 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 292 libdb/bt_seq.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 305 libdb/bt_seq.c ep->page = h; h 311 libdb/bt_seq.c pg = h->prevpg; h 312 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 315 libdb/bt_seq.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 317 libdb/bt_seq.c index = NEXTINDEX(h) - 1; h 323 libdb/bt_seq.c ep->page = h; h 349 libdb/bt_seq.c PAGE *h; h 375 libdb/bt_seq.c h = ep->page; h 389 libdb/bt_seq.c if (h->prevpg == P_INVALID) h 391 libdb/bt_seq.c if (h->pgno != save.page->pgno) h 392 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 393 libdb/bt_seq.c if ((h = mpool_get(t->bt_mp, h 394 libdb/bt_seq.c h->prevpg, 0)) == NULL) { h 395 libdb/bt_seq.c if (h->pgno == save.page->pgno) h 400 libdb/bt_seq.c ep->page = h; h 401 libdb/bt_seq.c ep->index = NEXTINDEX(h); h 411 libdb/bt_seq.c if (h->pgno != save.page->pgno) h 412 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 420 libdb/bt_seq.c h = ep->page; h 421 libdb/bt_seq.c pg = h->nextpg; h 422 libdb/bt_seq.c mpool_put(t->bt_mp, h, 0); h 425 libdb/bt_seq.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 428 libdb/bt_seq.c ep->page = h; h 95 libdb/bt_split.c PAGE *h, *l, *r, *lchild, *rchild; h 109 libdb/bt_split.c h = sp->pgno == P_ROOT ? h 112 libdb/bt_split.c if (h == NULL) h 119 libdb/bt_split.c h->linp[skip] = h->upper -= ilen; h 120 libdb/bt_split.c dest = (char *)h + h->upper; h 160 libdb/bt_split.c if ((h = mpool_get(t->bt_mp, parent->pgno, 0)) == NULL) h 192 libdb/bt_split.c (h->prevpg != P_INVALID || skip > 1)) { h 219 libdb/bt_split.c if (h->upper - h->lower < nbytes + sizeof(indx_t)) { h 220 libdb/bt_split.c sp = h; h 221 libdb/bt_split.c h = h->pgno == P_ROOT ? h 222 libdb/bt_split.c bt_root(t, h, &l, &r, &skip, nbytes) : h 223 libdb/bt_split.c bt_page(t, h, &l, &r, &skip, nbytes); h 224 libdb/bt_split.c if (h == NULL) h 228 libdb/bt_split.c if (skip < (nxtindex = NEXTINDEX(h))) h 229 libdb/bt_split.c memmove(h->linp + skip + 1, h->linp + skip, h 231 libdb/bt_split.c h->lower += sizeof(indx_t); h 238 libdb/bt_split.c h->linp[skip] = h->upper -= nbytes; h 239 libdb/bt_split.c dest = (char *)h + h->linp[skip]; h 244 libdb/bt_split.c h->linp[skip] = h->upper -= nbytes; h 245 libdb/bt_split.c dest = (char *)h + h->linp[skip]; h 259 libdb/bt_split.c dest = (char *)h + h->linp[skip - 1]; h 266 libdb/bt_split.c h->linp[skip] = h->upper -= nbytes; h 267 libdb/bt_split.c dest = (char *)h + h->linp[skip]; h 277 libdb/bt_split.c dest = (char *)h + h->linp[skip - 1]; h 284 libdb/bt_split.c h->linp[skip] = h->upper -= nbytes; h 285 libdb/bt_split.c dest = (char *)h + h->linp[skip]; h 295 libdb/bt_split.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 345 libdb/bt_split.c bt_page(t, h, lp, rp, skip, ilen) h 347 libdb/bt_split.c PAGE *h, **lp, **rp; h 363 libdb/bt_split.c r->nextpg = h->nextpg; h 364 libdb/bt_split.c r->prevpg = h->pgno; h 365 libdb/bt_split.c r->flags = h->flags & P_TYPE; h 377 libdb/bt_split.c if (h->nextpg == P_INVALID && *skip == NEXTINDEX(h)) { h 381 libdb/bt_split.c h->nextpg = r->pgno; h 384 libdb/bt_split.c *lp = h; h 397 libdb/bt_split.c l->pgno = h->pgno; h 399 libdb/bt_split.c l->prevpg = h->prevpg; h 402 libdb/bt_split.c l->flags = h->flags & P_TYPE; h 405 libdb/bt_split.c if (h->nextpg != P_INVALID) { h 406 libdb/bt_split.c if ((tp = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL) { h 422 libdb/bt_split.c tp = bt_psplit(t, h, l, r, skip, ilen); h 425 libdb/bt_split.c memmove(h, l, t->bt_psize); h 427 libdb/bt_split.c tp = h; h 430 libdb/bt_split.c *lp = h; h 450 libdb/bt_split.c bt_root(t, h, lp, rp, skip, ilen) h 452 libdb/bt_split.c PAGE *h, **lp, **rp; h 474 libdb/bt_split.c l->flags = r->flags = h->flags & P_TYPE; h 477 libdb/bt_split.c tp = bt_psplit(t, h, l, r, skip, ilen); h 497 libdb/bt_split.c bt_rroot(t, h, l, r) h 499 libdb/bt_split.c PAGE *h, *l, *r; h 504 libdb/bt_split.c h->linp[0] = h->upper = t->bt_psize - NRINTERNAL; h 505 libdb/bt_split.c dest = (char *)h + h->upper; h 509 libdb/bt_split.c h->linp[1] = h->upper -= NRINTERNAL; h 510 libdb/bt_split.c dest = (char *)h + h->upper; h 514 libdb/bt_split.c h->lower = BTDATAOFF + 2 * sizeof(indx_t); h 517 libdb/bt_split.c h->flags &= ~P_TYPE; h 518 libdb/bt_split.c h->flags |= P_RINTERNAL; h 519 libdb/bt_split.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 537 libdb/bt_split.c bt_broot(t, h, l, r) h 539 libdb/bt_split.c PAGE *h, *l, *r; h 555 libdb/bt_split.c h->linp[0] = h->upper = t->bt_psize - nbytes; h 556 libdb/bt_split.c dest = (char *)h + h->upper; h 559 libdb/bt_split.c switch (h->flags & P_TYPE) { h 563 libdb/bt_split.c h->linp[1] = h->upper -= nbytes; h 564 libdb/bt_split.c dest = (char *)h + h->upper; h 579 libdb/bt_split.c h->linp[1] = h->upper -= nbytes; h 580 libdb/bt_split.c dest = (char *)h + h->upper; h 589 libdb/bt_split.c h->lower = BTDATAOFF + 2 * sizeof(indx_t); h 592 libdb/bt_split.c h->flags &= ~P_TYPE; h 593 libdb/bt_split.c h->flags |= P_BINTERNAL; h 594 libdb/bt_split.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 614 libdb/bt_split.c bt_psplit(t, h, l, r, pskip, ilen) h 616 libdb/bt_split.c PAGE *h, *l, *r; h 641 libdb/bt_split.c for (nxt = off = 0, top = NEXTINDEX(h); nxt < top; ++off) { h 646 libdb/bt_split.c switch (h->flags & P_TYPE) { h 648 libdb/bt_split.c src = bi = GETBINTERNAL(h, nxt); h 653 libdb/bt_split.c src = bl = GETBLEAF(h, nxt); h 658 libdb/bt_split.c src = GETRINTERNAL(h, nxt); h 663 libdb/bt_split.c src = rl = GETRLEAF(h, nxt); h 714 libdb/bt_split.c if (F_ISSET(c, CURS_INIT) && c->pg.pgno == h->pgno) { h 743 libdb/bt_split.c switch (h->flags & P_TYPE) { h 745 libdb/bt_split.c src = bi = GETBINTERNAL(h, nxt); h 749 libdb/bt_split.c src = bl = GETBLEAF(h, nxt); h 753 libdb/bt_split.c src = GETRINTERNAL(h, nxt); h 757 libdb/bt_split.c src = rl = GETRLEAF(h, nxt); h 796 libdb/bt_split.c PAGE *h; h 798 libdb/bt_split.c if ((h = mpool_get(t->bt_mp, pg, 0)) == NULL) h 800 libdb/bt_split.c h->flags |= P_PRESERVE; h 801 libdb/bt_split.c mpool_put(t->bt_mp, h, MPOOL_DIRTY); h 820 libdb/bt_split.c rec_total(h) h 821 libdb/bt_split.c PAGE *h; h 826 libdb/bt_split.c for (recs = 0, nxt = 0, top = NEXTINDEX(h); nxt < top; ++nxt) h 827 libdb/bt_split.c recs += GETRINTERNAL(h, nxt)->nrecs; h 164 libdb/bt_utils.c PAGE *h; h 174 libdb/bt_utils.c h = e->page; h 175 libdb/bt_utils.c if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & P_BLEAF)) h 179 libdb/bt_utils.c if (h->flags & P_BLEAF) { h 180 libdb/bt_utils.c bl = GETBLEAF(h, e->index); h 188 libdb/bt_utils.c bi = GETBINTERNAL(h, e->index); h 118 libglibc/obstack.c # define CALL_CHUNKFUN(h, size) \ h 119 libglibc/obstack.c (((h) -> use_extra_arg) \ h 120 libglibc/obstack.c ? (*(h)->chunkfun) ((h)->extra_arg, (size)) \ h 121 libglibc/obstack.c : (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size))) h 123 libglibc/obstack.c # define CALL_FREEFUN(h, old_chunk) \ h 125 libglibc/obstack.c if ((h) -> use_extra_arg) \ h 126 libglibc/obstack.c (*(h)->freefun) ((h)->extra_arg, (old_chunk)); \ h 128 libglibc/obstack.c (*(void (*) (void *)) (h)->freefun) ((old_chunk)); \ h 141 libglibc/obstack.c _obstack_begin (struct obstack *h, h 167 libglibc/obstack.c h->chunkfun = (struct _obstack_chunk * (*)(void *, long)) chunkfun; h 168 libglibc/obstack.c h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun; h 169 libglibc/obstack.c h->chunk_size = size; h 170 libglibc/obstack.c h->alignment_mask = alignment - 1; h 171 libglibc/obstack.c h->use_extra_arg = 0; h 173 libglibc/obstack.c chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size); h 176 libglibc/obstack.c h->next_free = h->object_base = chunk->contents; h 177 libglibc/obstack.c h->chunk_limit = chunk->limit h 178 libglibc/obstack.c = (char *) chunk + h->chunk_size; h 181 libglibc/obstack.c h->maybe_empty_object = 0; h 182 libglibc/obstack.c h->alloc_failed = 0; h 187 libglibc/obstack.c _obstack_begin_1 (struct obstack *h, int size, int alignment, h 213 libglibc/obstack.c h->chunkfun = (struct _obstack_chunk * (*)(void *,long)) chunkfun; h 214 libglibc/obstack.c h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun; h 215 libglibc/obstack.c h->chunk_size = size; h 216 libglibc/obstack.c h->alignment_mask = alignment - 1; h 217 libglibc/obstack.c h->extra_arg = arg; h 218 libglibc/obstack.c h->use_extra_arg = 1; h 220 libglibc/obstack.c chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size); h 223 libglibc/obstack.c h->next_free = h->object_base = chunk->contents; h 224 libglibc/obstack.c h->chunk_limit = chunk->limit h 225 libglibc/obstack.c = (char *) chunk + h->chunk_size; h 228 libglibc/obstack.c h->maybe_empty_object = 0; h 229 libglibc/obstack.c h->alloc_failed = 0; h 240 libglibc/obstack.c _obstack_newchunk (struct obstack *h, int length) h 242 libglibc/obstack.c register struct _obstack_chunk *old_chunk = h->chunk; h 245 libglibc/obstack.c register long obj_size = h->next_free - h->object_base; h 251 libglibc/obstack.c new_size = (obj_size + length) + (obj_size >> 3) + h->alignment_mask + 100; h 252 libglibc/obstack.c if (new_size < h->chunk_size) h 253 libglibc/obstack.c new_size = h->chunk_size; h 256 libglibc/obstack.c new_chunk = CALL_CHUNKFUN (h, new_size); h 259 libglibc/obstack.c h->chunk = new_chunk; h 261 libglibc/obstack.c new_chunk->limit = h->chunk_limit = (char *) new_chunk + new_size; h 265 libglibc/obstack.c __INT_TO_PTR ((__PTR_TO_INT (new_chunk->contents) + h->alignment_mask) h 266 libglibc/obstack.c & ~ (h->alignment_mask)); h 271 libglibc/obstack.c if (h->alignment_mask + 1 >= DEFAULT_ALIGNMENT) h 276 libglibc/obstack.c = ((COPYING_UNIT *)h->object_base)[i]; h 286 libglibc/obstack.c object_base[i] = h->object_base[i]; h 291 libglibc/obstack.c if (h->object_base == old_chunk->contents && ! h->maybe_empty_object) h 294 libglibc/obstack.c CALL_FREEFUN (h, old_chunk); h 297 libglibc/obstack.c h->object_base = object_base; h 298 libglibc/obstack.c h->next_free = h->object_base + obj_size; h 300 libglibc/obstack.c h->maybe_empty_object = 0; h 312 libglibc/obstack.c int _obstack_allocated_p (struct obstack *h, void *obj); h 315 libglibc/obstack.c _obstack_allocated_p (struct obstack *h, void *obj) h 320 libglibc/obstack.c lp = (h)->chunk; h 338 libglibc/obstack.c obstack_free (struct obstack *h, void *obj) h 343 libglibc/obstack.c lp = h->chunk; h 350 libglibc/obstack.c CALL_FREEFUN (h, lp); h 354 libglibc/obstack.c h->maybe_empty_object = 1; h 358 libglibc/obstack.c h->object_base = h->next_free = (char *) (obj); h 359 libglibc/obstack.c h->chunk_limit = lp->limit; h 360 libglibc/obstack.c h->chunk = lp; h 374 libglibc/obstack.c _obstack_memory_used (struct obstack *h) h 379 libglibc/obstack.c for (lp = h->chunk; lp != 0; lp = lp->prev) h 197 libglibc/obstack.h #define obstack_base(h) ((void *) (h)->object_base) h 201 libglibc/obstack.h #define obstack_chunk_size(h) ((h)->chunk_size) h 205 libglibc/obstack.h #define obstack_next_free(h) ((h)->next_free) h 209 libglibc/obstack.h #define obstack_alignment_mask(h) ((h)->alignment_mask) h 212 libglibc/obstack.h #define obstack_init(h) \ h 213 libglibc/obstack.h _obstack_begin ((h), 0, 0, \ h 217 libglibc/obstack.h #define obstack_begin(h, size) \ h 218 libglibc/obstack.h _obstack_begin ((h), (size), 0, \ h 222 libglibc/obstack.h #define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \ h 223 libglibc/obstack.h _obstack_begin ((h), (size), (alignment), \ h 227 libglibc/obstack.h #define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \ h 228 libglibc/obstack.h _obstack_begin_1 ((h), (size), (alignment), \ h 232 libglibc/obstack.h #define obstack_chunkfun(h, newchunkfun) \ h 233 libglibc/obstack.h ((h) -> chunkfun = (struct _obstack_chunk *(*)(void *, long)) (newchunkfun)) h 235 libglibc/obstack.h #define obstack_freefun(h, newfreefun) \ h 236 libglibc/obstack.h ((h) -> freefun = (void (*)(void *, struct _obstack_chunk *)) (newfreefun)) h 238 libglibc/obstack.h #define obstack_1grow_fast(h,achar) (*((h)->next_free)++ = (achar)) h 240 libglibc/obstack.h #define obstack_blank_fast(h,n) ((h)->next_free += (n)) h 242 libglibc/obstack.h #define obstack_memory_used(h) _obstack_memory_used (h) h 395 libglibc/obstack.h # define obstack_object_size(h) \ h 396 libglibc/obstack.h (unsigned) ((h)->next_free - (h)->object_base) h 398 libglibc/obstack.h # define obstack_room(h) \ h 399 libglibc/obstack.h (unsigned) ((h)->chunk_limit - (h)->next_free) h 401 libglibc/obstack.h # define obstack_empty_p(h) \ h 402 libglibc/obstack.h ((h)->chunk->prev == 0 && (h)->next_free - (h)->chunk->contents == 0) h 410 libglibc/obstack.h # define obstack_make_room(h,length) \ h 411 libglibc/obstack.h ( (h)->temp = (length), \ h 412 libglibc/obstack.h (((h)->next_free + (h)->temp > (h)->chunk_limit) \ h 413 libglibc/obstack.h ? (_obstack_newchunk ((h), (h)->temp), 0) : 0)) h 415 libglibc/obstack.h # define obstack_grow(h,where,length) \ h 416 libglibc/obstack.h ( (h)->temp = (length), \ h 417 libglibc/obstack.h (((h)->next_free + (h)->temp > (h)->chunk_limit) \ h 418 libglibc/obstack.h ? (_obstack_newchunk ((h), (h)->temp), 0) : 0), \ h 419 libglibc/obstack.h memcpy ((h)->next_free, where, (h)->temp), \ h 420 libglibc/obstack.h (h)->next_free += (h)->temp) h 422 libglibc/obstack.h # define obstack_grow0(h,where,length) \ h 423 libglibc/obstack.h ( (h)->temp = (length), \ h 424 libglibc/obstack.h (((h)->next_free + (h)->temp + 1 > (h)->chunk_limit) \ h 425 libglibc/obstack.h ? (_obstack_newchunk ((h), (h)->temp + 1), 0) : 0), \ h 426 libglibc/obstack.h memcpy ((h)->next_free, where, (h)->temp), \ h 427 libglibc/obstack.h (h)->next_free += (h)->temp, \ h 428 libglibc/obstack.h *((h)->next_free)++ = 0) h 430 libglibc/obstack.h # define obstack_1grow(h,datum) \ h 431 libglibc/obstack.h ( (((h)->next_free + 1 > (h)->chunk_limit) \ h 432 libglibc/obstack.h ? (_obstack_newchunk ((h), 1), 0) : 0), \ h 433 libglibc/obstack.h obstack_1grow_fast (h, datum)) h 435 libglibc/obstack.h # define obstack_ptr_grow(h,datum) \ h 436 libglibc/obstack.h ( (((h)->next_free + sizeof (char *) > (h)->chunk_limit) \ h 437 libglibc/obstack.h ? (_obstack_newchunk ((h), sizeof (char *)), 0) : 0), \ h 438 libglibc/obstack.h obstack_ptr_grow_fast (h, datum)) h 440 libglibc/obstack.h # define obstack_int_grow(h,datum) \ h 441 libglibc/obstack.h ( (((h)->next_free + sizeof (int) > (h)->chunk_limit) \ h 442 libglibc/obstack.h ? (_obstack_newchunk ((h), sizeof (int)), 0) : 0), \ h 443 libglibc/obstack.h obstack_int_grow_fast (h, datum)) h 445 libglibc/obstack.h # define obstack_ptr_grow_fast(h,aptr) \ h 446 libglibc/obstack.h (((const void **) ((h)->next_free += sizeof (void *)))[-1] = (aptr)) h 448 libglibc/obstack.h # define obstack_int_grow_fast(h,aint) \ h 449 libglibc/obstack.h (((int *) ((h)->next_free += sizeof (int)))[-1] = (aptr)) h 451 libglibc/obstack.h # define obstack_blank(h,length) \ h 452 libglibc/obstack.h ( (h)->temp = (length), \ h 453 libglibc/obstack.h (((h)->chunk_limit - (h)->next_free < (h)->temp) \ h 454 libglibc/obstack.h ? (_obstack_newchunk ((h), (h)->temp), 0) : 0), \ h 455 libglibc/obstack.h obstack_blank_fast (h, (h)->temp)) h 457 libglibc/obstack.h # define obstack_alloc(h,length) \ h 458 libglibc/obstack.h (obstack_blank ((h), (length)), obstack_finish ((h))) h 460 libglibc/obstack.h # define obstack_copy(h,where,length) \ h 461 libglibc/obstack.h (obstack_grow ((h), (where), (length)), obstack_finish ((h))) h 463 libglibc/obstack.h # define obstack_copy0(h,where,length) \ h 464 libglibc/obstack.h (obstack_grow0 ((h), (where), (length)), obstack_finish ((h))) h 466 libglibc/obstack.h # define obstack_finish(h) \ h 467 libglibc/obstack.h ( ((h)->next_free == (h)->object_base \ h 468 libglibc/obstack.h ? (((h)->maybe_empty_object = 1), 0) \ h 470 libglibc/obstack.h (h)->temp = __PTR_TO_INT ((h)->object_base), \ h 471 libglibc/obstack.h (h)->next_free \ h 472 libglibc/obstack.h = __INT_TO_PTR ((__PTR_TO_INT ((h)->next_free)+(h)->alignment_mask) \ h 473 libglibc/obstack.h & ~ ((h)->alignment_mask)), \ h 474 libglibc/obstack.h (((h)->next_free - (char *) (h)->chunk \ h 475 libglibc/obstack.h > (h)->chunk_limit - (char *) (h)->chunk) \ h 476 libglibc/obstack.h ? ((h)->next_free = (h)->chunk_limit) : 0), \ h 477 libglibc/obstack.h (h)->object_base = (h)->next_free, \ h 478 libglibc/obstack.h (void *) __INT_TO_PTR ((h)->temp)) h 480 libglibc/obstack.h # define obstack_free(h,obj) \ h 481 libglibc/obstack.h ( (h)->temp = (char *) (obj) - (char *) (h)->chunk, \ h 482 libglibc/obstack.h (((h)->temp > 0 && (h)->temp < (h)->chunk_limit - (char *) (h)->chunk)\ h 483 libglibc/obstack.h ? (int) ((h)->next_free = (h)->object_base \ h 484 libglibc/obstack.h = (h)->temp + (char *) (h)->chunk) \ h 485 libglibc/obstack.h : (((obstack_free) ((h), (h)->temp + (char *) (h)->chunk), 0), 0)))