158f0484fSRodney W. Grimes /*- 2f1e396bcSPaul Traina * Copyright (c) 1990, 1993, 1994 358f0484fSRodney W. Grimes * The Regents of the University of California. All rights reserved. 458f0484fSRodney W. Grimes * 558f0484fSRodney W. Grimes * This code is derived from software contributed to Berkeley by 658f0484fSRodney W. Grimes * Margo Seltzer. 758f0484fSRodney W. Grimes * 858f0484fSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 958f0484fSRodney W. Grimes * modification, are permitted provided that the following conditions 1058f0484fSRodney W. Grimes * are met: 1158f0484fSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 1258f0484fSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 1358f0484fSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 1458f0484fSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 1558f0484fSRodney W. Grimes * documentation and/or other materials provided with the distribution. 1658f0484fSRodney W. Grimes * 4. Neither the name of the University nor the names of its contributors 1758f0484fSRodney W. Grimes * may be used to endorse or promote products derived from this software 1858f0484fSRodney W. Grimes * without specific prior written permission. 1958f0484fSRodney W. Grimes * 2058f0484fSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 2158f0484fSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2258f0484fSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2358f0484fSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2458f0484fSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2558f0484fSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2658f0484fSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2758f0484fSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2858f0484fSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 2958f0484fSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 3058f0484fSRodney W. Grimes * SUCH DAMAGE. 3158f0484fSRodney W. Grimes */ 3258f0484fSRodney W. Grimes 3358f0484fSRodney W. Grimes #if defined(LIBC_SCCS) && !defined(lint) 34f1e396bcSPaul Traina static char sccsid[] = "@(#)hash_page.c 8.7 (Berkeley) 8/16/94"; 3558f0484fSRodney W. Grimes #endif /* LIBC_SCCS and not lint */ 368fb3f3f6SDavid E. O'Brien #include <sys/cdefs.h> 378fb3f3f6SDavid E. O'Brien __FBSDID("$FreeBSD$"); 3858f0484fSRodney W. Grimes 3958f0484fSRodney W. Grimes /* 4058f0484fSRodney W. Grimes * PACKAGE: hashing 4158f0484fSRodney W. Grimes * 4258f0484fSRodney W. Grimes * DESCRIPTION: 4358f0484fSRodney W. Grimes * Page manipulation for hashing package. 4458f0484fSRodney W. Grimes * 4558f0484fSRodney W. Grimes * ROUTINES: 4658f0484fSRodney W. Grimes * 4758f0484fSRodney W. Grimes * External 4858f0484fSRodney W. Grimes * __get_page 4958f0484fSRodney W. Grimes * __add_ovflpage 5058f0484fSRodney W. Grimes * Internal 5158f0484fSRodney W. Grimes * overflow_page 5258f0484fSRodney W. Grimes * open_temp 5358f0484fSRodney W. Grimes */ 5458f0484fSRodney W. Grimes 55d201fe46SDaniel Eischen #include "namespace.h" 5602d7f710SXin LI #include <sys/param.h> 5758f0484fSRodney W. Grimes 5858f0484fSRodney W. Grimes #include <errno.h> 5958f0484fSRodney W. Grimes #include <fcntl.h> 6058f0484fSRodney W. Grimes #include <signal.h> 6158f0484fSRodney W. Grimes #include <stdio.h> 6258f0484fSRodney W. Grimes #include <stdlib.h> 6358f0484fSRodney W. Grimes #include <string.h> 6458f0484fSRodney W. Grimes #include <unistd.h> 6558f0484fSRodney W. Grimes #ifdef DEBUG 6658f0484fSRodney W. Grimes #include <assert.h> 6758f0484fSRodney W. Grimes #endif 68d201fe46SDaniel Eischen #include "un-namespace.h" 69bd6060a1SKonstantin Belousov #include "libc_private.h" 7058f0484fSRodney W. Grimes 7158f0484fSRodney W. Grimes #include <db.h> 7258f0484fSRodney W. Grimes #include "hash.h" 7358f0484fSRodney W. Grimes #include "page.h" 7458f0484fSRodney W. Grimes #include "extern.h" 7558f0484fSRodney W. Grimes 76c05ac53bSDavid E. O'Brien static u_int32_t *fetch_bitmap(HTAB *, int); 77c05ac53bSDavid E. O'Brien static u_int32_t first_free(u_int32_t); 78c05ac53bSDavid E. O'Brien static int open_temp(HTAB *); 79c05ac53bSDavid E. O'Brien static u_int16_t overflow_page(HTAB *); 80c05ac53bSDavid E. O'Brien static void putpair(char *, const DBT *, const DBT *); 81c05ac53bSDavid E. O'Brien static void squeeze_key(u_int16_t *, const DBT *, const DBT *); 820ac22237SXin LI static int ugly_split(HTAB *, u_int32_t, BUFHEAD *, BUFHEAD *, int, int); 8358f0484fSRodney W. Grimes 8458f0484fSRodney W. Grimes #define PAGE_INIT(P) { \ 85f1e396bcSPaul Traina ((u_int16_t *)(P))[0] = 0; \ 86f1e396bcSPaul Traina ((u_int16_t *)(P))[1] = hashp->BSIZE - 3 * sizeof(u_int16_t); \ 87f1e396bcSPaul Traina ((u_int16_t *)(P))[2] = hashp->BSIZE; \ 8858f0484fSRodney W. Grimes } 8958f0484fSRodney W. Grimes 9058f0484fSRodney W. Grimes /* 9158f0484fSRodney W. Grimes * This is called AFTER we have verified that there is room on the page for 9258f0484fSRodney W. Grimes * the pair (PAIRFITS has returned true) so we go right ahead and start moving 9358f0484fSRodney W. Grimes * stuff on. 9458f0484fSRodney W. Grimes */ 9558f0484fSRodney W. Grimes static void 960ac22237SXin LI putpair(char *p, const DBT *key, const DBT *val) 9758f0484fSRodney W. Grimes { 988fb3f3f6SDavid E. O'Brien u_int16_t *bp, n, off; 9958f0484fSRodney W. Grimes 100f1e396bcSPaul Traina bp = (u_int16_t *)p; 10158f0484fSRodney W. Grimes 10258f0484fSRodney W. Grimes /* Enter the key first. */ 10358f0484fSRodney W. Grimes n = bp[0]; 10458f0484fSRodney W. Grimes 10558f0484fSRodney W. Grimes off = OFFSET(bp) - key->size; 10658f0484fSRodney W. Grimes memmove(p + off, key->data, key->size); 10758f0484fSRodney W. Grimes bp[++n] = off; 10858f0484fSRodney W. Grimes 10958f0484fSRodney W. Grimes /* Now the data. */ 11058f0484fSRodney W. Grimes off -= val->size; 11158f0484fSRodney W. Grimes memmove(p + off, val->data, val->size); 11258f0484fSRodney W. Grimes bp[++n] = off; 11358f0484fSRodney W. Grimes 11458f0484fSRodney W. Grimes /* Adjust page info. */ 11558f0484fSRodney W. Grimes bp[0] = n; 116f1e396bcSPaul Traina bp[n + 1] = off - ((n + 3) * sizeof(u_int16_t)); 11758f0484fSRodney W. Grimes bp[n + 2] = off; 11858f0484fSRodney W. Grimes } 11958f0484fSRodney W. Grimes 12058f0484fSRodney W. Grimes /* 12158f0484fSRodney W. Grimes * Returns: 12258f0484fSRodney W. Grimes * 0 OK 12358f0484fSRodney W. Grimes * -1 error 12458f0484fSRodney W. Grimes */ 1250ac22237SXin LI int 1260ac22237SXin LI __delpair(HTAB *hashp, BUFHEAD *bufp, int ndx) 12758f0484fSRodney W. Grimes { 128b115f257SXin LI u_int16_t *bp, newoff, pairlen; 1298fb3f3f6SDavid E. O'Brien int n; 13058f0484fSRodney W. Grimes 131f1e396bcSPaul Traina bp = (u_int16_t *)bufp->page; 13258f0484fSRodney W. Grimes n = bp[0]; 13358f0484fSRodney W. Grimes 13458f0484fSRodney W. Grimes if (bp[ndx + 1] < REAL_KEY) 13558f0484fSRodney W. Grimes return (__big_delete(hashp, bufp)); 13658f0484fSRodney W. Grimes if (ndx != 1) 13758f0484fSRodney W. Grimes newoff = bp[ndx - 1]; 13858f0484fSRodney W. Grimes else 13958f0484fSRodney W. Grimes newoff = hashp->BSIZE; 14058f0484fSRodney W. Grimes pairlen = newoff - bp[ndx + 1]; 14158f0484fSRodney W. Grimes 14258f0484fSRodney W. Grimes if (ndx != (n - 1)) { 14358f0484fSRodney W. Grimes /* Hard Case -- need to shuffle keys */ 1448fb3f3f6SDavid E. O'Brien int i; 1458fb3f3f6SDavid E. O'Brien char *src = bufp->page + (int)OFFSET(bp); 1468fb3f3f6SDavid E. O'Brien char *dst = src + (int)pairlen; 14758f0484fSRodney W. Grimes memmove(dst, src, bp[ndx + 1] - OFFSET(bp)); 14858f0484fSRodney W. Grimes 14958f0484fSRodney W. Grimes /* Now adjust the pointers */ 15058f0484fSRodney W. Grimes for (i = ndx + 2; i <= n; i += 2) { 15158f0484fSRodney W. Grimes if (bp[i + 1] == OVFLPAGE) { 15258f0484fSRodney W. Grimes bp[i - 2] = bp[i]; 15358f0484fSRodney W. Grimes bp[i - 1] = bp[i + 1]; 15458f0484fSRodney W. Grimes } else { 15558f0484fSRodney W. Grimes bp[i - 2] = bp[i] + pairlen; 15658f0484fSRodney W. Grimes bp[i - 1] = bp[i + 1] + pairlen; 15758f0484fSRodney W. Grimes } 15858f0484fSRodney W. Grimes } 159213bceeeSXin LI if (ndx == hashp->cndx) { 160213bceeeSXin LI /* 161213bceeeSXin LI * We just removed pair we were "pointing" to. 162213bceeeSXin LI * By moving back the cndx we ensure subsequent 163213bceeeSXin LI * hash_seq() calls won't skip over any entries. 164213bceeeSXin LI */ 165213bceeeSXin LI hashp->cndx -= 2; 166213bceeeSXin LI } 16758f0484fSRodney W. Grimes } 16858f0484fSRodney W. Grimes /* Finally adjust the page data */ 16958f0484fSRodney W. Grimes bp[n] = OFFSET(bp) + pairlen; 170f1e396bcSPaul Traina bp[n - 1] = bp[n + 1] + pairlen + 2 * sizeof(u_int16_t); 17158f0484fSRodney W. Grimes bp[0] = n - 2; 17258f0484fSRodney W. Grimes hashp->NKEYS--; 17358f0484fSRodney W. Grimes 17458f0484fSRodney W. Grimes bufp->flags |= BUF_MOD; 17558f0484fSRodney W. Grimes return (0); 17658f0484fSRodney W. Grimes } 17758f0484fSRodney W. Grimes /* 17858f0484fSRodney W. Grimes * Returns: 17958f0484fSRodney W. Grimes * 0 ==> OK 18058f0484fSRodney W. Grimes * -1 ==> Error 18158f0484fSRodney W. Grimes */ 1820ac22237SXin LI int 1830ac22237SXin LI __split_page(HTAB *hashp, u_int32_t obucket, u_int32_t nbucket) 18458f0484fSRodney W. Grimes { 1858fb3f3f6SDavid E. O'Brien BUFHEAD *new_bufp, *old_bufp; 1868fb3f3f6SDavid E. O'Brien u_int16_t *ino; 1878fb3f3f6SDavid E. O'Brien char *np; 18858f0484fSRodney W. Grimes DBT key, val; 18958f0484fSRodney W. Grimes int n, ndx, retval; 190f1e396bcSPaul Traina u_int16_t copyto, diff, off, moved; 19158f0484fSRodney W. Grimes char *op; 19258f0484fSRodney W. Grimes 193f1e396bcSPaul Traina copyto = (u_int16_t)hashp->BSIZE; 194f1e396bcSPaul Traina off = (u_int16_t)hashp->BSIZE; 19558f0484fSRodney W. Grimes old_bufp = __get_buf(hashp, obucket, NULL, 0); 19658f0484fSRodney W. Grimes if (old_bufp == NULL) 19758f0484fSRodney W. Grimes return (-1); 19858f0484fSRodney W. Grimes new_bufp = __get_buf(hashp, nbucket, NULL, 0); 19958f0484fSRodney W. Grimes if (new_bufp == NULL) 20058f0484fSRodney W. Grimes return (-1); 20158f0484fSRodney W. Grimes 20258f0484fSRodney W. Grimes old_bufp->flags |= (BUF_MOD | BUF_PIN); 20358f0484fSRodney W. Grimes new_bufp->flags |= (BUF_MOD | BUF_PIN); 20458f0484fSRodney W. Grimes 205f1e396bcSPaul Traina ino = (u_int16_t *)(op = old_bufp->page); 20658f0484fSRodney W. Grimes np = new_bufp->page; 20758f0484fSRodney W. Grimes 20858f0484fSRodney W. Grimes moved = 0; 20958f0484fSRodney W. Grimes 21058f0484fSRodney W. Grimes for (n = 1, ndx = 1; n < ino[0]; n += 2) { 21158f0484fSRodney W. Grimes if (ino[n + 1] < REAL_KEY) { 21258f0484fSRodney W. Grimes retval = ugly_split(hashp, obucket, old_bufp, new_bufp, 21358f0484fSRodney W. Grimes (int)copyto, (int)moved); 21458f0484fSRodney W. Grimes old_bufp->flags &= ~BUF_PIN; 21558f0484fSRodney W. Grimes new_bufp->flags &= ~BUF_PIN; 21658f0484fSRodney W. Grimes return (retval); 21758f0484fSRodney W. Grimes 21858f0484fSRodney W. Grimes } 21958f0484fSRodney W. Grimes key.data = (u_char *)op + ino[n]; 22058f0484fSRodney W. Grimes key.size = off - ino[n]; 22158f0484fSRodney W. Grimes 22258f0484fSRodney W. Grimes if (__call_hash(hashp, key.data, key.size) == obucket) { 22358f0484fSRodney W. Grimes /* Don't switch page */ 22458f0484fSRodney W. Grimes diff = copyto - off; 22558f0484fSRodney W. Grimes if (diff) { 22658f0484fSRodney W. Grimes copyto = ino[n + 1] + diff; 22758f0484fSRodney W. Grimes memmove(op + copyto, op + ino[n + 1], 22858f0484fSRodney W. Grimes off - ino[n + 1]); 22958f0484fSRodney W. Grimes ino[ndx] = copyto + ino[n] - ino[n + 1]; 23058f0484fSRodney W. Grimes ino[ndx + 1] = copyto; 23158f0484fSRodney W. Grimes } else 23258f0484fSRodney W. Grimes copyto = ino[n + 1]; 23358f0484fSRodney W. Grimes ndx += 2; 23458f0484fSRodney W. Grimes } else { 23558f0484fSRodney W. Grimes /* Switch page */ 23658f0484fSRodney W. Grimes val.data = (u_char *)op + ino[n + 1]; 23758f0484fSRodney W. Grimes val.size = ino[n] - ino[n + 1]; 23858f0484fSRodney W. Grimes putpair(np, &key, &val); 23958f0484fSRodney W. Grimes moved += 2; 24058f0484fSRodney W. Grimes } 24158f0484fSRodney W. Grimes 24258f0484fSRodney W. Grimes off = ino[n + 1]; 24358f0484fSRodney W. Grimes } 24458f0484fSRodney W. Grimes 24558f0484fSRodney W. Grimes /* Now clean up the page */ 24658f0484fSRodney W. Grimes ino[0] -= moved; 247f1e396bcSPaul Traina FREESPACE(ino) = copyto - sizeof(u_int16_t) * (ino[0] + 3); 24858f0484fSRodney W. Grimes OFFSET(ino) = copyto; 24958f0484fSRodney W. Grimes 25058f0484fSRodney W. Grimes #ifdef DEBUG3 25158f0484fSRodney W. Grimes (void)fprintf(stderr, "split %d/%d\n", 252f1e396bcSPaul Traina ((u_int16_t *)np)[0] / 2, 253f1e396bcSPaul Traina ((u_int16_t *)op)[0] / 2); 25458f0484fSRodney W. Grimes #endif 25558f0484fSRodney W. Grimes /* unpin both pages */ 25658f0484fSRodney W. Grimes old_bufp->flags &= ~BUF_PIN; 25758f0484fSRodney W. Grimes new_bufp->flags &= ~BUF_PIN; 25858f0484fSRodney W. Grimes return (0); 25958f0484fSRodney W. Grimes } 26058f0484fSRodney W. Grimes 26158f0484fSRodney W. Grimes /* 26258f0484fSRodney W. Grimes * Called when we encounter an overflow or big key/data page during split 26358f0484fSRodney W. Grimes * handling. This is special cased since we have to begin checking whether 26458f0484fSRodney W. Grimes * the key/data pairs fit on their respective pages and because we may need 26558f0484fSRodney W. Grimes * overflow pages for both the old and new pages. 26658f0484fSRodney W. Grimes * 26758f0484fSRodney W. Grimes * The first page might be a page with regular key/data pairs in which case 26858f0484fSRodney W. Grimes * we have a regular overflow condition and just need to go on to the next 26958f0484fSRodney W. Grimes * page or it might be a big key/data pair in which case we need to fix the 27058f0484fSRodney W. Grimes * big key/data pair. 27158f0484fSRodney W. Grimes * 27258f0484fSRodney W. Grimes * Returns: 27358f0484fSRodney W. Grimes * 0 ==> success 27458f0484fSRodney W. Grimes * -1 ==> failure 27558f0484fSRodney W. Grimes */ 27658f0484fSRodney W. Grimes static int 2770ac22237SXin LI ugly_split(HTAB *hashp, 2780ac22237SXin LI u_int32_t obucket, /* Same as __split_page. */ 2790ac22237SXin LI BUFHEAD *old_bufp, 2800ac22237SXin LI BUFHEAD *new_bufp, 2810ac22237SXin LI int copyto, /* First byte on page which contains key/data values. */ 2820ac22237SXin LI int moved) /* Number of pairs moved to new page. */ 28358f0484fSRodney W. Grimes { 2848fb3f3f6SDavid E. O'Brien BUFHEAD *bufp; /* Buffer header for ino */ 2858fb3f3f6SDavid E. O'Brien u_int16_t *ino; /* Page keys come off of */ 2868fb3f3f6SDavid E. O'Brien u_int16_t *np; /* New page */ 2878fb3f3f6SDavid E. O'Brien u_int16_t *op; /* Page keys go on to if they aren't moving */ 28858f0484fSRodney W. Grimes 28958f0484fSRodney W. Grimes BUFHEAD *last_bfp; /* Last buf header OVFL needing to be freed */ 29058f0484fSRodney W. Grimes DBT key, val; 29158f0484fSRodney W. Grimes SPLIT_RETURN ret; 292f1e396bcSPaul Traina u_int16_t n, off, ov_addr, scopyto; 29358f0484fSRodney W. Grimes char *cino; /* Character value of ino */ 29458f0484fSRodney W. Grimes 29558f0484fSRodney W. Grimes bufp = old_bufp; 296f1e396bcSPaul Traina ino = (u_int16_t *)old_bufp->page; 297f1e396bcSPaul Traina np = (u_int16_t *)new_bufp->page; 298f1e396bcSPaul Traina op = (u_int16_t *)old_bufp->page; 29958f0484fSRodney W. Grimes last_bfp = NULL; 300f1e396bcSPaul Traina scopyto = (u_int16_t)copyto; /* ANSI */ 30158f0484fSRodney W. Grimes 30258f0484fSRodney W. Grimes n = ino[0] - 1; 30358f0484fSRodney W. Grimes while (n < ino[0]) { 30458f0484fSRodney W. Grimes if (ino[2] < REAL_KEY && ino[2] != OVFLPAGE) { 30558f0484fSRodney W. Grimes if (__big_split(hashp, old_bufp, 30658f0484fSRodney W. Grimes new_bufp, bufp, bufp->addr, obucket, &ret)) 30758f0484fSRodney W. Grimes return (-1); 30858f0484fSRodney W. Grimes old_bufp = ret.oldp; 30958f0484fSRodney W. Grimes if (!old_bufp) 31058f0484fSRodney W. Grimes return (-1); 311f1e396bcSPaul Traina op = (u_int16_t *)old_bufp->page; 31258f0484fSRodney W. Grimes new_bufp = ret.newp; 31358f0484fSRodney W. Grimes if (!new_bufp) 31458f0484fSRodney W. Grimes return (-1); 315f1e396bcSPaul Traina np = (u_int16_t *)new_bufp->page; 31658f0484fSRodney W. Grimes bufp = ret.nextp; 31758f0484fSRodney W. Grimes if (!bufp) 31858f0484fSRodney W. Grimes return (0); 31958f0484fSRodney W. Grimes cino = (char *)bufp->page; 320f1e396bcSPaul Traina ino = (u_int16_t *)cino; 32158f0484fSRodney W. Grimes last_bfp = ret.nextp; 32258f0484fSRodney W. Grimes } else if (ino[n + 1] == OVFLPAGE) { 32358f0484fSRodney W. Grimes ov_addr = ino[n]; 32458f0484fSRodney W. Grimes /* 32558f0484fSRodney W. Grimes * Fix up the old page -- the extra 2 are the fields 32658f0484fSRodney W. Grimes * which contained the overflow information. 32758f0484fSRodney W. Grimes */ 32858f0484fSRodney W. Grimes ino[0] -= (moved + 2); 32958f0484fSRodney W. Grimes FREESPACE(ino) = 330f1e396bcSPaul Traina scopyto - sizeof(u_int16_t) * (ino[0] + 3); 33158f0484fSRodney W. Grimes OFFSET(ino) = scopyto; 33258f0484fSRodney W. Grimes 33358f0484fSRodney W. Grimes bufp = __get_buf(hashp, ov_addr, bufp, 0); 33458f0484fSRodney W. Grimes if (!bufp) 33558f0484fSRodney W. Grimes return (-1); 33658f0484fSRodney W. Grimes 337f1e396bcSPaul Traina ino = (u_int16_t *)bufp->page; 33858f0484fSRodney W. Grimes n = 1; 33958f0484fSRodney W. Grimes scopyto = hashp->BSIZE; 34058f0484fSRodney W. Grimes moved = 0; 34158f0484fSRodney W. Grimes 34258f0484fSRodney W. Grimes if (last_bfp) 34358f0484fSRodney W. Grimes __free_ovflpage(hashp, last_bfp); 34458f0484fSRodney W. Grimes last_bfp = bufp; 34558f0484fSRodney W. Grimes } 34658f0484fSRodney W. Grimes /* Move regular sized pairs of there are any */ 34758f0484fSRodney W. Grimes off = hashp->BSIZE; 34858f0484fSRodney W. Grimes for (n = 1; (n < ino[0]) && (ino[n + 1] >= REAL_KEY); n += 2) { 34958f0484fSRodney W. Grimes cino = (char *)ino; 35058f0484fSRodney W. Grimes key.data = (u_char *)cino + ino[n]; 35158f0484fSRodney W. Grimes key.size = off - ino[n]; 35258f0484fSRodney W. Grimes val.data = (u_char *)cino + ino[n + 1]; 35358f0484fSRodney W. Grimes val.size = ino[n] - ino[n + 1]; 35458f0484fSRodney W. Grimes off = ino[n + 1]; 35558f0484fSRodney W. Grimes 35658f0484fSRodney W. Grimes if (__call_hash(hashp, key.data, key.size) == obucket) { 35758f0484fSRodney W. Grimes /* Keep on old page */ 35858f0484fSRodney W. Grimes if (PAIRFITS(op, (&key), (&val))) 35958f0484fSRodney W. Grimes putpair((char *)op, &key, &val); 36058f0484fSRodney W. Grimes else { 36158f0484fSRodney W. Grimes old_bufp = 36258f0484fSRodney W. Grimes __add_ovflpage(hashp, old_bufp); 36358f0484fSRodney W. Grimes if (!old_bufp) 36458f0484fSRodney W. Grimes return (-1); 365f1e396bcSPaul Traina op = (u_int16_t *)old_bufp->page; 36658f0484fSRodney W. Grimes putpair((char *)op, &key, &val); 36758f0484fSRodney W. Grimes } 36858f0484fSRodney W. Grimes old_bufp->flags |= BUF_MOD; 36958f0484fSRodney W. Grimes } else { 37058f0484fSRodney W. Grimes /* Move to new page */ 37158f0484fSRodney W. Grimes if (PAIRFITS(np, (&key), (&val))) 37258f0484fSRodney W. Grimes putpair((char *)np, &key, &val); 37358f0484fSRodney W. Grimes else { 37458f0484fSRodney W. Grimes new_bufp = 37558f0484fSRodney W. Grimes __add_ovflpage(hashp, new_bufp); 37658f0484fSRodney W. Grimes if (!new_bufp) 37758f0484fSRodney W. Grimes return (-1); 378f1e396bcSPaul Traina np = (u_int16_t *)new_bufp->page; 37958f0484fSRodney W. Grimes putpair((char *)np, &key, &val); 38058f0484fSRodney W. Grimes } 38158f0484fSRodney W. Grimes new_bufp->flags |= BUF_MOD; 38258f0484fSRodney W. Grimes } 38358f0484fSRodney W. Grimes } 38458f0484fSRodney W. Grimes } 38558f0484fSRodney W. Grimes if (last_bfp) 38658f0484fSRodney W. Grimes __free_ovflpage(hashp, last_bfp); 38758f0484fSRodney W. Grimes return (0); 38858f0484fSRodney W. Grimes } 38958f0484fSRodney W. Grimes 39058f0484fSRodney W. Grimes /* 39158f0484fSRodney W. Grimes * Add the given pair to the page 39258f0484fSRodney W. Grimes * 39358f0484fSRodney W. Grimes * Returns: 39458f0484fSRodney W. Grimes * 0 ==> OK 39558f0484fSRodney W. Grimes * 1 ==> failure 39658f0484fSRodney W. Grimes */ 3970ac22237SXin LI int 3980ac22237SXin LI __addel(HTAB *hashp, BUFHEAD *bufp, const DBT *key, const DBT *val) 39958f0484fSRodney W. Grimes { 4008fb3f3f6SDavid E. O'Brien u_int16_t *bp, *sop; 40158f0484fSRodney W. Grimes int do_expand; 40258f0484fSRodney W. Grimes 403f1e396bcSPaul Traina bp = (u_int16_t *)bufp->page; 40458f0484fSRodney W. Grimes do_expand = 0; 40558f0484fSRodney W. Grimes while (bp[0] && (bp[2] < REAL_KEY || bp[bp[0]] < REAL_KEY)) 40658f0484fSRodney W. Grimes /* Exception case */ 40758f0484fSRodney W. Grimes if (bp[2] == FULL_KEY_DATA && bp[0] == 2) 40858f0484fSRodney W. Grimes /* This is the last page of a big key/data pair 40958f0484fSRodney W. Grimes and we need to add another page */ 41058f0484fSRodney W. Grimes break; 41158f0484fSRodney W. Grimes else if (bp[2] < REAL_KEY && bp[bp[0]] != OVFLPAGE) { 41258f0484fSRodney W. Grimes bufp = __get_buf(hashp, bp[bp[0] - 1], bufp, 0); 41358f0484fSRodney W. Grimes if (!bufp) 41458f0484fSRodney W. Grimes return (-1); 415f1e396bcSPaul Traina bp = (u_int16_t *)bufp->page; 4163130c353SXin LI } else if (bp[bp[0]] != OVFLPAGE) { 4173130c353SXin LI /* Short key/data pairs, no more pages */ 4183130c353SXin LI break; 4193130c353SXin LI } else { 42058f0484fSRodney W. Grimes /* Try to squeeze key on this page */ 4213130c353SXin LI if (bp[2] >= REAL_KEY && 4223130c353SXin LI FREESPACE(bp) >= PAIRSIZE(key, val)) { 42358f0484fSRodney W. Grimes squeeze_key(bp, key, val); 4243130c353SXin LI goto stats; 42558f0484fSRodney W. Grimes } else { 42658f0484fSRodney W. Grimes bufp = __get_buf(hashp, bp[bp[0] - 1], bufp, 0); 42758f0484fSRodney W. Grimes if (!bufp) 42858f0484fSRodney W. Grimes return (-1); 429f1e396bcSPaul Traina bp = (u_int16_t *)bufp->page; 43058f0484fSRodney W. Grimes } 4313130c353SXin LI } 43258f0484fSRodney W. Grimes 43358f0484fSRodney W. Grimes if (PAIRFITS(bp, key, val)) 43458f0484fSRodney W. Grimes putpair(bufp->page, key, val); 43558f0484fSRodney W. Grimes else { 43658f0484fSRodney W. Grimes do_expand = 1; 43758f0484fSRodney W. Grimes bufp = __add_ovflpage(hashp, bufp); 43858f0484fSRodney W. Grimes if (!bufp) 43958f0484fSRodney W. Grimes return (-1); 440f1e396bcSPaul Traina sop = (u_int16_t *)bufp->page; 44158f0484fSRodney W. Grimes 44258f0484fSRodney W. Grimes if (PAIRFITS(sop, key, val)) 44358f0484fSRodney W. Grimes putpair((char *)sop, key, val); 44458f0484fSRodney W. Grimes else 44558f0484fSRodney W. Grimes if (__big_insert(hashp, bufp, key, val)) 44658f0484fSRodney W. Grimes return (-1); 44758f0484fSRodney W. Grimes } 4483130c353SXin LI stats: 44958f0484fSRodney W. Grimes bufp->flags |= BUF_MOD; 45058f0484fSRodney W. Grimes /* 45158f0484fSRodney W. Grimes * If the average number of keys per bucket exceeds the fill factor, 45258f0484fSRodney W. Grimes * expand the table. 45358f0484fSRodney W. Grimes */ 45458f0484fSRodney W. Grimes hashp->NKEYS++; 45558f0484fSRodney W. Grimes if (do_expand || 45658f0484fSRodney W. Grimes (hashp->NKEYS / (hashp->MAX_BUCKET + 1) > hashp->FFACTOR)) 45758f0484fSRodney W. Grimes return (__expand_table(hashp)); 45858f0484fSRodney W. Grimes return (0); 45958f0484fSRodney W. Grimes } 46058f0484fSRodney W. Grimes 46158f0484fSRodney W. Grimes /* 46258f0484fSRodney W. Grimes * 46358f0484fSRodney W. Grimes * Returns: 46458f0484fSRodney W. Grimes * pointer on success 46558f0484fSRodney W. Grimes * NULL on error 46658f0484fSRodney W. Grimes */ 4670ac22237SXin LI BUFHEAD * 4680ac22237SXin LI __add_ovflpage(HTAB *hashp, BUFHEAD *bufp) 46958f0484fSRodney W. Grimes { 470b115f257SXin LI u_int16_t *sp, ndx, ovfl_num; 47158f0484fSRodney W. Grimes #ifdef DEBUG1 47258f0484fSRodney W. Grimes int tmp1, tmp2; 47358f0484fSRodney W. Grimes #endif 474f1e396bcSPaul Traina sp = (u_int16_t *)bufp->page; 47558f0484fSRodney W. Grimes 47658f0484fSRodney W. Grimes /* Check if we are dynamically determining the fill factor */ 47758f0484fSRodney W. Grimes if (hashp->FFACTOR == DEF_FFACTOR) { 47858f0484fSRodney W. Grimes hashp->FFACTOR = sp[0] >> 1; 47958f0484fSRodney W. Grimes if (hashp->FFACTOR < MIN_FFACTOR) 48058f0484fSRodney W. Grimes hashp->FFACTOR = MIN_FFACTOR; 48158f0484fSRodney W. Grimes } 48258f0484fSRodney W. Grimes bufp->flags |= BUF_MOD; 48358f0484fSRodney W. Grimes ovfl_num = overflow_page(hashp); 48458f0484fSRodney W. Grimes #ifdef DEBUG1 48558f0484fSRodney W. Grimes tmp1 = bufp->addr; 48658f0484fSRodney W. Grimes tmp2 = bufp->ovfl ? bufp->ovfl->addr : 0; 48758f0484fSRodney W. Grimes #endif 48858f0484fSRodney W. Grimes if (!ovfl_num || !(bufp->ovfl = __get_buf(hashp, ovfl_num, bufp, 1))) 48958f0484fSRodney W. Grimes return (NULL); 49058f0484fSRodney W. Grimes bufp->ovfl->flags |= BUF_MOD; 49158f0484fSRodney W. Grimes #ifdef DEBUG1 49258f0484fSRodney W. Grimes (void)fprintf(stderr, "ADDOVFLPAGE: %d->ovfl was %d is now %d\n", 49358f0484fSRodney W. Grimes tmp1, tmp2, bufp->ovfl->addr); 49458f0484fSRodney W. Grimes #endif 49558f0484fSRodney W. Grimes ndx = sp[0]; 49658f0484fSRodney W. Grimes /* 49758f0484fSRodney W. Grimes * Since a pair is allocated on a page only if there's room to add 49858f0484fSRodney W. Grimes * an overflow page, we know that the OVFL information will fit on 49958f0484fSRodney W. Grimes * the page. 50058f0484fSRodney W. Grimes */ 50158f0484fSRodney W. Grimes sp[ndx + 4] = OFFSET(sp); 50258f0484fSRodney W. Grimes sp[ndx + 3] = FREESPACE(sp) - OVFLSIZE; 50358f0484fSRodney W. Grimes sp[ndx + 1] = ovfl_num; 50458f0484fSRodney W. Grimes sp[ndx + 2] = OVFLPAGE; 50558f0484fSRodney W. Grimes sp[0] = ndx + 2; 50658f0484fSRodney W. Grimes #ifdef HASH_STATISTICS 50758f0484fSRodney W. Grimes hash_overflows++; 50858f0484fSRodney W. Grimes #endif 50958f0484fSRodney W. Grimes return (bufp->ovfl); 51058f0484fSRodney W. Grimes } 51158f0484fSRodney W. Grimes 51258f0484fSRodney W. Grimes /* 51358f0484fSRodney W. Grimes * Returns: 51458f0484fSRodney W. Grimes * 0 indicates SUCCESS 51558f0484fSRodney W. Grimes * -1 indicates FAILURE 51658f0484fSRodney W. Grimes */ 5170ac22237SXin LI int 5180ac22237SXin LI __get_page(HTAB *hashp, char *p, u_int32_t bucket, int is_bucket, int is_disk, 5190ac22237SXin LI int is_bitmap) 52058f0484fSRodney W. Grimes { 521b115f257SXin LI int fd, page, size, rsize; 522f1e396bcSPaul Traina u_int16_t *bp; 52358f0484fSRodney W. Grimes 52458f0484fSRodney W. Grimes fd = hashp->fp; 52558f0484fSRodney W. Grimes size = hashp->BSIZE; 52658f0484fSRodney W. Grimes 52758f0484fSRodney W. Grimes if ((fd == -1) || !is_disk) { 52858f0484fSRodney W. Grimes PAGE_INIT(p); 52958f0484fSRodney W. Grimes return (0); 53058f0484fSRodney W. Grimes } 53158f0484fSRodney W. Grimes if (is_bucket) 53258f0484fSRodney W. Grimes page = BUCKET_TO_PAGE(bucket); 53358f0484fSRodney W. Grimes else 53458f0484fSRodney W. Grimes page = OADDR_TO_PAGE(bucket); 535d3b2afadSXin LI if ((rsize = pread(fd, p, size, (off_t)page << hashp->BSHIFT)) == -1) 53658f0484fSRodney W. Grimes return (-1); 537f1e396bcSPaul Traina bp = (u_int16_t *)p; 53858f0484fSRodney W. Grimes if (!rsize) 53958f0484fSRodney W. Grimes bp[0] = 0; /* We hit the EOF, so initialize a new page */ 54058f0484fSRodney W. Grimes else 54158f0484fSRodney W. Grimes if (rsize != size) { 54258f0484fSRodney W. Grimes errno = EFTYPE; 54358f0484fSRodney W. Grimes return (-1); 54458f0484fSRodney W. Grimes } 54558f0484fSRodney W. Grimes if (!is_bitmap && !bp[0]) { 54658f0484fSRodney W. Grimes PAGE_INIT(p); 54758f0484fSRodney W. Grimes } else 54858f0484fSRodney W. Grimes if (hashp->LORDER != BYTE_ORDER) { 5498fb3f3f6SDavid E. O'Brien int i, max; 55058f0484fSRodney W. Grimes 55158f0484fSRodney W. Grimes if (is_bitmap) { 55258f0484fSRodney W. Grimes max = hashp->BSIZE >> 2; /* divide by 4 */ 55358f0484fSRodney W. Grimes for (i = 0; i < max; i++) 554f1e396bcSPaul Traina M_32_SWAP(((int *)p)[i]); 55558f0484fSRodney W. Grimes } else { 55658f0484fSRodney W. Grimes M_16_SWAP(bp[0]); 55758f0484fSRodney W. Grimes max = bp[0] + 2; 55858f0484fSRodney W. Grimes for (i = 1; i <= max; i++) 55958f0484fSRodney W. Grimes M_16_SWAP(bp[i]); 56058f0484fSRodney W. Grimes } 56158f0484fSRodney W. Grimes } 56258f0484fSRodney W. Grimes return (0); 56358f0484fSRodney W. Grimes } 56458f0484fSRodney W. Grimes 56558f0484fSRodney W. Grimes /* 56658f0484fSRodney W. Grimes * Write page p to disk 56758f0484fSRodney W. Grimes * 56858f0484fSRodney W. Grimes * Returns: 56958f0484fSRodney W. Grimes * 0 ==> OK 57058f0484fSRodney W. Grimes * -1 ==>failure 57158f0484fSRodney W. Grimes */ 5720ac22237SXin LI int 5730ac22237SXin LI __put_page(HTAB *hashp, char *p, u_int32_t bucket, int is_bucket, int is_bitmap) 57458f0484fSRodney W. Grimes { 57570e7268bSPedro F. Giffuni int fd, page, size; 57670e7268bSPedro F. Giffuni ssize_t wsize; 57770e7268bSPedro F. Giffuni char pbuf[MAX_BSIZE]; 57858f0484fSRodney W. Grimes 57958f0484fSRodney W. Grimes size = hashp->BSIZE; 58058f0484fSRodney W. Grimes if ((hashp->fp == -1) && open_temp(hashp)) 58158f0484fSRodney W. Grimes return (-1); 58258f0484fSRodney W. Grimes fd = hashp->fp; 58358f0484fSRodney W. Grimes 58458f0484fSRodney W. Grimes if (hashp->LORDER != BYTE_ORDER) { 585b115f257SXin LI int i, max; 58658f0484fSRodney W. Grimes 58770e7268bSPedro F. Giffuni memcpy(pbuf, p, size); 58858f0484fSRodney W. Grimes if (is_bitmap) { 58958f0484fSRodney W. Grimes max = hashp->BSIZE >> 2; /* divide by 4 */ 59058f0484fSRodney W. Grimes for (i = 0; i < max; i++) 59170e7268bSPedro F. Giffuni M_32_SWAP(((int *)pbuf)[i]); 59258f0484fSRodney W. Grimes } else { 59370e7268bSPedro F. Giffuni uint16_t *bp = (uint16_t *)(void *)pbuf; 59470e7268bSPedro F. Giffuni max = bp[0] + 2; 59558f0484fSRodney W. Grimes for (i = 0; i <= max; i++) 59670e7268bSPedro F. Giffuni M_16_SWAP(bp[i]); 59758f0484fSRodney W. Grimes } 59870e7268bSPedro F. Giffuni p = pbuf; 59958f0484fSRodney W. Grimes } 60058f0484fSRodney W. Grimes if (is_bucket) 60158f0484fSRodney W. Grimes page = BUCKET_TO_PAGE(bucket); 60258f0484fSRodney W. Grimes else 60358f0484fSRodney W. Grimes page = OADDR_TO_PAGE(bucket); 604d3b2afadSXin LI if ((wsize = pwrite(fd, p, size, (off_t)page << hashp->BSHIFT)) == -1) 60558f0484fSRodney W. Grimes /* Errno is set */ 60658f0484fSRodney W. Grimes return (-1); 60758f0484fSRodney W. Grimes if (wsize != size) { 60858f0484fSRodney W. Grimes errno = EFTYPE; 60958f0484fSRodney W. Grimes return (-1); 61058f0484fSRodney W. Grimes } 61158f0484fSRodney W. Grimes return (0); 61258f0484fSRodney W. Grimes } 61358f0484fSRodney W. Grimes 61458f0484fSRodney W. Grimes #define BYTE_MASK ((1 << INT_BYTE_SHIFT) -1) 61558f0484fSRodney W. Grimes /* 61658f0484fSRodney W. Grimes * Initialize a new bitmap page. Bitmap pages are left in memory 61758f0484fSRodney W. Grimes * once they are read in. 61858f0484fSRodney W. Grimes */ 6190ac22237SXin LI int 6200ac22237SXin LI __ibitmap(HTAB *hashp, int pnum, int nbits, int ndx) 62158f0484fSRodney W. Grimes { 622f1e396bcSPaul Traina u_int32_t *ip; 62358f0484fSRodney W. Grimes int clearbytes, clearints; 62458f0484fSRodney W. Grimes 625f1e396bcSPaul Traina if ((ip = (u_int32_t *)malloc(hashp->BSIZE)) == NULL) 62658f0484fSRodney W. Grimes return (1); 62758f0484fSRodney W. Grimes hashp->nmaps++; 62858f0484fSRodney W. Grimes clearints = ((nbits - 1) >> INT_BYTE_SHIFT) + 1; 62958f0484fSRodney W. Grimes clearbytes = clearints << INT_TO_BYTE; 63058f0484fSRodney W. Grimes (void)memset((char *)ip, 0, clearbytes); 63158f0484fSRodney W. Grimes (void)memset(((char *)ip) + clearbytes, 0xFF, 63258f0484fSRodney W. Grimes hashp->BSIZE - clearbytes); 63358f0484fSRodney W. Grimes ip[clearints - 1] = ALL_SET << (nbits & BYTE_MASK); 63458f0484fSRodney W. Grimes SETBIT(ip, 0); 635f1e396bcSPaul Traina hashp->BITMAPS[ndx] = (u_int16_t)pnum; 63658f0484fSRodney W. Grimes hashp->mapp[ndx] = ip; 63758f0484fSRodney W. Grimes return (0); 63858f0484fSRodney W. Grimes } 63958f0484fSRodney W. Grimes 640f1e396bcSPaul Traina static u_int32_t 6410ac22237SXin LI first_free(u_int32_t map) 64258f0484fSRodney W. Grimes { 6438fb3f3f6SDavid E. O'Brien u_int32_t i, mask; 64458f0484fSRodney W. Grimes 64558f0484fSRodney W. Grimes mask = 0x1; 64658f0484fSRodney W. Grimes for (i = 0; i < BITS_PER_MAP; i++) { 64758f0484fSRodney W. Grimes if (!(mask & map)) 64858f0484fSRodney W. Grimes return (i); 64958f0484fSRodney W. Grimes mask = mask << 1; 65058f0484fSRodney W. Grimes } 65158f0484fSRodney W. Grimes return (i); 65258f0484fSRodney W. Grimes } 65358f0484fSRodney W. Grimes 654f1e396bcSPaul Traina static u_int16_t 6550ac22237SXin LI overflow_page(HTAB *hashp) 65658f0484fSRodney W. Grimes { 6578fb3f3f6SDavid E. O'Brien u_int32_t *freep; 6588fb3f3f6SDavid E. O'Brien int max_free, offset, splitnum; 659f1e396bcSPaul Traina u_int16_t addr; 66058f0484fSRodney W. Grimes int bit, first_page, free_bit, free_page, i, in_use_bits, j; 66158f0484fSRodney W. Grimes #ifdef DEBUG2 66258f0484fSRodney W. Grimes int tmp1, tmp2; 66358f0484fSRodney W. Grimes #endif 66458f0484fSRodney W. Grimes splitnum = hashp->OVFL_POINT; 66558f0484fSRodney W. Grimes max_free = hashp->SPARES[splitnum]; 66658f0484fSRodney W. Grimes 66758f0484fSRodney W. Grimes free_page = (max_free - 1) >> (hashp->BSHIFT + BYTE_SHIFT); 66858f0484fSRodney W. Grimes free_bit = (max_free - 1) & ((hashp->BSIZE << BYTE_SHIFT) - 1); 66958f0484fSRodney W. Grimes 67058f0484fSRodney W. Grimes /* Look through all the free maps to find the first free block */ 67158f0484fSRodney W. Grimes first_page = hashp->LAST_FREED >>(hashp->BSHIFT + BYTE_SHIFT); 67258f0484fSRodney W. Grimes for ( i = first_page; i <= free_page; i++ ) { 673f1e396bcSPaul Traina if (!(freep = (u_int32_t *)hashp->mapp[i]) && 67458f0484fSRodney W. Grimes !(freep = fetch_bitmap(hashp, i))) 675f1e396bcSPaul Traina return (0); 67658f0484fSRodney W. Grimes if (i == free_page) 67758f0484fSRodney W. Grimes in_use_bits = free_bit; 67858f0484fSRodney W. Grimes else 67958f0484fSRodney W. Grimes in_use_bits = (hashp->BSIZE << BYTE_SHIFT) - 1; 68058f0484fSRodney W. Grimes 68158f0484fSRodney W. Grimes if (i == first_page) { 68258f0484fSRodney W. Grimes bit = hashp->LAST_FREED & 68358f0484fSRodney W. Grimes ((hashp->BSIZE << BYTE_SHIFT) - 1); 68458f0484fSRodney W. Grimes j = bit / BITS_PER_MAP; 68575a5de5aSPedro F. Giffuni bit = rounddown2(bit, BITS_PER_MAP); 68658f0484fSRodney W. Grimes } else { 68758f0484fSRodney W. Grimes bit = 0; 68858f0484fSRodney W. Grimes j = 0; 68958f0484fSRodney W. Grimes } 69058f0484fSRodney W. Grimes for (; bit <= in_use_bits; j++, bit += BITS_PER_MAP) 69158f0484fSRodney W. Grimes if (freep[j] != ALL_SET) 69258f0484fSRodney W. Grimes goto found; 69358f0484fSRodney W. Grimes } 69458f0484fSRodney W. Grimes 69558f0484fSRodney W. Grimes /* No Free Page Found */ 69658f0484fSRodney W. Grimes hashp->LAST_FREED = hashp->SPARES[splitnum]; 69758f0484fSRodney W. Grimes hashp->SPARES[splitnum]++; 69858f0484fSRodney W. Grimes offset = hashp->SPARES[splitnum] - 69958f0484fSRodney W. Grimes (splitnum ? hashp->SPARES[splitnum - 1] : 0); 70058f0484fSRodney W. Grimes 70158f0484fSRodney W. Grimes #define OVMSG "HASH: Out of overflow pages. Increase page size\n" 70258f0484fSRodney W. Grimes if (offset > SPLITMASK) { 70358f0484fSRodney W. Grimes if (++splitnum >= NCACHED) { 7049233c4d9SJason Evans (void)_write(STDERR_FILENO, OVMSG, sizeof(OVMSG) - 1); 705a53e89e3SXin LI errno = EFBIG; 706f1e396bcSPaul Traina return (0); 70758f0484fSRodney W. Grimes } 70858f0484fSRodney W. Grimes hashp->OVFL_POINT = splitnum; 70958f0484fSRodney W. Grimes hashp->SPARES[splitnum] = hashp->SPARES[splitnum-1]; 71058f0484fSRodney W. Grimes hashp->SPARES[splitnum-1]--; 71158f0484fSRodney W. Grimes offset = 1; 71258f0484fSRodney W. Grimes } 71358f0484fSRodney W. Grimes 71458f0484fSRodney W. Grimes /* Check if we need to allocate a new bitmap page */ 71558f0484fSRodney W. Grimes if (free_bit == (hashp->BSIZE << BYTE_SHIFT) - 1) { 71658f0484fSRodney W. Grimes free_page++; 71758f0484fSRodney W. Grimes if (free_page >= NCACHED) { 7189233c4d9SJason Evans (void)_write(STDERR_FILENO, OVMSG, sizeof(OVMSG) - 1); 719a53e89e3SXin LI errno = EFBIG; 720f1e396bcSPaul Traina return (0); 72158f0484fSRodney W. Grimes } 72258f0484fSRodney W. Grimes /* 72358f0484fSRodney W. Grimes * This is tricky. The 1 indicates that you want the new page 72458f0484fSRodney W. Grimes * allocated with 1 clear bit. Actually, you are going to 72558f0484fSRodney W. Grimes * allocate 2 pages from this map. The first is going to be 72658f0484fSRodney W. Grimes * the map page, the second is the overflow page we were 72758f0484fSRodney W. Grimes * looking for. The init_bitmap routine automatically, sets 72858f0484fSRodney W. Grimes * the first bit of itself to indicate that the bitmap itself 72958f0484fSRodney W. Grimes * is in use. We would explicitly set the second bit, but 73058f0484fSRodney W. Grimes * don't have to if we tell init_bitmap not to leave it clear 73158f0484fSRodney W. Grimes * in the first place. 73258f0484fSRodney W. Grimes */ 733f1e396bcSPaul Traina if (__ibitmap(hashp, 734f1e396bcSPaul Traina (int)OADDR_OF(splitnum, offset), 1, free_page)) 735f1e396bcSPaul Traina return (0); 73658f0484fSRodney W. Grimes hashp->SPARES[splitnum]++; 73758f0484fSRodney W. Grimes #ifdef DEBUG2 73858f0484fSRodney W. Grimes free_bit = 2; 73958f0484fSRodney W. Grimes #endif 74058f0484fSRodney W. Grimes offset++; 74158f0484fSRodney W. Grimes if (offset > SPLITMASK) { 74258f0484fSRodney W. Grimes if (++splitnum >= NCACHED) { 7439233c4d9SJason Evans (void)_write(STDERR_FILENO, OVMSG, 74458f0484fSRodney W. Grimes sizeof(OVMSG) - 1); 745a53e89e3SXin LI errno = EFBIG; 746f1e396bcSPaul Traina return (0); 74758f0484fSRodney W. Grimes } 74858f0484fSRodney W. Grimes hashp->OVFL_POINT = splitnum; 74958f0484fSRodney W. Grimes hashp->SPARES[splitnum] = hashp->SPARES[splitnum-1]; 75058f0484fSRodney W. Grimes hashp->SPARES[splitnum-1]--; 75158f0484fSRodney W. Grimes offset = 0; 75258f0484fSRodney W. Grimes } 75358f0484fSRodney W. Grimes } else { 75458f0484fSRodney W. Grimes /* 75558f0484fSRodney W. Grimes * Free_bit addresses the last used bit. Bump it to address 75658f0484fSRodney W. Grimes * the first available bit. 75758f0484fSRodney W. Grimes */ 75858f0484fSRodney W. Grimes free_bit++; 75958f0484fSRodney W. Grimes SETBIT(freep, free_bit); 76058f0484fSRodney W. Grimes } 76158f0484fSRodney W. Grimes 76258f0484fSRodney W. Grimes /* Calculate address of the new overflow page */ 76358f0484fSRodney W. Grimes addr = OADDR_OF(splitnum, offset); 76458f0484fSRodney W. Grimes #ifdef DEBUG2 76558f0484fSRodney W. Grimes (void)fprintf(stderr, "OVERFLOW_PAGE: ADDR: %d BIT: %d PAGE %d\n", 76658f0484fSRodney W. Grimes addr, free_bit, free_page); 76758f0484fSRodney W. Grimes #endif 76858f0484fSRodney W. Grimes return (addr); 76958f0484fSRodney W. Grimes 77058f0484fSRodney W. Grimes found: 77158f0484fSRodney W. Grimes bit = bit + first_free(freep[j]); 77258f0484fSRodney W. Grimes SETBIT(freep, bit); 77358f0484fSRodney W. Grimes #ifdef DEBUG2 77458f0484fSRodney W. Grimes tmp1 = bit; 77558f0484fSRodney W. Grimes tmp2 = i; 77658f0484fSRodney W. Grimes #endif 77758f0484fSRodney W. Grimes /* 77858f0484fSRodney W. Grimes * Bits are addressed starting with 0, but overflow pages are addressed 77958f0484fSRodney W. Grimes * beginning at 1. Bit is a bit addressnumber, so we need to increment 78058f0484fSRodney W. Grimes * it to convert it to a page number. 78158f0484fSRodney W. Grimes */ 78258f0484fSRodney W. Grimes bit = 1 + bit + (i * (hashp->BSIZE << BYTE_SHIFT)); 78358f0484fSRodney W. Grimes if (bit >= hashp->LAST_FREED) 78458f0484fSRodney W. Grimes hashp->LAST_FREED = bit - 1; 78558f0484fSRodney W. Grimes 78658f0484fSRodney W. Grimes /* Calculate the split number for this page */ 78758f0484fSRodney W. Grimes for (i = 0; (i < splitnum) && (bit > hashp->SPARES[i]); i++); 78858f0484fSRodney W. Grimes offset = (i ? bit - hashp->SPARES[i - 1] : bit); 789a53e89e3SXin LI if (offset >= SPLITMASK) { 790a53e89e3SXin LI (void)_write(STDERR_FILENO, OVMSG, sizeof(OVMSG) - 1); 791a53e89e3SXin LI errno = EFBIG; 792f1e396bcSPaul Traina return (0); /* Out of overflow pages */ 793a53e89e3SXin LI } 79458f0484fSRodney W. Grimes addr = OADDR_OF(i, offset); 79558f0484fSRodney W. Grimes #ifdef DEBUG2 79658f0484fSRodney W. Grimes (void)fprintf(stderr, "OVERFLOW_PAGE: ADDR: %d BIT: %d PAGE %d\n", 79758f0484fSRodney W. Grimes addr, tmp1, tmp2); 79858f0484fSRodney W. Grimes #endif 79958f0484fSRodney W. Grimes 80058f0484fSRodney W. Grimes /* Allocate and return the overflow page */ 80158f0484fSRodney W. Grimes return (addr); 80258f0484fSRodney W. Grimes } 80358f0484fSRodney W. Grimes 80458f0484fSRodney W. Grimes /* 80558f0484fSRodney W. Grimes * Mark this overflow page as free. 80658f0484fSRodney W. Grimes */ 8070ac22237SXin LI void 8080ac22237SXin LI __free_ovflpage(HTAB *hashp, BUFHEAD *obufp) 80958f0484fSRodney W. Grimes { 8108fb3f3f6SDavid E. O'Brien u_int16_t addr; 811f1e396bcSPaul Traina u_int32_t *freep; 81258f0484fSRodney W. Grimes int bit_address, free_page, free_bit; 813f1e396bcSPaul Traina u_int16_t ndx; 81458f0484fSRodney W. Grimes 81558f0484fSRodney W. Grimes addr = obufp->addr; 81658f0484fSRodney W. Grimes #ifdef DEBUG1 81758f0484fSRodney W. Grimes (void)fprintf(stderr, "Freeing %d\n", addr); 81858f0484fSRodney W. Grimes #endif 819f1e396bcSPaul Traina ndx = (((u_int16_t)addr) >> SPLITSHIFT); 82058f0484fSRodney W. Grimes bit_address = 82158f0484fSRodney W. Grimes (ndx ? hashp->SPARES[ndx - 1] : 0) + (addr & SPLITMASK) - 1; 82258f0484fSRodney W. Grimes if (bit_address < hashp->LAST_FREED) 82358f0484fSRodney W. Grimes hashp->LAST_FREED = bit_address; 82458f0484fSRodney W. Grimes free_page = (bit_address >> (hashp->BSHIFT + BYTE_SHIFT)); 82558f0484fSRodney W. Grimes free_bit = bit_address & ((hashp->BSIZE << BYTE_SHIFT) - 1); 82658f0484fSRodney W. Grimes 82758f0484fSRodney W. Grimes if (!(freep = hashp->mapp[free_page])) 82858f0484fSRodney W. Grimes freep = fetch_bitmap(hashp, free_page); 82958f0484fSRodney W. Grimes #ifdef DEBUG 83058f0484fSRodney W. Grimes /* 83158f0484fSRodney W. Grimes * This had better never happen. It means we tried to read a bitmap 83258f0484fSRodney W. Grimes * that has already had overflow pages allocated off it, and we 83358f0484fSRodney W. Grimes * failed to read it from the file. 83458f0484fSRodney W. Grimes */ 83558f0484fSRodney W. Grimes if (!freep) 83658f0484fSRodney W. Grimes assert(0); 83758f0484fSRodney W. Grimes #endif 83858f0484fSRodney W. Grimes CLRBIT(freep, free_bit); 83958f0484fSRodney W. Grimes #ifdef DEBUG2 84058f0484fSRodney W. Grimes (void)fprintf(stderr, "FREE_OVFLPAGE: ADDR: %d BIT: %d PAGE %d\n", 84158f0484fSRodney W. Grimes obufp->addr, free_bit, free_page); 84258f0484fSRodney W. Grimes #endif 84358f0484fSRodney W. Grimes __reclaim_buf(hashp, obufp); 84458f0484fSRodney W. Grimes } 84558f0484fSRodney W. Grimes 84658f0484fSRodney W. Grimes /* 84758f0484fSRodney W. Grimes * Returns: 84858f0484fSRodney W. Grimes * 0 success 84958f0484fSRodney W. Grimes * -1 failure 85058f0484fSRodney W. Grimes */ 85158f0484fSRodney W. Grimes static int 8520ac22237SXin LI open_temp(HTAB *hashp) 85358f0484fSRodney W. Grimes { 85458f0484fSRodney W. Grimes sigset_t set, oset; 85502d7f710SXin LI int len; 85602d7f710SXin LI char *envtmp = NULL; 85702d7f710SXin LI char path[MAXPATHLEN]; 85802d7f710SXin LI 85902d7f710SXin LI if (issetugid() == 0) 86002d7f710SXin LI envtmp = getenv("TMPDIR"); 86102d7f710SXin LI len = snprintf(path, 86202d7f710SXin LI sizeof(path), "%s/_hash.XXXXXX", envtmp ? envtmp : "/tmp"); 863e8ee08baSXin LI if (len < 0 || len >= (int)sizeof(path)) { 86402d7f710SXin LI errno = ENAMETOOLONG; 86502d7f710SXin LI return (-1); 86602d7f710SXin LI } 86758f0484fSRodney W. Grimes 86858f0484fSRodney W. Grimes /* Block signals; make sure file goes away at process exit. */ 86958f0484fSRodney W. Grimes (void)sigfillset(&set); 870bd6060a1SKonstantin Belousov (void)__libc_sigprocmask(SIG_BLOCK, &set, &oset); 87189521d41SJilles Tjoelker if ((hashp->fp = mkostemp(path, O_CLOEXEC)) != -1) 87202d7f710SXin LI (void)unlink(path); 873bd6060a1SKonstantin Belousov (void)__libc_sigprocmask(SIG_SETMASK, &oset, (sigset_t *)NULL); 87458f0484fSRodney W. Grimes return (hashp->fp != -1 ? 0 : -1); 87558f0484fSRodney W. Grimes } 87658f0484fSRodney W. Grimes 87758f0484fSRodney W. Grimes /* 87858f0484fSRodney W. Grimes * We have to know that the key will fit, but the last entry on the page is 87958f0484fSRodney W. Grimes * an overflow pair, so we need to shift things. 88058f0484fSRodney W. Grimes */ 88158f0484fSRodney W. Grimes static void 8820ac22237SXin LI squeeze_key(u_int16_t *sp, const DBT *key, const DBT *val) 88358f0484fSRodney W. Grimes { 8848fb3f3f6SDavid E. O'Brien char *p; 885f1e396bcSPaul Traina u_int16_t free_space, n, off, pageno; 88658f0484fSRodney W. Grimes 88758f0484fSRodney W. Grimes p = (char *)sp; 88858f0484fSRodney W. Grimes n = sp[0]; 88958f0484fSRodney W. Grimes free_space = FREESPACE(sp); 89058f0484fSRodney W. Grimes off = OFFSET(sp); 89158f0484fSRodney W. Grimes 89258f0484fSRodney W. Grimes pageno = sp[n - 1]; 89358f0484fSRodney W. Grimes off -= key->size; 89458f0484fSRodney W. Grimes sp[n - 1] = off; 89558f0484fSRodney W. Grimes memmove(p + off, key->data, key->size); 89658f0484fSRodney W. Grimes off -= val->size; 89758f0484fSRodney W. Grimes sp[n] = off; 89858f0484fSRodney W. Grimes memmove(p + off, val->data, val->size); 89958f0484fSRodney W. Grimes sp[0] = n + 2; 90058f0484fSRodney W. Grimes sp[n + 1] = pageno; 90158f0484fSRodney W. Grimes sp[n + 2] = OVFLPAGE; 90258f0484fSRodney W. Grimes FREESPACE(sp) = free_space - PAIRSIZE(key, val); 90358f0484fSRodney W. Grimes OFFSET(sp) = off; 90458f0484fSRodney W. Grimes } 90558f0484fSRodney W. Grimes 906f1e396bcSPaul Traina static u_int32_t * 9070ac22237SXin LI fetch_bitmap(HTAB *hashp, int ndx) 90858f0484fSRodney W. Grimes { 90958f0484fSRodney W. Grimes if (ndx >= hashp->nmaps) 91058f0484fSRodney W. Grimes return (NULL); 911f1e396bcSPaul Traina if ((hashp->mapp[ndx] = (u_int32_t *)malloc(hashp->BSIZE)) == NULL) 91258f0484fSRodney W. Grimes return (NULL); 91358f0484fSRodney W. Grimes if (__get_page(hashp, 91458f0484fSRodney W. Grimes (char *)hashp->mapp[ndx], hashp->BITMAPS[ndx], 0, 1, 1)) { 91558f0484fSRodney W. Grimes free(hashp->mapp[ndx]); 91658f0484fSRodney W. Grimes return (NULL); 91758f0484fSRodney W. Grimes } 91858f0484fSRodney W. Grimes return (hashp->mapp[ndx]); 91958f0484fSRodney W. Grimes } 92058f0484fSRodney W. Grimes 92158f0484fSRodney W. Grimes #ifdef DEBUG4 92258f0484fSRodney W. Grimes int 9230ac22237SXin LI print_chain(int addr) 92458f0484fSRodney W. Grimes { 92558f0484fSRodney W. Grimes BUFHEAD *bufp; 92658f0484fSRodney W. Grimes short *bp, oaddr; 92758f0484fSRodney W. Grimes 92858f0484fSRodney W. Grimes (void)fprintf(stderr, "%d ", addr); 92958f0484fSRodney W. Grimes bufp = __get_buf(hashp, addr, NULL, 0); 93058f0484fSRodney W. Grimes bp = (short *)bufp->page; 93158f0484fSRodney W. Grimes while (bp[0] && ((bp[bp[0]] == OVFLPAGE) || 93258f0484fSRodney W. Grimes ((bp[0] > 2) && bp[2] < REAL_KEY))) { 93358f0484fSRodney W. Grimes oaddr = bp[bp[0] - 1]; 93458f0484fSRodney W. Grimes (void)fprintf(stderr, "%d ", (int)oaddr); 93558f0484fSRodney W. Grimes bufp = __get_buf(hashp, (int)oaddr, bufp, 0); 93658f0484fSRodney W. Grimes bp = (short *)bufp->page; 93758f0484fSRodney W. Grimes } 93858f0484fSRodney W. Grimes (void)fprintf(stderr, "\n"); 93958f0484fSRodney W. Grimes } 94058f0484fSRodney W. Grimes #endif 941