2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * $FreeBSD: src/lib/libc/db/hash/hash.c,v 1.8 2000/01/27 23:06:08 jasone Exp $
39 #if defined(LIBC_SCCS) && !defined(lint)
40 static char sccsid[] = "@(#)hash.c 8.9 (Berkeley) 6/16/94";
41 #endif /* LIBC_SCCS and not lint */
43 #include <sys/param.h>
61 static int alloc_segs __P((HTAB *, int));
62 static int flush_meta __P((HTAB *));
63 static int hash_access __P((HTAB *, ACTION, DBT *, DBT *));
64 static int hash_close __P((DB *));
65 static int hash_delete __P((const DB *, const DBT *, u_int32_t));
66 static int hash_fd __P((const DB *));
67 static int hash_get __P((const DB *, const DBT *, DBT *, u_int32_t));
68 static int hash_put __P((const DB *, DBT *, const DBT *, u_int32_t));
69 static void *hash_realloc __P((SEGMENT **, int, int));
70 static int hash_seq __P((const DB *, DBT *, DBT *, u_int32_t));
71 static int hash_sync __P((const DB *, u_int32_t));
72 static int hdestroy __P((HTAB *));
73 static HTAB *init_hash __P((HTAB *, const char *, HASHINFO *));
74 static int init_htab __P((HTAB *, int));
75 #if BYTE_ORDER == LITTLE_ENDIAN
76 static void swap_header __P((HTAB *));
77 static void swap_header_copy __P((HASHHDR *, HASHHDR *));
80 /* Fast arithmetic, relying on powers of 2, */
81 #define MOD(x, y) ((x) & ((y) - 1))
83 #define RETURN_ERROR(ERR, LOC) { save_errno = ERR; goto LOC; }
90 #ifdef HASH_STATISTICS
91 int hash_accesses, hash_collisions, hash_expansions, hash_overflows;
94 /************************** INTERFACE ROUTINES ***************************/
98 __hash_open(file, flags, mode, info, dflags)
100 int flags, mode, dflags;
101 const HASHINFO *info; /* Special directives for create */
106 int bpages, hdrsize, new_table, nsegs, save_errno;
108 if ((flags & O_ACCMODE) == O_WRONLY) {
113 if (!(hashp = (HTAB *)calloc(1, sizeof(HTAB))))
118 * Even if user wants write only, we need to be able to read
119 * the actual file, so we need to open it read/write. But, the
120 * field in the hashp structure needs to be accurate so that
121 * we can check accesses.
123 hashp->flags = flags;
126 if (!file || (flags & O_TRUNC) ||
127 (stat(file, &statbuf) && (errno == ENOENT))) {
129 errno = 0; /* Just in case someone looks at errno */
133 if ((hashp->fp = _open(file, flags, mode)) == -1)
134 RETURN_ERROR(errno, error0);
136 /* if the .db file is empty, and we had permission to create
137 a new .db file, then reinitialize the database */
138 if ((flags & O_CREAT) &&
139 fstat(hashp->fp, &statbuf) == 0 && statbuf.st_size == 0)
142 (void)_fcntl(hashp->fp, F_SETFD, 1);
145 if (!(hashp = init_hash(hashp, file, (HASHINFO *)info)))
146 RETURN_ERROR(errno, error1);
148 /* Table already exists */
149 if (info && info->hash)
150 hashp->hash = info->hash;
152 hashp->hash = __default_hash;
154 hdrsize = _read(hashp->fp, &hashp->hdr, sizeof(HASHHDR));
155 #if BYTE_ORDER == LITTLE_ENDIAN
159 RETURN_ERROR(errno, error1);
160 if (hdrsize != sizeof(HASHHDR))
161 RETURN_ERROR(EFTYPE, error1);
162 /* Verify file type, versions and hash function */
163 if (hashp->MAGIC != HASHMAGIC)
164 RETURN_ERROR(EFTYPE, error1);
165 #define OLDHASHVERSION 1
166 if (hashp->VERSION != HASHVERSION &&
167 hashp->VERSION != OLDHASHVERSION)
168 RETURN_ERROR(EFTYPE, error1);
169 if (hashp->hash(CHARKEY, sizeof(CHARKEY)) != hashp->H_CHARKEY)
170 RETURN_ERROR(EFTYPE, error1);
172 * Figure out how many segments we need. Max_Bucket is the
173 * maximum bucket number, so the number of buckets is
176 nsegs = (hashp->MAX_BUCKET + 1 + hashp->SGSIZE - 1) /
179 if (alloc_segs(hashp, nsegs))
181 * If alloc_segs fails, table will have been destroyed
182 * and errno will have been set.
185 /* Read in bitmaps */
186 bpages = (hashp->SPARES[hashp->OVFL_POINT] +
187 (hashp->BSIZE << BYTE_SHIFT) - 1) >>
188 (hashp->BSHIFT + BYTE_SHIFT);
190 hashp->nmaps = bpages;
191 (void)memset(&hashp->mapp[0], 0, bpages * sizeof(u_int32_t *));
194 /* Initialize Buffer Manager */
195 if (info && info->cachesize)
196 __buf_init(hashp, info->cachesize);
198 __buf_init(hashp, DEF_BUFSIZE);
200 hashp->new_file = new_table;
201 hashp->save_file = file && (hashp->flags & O_RDWR);
203 if (!(dbp = (DB *)malloc(sizeof(DB)))) {
209 dbp->internal = hashp;
210 dbp->close = hash_close;
211 dbp->del = hash_delete;
216 dbp->sync = hash_sync;
220 (void)fprintf(stderr,
221 "%s\n%s%x\n%s%d\n%s%d\n%s%d\n%s%d\n%s%d\n%s%d\n%s%d\n%s%d\n%s%d\n%s%x\n%s%x\n%s%d\n%s%d\n",
223 "TABLE POINTER ", hashp,
224 "BUCKET SIZE ", hashp->BSIZE,
225 "BUCKET SHIFT ", hashp->BSHIFT,
226 "DIRECTORY SIZE ", hashp->DSIZE,
227 "SEGMENT SIZE ", hashp->SGSIZE,
228 "SEGMENT SHIFT ", hashp->SSHIFT,
229 "FILL FACTOR ", hashp->FFACTOR,
230 "MAX BUCKET ", hashp->MAX_BUCKET,
231 "OVFL POINT ", hashp->OVFL_POINT,
232 "LAST FREED ", hashp->LAST_FREED,
233 "HIGH MASK ", hashp->HIGH_MASK,
234 "LOW MASK ", hashp->LOW_MASK,
235 "NSEGS ", hashp->nsegs,
236 "NKEYS ", hashp->NKEYS);
238 #ifdef HASH_STATISTICS
239 hash_overflows = hash_accesses = hash_collisions = hash_expansions = 0;
245 (void)_close(hashp->fp);
263 hashp = (HTAB *)dbp->internal;
264 retval = hdestroy(hashp);
278 hashp = (HTAB *)dbp->internal;
279 if (hashp->fp == -1) {
286 /************************** LOCAL CREATION ROUTINES **********************/
288 init_hash(hashp, file, info)
298 hashp->LORDER = BYTE_ORDER;
299 hashp->BSIZE = DEF_BUCKET_SIZE;
300 hashp->BSHIFT = DEF_BUCKET_SHIFT;
301 hashp->SGSIZE = DEF_SEGSIZE;
302 hashp->SSHIFT = DEF_SEGSIZE_SHIFT;
303 hashp->DSIZE = DEF_DIRSIZE;
304 hashp->FFACTOR = DEF_FFACTOR;
305 hashp->hash = __default_hash;
306 memset(hashp->SPARES, 0, sizeof(hashp->SPARES));
307 memset(hashp->BITMAPS, 0, sizeof (hashp->BITMAPS));
309 /* Fix bucket size to be optimal for file system */
311 if (stat(file, &statbuf))
313 hashp->BSIZE = statbuf.st_blksize;
314 hashp->BSHIFT = __log2(hashp->BSIZE);
319 /* Round pagesize up to power of 2 */
320 hashp->BSHIFT = __log2(info->bsize);
321 hashp->BSIZE = 1 << hashp->BSHIFT;
322 if (hashp->BSIZE > MAX_BSIZE) {
328 hashp->FFACTOR = info->ffactor;
330 hashp->hash = info->hash;
334 if (info->lorder != BIG_ENDIAN &&
335 info->lorder != LITTLE_ENDIAN) {
339 hashp->LORDER = info->lorder;
342 /* init_htab should destroy the table and set errno if it fails */
343 if (init_htab(hashp, nelem))
349 * This calls alloc_segs which may run out of memory. Alloc_segs will destroy
350 * the table and set errno, so we just pass the error information along.
352 * Returns 0 on No Error
355 init_htab(hashp, nelem)
359 register int nbuckets, nsegs;
363 * Divide number of elements by the fill factor and determine a
364 * desired number of buckets. Allocate space for the next greater
365 * power of two number of buckets.
367 nelem = (nelem - 1) / hashp->FFACTOR + 1;
369 l2 = __log2(MAX(nelem, 2));
372 hashp->SPARES[l2] = l2 + 1;
373 hashp->SPARES[l2 + 1] = l2 + 1;
374 hashp->OVFL_POINT = l2;
375 hashp->LAST_FREED = 2;
377 /* First bitmap page is at: splitpoint l2 page offset 1 */
378 if (__ibitmap(hashp, OADDR_OF(l2, 1), l2 + 1, 0))
381 hashp->MAX_BUCKET = hashp->LOW_MASK = nbuckets - 1;
382 hashp->HIGH_MASK = (nbuckets << 1) - 1;
383 hashp->HDRPAGES = ((MAX(sizeof(HASHHDR), MINHDRSIZE) - 1) >>
386 nsegs = (nbuckets - 1) / hashp->SGSIZE + 1;
387 nsegs = 1 << __log2(nsegs);
389 if (nsegs > hashp->DSIZE)
390 hashp->DSIZE = nsegs;
391 return (alloc_segs(hashp, nsegs));
394 /********************** DESTROY/CLOSE ROUTINES ************************/
397 * Flushes any changes to the file if necessary and destroys the hashp
398 * structure, freeing all allocated space.
408 #ifdef HASH_STATISTICS
409 (void)fprintf(stderr, "hdestroy: accesses %ld collisions %ld\n",
410 hash_accesses, hash_collisions);
411 (void)fprintf(stderr, "hdestroy: expansions %ld\n",
413 (void)fprintf(stderr, "hdestroy: overflows %ld\n",
415 (void)fprintf(stderr, "keys %ld maxp %d segmentcount %d\n",
416 hashp->NKEYS, hashp->MAX_BUCKET, hashp->nsegs);
418 for (i = 0; i < NCACHED; i++)
419 (void)fprintf(stderr,
420 "spares[%d] = %d\n", i, hashp->SPARES[i]);
423 * Call on buffer manager to free buffers, and if required,
424 * write them to disk.
426 if (__buf_free(hashp, 1, hashp->save_file))
429 free(*hashp->dir); /* Free initial segments */
430 /* Free extra segments */
431 while (hashp->exsegs--)
432 free(hashp->dir[--hashp->nsegs]);
435 if (flush_meta(hashp) && !save_errno)
438 for (i = 0; i < hashp->nmaps; i++)
440 free(hashp->mapp[i]);
443 (void)_close(hashp->fp);
454 * Write modified pages to disk
461 hash_sync(dbp, flags)
475 hashp = (HTAB *)dbp->internal;
476 if (!hashp->save_file)
478 if (__buf_free(hashp, 0, 1) || flush_meta(hashp))
487 * -1 indicates that errno should be set
494 #if BYTE_ORDER == LITTLE_ENDIAN
499 if (!hashp->save_file)
501 hashp->MAGIC = HASHMAGIC;
502 hashp->VERSION = HASHVERSION;
503 hashp->H_CHARKEY = hashp->hash(CHARKEY, sizeof(CHARKEY));
507 #if BYTE_ORDER == LITTLE_ENDIAN
509 swap_header_copy(&hashp->hdr, whdrp);
511 if ((lseek(fp, (off_t)0, SEEK_SET) == -1) ||
512 ((wsize = _write(fp, whdrp, sizeof(HASHHDR))) == -1))
515 if (wsize != sizeof(HASHHDR)) {
517 hashp->error = errno;
520 for (i = 0; i < NCACHED; i++)
522 if (__put_page(hashp, (char *)hashp->mapp[i],
523 hashp->BITMAPS[i], 0, 1))
528 /*******************************SEARCH ROUTINES *****************************/
530 * All the access routines return
534 * 1 to indicate an external ERROR (i.e. key not found, etc)
535 * -1 to indicate an internal ERROR (i.e. out of memory, etc)
538 hash_get(dbp, key, data, flag)
546 hashp = (HTAB *)dbp->internal;
548 hashp->error = errno = EINVAL;
551 return (hash_access(hashp, HASH_GET, (DBT *)key, data));
555 hash_put(dbp, key, data, flag)
563 hashp = (HTAB *)dbp->internal;
564 if (flag && flag != R_NOOVERWRITE) {
565 hashp->error = errno = EINVAL;
568 if ((hashp->flags & O_ACCMODE) == O_RDONLY) {
569 hashp->error = errno = EPERM;
572 return (hash_access(hashp, flag == R_NOOVERWRITE ?
573 HASH_PUTNEW : HASH_PUT, (DBT *)key, (DBT *)data));
577 hash_delete(dbp, key, flag)
580 u_int32_t flag; /* Ignored */
584 hashp = (HTAB *)dbp->internal;
585 if (flag && flag != R_CURSOR) {
586 hashp->error = errno = EINVAL;
589 if ((hashp->flags & O_ACCMODE) == O_RDONLY) {
590 hashp->error = errno = EPERM;
593 return (hash_access(hashp, HASH_DELETE, (DBT *)key, NULL));
597 * Assume that hashp has been set in wrapper routine.
600 hash_access(hashp, action, key, val)
605 register BUFHEAD *rbufp;
606 BUFHEAD *bufp, *save_bufp;
607 register u_int16_t *bp;
608 register int n, ndx, off, size;
612 #ifdef HASH_STATISTICS
618 kp = (char *)key->data;
619 rbufp = __get_buf(hashp, __call_hash(hashp, kp, size), NULL, 0);
624 /* Pin the bucket chain */
625 rbufp->flags |= BUF_PIN;
626 for (bp = (u_int16_t *)rbufp->page, n = *bp++, ndx = 1; ndx < n;)
627 if (bp[1] >= REAL_KEY) {
628 /* Real key/data pair */
629 if (size == off - *bp &&
630 memcmp(kp, rbufp->page + *bp, size) == 0)
633 #ifdef HASH_STATISTICS
638 } else if (bp[1] == OVFLPAGE) {
639 rbufp = __get_buf(hashp, *bp, rbufp, 0);
641 save_bufp->flags &= ~BUF_PIN;
645 bp = (u_int16_t *)rbufp->page;
649 } else if (bp[1] < REAL_KEY) {
651 __find_bigpair(hashp, rbufp, ndx, kp, size)) > 0)
656 __find_last_page(hashp, &bufp))) {
661 rbufp = __get_buf(hashp, pageno, bufp, 0);
663 save_bufp->flags &= ~BUF_PIN;
667 bp = (u_int16_t *)rbufp->page;
672 save_bufp->flags &= ~BUF_PIN;
681 if (__addel(hashp, rbufp, key, val)) {
682 save_bufp->flags &= ~BUF_PIN;
685 save_bufp->flags &= ~BUF_PIN;
691 save_bufp->flags &= ~BUF_PIN;
698 save_bufp->flags &= ~BUF_PIN;
701 bp = (u_int16_t *)rbufp->page;
702 if (bp[ndx + 1] < REAL_KEY) {
703 if (__big_return(hashp, rbufp, ndx, val, 0))
706 val->data = (u_char *)rbufp->page + (int)bp[ndx + 1];
707 val->size = bp[ndx] - bp[ndx + 1];
711 if ((__delpair(hashp, rbufp, ndx)) ||
712 (__addel(hashp, rbufp, key, val))) {
713 save_bufp->flags &= ~BUF_PIN;
718 if (__delpair(hashp, rbufp, ndx))
724 save_bufp->flags &= ~BUF_PIN;
729 hash_seq(dbp, key, data, flag)
734 register u_int32_t bucket;
735 register BUFHEAD *bufp;
739 hashp = (HTAB *)dbp->internal;
740 if (flag && flag != R_FIRST && flag != R_NEXT) {
741 hashp->error = errno = EINVAL;
744 #ifdef HASH_STATISTICS
747 if ((hashp->cbucket < 0) || (flag == R_FIRST)) {
753 for (bp = NULL; !bp || !bp[0]; ) {
754 if (!(bufp = hashp->cpage)) {
755 for (bucket = hashp->cbucket;
756 bucket <= hashp->MAX_BUCKET;
757 bucket++, hashp->cndx = 1) {
758 bufp = __get_buf(hashp, bucket, NULL, 0);
762 bp = (u_int16_t *)bufp->page;
766 hashp->cbucket = bucket;
767 if (hashp->cbucket > hashp->MAX_BUCKET) {
772 bp = (u_int16_t *)hashp->cpage->page;
778 while (bp[hashp->cndx + 1] == OVFLPAGE) {
779 bufp = hashp->cpage =
780 __get_buf(hashp, bp[hashp->cndx], bufp, 0);
783 bp = (u_int16_t *)(bufp->page);
792 if (bp[ndx + 1] < REAL_KEY) {
793 if (__big_keydata(hashp, bufp, key, data, 1))
796 key->data = (u_char *)hashp->cpage->page + bp[ndx];
797 key->size = (ndx > 1 ? bp[ndx - 1] : hashp->BSIZE) - bp[ndx];
798 data->data = (u_char *)hashp->cpage->page + bp[ndx + 1];
799 data->size = bp[ndx] - bp[ndx + 1];
811 /********************************* UTILITIES ************************/
819 __expand_table(hashp)
822 u_int32_t old_bucket, new_bucket;
823 int dirsize, new_segnum, spare_ndx;
825 #ifdef HASH_STATISTICS
828 new_bucket = ++hashp->MAX_BUCKET;
829 old_bucket = (hashp->MAX_BUCKET & hashp->LOW_MASK);
831 new_segnum = new_bucket >> hashp->SSHIFT;
833 /* Check if we need a new segment */
834 if (new_segnum >= hashp->nsegs) {
835 /* Check if we need to expand directory */
836 if (new_segnum >= hashp->DSIZE) {
837 /* Reallocate directory */
838 dirsize = hashp->DSIZE * sizeof(SEGMENT *);
839 if (!hash_realloc(&hashp->dir, dirsize, dirsize << 1))
841 hashp->DSIZE = dirsize << 1;
843 if ((hashp->dir[new_segnum] =
844 (SEGMENT)calloc(hashp->SGSIZE, sizeof(SEGMENT))) == NULL)
850 * If the split point is increasing (MAX_BUCKET's log base 2
851 * * increases), we need to copy the current contents of the spare
852 * split bucket to the next bucket.
854 spare_ndx = __log2(hashp->MAX_BUCKET + 1);
855 if (spare_ndx > hashp->OVFL_POINT) {
856 hashp->SPARES[spare_ndx] = hashp->SPARES[hashp->OVFL_POINT];
857 hashp->OVFL_POINT = spare_ndx;
860 if (new_bucket > hashp->HIGH_MASK) {
861 /* Starting a new doubling */
862 hashp->LOW_MASK = hashp->HIGH_MASK;
863 hashp->HIGH_MASK = new_bucket | hashp->LOW_MASK;
865 /* Relocate records to the new bucket */
866 return (__split_page(hashp, old_bucket, new_bucket));
870 * If realloc guarantees that the pointer is not destroyed if the realloc
871 * fails, then this routine can go away.
874 hash_realloc(p_ptr, oldsize, newsize)
876 int oldsize, newsize;
880 if ( (p = malloc(newsize)) ) {
881 memmove(p, *p_ptr, oldsize);
882 memset((char *)p + oldsize, 0, newsize - oldsize);
890 __call_hash(hashp, k, len)
897 n = hashp->hash(k, len);
898 bucket = n & hashp->HIGH_MASK;
899 if (bucket > hashp->MAX_BUCKET)
900 bucket = bucket & hashp->LOW_MASK;
905 * Allocate segment table. On error, destroy the table and set errno.
907 * Returns 0 on success
910 alloc_segs(hashp, nsegs)
915 register SEGMENT store;
920 (SEGMENT *)calloc(hashp->DSIZE, sizeof(SEGMENT *))) == NULL) {
922 (void)hdestroy(hashp);
926 /* Allocate segments */
928 (SEGMENT)calloc(nsegs << hashp->SSHIFT, sizeof(SEGMENT))) == NULL) {
930 (void)hdestroy(hashp);
934 for (i = 0; i < nsegs; i++, hashp->nsegs++)
935 hashp->dir[i] = &store[i << hashp->SSHIFT];
939 #if BYTE_ORDER == LITTLE_ENDIAN
941 * Hashp->hdr needs to be byteswapped.
944 swap_header_copy(srcp, destp)
945 HASHHDR *srcp, *destp;
949 P_32_COPY(srcp->magic, destp->magic);
950 P_32_COPY(srcp->version, destp->version);
951 P_32_COPY(srcp->lorder, destp->lorder);
952 P_32_COPY(srcp->bsize, destp->bsize);
953 P_32_COPY(srcp->bshift, destp->bshift);
954 P_32_COPY(srcp->dsize, destp->dsize);
955 P_32_COPY(srcp->ssize, destp->ssize);
956 P_32_COPY(srcp->sshift, destp->sshift);
957 P_32_COPY(srcp->ovfl_point, destp->ovfl_point);
958 P_32_COPY(srcp->last_freed, destp->last_freed);
959 P_32_COPY(srcp->max_bucket, destp->max_bucket);
960 P_32_COPY(srcp->high_mask, destp->high_mask);
961 P_32_COPY(srcp->low_mask, destp->low_mask);
962 P_32_COPY(srcp->ffactor, destp->ffactor);
963 P_32_COPY(srcp->nkeys, destp->nkeys);
964 P_32_COPY(srcp->hdrpages, destp->hdrpages);
965 P_32_COPY(srcp->h_charkey, destp->h_charkey);
966 for (i = 0; i < NCACHED; i++) {
967 P_32_COPY(srcp->spares[i], destp->spares[i]);
968 P_16_COPY(srcp->bitmaps[i], destp->bitmaps[i]);
981 M_32_SWAP(hdrp->magic);
982 M_32_SWAP(hdrp->version);
983 M_32_SWAP(hdrp->lorder);
984 M_32_SWAP(hdrp->bsize);
985 M_32_SWAP(hdrp->bshift);
986 M_32_SWAP(hdrp->dsize);
987 M_32_SWAP(hdrp->ssize);
988 M_32_SWAP(hdrp->sshift);
989 M_32_SWAP(hdrp->ovfl_point);
990 M_32_SWAP(hdrp->last_freed);
991 M_32_SWAP(hdrp->max_bucket);
992 M_32_SWAP(hdrp->high_mask);
993 M_32_SWAP(hdrp->low_mask);
994 M_32_SWAP(hdrp->ffactor);
995 M_32_SWAP(hdrp->nkeys);
996 M_32_SWAP(hdrp->hdrpages);
997 M_32_SWAP(hdrp->h_charkey);
998 for (i = 0; i < NCACHED; i++) {
999 M_32_SWAP(hdrp->spares[i]);
1000 M_16_SWAP(hdrp->bitmaps[i]);