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" 6958f0484fSRodney W. Grimes 7058f0484fSRodney W. Grimes #include <db.h> 7158f0484fSRodney W. Grimes #include "hash.h" 7258f0484fSRodney W. Grimes #include "page.h" 7358f0484fSRodney W. Grimes #include "extern.h" 7458f0484fSRodney W. Grimes 75c05ac53bSDavid E. O'Brien static u_int32_t *fetch_bitmap(HTAB *, int); 76c05ac53bSDavid E. O'Brien static u_int32_t first_free(u_int32_t); 77c05ac53bSDavid E. O'Brien static int open_temp(HTAB *); 78c05ac53bSDavid E. O'Brien static u_int16_t overflow_page(HTAB *); 79c05ac53bSDavid E. O'Brien static void putpair(char *, const DBT *, const DBT *); 80c05ac53bSDavid E. O'Brien static void squeeze_key(u_int16_t *, const DBT *, const DBT *); 810ac22237SXin LI static int ugly_split(HTAB *, u_int32_t, BUFHEAD *, BUFHEAD *, int, int); 8258f0484fSRodney W. Grimes 8358f0484fSRodney W. Grimes #define PAGE_INIT(P) { \ 84f1e396bcSPaul Traina ((u_int16_t *)(P))[0] = 0; \ 85f1e396bcSPaul Traina ((u_int16_t *)(P))[1] = hashp->BSIZE - 3 * sizeof(u_int16_t); \ 86f1e396bcSPaul Traina ((u_int16_t *)(P))[2] = hashp->BSIZE; \ 8758f0484fSRodney W. Grimes } 8858f0484fSRodney W. Grimes 8958f0484fSRodney W. Grimes /* 9058f0484fSRodney W. Grimes * This is called AFTER we have verified that there is room on the page for 9158f0484fSRodney W. Grimes * the pair (PAIRFITS has returned true) so we go right ahead and start moving 9258f0484fSRodney W. Grimes * stuff on. 9358f0484fSRodney W. Grimes */ 9458f0484fSRodney W. Grimes static void 950ac22237SXin LI putpair(char *p, const DBT *key, const DBT *val) 9658f0484fSRodney W. Grimes { 978fb3f3f6SDavid E. O'Brien u_int16_t *bp, n, off; 9858f0484fSRodney W. Grimes 99f1e396bcSPaul Traina bp = (u_int16_t *)p; 10058f0484fSRodney W. Grimes 10158f0484fSRodney W. Grimes /* Enter the key first. */ 10258f0484fSRodney W. Grimes n = bp[0]; 10358f0484fSRodney W. Grimes 10458f0484fSRodney W. Grimes off = OFFSET(bp) - key->size; 10558f0484fSRodney W. Grimes memmove(p + off, key->data, key->size); 10658f0484fSRodney W. Grimes bp[++n] = off; 10758f0484fSRodney W. Grimes 10858f0484fSRodney W. Grimes /* Now the data. */ 10958f0484fSRodney W. Grimes off -= val->size; 11058f0484fSRodney W. Grimes memmove(p + off, val->data, val->size); 11158f0484fSRodney W. Grimes bp[++n] = off; 11258f0484fSRodney W. Grimes 11358f0484fSRodney W. Grimes /* Adjust page info. */ 11458f0484fSRodney W. Grimes bp[0] = n; 115f1e396bcSPaul Traina bp[n + 1] = off - ((n + 3) * sizeof(u_int16_t)); 11658f0484fSRodney W. Grimes bp[n + 2] = off; 11758f0484fSRodney W. Grimes } 11858f0484fSRodney W. Grimes 11958f0484fSRodney W. Grimes /* 12058f0484fSRodney W. Grimes * Returns: 12158f0484fSRodney W. Grimes * 0 OK 12258f0484fSRodney W. Grimes * -1 error 12358f0484fSRodney W. Grimes */ 1240ac22237SXin LI int 1250ac22237SXin LI __delpair(HTAB *hashp, BUFHEAD *bufp, int ndx) 12658f0484fSRodney W. Grimes { 127b115f257SXin LI u_int16_t *bp, newoff, pairlen; 1288fb3f3f6SDavid E. O'Brien int n; 12958f0484fSRodney W. Grimes 130f1e396bcSPaul Traina bp = (u_int16_t *)bufp->page; 13158f0484fSRodney W. Grimes n = bp[0]; 13258f0484fSRodney W. Grimes 13358f0484fSRodney W. Grimes if (bp[ndx + 1] < REAL_KEY) 13458f0484fSRodney W. Grimes return (__big_delete(hashp, bufp)); 13558f0484fSRodney W. Grimes if (ndx != 1) 13658f0484fSRodney W. Grimes newoff = bp[ndx - 1]; 13758f0484fSRodney W. Grimes else 13858f0484fSRodney W. Grimes newoff = hashp->BSIZE; 13958f0484fSRodney W. Grimes pairlen = newoff - bp[ndx + 1]; 14058f0484fSRodney W. Grimes 14158f0484fSRodney W. Grimes if (ndx != (n - 1)) { 14258f0484fSRodney W. Grimes /* Hard Case -- need to shuffle keys */ 1438fb3f3f6SDavid E. O'Brien int i; 1448fb3f3f6SDavid E. O'Brien char *src = bufp->page + (int)OFFSET(bp); 1458fb3f3f6SDavid E. O'Brien char *dst = src + (int)pairlen; 14658f0484fSRodney W. Grimes memmove(dst, src, bp[ndx + 1] - OFFSET(bp)); 14758f0484fSRodney W. Grimes 14858f0484fSRodney W. Grimes /* Now adjust the pointers */ 14958f0484fSRodney W. Grimes for (i = ndx + 2; i <= n; i += 2) { 15058f0484fSRodney W. Grimes if (bp[i + 1] == OVFLPAGE) { 15158f0484fSRodney W. Grimes bp[i - 2] = bp[i]; 15258f0484fSRodney W. Grimes bp[i - 1] = bp[i + 1]; 15358f0484fSRodney W. Grimes } else { 15458f0484fSRodney W. Grimes bp[i - 2] = bp[i] + pairlen; 15558f0484fSRodney W. Grimes bp[i - 1] = bp[i + 1] + pairlen; 15658f0484fSRodney W. Grimes } 15758f0484fSRodney W. Grimes } 158213bceeeSXin LI if (ndx == hashp->cndx) { 159213bceeeSXin LI /* 160213bceeeSXin LI * We just removed pair we were "pointing" to. 161213bceeeSXin LI * By moving back the cndx we ensure subsequent 162213bceeeSXin LI * hash_seq() calls won't skip over any entries. 163213bceeeSXin LI */ 164213bceeeSXin LI hashp->cndx -= 2; 165213bceeeSXin LI } 16658f0484fSRodney W. Grimes } 16758f0484fSRodney W. Grimes /* Finally adjust the page data */ 16858f0484fSRodney W. Grimes bp[n] = OFFSET(bp) + pairlen; 169f1e396bcSPaul Traina bp[n - 1] = bp[n + 1] + pairlen + 2 * sizeof(u_int16_t); 17058f0484fSRodney W. Grimes bp[0] = n - 2; 17158f0484fSRodney W. Grimes hashp->NKEYS--; 17258f0484fSRodney W. Grimes 17358f0484fSRodney W. Grimes bufp->flags |= BUF_MOD; 17458f0484fSRodney W. Grimes return (0); 17558f0484fSRodney W. Grimes } 17658f0484fSRodney W. Grimes /* 17758f0484fSRodney W. Grimes * Returns: 17858f0484fSRodney W. Grimes * 0 ==> OK 17958f0484fSRodney W. Grimes * -1 ==> Error 18058f0484fSRodney W. Grimes */ 1810ac22237SXin LI int 1820ac22237SXin LI __split_page(HTAB *hashp, u_int32_t obucket, u_int32_t nbucket) 18358f0484fSRodney W. Grimes { 1848fb3f3f6SDavid E. O'Brien BUFHEAD *new_bufp, *old_bufp; 1858fb3f3f6SDavid E. O'Brien u_int16_t *ino; 1868fb3f3f6SDavid E. O'Brien char *np; 18758f0484fSRodney W. Grimes DBT key, val; 18858f0484fSRodney W. Grimes int n, ndx, retval; 189f1e396bcSPaul Traina u_int16_t copyto, diff, off, moved; 19058f0484fSRodney W. Grimes char *op; 19158f0484fSRodney W. Grimes 192f1e396bcSPaul Traina copyto = (u_int16_t)hashp->BSIZE; 193f1e396bcSPaul Traina off = (u_int16_t)hashp->BSIZE; 19458f0484fSRodney W. Grimes old_bufp = __get_buf(hashp, obucket, NULL, 0); 19558f0484fSRodney W. Grimes if (old_bufp == NULL) 19658f0484fSRodney W. Grimes return (-1); 19758f0484fSRodney W. Grimes new_bufp = __get_buf(hashp, nbucket, NULL, 0); 19858f0484fSRodney W. Grimes if (new_bufp == NULL) 19958f0484fSRodney W. Grimes return (-1); 20058f0484fSRodney W. Grimes 20158f0484fSRodney W. Grimes old_bufp->flags |= (BUF_MOD | BUF_PIN); 20258f0484fSRodney W. Grimes new_bufp->flags |= (BUF_MOD | BUF_PIN); 20358f0484fSRodney W. Grimes 204f1e396bcSPaul Traina ino = (u_int16_t *)(op = old_bufp->page); 20558f0484fSRodney W. Grimes np = new_bufp->page; 20658f0484fSRodney W. Grimes 20758f0484fSRodney W. Grimes moved = 0; 20858f0484fSRodney W. Grimes 20958f0484fSRodney W. Grimes for (n = 1, ndx = 1; n < ino[0]; n += 2) { 21058f0484fSRodney W. Grimes if (ino[n + 1] < REAL_KEY) { 21158f0484fSRodney W. Grimes retval = ugly_split(hashp, obucket, old_bufp, new_bufp, 21258f0484fSRodney W. Grimes (int)copyto, (int)moved); 21358f0484fSRodney W. Grimes old_bufp->flags &= ~BUF_PIN; 21458f0484fSRodney W. Grimes new_bufp->flags &= ~BUF_PIN; 21558f0484fSRodney W. Grimes return (retval); 21658f0484fSRodney W. Grimes 21758f0484fSRodney W. Grimes } 21858f0484fSRodney W. Grimes key.data = (u_char *)op + ino[n]; 21958f0484fSRodney W. Grimes key.size = off - ino[n]; 22058f0484fSRodney W. Grimes 22158f0484fSRodney W. Grimes if (__call_hash(hashp, key.data, key.size) == obucket) { 22258f0484fSRodney W. Grimes /* Don't switch page */ 22358f0484fSRodney W. Grimes diff = copyto - off; 22458f0484fSRodney W. Grimes if (diff) { 22558f0484fSRodney W. Grimes copyto = ino[n + 1] + diff; 22658f0484fSRodney W. Grimes memmove(op + copyto, op + ino[n + 1], 22758f0484fSRodney W. Grimes off - ino[n + 1]); 22858f0484fSRodney W. Grimes ino[ndx] = copyto + ino[n] - ino[n + 1]; 22958f0484fSRodney W. Grimes ino[ndx + 1] = copyto; 23058f0484fSRodney W. Grimes } else 23158f0484fSRodney W. Grimes copyto = ino[n + 1]; 23258f0484fSRodney W. Grimes ndx += 2; 23358f0484fSRodney W. Grimes } else { 23458f0484fSRodney W. Grimes /* Switch page */ 23558f0484fSRodney W. Grimes val.data = (u_char *)op + ino[n + 1]; 23658f0484fSRodney W. Grimes val.size = ino[n] - ino[n + 1]; 23758f0484fSRodney W. Grimes putpair(np, &key, &val); 23858f0484fSRodney W. Grimes moved += 2; 23958f0484fSRodney W. Grimes } 24058f0484fSRodney W. Grimes 24158f0484fSRodney W. Grimes off = ino[n + 1]; 24258f0484fSRodney W. Grimes } 24358f0484fSRodney W. Grimes 24458f0484fSRodney W. Grimes /* Now clean up the page */ 24558f0484fSRodney W. Grimes ino[0] -= moved; 246f1e396bcSPaul Traina FREESPACE(ino) = copyto - sizeof(u_int16_t) * (ino[0] + 3); 24758f0484fSRodney W. Grimes OFFSET(ino) = copyto; 24858f0484fSRodney W. Grimes 24958f0484fSRodney W. Grimes #ifdef DEBUG3 25058f0484fSRodney W. Grimes (void)fprintf(stderr, "split %d/%d\n", 251f1e396bcSPaul Traina ((u_int16_t *)np)[0] / 2, 252f1e396bcSPaul Traina ((u_int16_t *)op)[0] / 2); 25358f0484fSRodney W. Grimes #endif 25458f0484fSRodney W. Grimes /* unpin both pages */ 25558f0484fSRodney W. Grimes old_bufp->flags &= ~BUF_PIN; 25658f0484fSRodney W. Grimes new_bufp->flags &= ~BUF_PIN; 25758f0484fSRodney W. Grimes return (0); 25858f0484fSRodney W. Grimes } 25958f0484fSRodney W. Grimes 26058f0484fSRodney W. Grimes /* 26158f0484fSRodney W. Grimes * Called when we encounter an overflow or big key/data page during split 26258f0484fSRodney W. Grimes * handling. This is special cased since we have to begin checking whether 26358f0484fSRodney W. Grimes * the key/data pairs fit on their respective pages and because we may need 26458f0484fSRodney W. Grimes * overflow pages for both the old and new pages. 26558f0484fSRodney W. Grimes * 26658f0484fSRodney W. Grimes * The first page might be a page with regular key/data pairs in which case 26758f0484fSRodney W. Grimes * we have a regular overflow condition and just need to go on to the next 26858f0484fSRodney W. Grimes * page or it might be a big key/data pair in which case we need to fix the 26958f0484fSRodney W. Grimes * big key/data pair. 27058f0484fSRodney W. Grimes * 27158f0484fSRodney W. Grimes * Returns: 27258f0484fSRodney W. Grimes * 0 ==> success 27358f0484fSRodney W. Grimes * -1 ==> failure 27458f0484fSRodney W. Grimes */ 27558f0484fSRodney W. Grimes static int 2760ac22237SXin LI ugly_split(HTAB *hashp, 2770ac22237SXin LI u_int32_t obucket, /* Same as __split_page. */ 2780ac22237SXin LI BUFHEAD *old_bufp, 2790ac22237SXin LI BUFHEAD *new_bufp, 2800ac22237SXin LI int copyto, /* First byte on page which contains key/data values. */ 2810ac22237SXin LI int moved) /* Number of pairs moved to new page. */ 28258f0484fSRodney W. Grimes { 2838fb3f3f6SDavid E. O'Brien BUFHEAD *bufp; /* Buffer header for ino */ 2848fb3f3f6SDavid E. O'Brien u_int16_t *ino; /* Page keys come off of */ 2858fb3f3f6SDavid E. O'Brien u_int16_t *np; /* New page */ 2868fb3f3f6SDavid E. O'Brien u_int16_t *op; /* Page keys go on to if they aren't moving */ 28758f0484fSRodney W. Grimes 28858f0484fSRodney W. Grimes BUFHEAD *last_bfp; /* Last buf header OVFL needing to be freed */ 28958f0484fSRodney W. Grimes DBT key, val; 29058f0484fSRodney W. Grimes SPLIT_RETURN ret; 291f1e396bcSPaul Traina u_int16_t n, off, ov_addr, scopyto; 29258f0484fSRodney W. Grimes char *cino; /* Character value of ino */ 29358f0484fSRodney W. Grimes 29458f0484fSRodney W. Grimes bufp = old_bufp; 295f1e396bcSPaul Traina ino = (u_int16_t *)old_bufp->page; 296f1e396bcSPaul Traina np = (u_int16_t *)new_bufp->page; 297f1e396bcSPaul Traina op = (u_int16_t *)old_bufp->page; 29858f0484fSRodney W. Grimes last_bfp = NULL; 299f1e396bcSPaul Traina scopyto = (u_int16_t)copyto; /* ANSI */ 30058f0484fSRodney W. Grimes 30158f0484fSRodney W. Grimes n = ino[0] - 1; 30258f0484fSRodney W. Grimes while (n < ino[0]) { 30358f0484fSRodney W. Grimes if (ino[2] < REAL_KEY && ino[2] != OVFLPAGE) { 30458f0484fSRodney W. Grimes if (__big_split(hashp, old_bufp, 30558f0484fSRodney W. Grimes new_bufp, bufp, bufp->addr, obucket, &ret)) 30658f0484fSRodney W. Grimes return (-1); 30758f0484fSRodney W. Grimes old_bufp = ret.oldp; 30858f0484fSRodney W. Grimes if (!old_bufp) 30958f0484fSRodney W. Grimes return (-1); 310f1e396bcSPaul Traina op = (u_int16_t *)old_bufp->page; 31158f0484fSRodney W. Grimes new_bufp = ret.newp; 31258f0484fSRodney W. Grimes if (!new_bufp) 31358f0484fSRodney W. Grimes return (-1); 314f1e396bcSPaul Traina np = (u_int16_t *)new_bufp->page; 31558f0484fSRodney W. Grimes bufp = ret.nextp; 31658f0484fSRodney W. Grimes if (!bufp) 31758f0484fSRodney W. Grimes return (0); 31858f0484fSRodney W. Grimes cino = (char *)bufp->page; 319f1e396bcSPaul Traina ino = (u_int16_t *)cino; 32058f0484fSRodney W. Grimes last_bfp = ret.nextp; 32158f0484fSRodney W. Grimes } else if (ino[n + 1] == OVFLPAGE) { 32258f0484fSRodney W. Grimes ov_addr = ino[n]; 32358f0484fSRodney W. Grimes /* 32458f0484fSRodney W. Grimes * Fix up the old page -- the extra 2 are the fields 32558f0484fSRodney W. Grimes * which contained the overflow information. 32658f0484fSRodney W. Grimes */ 32758f0484fSRodney W. Grimes ino[0] -= (moved + 2); 32858f0484fSRodney W. Grimes FREESPACE(ino) = 329f1e396bcSPaul Traina scopyto - sizeof(u_int16_t) * (ino[0] + 3); 33058f0484fSRodney W. Grimes OFFSET(ino) = scopyto; 33158f0484fSRodney W. Grimes 33258f0484fSRodney W. Grimes bufp = __get_buf(hashp, ov_addr, bufp, 0); 33358f0484fSRodney W. Grimes if (!bufp) 33458f0484fSRodney W. Grimes return (-1); 33558f0484fSRodney W. Grimes 336f1e396bcSPaul Traina ino = (u_int16_t *)bufp->page; 33758f0484fSRodney W. Grimes n = 1; 33858f0484fSRodney W. Grimes scopyto = hashp->BSIZE; 33958f0484fSRodney W. Grimes moved = 0; 34058f0484fSRodney W. Grimes 34158f0484fSRodney W. Grimes if (last_bfp) 34258f0484fSRodney W. Grimes __free_ovflpage(hashp, last_bfp); 34358f0484fSRodney W. Grimes last_bfp = bufp; 34458f0484fSRodney W. Grimes } 34558f0484fSRodney W. Grimes /* Move regular sized pairs of there are any */ 34658f0484fSRodney W. Grimes off = hashp->BSIZE; 34758f0484fSRodney W. Grimes for (n = 1; (n < ino[0]) && (ino[n + 1] >= REAL_KEY); n += 2) { 34858f0484fSRodney W. Grimes cino = (char *)ino; 34958f0484fSRodney W. Grimes key.data = (u_char *)cino + ino[n]; 35058f0484fSRodney W. Grimes key.size = off - ino[n]; 35158f0484fSRodney W. Grimes val.data = (u_char *)cino + ino[n + 1]; 35258f0484fSRodney W. Grimes val.size = ino[n] - ino[n + 1]; 35358f0484fSRodney W. Grimes off = ino[n + 1]; 35458f0484fSRodney W. Grimes 35558f0484fSRodney W. Grimes if (__call_hash(hashp, key.data, key.size) == obucket) { 35658f0484fSRodney W. Grimes /* Keep on old page */ 35758f0484fSRodney W. Grimes if (PAIRFITS(op, (&key), (&val))) 35858f0484fSRodney W. Grimes putpair((char *)op, &key, &val); 35958f0484fSRodney W. Grimes else { 36058f0484fSRodney W. Grimes old_bufp = 36158f0484fSRodney W. Grimes __add_ovflpage(hashp, old_bufp); 36258f0484fSRodney W. Grimes if (!old_bufp) 36358f0484fSRodney W. Grimes return (-1); 364f1e396bcSPaul Traina op = (u_int16_t *)old_bufp->page; 36558f0484fSRodney W. Grimes putpair((char *)op, &key, &val); 36658f0484fSRodney W. Grimes } 36758f0484fSRodney W. Grimes old_bufp->flags |= BUF_MOD; 36858f0484fSRodney W. Grimes } else { 36958f0484fSRodney W. Grimes /* Move to new page */ 37058f0484fSRodney W. Grimes if (PAIRFITS(np, (&key), (&val))) 37158f0484fSRodney W. Grimes putpair((char *)np, &key, &val); 37258f0484fSRodney W. Grimes else { 37358f0484fSRodney W. Grimes new_bufp = 37458f0484fSRodney W. Grimes __add_ovflpage(hashp, new_bufp); 37558f0484fSRodney W. Grimes if (!new_bufp) 37658f0484fSRodney W. Grimes return (-1); 377f1e396bcSPaul Traina np = (u_int16_t *)new_bufp->page; 37858f0484fSRodney W. Grimes putpair((char *)np, &key, &val); 37958f0484fSRodney W. Grimes } 38058f0484fSRodney W. Grimes new_bufp->flags |= BUF_MOD; 38158f0484fSRodney W. Grimes } 38258f0484fSRodney W. Grimes } 38358f0484fSRodney W. Grimes } 38458f0484fSRodney W. Grimes if (last_bfp) 38558f0484fSRodney W. Grimes __free_ovflpage(hashp, last_bfp); 38658f0484fSRodney W. Grimes return (0); 38758f0484fSRodney W. Grimes } 38858f0484fSRodney W. Grimes 38958f0484fSRodney W. Grimes /* 39058f0484fSRodney W. Grimes * Add the given pair to the page 39158f0484fSRodney W. Grimes * 39258f0484fSRodney W. Grimes * Returns: 39358f0484fSRodney W. Grimes * 0 ==> OK 39458f0484fSRodney W. Grimes * 1 ==> failure 39558f0484fSRodney W. Grimes */ 3960ac22237SXin LI int 3970ac22237SXin LI __addel(HTAB *hashp, BUFHEAD *bufp, const DBT *key, const DBT *val) 39858f0484fSRodney W. Grimes { 3998fb3f3f6SDavid E. O'Brien u_int16_t *bp, *sop; 40058f0484fSRodney W. Grimes int do_expand; 40158f0484fSRodney W. Grimes 402f1e396bcSPaul Traina bp = (u_int16_t *)bufp->page; 40358f0484fSRodney W. Grimes do_expand = 0; 40458f0484fSRodney W. Grimes while (bp[0] && (bp[2] < REAL_KEY || bp[bp[0]] < REAL_KEY)) 40558f0484fSRodney W. Grimes /* Exception case */ 40658f0484fSRodney W. Grimes if (bp[2] == FULL_KEY_DATA && bp[0] == 2) 40758f0484fSRodney W. Grimes /* This is the last page of a big key/data pair 40858f0484fSRodney W. Grimes and we need to add another page */ 40958f0484fSRodney W. Grimes break; 41058f0484fSRodney W. Grimes else if (bp[2] < REAL_KEY && bp[bp[0]] != OVFLPAGE) { 41158f0484fSRodney W. Grimes bufp = __get_buf(hashp, bp[bp[0] - 1], bufp, 0); 41258f0484fSRodney W. Grimes if (!bufp) 41358f0484fSRodney W. Grimes return (-1); 414f1e396bcSPaul Traina bp = (u_int16_t *)bufp->page; 4153130c353SXin LI } else if (bp[bp[0]] != OVFLPAGE) { 4163130c353SXin LI /* Short key/data pairs, no more pages */ 4173130c353SXin LI break; 4183130c353SXin LI } else { 41958f0484fSRodney W. Grimes /* Try to squeeze key on this page */ 4203130c353SXin LI if (bp[2] >= REAL_KEY && 4213130c353SXin LI FREESPACE(bp) >= PAIRSIZE(key, val)) { 42258f0484fSRodney W. Grimes squeeze_key(bp, key, val); 4233130c353SXin LI goto stats; 42458f0484fSRodney W. Grimes } else { 42558f0484fSRodney W. Grimes bufp = __get_buf(hashp, bp[bp[0] - 1], bufp, 0); 42658f0484fSRodney W. Grimes if (!bufp) 42758f0484fSRodney W. Grimes return (-1); 428f1e396bcSPaul Traina bp = (u_int16_t *)bufp->page; 42958f0484fSRodney W. Grimes } 4303130c353SXin LI } 43158f0484fSRodney W. Grimes 43258f0484fSRodney W. Grimes if (PAIRFITS(bp, key, val)) 43358f0484fSRodney W. Grimes putpair(bufp->page, key, val); 43458f0484fSRodney W. Grimes else { 43558f0484fSRodney W. Grimes do_expand = 1; 43658f0484fSRodney W. Grimes bufp = __add_ovflpage(hashp, bufp); 43758f0484fSRodney W. Grimes if (!bufp) 43858f0484fSRodney W. Grimes return (-1); 439f1e396bcSPaul Traina sop = (u_int16_t *)bufp->page; 44058f0484fSRodney W. Grimes 44158f0484fSRodney W. Grimes if (PAIRFITS(sop, key, val)) 44258f0484fSRodney W. Grimes putpair((char *)sop, key, val); 44358f0484fSRodney W. Grimes else 44458f0484fSRodney W. Grimes if (__big_insert(hashp, bufp, key, val)) 44558f0484fSRodney W. Grimes return (-1); 44658f0484fSRodney W. Grimes } 4473130c353SXin LI stats: 44858f0484fSRodney W. Grimes bufp->flags |= BUF_MOD; 44958f0484fSRodney W. Grimes /* 45058f0484fSRodney W. Grimes * If the average number of keys per bucket exceeds the fill factor, 45158f0484fSRodney W. Grimes * expand the table. 45258f0484fSRodney W. Grimes */ 45358f0484fSRodney W. Grimes hashp->NKEYS++; 45458f0484fSRodney W. Grimes if (do_expand || 45558f0484fSRodney W. Grimes (hashp->NKEYS / (hashp->MAX_BUCKET + 1) > hashp->FFACTOR)) 45658f0484fSRodney W. Grimes return (__expand_table(hashp)); 45758f0484fSRodney W. Grimes return (0); 45858f0484fSRodney W. Grimes } 45958f0484fSRodney W. Grimes 46058f0484fSRodney W. Grimes /* 46158f0484fSRodney W. Grimes * 46258f0484fSRodney W. Grimes * Returns: 46358f0484fSRodney W. Grimes * pointer on success 46458f0484fSRodney W. Grimes * NULL on error 46558f0484fSRodney W. Grimes */ 4660ac22237SXin LI BUFHEAD * 4670ac22237SXin LI __add_ovflpage(HTAB *hashp, BUFHEAD *bufp) 46858f0484fSRodney W. Grimes { 469b115f257SXin LI u_int16_t *sp, ndx, ovfl_num; 47058f0484fSRodney W. Grimes #ifdef DEBUG1 47158f0484fSRodney W. Grimes int tmp1, tmp2; 47258f0484fSRodney W. Grimes #endif 473f1e396bcSPaul Traina sp = (u_int16_t *)bufp->page; 47458f0484fSRodney W. Grimes 47558f0484fSRodney W. Grimes /* Check if we are dynamically determining the fill factor */ 47658f0484fSRodney W. Grimes if (hashp->FFACTOR == DEF_FFACTOR) { 47758f0484fSRodney W. Grimes hashp->FFACTOR = sp[0] >> 1; 47858f0484fSRodney W. Grimes if (hashp->FFACTOR < MIN_FFACTOR) 47958f0484fSRodney W. Grimes hashp->FFACTOR = MIN_FFACTOR; 48058f0484fSRodney W. Grimes } 48158f0484fSRodney W. Grimes bufp->flags |= BUF_MOD; 48258f0484fSRodney W. Grimes ovfl_num = overflow_page(hashp); 48358f0484fSRodney W. Grimes #ifdef DEBUG1 48458f0484fSRodney W. Grimes tmp1 = bufp->addr; 48558f0484fSRodney W. Grimes tmp2 = bufp->ovfl ? bufp->ovfl->addr : 0; 48658f0484fSRodney W. Grimes #endif 48758f0484fSRodney W. Grimes if (!ovfl_num || !(bufp->ovfl = __get_buf(hashp, ovfl_num, bufp, 1))) 48858f0484fSRodney W. Grimes return (NULL); 48958f0484fSRodney W. Grimes bufp->ovfl->flags |= BUF_MOD; 49058f0484fSRodney W. Grimes #ifdef DEBUG1 49158f0484fSRodney W. Grimes (void)fprintf(stderr, "ADDOVFLPAGE: %d->ovfl was %d is now %d\n", 49258f0484fSRodney W. Grimes tmp1, tmp2, bufp->ovfl->addr); 49358f0484fSRodney W. Grimes #endif 49458f0484fSRodney W. Grimes ndx = sp[0]; 49558f0484fSRodney W. Grimes /* 49658f0484fSRodney W. Grimes * Since a pair is allocated on a page only if there's room to add 49758f0484fSRodney W. Grimes * an overflow page, we know that the OVFL information will fit on 49858f0484fSRodney W. Grimes * the page. 49958f0484fSRodney W. Grimes */ 50058f0484fSRodney W. Grimes sp[ndx + 4] = OFFSET(sp); 50158f0484fSRodney W. Grimes sp[ndx + 3] = FREESPACE(sp) - OVFLSIZE; 50258f0484fSRodney W. Grimes sp[ndx + 1] = ovfl_num; 50358f0484fSRodney W. Grimes sp[ndx + 2] = OVFLPAGE; 50458f0484fSRodney W. Grimes sp[0] = ndx + 2; 50558f0484fSRodney W. Grimes #ifdef HASH_STATISTICS 50658f0484fSRodney W. Grimes hash_overflows++; 50758f0484fSRodney W. Grimes #endif 50858f0484fSRodney W. Grimes return (bufp->ovfl); 50958f0484fSRodney W. Grimes } 51058f0484fSRodney W. Grimes 51158f0484fSRodney W. Grimes /* 51258f0484fSRodney W. Grimes * Returns: 51358f0484fSRodney W. Grimes * 0 indicates SUCCESS 51458f0484fSRodney W. Grimes * -1 indicates FAILURE 51558f0484fSRodney W. Grimes */ 5160ac22237SXin LI int 5170ac22237SXin LI __get_page(HTAB *hashp, char *p, u_int32_t bucket, int is_bucket, int is_disk, 5180ac22237SXin LI int is_bitmap) 51958f0484fSRodney W. Grimes { 520b115f257SXin LI int fd, page, size, rsize; 521f1e396bcSPaul Traina u_int16_t *bp; 52258f0484fSRodney W. Grimes 52358f0484fSRodney W. Grimes fd = hashp->fp; 52458f0484fSRodney W. Grimes size = hashp->BSIZE; 52558f0484fSRodney W. Grimes 52658f0484fSRodney W. Grimes if ((fd == -1) || !is_disk) { 52758f0484fSRodney W. Grimes PAGE_INIT(p); 52858f0484fSRodney W. Grimes return (0); 52958f0484fSRodney W. Grimes } 53058f0484fSRodney W. Grimes if (is_bucket) 53158f0484fSRodney W. Grimes page = BUCKET_TO_PAGE(bucket); 53258f0484fSRodney W. Grimes else 53358f0484fSRodney W. Grimes page = OADDR_TO_PAGE(bucket); 534d3b2afadSXin LI if ((rsize = pread(fd, p, size, (off_t)page << hashp->BSHIFT)) == -1) 53558f0484fSRodney W. Grimes return (-1); 536f1e396bcSPaul Traina bp = (u_int16_t *)p; 53758f0484fSRodney W. Grimes if (!rsize) 53858f0484fSRodney W. Grimes bp[0] = 0; /* We hit the EOF, so initialize a new page */ 53958f0484fSRodney W. Grimes else 54058f0484fSRodney W. Grimes if (rsize != size) { 54158f0484fSRodney W. Grimes errno = EFTYPE; 54258f0484fSRodney W. Grimes return (-1); 54358f0484fSRodney W. Grimes } 54458f0484fSRodney W. Grimes if (!is_bitmap && !bp[0]) { 54558f0484fSRodney W. Grimes PAGE_INIT(p); 54658f0484fSRodney W. Grimes } else 54758f0484fSRodney W. Grimes if (hashp->LORDER != BYTE_ORDER) { 5488fb3f3f6SDavid E. O'Brien int i, max; 54958f0484fSRodney W. Grimes 55058f0484fSRodney W. Grimes if (is_bitmap) { 55158f0484fSRodney W. Grimes max = hashp->BSIZE >> 2; /* divide by 4 */ 55258f0484fSRodney W. Grimes for (i = 0; i < max; i++) 553f1e396bcSPaul Traina M_32_SWAP(((int *)p)[i]); 55458f0484fSRodney W. Grimes } else { 55558f0484fSRodney W. Grimes M_16_SWAP(bp[0]); 55658f0484fSRodney W. Grimes max = bp[0] + 2; 55758f0484fSRodney W. Grimes for (i = 1; i <= max; i++) 55858f0484fSRodney W. Grimes M_16_SWAP(bp[i]); 55958f0484fSRodney W. Grimes } 56058f0484fSRodney W. Grimes } 56158f0484fSRodney W. Grimes return (0); 56258f0484fSRodney W. Grimes } 56358f0484fSRodney W. Grimes 56458f0484fSRodney W. Grimes /* 56558f0484fSRodney W. Grimes * Write page p to disk 56658f0484fSRodney W. Grimes * 56758f0484fSRodney W. Grimes * Returns: 56858f0484fSRodney W. Grimes * 0 ==> OK 56958f0484fSRodney W. Grimes * -1 ==>failure 57058f0484fSRodney W. Grimes */ 5710ac22237SXin LI int 5720ac22237SXin LI __put_page(HTAB *hashp, char *p, u_int32_t bucket, int is_bucket, int is_bitmap) 57358f0484fSRodney W. Grimes { 574b115f257SXin LI int fd, page, size, wsize; 57558f0484fSRodney W. Grimes 57658f0484fSRodney W. Grimes size = hashp->BSIZE; 57758f0484fSRodney W. Grimes if ((hashp->fp == -1) && open_temp(hashp)) 57858f0484fSRodney W. Grimes return (-1); 57958f0484fSRodney W. Grimes fd = hashp->fp; 58058f0484fSRodney W. Grimes 58158f0484fSRodney W. Grimes if (hashp->LORDER != BYTE_ORDER) { 582b115f257SXin LI int i, max; 58358f0484fSRodney W. Grimes 58458f0484fSRodney W. Grimes if (is_bitmap) { 58558f0484fSRodney W. Grimes max = hashp->BSIZE >> 2; /* divide by 4 */ 58658f0484fSRodney W. Grimes for (i = 0; i < max; i++) 587f1e396bcSPaul Traina M_32_SWAP(((int *)p)[i]); 58858f0484fSRodney W. Grimes } else { 589f1e396bcSPaul Traina max = ((u_int16_t *)p)[0] + 2; 59058f0484fSRodney W. Grimes for (i = 0; i <= max; i++) 591f1e396bcSPaul Traina M_16_SWAP(((u_int16_t *)p)[i]); 59258f0484fSRodney W. Grimes } 59358f0484fSRodney W. Grimes } 59458f0484fSRodney W. Grimes if (is_bucket) 59558f0484fSRodney W. Grimes page = BUCKET_TO_PAGE(bucket); 59658f0484fSRodney W. Grimes else 59758f0484fSRodney W. Grimes page = OADDR_TO_PAGE(bucket); 598d3b2afadSXin LI if ((wsize = pwrite(fd, p, size, (off_t)page << hashp->BSHIFT)) == -1) 59958f0484fSRodney W. Grimes /* Errno is set */ 60058f0484fSRodney W. Grimes return (-1); 60158f0484fSRodney W. Grimes if (wsize != size) { 60258f0484fSRodney W. Grimes errno = EFTYPE; 60358f0484fSRodney W. Grimes return (-1); 60458f0484fSRodney W. Grimes } 60558f0484fSRodney W. Grimes return (0); 60658f0484fSRodney W. Grimes } 60758f0484fSRodney W. Grimes 60858f0484fSRodney W. Grimes #define BYTE_MASK ((1 << INT_BYTE_SHIFT) -1) 60958f0484fSRodney W. Grimes /* 61058f0484fSRodney W. Grimes * Initialize a new bitmap page. Bitmap pages are left in memory 61158f0484fSRodney W. Grimes * once they are read in. 61258f0484fSRodney W. Grimes */ 6130ac22237SXin LI int 6140ac22237SXin LI __ibitmap(HTAB *hashp, int pnum, int nbits, int ndx) 61558f0484fSRodney W. Grimes { 616f1e396bcSPaul Traina u_int32_t *ip; 61758f0484fSRodney W. Grimes int clearbytes, clearints; 61858f0484fSRodney W. Grimes 619f1e396bcSPaul Traina if ((ip = (u_int32_t *)malloc(hashp->BSIZE)) == NULL) 62058f0484fSRodney W. Grimes return (1); 62158f0484fSRodney W. Grimes hashp->nmaps++; 62258f0484fSRodney W. Grimes clearints = ((nbits - 1) >> INT_BYTE_SHIFT) + 1; 62358f0484fSRodney W. Grimes clearbytes = clearints << INT_TO_BYTE; 62458f0484fSRodney W. Grimes (void)memset((char *)ip, 0, clearbytes); 62558f0484fSRodney W. Grimes (void)memset(((char *)ip) + clearbytes, 0xFF, 62658f0484fSRodney W. Grimes hashp->BSIZE - clearbytes); 62758f0484fSRodney W. Grimes ip[clearints - 1] = ALL_SET << (nbits & BYTE_MASK); 62858f0484fSRodney W. Grimes SETBIT(ip, 0); 629f1e396bcSPaul Traina hashp->BITMAPS[ndx] = (u_int16_t)pnum; 63058f0484fSRodney W. Grimes hashp->mapp[ndx] = ip; 63158f0484fSRodney W. Grimes return (0); 63258f0484fSRodney W. Grimes } 63358f0484fSRodney W. Grimes 634f1e396bcSPaul Traina static u_int32_t 6350ac22237SXin LI first_free(u_int32_t map) 63658f0484fSRodney W. Grimes { 6378fb3f3f6SDavid E. O'Brien u_int32_t i, mask; 63858f0484fSRodney W. Grimes 63958f0484fSRodney W. Grimes mask = 0x1; 64058f0484fSRodney W. Grimes for (i = 0; i < BITS_PER_MAP; i++) { 64158f0484fSRodney W. Grimes if (!(mask & map)) 64258f0484fSRodney W. Grimes return (i); 64358f0484fSRodney W. Grimes mask = mask << 1; 64458f0484fSRodney W. Grimes } 64558f0484fSRodney W. Grimes return (i); 64658f0484fSRodney W. Grimes } 64758f0484fSRodney W. Grimes 648f1e396bcSPaul Traina static u_int16_t 6490ac22237SXin LI overflow_page(HTAB *hashp) 65058f0484fSRodney W. Grimes { 6518fb3f3f6SDavid E. O'Brien u_int32_t *freep; 6528fb3f3f6SDavid E. O'Brien int max_free, offset, splitnum; 653f1e396bcSPaul Traina u_int16_t addr; 65458f0484fSRodney W. Grimes int bit, first_page, free_bit, free_page, i, in_use_bits, j; 65558f0484fSRodney W. Grimes #ifdef DEBUG2 65658f0484fSRodney W. Grimes int tmp1, tmp2; 65758f0484fSRodney W. Grimes #endif 65858f0484fSRodney W. Grimes splitnum = hashp->OVFL_POINT; 65958f0484fSRodney W. Grimes max_free = hashp->SPARES[splitnum]; 66058f0484fSRodney W. Grimes 66158f0484fSRodney W. Grimes free_page = (max_free - 1) >> (hashp->BSHIFT + BYTE_SHIFT); 66258f0484fSRodney W. Grimes free_bit = (max_free - 1) & ((hashp->BSIZE << BYTE_SHIFT) - 1); 66358f0484fSRodney W. Grimes 66458f0484fSRodney W. Grimes /* Look through all the free maps to find the first free block */ 66558f0484fSRodney W. Grimes first_page = hashp->LAST_FREED >>(hashp->BSHIFT + BYTE_SHIFT); 66658f0484fSRodney W. Grimes for ( i = first_page; i <= free_page; i++ ) { 667f1e396bcSPaul Traina if (!(freep = (u_int32_t *)hashp->mapp[i]) && 66858f0484fSRodney W. Grimes !(freep = fetch_bitmap(hashp, i))) 669f1e396bcSPaul Traina return (0); 67058f0484fSRodney W. Grimes if (i == free_page) 67158f0484fSRodney W. Grimes in_use_bits = free_bit; 67258f0484fSRodney W. Grimes else 67358f0484fSRodney W. Grimes in_use_bits = (hashp->BSIZE << BYTE_SHIFT) - 1; 67458f0484fSRodney W. Grimes 67558f0484fSRodney W. Grimes if (i == first_page) { 67658f0484fSRodney W. Grimes bit = hashp->LAST_FREED & 67758f0484fSRodney W. Grimes ((hashp->BSIZE << BYTE_SHIFT) - 1); 67858f0484fSRodney W. Grimes j = bit / BITS_PER_MAP; 67958f0484fSRodney W. Grimes bit = bit & ~(BITS_PER_MAP - 1); 68058f0484fSRodney W. Grimes } else { 68158f0484fSRodney W. Grimes bit = 0; 68258f0484fSRodney W. Grimes j = 0; 68358f0484fSRodney W. Grimes } 68458f0484fSRodney W. Grimes for (; bit <= in_use_bits; j++, bit += BITS_PER_MAP) 68558f0484fSRodney W. Grimes if (freep[j] != ALL_SET) 68658f0484fSRodney W. Grimes goto found; 68758f0484fSRodney W. Grimes } 68858f0484fSRodney W. Grimes 68958f0484fSRodney W. Grimes /* No Free Page Found */ 69058f0484fSRodney W. Grimes hashp->LAST_FREED = hashp->SPARES[splitnum]; 69158f0484fSRodney W. Grimes hashp->SPARES[splitnum]++; 69258f0484fSRodney W. Grimes offset = hashp->SPARES[splitnum] - 69358f0484fSRodney W. Grimes (splitnum ? hashp->SPARES[splitnum - 1] : 0); 69458f0484fSRodney W. Grimes 69558f0484fSRodney W. Grimes #define OVMSG "HASH: Out of overflow pages. Increase page size\n" 69658f0484fSRodney W. Grimes if (offset > SPLITMASK) { 69758f0484fSRodney W. Grimes if (++splitnum >= NCACHED) { 6989233c4d9SJason Evans (void)_write(STDERR_FILENO, OVMSG, sizeof(OVMSG) - 1); 699a53e89e3SXin LI errno = EFBIG; 700f1e396bcSPaul Traina return (0); 70158f0484fSRodney W. Grimes } 70258f0484fSRodney W. Grimes hashp->OVFL_POINT = splitnum; 70358f0484fSRodney W. Grimes hashp->SPARES[splitnum] = hashp->SPARES[splitnum-1]; 70458f0484fSRodney W. Grimes hashp->SPARES[splitnum-1]--; 70558f0484fSRodney W. Grimes offset = 1; 70658f0484fSRodney W. Grimes } 70758f0484fSRodney W. Grimes 70858f0484fSRodney W. Grimes /* Check if we need to allocate a new bitmap page */ 70958f0484fSRodney W. Grimes if (free_bit == (hashp->BSIZE << BYTE_SHIFT) - 1) { 71058f0484fSRodney W. Grimes free_page++; 71158f0484fSRodney W. Grimes if (free_page >= NCACHED) { 7129233c4d9SJason Evans (void)_write(STDERR_FILENO, OVMSG, sizeof(OVMSG) - 1); 713a53e89e3SXin LI errno = EFBIG; 714f1e396bcSPaul Traina return (0); 71558f0484fSRodney W. Grimes } 71658f0484fSRodney W. Grimes /* 71758f0484fSRodney W. Grimes * This is tricky. The 1 indicates that you want the new page 71858f0484fSRodney W. Grimes * allocated with 1 clear bit. Actually, you are going to 71958f0484fSRodney W. Grimes * allocate 2 pages from this map. The first is going to be 72058f0484fSRodney W. Grimes * the map page, the second is the overflow page we were 72158f0484fSRodney W. Grimes * looking for. The init_bitmap routine automatically, sets 72258f0484fSRodney W. Grimes * the first bit of itself to indicate that the bitmap itself 72358f0484fSRodney W. Grimes * is in use. We would explicitly set the second bit, but 72458f0484fSRodney W. Grimes * don't have to if we tell init_bitmap not to leave it clear 72558f0484fSRodney W. Grimes * in the first place. 72658f0484fSRodney W. Grimes */ 727f1e396bcSPaul Traina if (__ibitmap(hashp, 728f1e396bcSPaul Traina (int)OADDR_OF(splitnum, offset), 1, free_page)) 729f1e396bcSPaul Traina return (0); 73058f0484fSRodney W. Grimes hashp->SPARES[splitnum]++; 73158f0484fSRodney W. Grimes #ifdef DEBUG2 73258f0484fSRodney W. Grimes free_bit = 2; 73358f0484fSRodney W. Grimes #endif 73458f0484fSRodney W. Grimes offset++; 73558f0484fSRodney W. Grimes if (offset > SPLITMASK) { 73658f0484fSRodney W. Grimes if (++splitnum >= NCACHED) { 7379233c4d9SJason Evans (void)_write(STDERR_FILENO, OVMSG, 73858f0484fSRodney W. Grimes sizeof(OVMSG) - 1); 739a53e89e3SXin LI errno = EFBIG; 740f1e396bcSPaul Traina return (0); 74158f0484fSRodney W. Grimes } 74258f0484fSRodney W. Grimes hashp->OVFL_POINT = splitnum; 74358f0484fSRodney W. Grimes hashp->SPARES[splitnum] = hashp->SPARES[splitnum-1]; 74458f0484fSRodney W. Grimes hashp->SPARES[splitnum-1]--; 74558f0484fSRodney W. Grimes offset = 0; 74658f0484fSRodney W. Grimes } 74758f0484fSRodney W. Grimes } else { 74858f0484fSRodney W. Grimes /* 74958f0484fSRodney W. Grimes * Free_bit addresses the last used bit. Bump it to address 75058f0484fSRodney W. Grimes * the first available bit. 75158f0484fSRodney W. Grimes */ 75258f0484fSRodney W. Grimes free_bit++; 75358f0484fSRodney W. Grimes SETBIT(freep, free_bit); 75458f0484fSRodney W. Grimes } 75558f0484fSRodney W. Grimes 75658f0484fSRodney W. Grimes /* Calculate address of the new overflow page */ 75758f0484fSRodney W. Grimes addr = OADDR_OF(splitnum, offset); 75858f0484fSRodney W. Grimes #ifdef DEBUG2 75958f0484fSRodney W. Grimes (void)fprintf(stderr, "OVERFLOW_PAGE: ADDR: %d BIT: %d PAGE %d\n", 76058f0484fSRodney W. Grimes addr, free_bit, free_page); 76158f0484fSRodney W. Grimes #endif 76258f0484fSRodney W. Grimes return (addr); 76358f0484fSRodney W. Grimes 76458f0484fSRodney W. Grimes found: 76558f0484fSRodney W. Grimes bit = bit + first_free(freep[j]); 76658f0484fSRodney W. Grimes SETBIT(freep, bit); 76758f0484fSRodney W. Grimes #ifdef DEBUG2 76858f0484fSRodney W. Grimes tmp1 = bit; 76958f0484fSRodney W. Grimes tmp2 = i; 77058f0484fSRodney W. Grimes #endif 77158f0484fSRodney W. Grimes /* 77258f0484fSRodney W. Grimes * Bits are addressed starting with 0, but overflow pages are addressed 77358f0484fSRodney W. Grimes * beginning at 1. Bit is a bit addressnumber, so we need to increment 77458f0484fSRodney W. Grimes * it to convert it to a page number. 77558f0484fSRodney W. Grimes */ 77658f0484fSRodney W. Grimes bit = 1 + bit + (i * (hashp->BSIZE << BYTE_SHIFT)); 77758f0484fSRodney W. Grimes if (bit >= hashp->LAST_FREED) 77858f0484fSRodney W. Grimes hashp->LAST_FREED = bit - 1; 77958f0484fSRodney W. Grimes 78058f0484fSRodney W. Grimes /* Calculate the split number for this page */ 78158f0484fSRodney W. Grimes for (i = 0; (i < splitnum) && (bit > hashp->SPARES[i]); i++); 78258f0484fSRodney W. Grimes offset = (i ? bit - hashp->SPARES[i - 1] : bit); 783a53e89e3SXin LI if (offset >= SPLITMASK) { 784a53e89e3SXin LI (void)_write(STDERR_FILENO, OVMSG, sizeof(OVMSG) - 1); 785a53e89e3SXin LI errno = EFBIG; 786f1e396bcSPaul Traina return (0); /* Out of overflow pages */ 787a53e89e3SXin LI } 78858f0484fSRodney W. Grimes addr = OADDR_OF(i, offset); 78958f0484fSRodney W. Grimes #ifdef DEBUG2 79058f0484fSRodney W. Grimes (void)fprintf(stderr, "OVERFLOW_PAGE: ADDR: %d BIT: %d PAGE %d\n", 79158f0484fSRodney W. Grimes addr, tmp1, tmp2); 79258f0484fSRodney W. Grimes #endif 79358f0484fSRodney W. Grimes 79458f0484fSRodney W. Grimes /* Allocate and return the overflow page */ 79558f0484fSRodney W. Grimes return (addr); 79658f0484fSRodney W. Grimes } 79758f0484fSRodney W. Grimes 79858f0484fSRodney W. Grimes /* 79958f0484fSRodney W. Grimes * Mark this overflow page as free. 80058f0484fSRodney W. Grimes */ 8010ac22237SXin LI void 8020ac22237SXin LI __free_ovflpage(HTAB *hashp, BUFHEAD *obufp) 80358f0484fSRodney W. Grimes { 8048fb3f3f6SDavid E. O'Brien u_int16_t addr; 805f1e396bcSPaul Traina u_int32_t *freep; 80658f0484fSRodney W. Grimes int bit_address, free_page, free_bit; 807f1e396bcSPaul Traina u_int16_t ndx; 80858f0484fSRodney W. Grimes 80958f0484fSRodney W. Grimes addr = obufp->addr; 81058f0484fSRodney W. Grimes #ifdef DEBUG1 81158f0484fSRodney W. Grimes (void)fprintf(stderr, "Freeing %d\n", addr); 81258f0484fSRodney W. Grimes #endif 813f1e396bcSPaul Traina ndx = (((u_int16_t)addr) >> SPLITSHIFT); 81458f0484fSRodney W. Grimes bit_address = 81558f0484fSRodney W. Grimes (ndx ? hashp->SPARES[ndx - 1] : 0) + (addr & SPLITMASK) - 1; 81658f0484fSRodney W. Grimes if (bit_address < hashp->LAST_FREED) 81758f0484fSRodney W. Grimes hashp->LAST_FREED = bit_address; 81858f0484fSRodney W. Grimes free_page = (bit_address >> (hashp->BSHIFT + BYTE_SHIFT)); 81958f0484fSRodney W. Grimes free_bit = bit_address & ((hashp->BSIZE << BYTE_SHIFT) - 1); 82058f0484fSRodney W. Grimes 82158f0484fSRodney W. Grimes if (!(freep = hashp->mapp[free_page])) 82258f0484fSRodney W. Grimes freep = fetch_bitmap(hashp, free_page); 82358f0484fSRodney W. Grimes #ifdef DEBUG 82458f0484fSRodney W. Grimes /* 82558f0484fSRodney W. Grimes * This had better never happen. It means we tried to read a bitmap 82658f0484fSRodney W. Grimes * that has already had overflow pages allocated off it, and we 82758f0484fSRodney W. Grimes * failed to read it from the file. 82858f0484fSRodney W. Grimes */ 82958f0484fSRodney W. Grimes if (!freep) 83058f0484fSRodney W. Grimes assert(0); 83158f0484fSRodney W. Grimes #endif 83258f0484fSRodney W. Grimes CLRBIT(freep, free_bit); 83358f0484fSRodney W. Grimes #ifdef DEBUG2 83458f0484fSRodney W. Grimes (void)fprintf(stderr, "FREE_OVFLPAGE: ADDR: %d BIT: %d PAGE %d\n", 83558f0484fSRodney W. Grimes obufp->addr, free_bit, free_page); 83658f0484fSRodney W. Grimes #endif 83758f0484fSRodney W. Grimes __reclaim_buf(hashp, obufp); 83858f0484fSRodney W. Grimes } 83958f0484fSRodney W. Grimes 84058f0484fSRodney W. Grimes /* 84158f0484fSRodney W. Grimes * Returns: 84258f0484fSRodney W. Grimes * 0 success 84358f0484fSRodney W. Grimes * -1 failure 84458f0484fSRodney W. Grimes */ 84558f0484fSRodney W. Grimes static int 8460ac22237SXin LI open_temp(HTAB *hashp) 84758f0484fSRodney W. Grimes { 84858f0484fSRodney W. Grimes sigset_t set, oset; 84902d7f710SXin LI int len; 85002d7f710SXin LI char *envtmp = NULL; 85102d7f710SXin LI char path[MAXPATHLEN]; 85202d7f710SXin LI 85302d7f710SXin LI if (issetugid() == 0) 85402d7f710SXin LI envtmp = getenv("TMPDIR"); 85502d7f710SXin LI len = snprintf(path, 85602d7f710SXin LI sizeof(path), "%s/_hash.XXXXXX", envtmp ? envtmp : "/tmp"); 85702d7f710SXin LI if (len < 0 || len >= sizeof(path)) { 85802d7f710SXin LI errno = ENAMETOOLONG; 85902d7f710SXin LI return (-1); 86002d7f710SXin LI } 86158f0484fSRodney W. Grimes 86258f0484fSRodney W. Grimes /* Block signals; make sure file goes away at process exit. */ 86358f0484fSRodney W. Grimes (void)sigfillset(&set); 864d201fe46SDaniel Eischen (void)_sigprocmask(SIG_BLOCK, &set, &oset); 86502d7f710SXin LI if ((hashp->fp = mkstemp(path)) != -1) { 86602d7f710SXin LI (void)unlink(path); 8679233c4d9SJason Evans (void)_fcntl(hashp->fp, F_SETFD, 1); 86858f0484fSRodney W. Grimes } 869d201fe46SDaniel Eischen (void)_sigprocmask(SIG_SETMASK, &oset, (sigset_t *)NULL); 87058f0484fSRodney W. Grimes return (hashp->fp != -1 ? 0 : -1); 87158f0484fSRodney W. Grimes } 87258f0484fSRodney W. Grimes 87358f0484fSRodney W. Grimes /* 87458f0484fSRodney W. Grimes * We have to know that the key will fit, but the last entry on the page is 87558f0484fSRodney W. Grimes * an overflow pair, so we need to shift things. 87658f0484fSRodney W. Grimes */ 87758f0484fSRodney W. Grimes static void 8780ac22237SXin LI squeeze_key(u_int16_t *sp, const DBT *key, const DBT *val) 87958f0484fSRodney W. Grimes { 8808fb3f3f6SDavid E. O'Brien char *p; 881f1e396bcSPaul Traina u_int16_t free_space, n, off, pageno; 88258f0484fSRodney W. Grimes 88358f0484fSRodney W. Grimes p = (char *)sp; 88458f0484fSRodney W. Grimes n = sp[0]; 88558f0484fSRodney W. Grimes free_space = FREESPACE(sp); 88658f0484fSRodney W. Grimes off = OFFSET(sp); 88758f0484fSRodney W. Grimes 88858f0484fSRodney W. Grimes pageno = sp[n - 1]; 88958f0484fSRodney W. Grimes off -= key->size; 89058f0484fSRodney W. Grimes sp[n - 1] = off; 89158f0484fSRodney W. Grimes memmove(p + off, key->data, key->size); 89258f0484fSRodney W. Grimes off -= val->size; 89358f0484fSRodney W. Grimes sp[n] = off; 89458f0484fSRodney W. Grimes memmove(p + off, val->data, val->size); 89558f0484fSRodney W. Grimes sp[0] = n + 2; 89658f0484fSRodney W. Grimes sp[n + 1] = pageno; 89758f0484fSRodney W. Grimes sp[n + 2] = OVFLPAGE; 89858f0484fSRodney W. Grimes FREESPACE(sp) = free_space - PAIRSIZE(key, val); 89958f0484fSRodney W. Grimes OFFSET(sp) = off; 90058f0484fSRodney W. Grimes } 90158f0484fSRodney W. Grimes 902f1e396bcSPaul Traina static u_int32_t * 9030ac22237SXin LI fetch_bitmap(HTAB *hashp, int ndx) 90458f0484fSRodney W. Grimes { 90558f0484fSRodney W. Grimes if (ndx >= hashp->nmaps) 90658f0484fSRodney W. Grimes return (NULL); 907f1e396bcSPaul Traina if ((hashp->mapp[ndx] = (u_int32_t *)malloc(hashp->BSIZE)) == NULL) 90858f0484fSRodney W. Grimes return (NULL); 90958f0484fSRodney W. Grimes if (__get_page(hashp, 91058f0484fSRodney W. Grimes (char *)hashp->mapp[ndx], hashp->BITMAPS[ndx], 0, 1, 1)) { 91158f0484fSRodney W. Grimes free(hashp->mapp[ndx]); 91258f0484fSRodney W. Grimes return (NULL); 91358f0484fSRodney W. Grimes } 91458f0484fSRodney W. Grimes return (hashp->mapp[ndx]); 91558f0484fSRodney W. Grimes } 91658f0484fSRodney W. Grimes 91758f0484fSRodney W. Grimes #ifdef DEBUG4 91858f0484fSRodney W. Grimes int 9190ac22237SXin LI print_chain(int addr) 92058f0484fSRodney W. Grimes { 92158f0484fSRodney W. Grimes BUFHEAD *bufp; 92258f0484fSRodney W. Grimes short *bp, oaddr; 92358f0484fSRodney W. Grimes 92458f0484fSRodney W. Grimes (void)fprintf(stderr, "%d ", addr); 92558f0484fSRodney W. Grimes bufp = __get_buf(hashp, addr, NULL, 0); 92658f0484fSRodney W. Grimes bp = (short *)bufp->page; 92758f0484fSRodney W. Grimes while (bp[0] && ((bp[bp[0]] == OVFLPAGE) || 92858f0484fSRodney W. Grimes ((bp[0] > 2) && bp[2] < REAL_KEY))) { 92958f0484fSRodney W. Grimes oaddr = bp[bp[0] - 1]; 93058f0484fSRodney W. Grimes (void)fprintf(stderr, "%d ", (int)oaddr); 93158f0484fSRodney W. Grimes bufp = __get_buf(hashp, (int)oaddr, bufp, 0); 93258f0484fSRodney W. Grimes bp = (short *)bufp->page; 93358f0484fSRodney W. Grimes } 93458f0484fSRodney W. Grimes (void)fprintf(stderr, "\n"); 93558f0484fSRodney W. Grimes } 93658f0484fSRodney W. Grimes #endif 937