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 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 #if defined(LIBC_SCCS) && !defined(lint)
34 static char sccsid[] = "@(#)hash.c 8.9 (Berkeley) 6/16/94";
35 #endif /* LIBC_SCCS and not lint */
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
39 #include "namespace.h"
40 #include <sys/param.h>
52 #include "un-namespace.h"
59 static int alloc_segs(HTAB *, int);
60 static int flush_meta(HTAB *);
61 static int hash_access(HTAB *, ACTION, DBT *, DBT *);
62 static int hash_close(DB *);
63 static int hash_delete(const DB *, const DBT *, u_int32_t);
64 static int hash_fd(const DB *);
65 static int hash_get(const DB *, const DBT *, DBT *, u_int32_t);
66 static int hash_put(const DB *, DBT *, const DBT *, u_int32_t);
67 static void *hash_realloc(SEGMENT **, int, int);
68 static int hash_seq(const DB *, DBT *, DBT *, u_int32_t);
69 static int hash_sync(const DB *, u_int32_t);
70 static int hdestroy(HTAB *);
71 static HTAB *init_hash(HTAB *, const char *, const HASHINFO *);
72 static int init_htab(HTAB *, int);
73 #if BYTE_ORDER == LITTLE_ENDIAN
74 static void swap_header(HTAB *);
75 static void swap_header_copy(HASHHDR *, HASHHDR *);
78 /* Fast arithmetic, relying on powers of 2, */
79 #define MOD(x, y) ((x) & ((y) - 1))
81 #define RETURN_ERROR(ERR, LOC) { save_errno = ERR; goto LOC; }
88 #ifdef HASH_STATISTICS
89 int hash_accesses, hash_collisions, hash_expansions, hash_overflows;
92 /************************** INTERFACE ROUTINES ***************************/
97 __hash_open(const char *file, int flags, int mode,
98 const HASHINFO *info, /* Special directives for create */
104 int bpages, hdrsize, new_table, nsegs, save_errno;
106 if ((flags & O_ACCMODE) == O_WRONLY) {
111 if (!(hashp = (HTAB *)calloc(1, sizeof(HTAB))))
116 * Even if user wants write only, we need to be able to read
117 * the actual file, so we need to open it read/write. But, the
118 * field in the hashp structure needs to be accurate so that
119 * we can check accesses.
121 hashp->flags = flags;
124 if ((hashp->fp = _open(file, flags, mode)) == -1)
125 RETURN_ERROR(errno, error0);
126 (void)_fcntl(hashp->fp, F_SETFD, 1);
127 new_table = _fstat(hashp->fp, &statbuf) == 0 &&
128 statbuf.st_size == 0 && (flags & O_ACCMODE) != O_RDONLY;
133 if (!(hashp = init_hash(hashp, file, info)))
134 RETURN_ERROR(errno, error1);
136 /* Table already exists */
137 if (info && info->hash)
138 hashp->hash = info->hash;
140 hashp->hash = __default_hash;
142 hdrsize = _read(hashp->fp, &hashp->hdr, sizeof(HASHHDR));
143 #if BYTE_ORDER == LITTLE_ENDIAN
147 RETURN_ERROR(errno, error1);
148 if (hdrsize != sizeof(HASHHDR))
149 RETURN_ERROR(EFTYPE, error1);
150 /* Verify file type, versions and hash function */
151 if (hashp->MAGIC != HASHMAGIC)
152 RETURN_ERROR(EFTYPE, error1);
153 #define OLDHASHVERSION 1
154 if (hashp->VERSION != HASHVERSION &&
155 hashp->VERSION != OLDHASHVERSION)
156 RETURN_ERROR(EFTYPE, error1);
157 if ((int32_t)hashp->hash(CHARKEY, sizeof(CHARKEY)) != hashp->H_CHARKEY)
158 RETURN_ERROR(EFTYPE, error1);
160 * Figure out how many segments we need. Max_Bucket is the
161 * maximum bucket number, so the number of buckets is
164 nsegs = (hashp->MAX_BUCKET + 1 + hashp->SGSIZE - 1) /
166 if (alloc_segs(hashp, nsegs))
168 * If alloc_segs fails, table will have been destroyed
169 * and errno will have been set.
172 /* Read in bitmaps */
173 bpages = (hashp->SPARES[hashp->OVFL_POINT] +
174 (hashp->BSIZE << BYTE_SHIFT) - 1) >>
175 (hashp->BSHIFT + BYTE_SHIFT);
177 hashp->nmaps = bpages;
178 (void)memset(&hashp->mapp[0], 0, bpages * sizeof(u_int32_t *));
181 /* Initialize Buffer Manager */
182 if (info && info->cachesize)
183 __buf_init(hashp, info->cachesize);
185 __buf_init(hashp, DEF_BUFSIZE);
187 hashp->new_file = new_table;
188 hashp->save_file = file && (hashp->flags & O_RDWR);
190 if (!(dbp = (DB *)malloc(sizeof(DB)))) {
196 dbp->internal = hashp;
197 dbp->close = hash_close;
198 dbp->del = hash_delete;
203 dbp->sync = hash_sync;
207 (void)fprintf(stderr,
208 "%s\n%s%p\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",
210 "TABLE POINTER ", hashp,
211 "BUCKET SIZE ", hashp->BSIZE,
212 "BUCKET SHIFT ", hashp->BSHIFT,
213 "DIRECTORY SIZE ", hashp->DSIZE,
214 "SEGMENT SIZE ", hashp->SGSIZE,
215 "SEGMENT SHIFT ", hashp->SSHIFT,
216 "FILL FACTOR ", hashp->FFACTOR,
217 "MAX BUCKET ", hashp->MAX_BUCKET,
218 "OVFL POINT ", hashp->OVFL_POINT,
219 "LAST FREED ", hashp->LAST_FREED,
220 "HIGH MASK ", hashp->HIGH_MASK,
221 "LOW MASK ", hashp->LOW_MASK,
222 "NSEGS ", hashp->nsegs,
223 "NKEYS ", hashp->NKEYS);
225 #ifdef HASH_STATISTICS
226 hash_overflows = hash_accesses = hash_collisions = hash_expansions = 0;
232 (void)_close(hashp->fp);
249 hashp = (HTAB *)dbp->internal;
250 retval = hdestroy(hashp);
256 hash_fd(const DB *dbp)
263 hashp = (HTAB *)dbp->internal;
264 if (hashp->fp == -1) {
271 /************************** LOCAL CREATION ROUTINES **********************/
273 init_hash(HTAB *hashp, const char *file, const HASHINFO *info)
280 hashp->LORDER = BYTE_ORDER;
281 hashp->BSIZE = DEF_BUCKET_SIZE;
282 hashp->BSHIFT = DEF_BUCKET_SHIFT;
283 hashp->SGSIZE = DEF_SEGSIZE;
284 hashp->SSHIFT = DEF_SEGSIZE_SHIFT;
285 hashp->DSIZE = DEF_DIRSIZE;
286 hashp->FFACTOR = DEF_FFACTOR;
287 hashp->hash = __default_hash;
288 memset(hashp->SPARES, 0, sizeof(hashp->SPARES));
289 memset(hashp->BITMAPS, 0, sizeof (hashp->BITMAPS));
291 /* Fix bucket size to be optimal for file system */
293 if (stat(file, &statbuf))
295 hashp->BSIZE = statbuf.st_blksize;
296 if (hashp->BSIZE > MAX_BSIZE)
297 hashp->BSIZE = MAX_BSIZE;
298 hashp->BSHIFT = __log2(hashp->BSIZE);
303 /* Round pagesize up to power of 2 */
304 hashp->BSHIFT = __log2(info->bsize);
305 hashp->BSIZE = 1 << hashp->BSHIFT;
306 if (hashp->BSIZE > MAX_BSIZE) {
312 hashp->FFACTOR = info->ffactor;
314 hashp->hash = info->hash;
318 if (info->lorder != BIG_ENDIAN &&
319 info->lorder != LITTLE_ENDIAN) {
323 hashp->LORDER = info->lorder;
326 /* init_htab should destroy the table and set errno if it fails */
327 if (init_htab(hashp, nelem))
333 * This calls alloc_segs which may run out of memory. Alloc_segs will destroy
334 * the table and set errno, so we just pass the error information along.
336 * Returns 0 on No Error
339 init_htab(HTAB *hashp, int nelem)
341 int nbuckets, nsegs, l2;
344 * Divide number of elements by the fill factor and determine a
345 * desired number of buckets. Allocate space for the next greater
346 * power of two number of buckets.
348 nelem = (nelem - 1) / hashp->FFACTOR + 1;
350 l2 = __log2(MAX(nelem, 2));
353 hashp->SPARES[l2] = l2 + 1;
354 hashp->SPARES[l2 + 1] = l2 + 1;
355 hashp->OVFL_POINT = l2;
356 hashp->LAST_FREED = 2;
358 /* First bitmap page is at: splitpoint l2 page offset 1 */
359 if (__ibitmap(hashp, OADDR_OF(l2, 1), l2 + 1, 0))
362 hashp->MAX_BUCKET = hashp->LOW_MASK = nbuckets - 1;
363 hashp->HIGH_MASK = (nbuckets << 1) - 1;
364 hashp->HDRPAGES = ((MAX(sizeof(HASHHDR), MINHDRSIZE) - 1) >>
367 nsegs = (nbuckets - 1) / hashp->SGSIZE + 1;
368 nsegs = 1 << __log2(nsegs);
370 if (nsegs > hashp->DSIZE)
371 hashp->DSIZE = nsegs;
372 return (alloc_segs(hashp, nsegs));
375 /********************** DESTROY/CLOSE ROUTINES ************************/
378 * Flushes any changes to the file if necessary and destroys the hashp
379 * structure, freeing all allocated space.
382 hdestroy(HTAB *hashp)
388 #ifdef HASH_STATISTICS
389 (void)fprintf(stderr, "hdestroy: accesses %ld collisions %ld\n",
390 hash_accesses, hash_collisions);
391 (void)fprintf(stderr, "hdestroy: expansions %ld\n",
393 (void)fprintf(stderr, "hdestroy: overflows %ld\n",
395 (void)fprintf(stderr, "keys %ld maxp %d segmentcount %d\n",
396 hashp->NKEYS, hashp->MAX_BUCKET, hashp->nsegs);
398 for (i = 0; i < NCACHED; i++)
399 (void)fprintf(stderr,
400 "spares[%d] = %d\n", i, hashp->SPARES[i]);
403 * Call on buffer manager to free buffers, and if required,
404 * write them to disk.
406 if (__buf_free(hashp, 1, hashp->save_file))
409 free(*hashp->dir); /* Free initial segments */
410 /* Free extra segments */
411 while (hashp->exsegs--)
412 free(hashp->dir[--hashp->nsegs]);
415 if (flush_meta(hashp) && !save_errno)
418 for (i = 0; i < hashp->nmaps; i++)
420 free(hashp->mapp[i]);
422 free(hashp->tmp_key);
424 free(hashp->tmp_buf);
427 (void)_close(hashp->fp);
438 * Write modified pages to disk
445 hash_sync(const DB *dbp, u_int32_t flags)
457 hashp = (HTAB *)dbp->internal;
458 if (!hashp->save_file)
460 if (__buf_free(hashp, 0, 1) || flush_meta(hashp))
469 * -1 indicates that errno should be set
472 flush_meta(HTAB *hashp)
475 #if BYTE_ORDER == LITTLE_ENDIAN
480 if (!hashp->save_file)
482 hashp->MAGIC = HASHMAGIC;
483 hashp->VERSION = HASHVERSION;
484 hashp->H_CHARKEY = hashp->hash(CHARKEY, sizeof(CHARKEY));
488 #if BYTE_ORDER == LITTLE_ENDIAN
490 swap_header_copy(&hashp->hdr, whdrp);
492 if ((wsize = pwrite(fp, whdrp, sizeof(HASHHDR), (off_t)0)) == -1)
495 if (wsize != sizeof(HASHHDR)) {
497 hashp->error = errno;
500 for (i = 0; i < NCACHED; i++)
502 if (__put_page(hashp, (char *)hashp->mapp[i],
503 hashp->BITMAPS[i], 0, 1))
508 /*******************************SEARCH ROUTINES *****************************/
510 * All the access routines return
514 * 1 to indicate an external ERROR (i.e. key not found, etc)
515 * -1 to indicate an internal ERROR (i.e. out of memory, etc)
518 hash_get(const DB *dbp, const DBT *key, DBT *data, u_int32_t flag)
522 hashp = (HTAB *)dbp->internal;
524 hashp->error = errno = EINVAL;
527 return (hash_access(hashp, HASH_GET, (DBT *)key, data));
531 hash_put(const DB *dbp, DBT *key, const DBT *data, u_int32_t flag)
535 hashp = (HTAB *)dbp->internal;
536 if (flag && flag != R_NOOVERWRITE) {
537 hashp->error = errno = EINVAL;
540 if ((hashp->flags & O_ACCMODE) == O_RDONLY) {
541 hashp->error = errno = EPERM;
544 return (hash_access(hashp, flag == R_NOOVERWRITE ?
545 HASH_PUTNEW : HASH_PUT, (DBT *)key, (DBT *)data));
549 hash_delete(const DB *dbp, const DBT *key,
550 u_int32_t flag) /* Ignored */
554 hashp = (HTAB *)dbp->internal;
555 if (flag && flag != R_CURSOR) {
556 hashp->error = errno = EINVAL;
559 if ((hashp->flags & O_ACCMODE) == O_RDONLY) {
560 hashp->error = errno = EPERM;
563 return (hash_access(hashp, HASH_DELETE, (DBT *)key, NULL));
567 * Assume that hashp has been set in wrapper routine.
570 hash_access(HTAB *hashp, ACTION action, DBT *key, DBT *val)
573 BUFHEAD *bufp, *save_bufp;
575 int n, ndx, off, size;
579 #ifdef HASH_STATISTICS
585 kp = (char *)key->data;
586 rbufp = __get_buf(hashp, __call_hash(hashp, kp, size), NULL, 0);
591 /* Pin the bucket chain */
592 rbufp->flags |= BUF_PIN;
593 for (bp = (u_int16_t *)rbufp->page, n = *bp++, ndx = 1; ndx < n;)
594 if (bp[1] >= REAL_KEY) {
595 /* Real key/data pair */
596 if (size == off - *bp &&
597 memcmp(kp, rbufp->page + *bp, size) == 0)
600 #ifdef HASH_STATISTICS
605 } else if (bp[1] == OVFLPAGE) {
606 rbufp = __get_buf(hashp, *bp, rbufp, 0);
608 save_bufp->flags &= ~BUF_PIN;
612 bp = (u_int16_t *)rbufp->page;
616 } else if (bp[1] < REAL_KEY) {
618 __find_bigpair(hashp, rbufp, ndx, kp, size)) > 0)
623 __find_last_page(hashp, &bufp))) {
628 rbufp = __get_buf(hashp, pageno, bufp, 0);
630 save_bufp->flags &= ~BUF_PIN;
634 bp = (u_int16_t *)rbufp->page;
639 save_bufp->flags &= ~BUF_PIN;
648 if (__addel(hashp, rbufp, key, val)) {
649 save_bufp->flags &= ~BUF_PIN;
652 save_bufp->flags &= ~BUF_PIN;
658 save_bufp->flags &= ~BUF_PIN;
665 save_bufp->flags &= ~BUF_PIN;
668 bp = (u_int16_t *)rbufp->page;
669 if (bp[ndx + 1] < REAL_KEY) {
670 if (__big_return(hashp, rbufp, ndx, val, 0))
673 val->data = (u_char *)rbufp->page + (int)bp[ndx + 1];
674 val->size = bp[ndx] - bp[ndx + 1];
678 if ((__delpair(hashp, rbufp, ndx)) ||
679 (__addel(hashp, rbufp, key, val))) {
680 save_bufp->flags &= ~BUF_PIN;
685 if (__delpair(hashp, rbufp, ndx))
691 save_bufp->flags &= ~BUF_PIN;
696 hash_seq(const DB *dbp, DBT *key, DBT *data, u_int32_t flag)
703 hashp = (HTAB *)dbp->internal;
704 if (flag && flag != R_FIRST && flag != R_NEXT) {
705 hashp->error = errno = EINVAL;
708 #ifdef HASH_STATISTICS
711 if ((hashp->cbucket < 0) || (flag == R_FIRST)) {
717 for (bp = NULL; !bp || !bp[0]; ) {
718 if (!(bufp = hashp->cpage)) {
719 for (bucket = hashp->cbucket;
720 bucket <= hashp->MAX_BUCKET;
721 bucket++, hashp->cndx = 1) {
722 bufp = __get_buf(hashp, bucket, NULL, 0);
726 bp = (u_int16_t *)bufp->page;
730 hashp->cbucket = bucket;
731 if ((u_int32_t)hashp->cbucket > hashp->MAX_BUCKET) {
736 bp = (u_int16_t *)hashp->cpage->page;
737 if (flag == R_NEXT || flag == 0) {
739 if (hashp->cndx > bp[0]) {
752 while (bp[hashp->cndx + 1] == OVFLPAGE) {
753 bufp = hashp->cpage =
754 __get_buf(hashp, bp[hashp->cndx], bufp, 0);
757 bp = (u_int16_t *)(bufp->page);
766 if (bp[ndx + 1] < REAL_KEY) {
767 if (__big_keydata(hashp, bufp, key, data, 1))
770 if (hashp->cpage == 0)
772 key->data = (u_char *)hashp->cpage->page + bp[ndx];
773 key->size = (ndx > 1 ? bp[ndx - 1] : hashp->BSIZE) - bp[ndx];
774 data->data = (u_char *)hashp->cpage->page + bp[ndx + 1];
775 data->size = bp[ndx] - bp[ndx + 1];
780 /********************************* UTILITIES ************************/
788 __expand_table(HTAB *hashp)
790 u_int32_t old_bucket, new_bucket;
791 int dirsize, new_segnum, spare_ndx;
793 #ifdef HASH_STATISTICS
796 new_bucket = ++hashp->MAX_BUCKET;
797 old_bucket = (hashp->MAX_BUCKET & hashp->LOW_MASK);
799 new_segnum = new_bucket >> hashp->SSHIFT;
801 /* Check if we need a new segment */
802 if (new_segnum >= hashp->nsegs) {
803 /* Check if we need to expand directory */
804 if (new_segnum >= hashp->DSIZE) {
805 /* Reallocate directory */
806 dirsize = hashp->DSIZE * sizeof(SEGMENT *);
807 if (!hash_realloc(&hashp->dir, dirsize, dirsize << 1))
809 hashp->DSIZE = dirsize << 1;
811 if ((hashp->dir[new_segnum] =
812 (SEGMENT)calloc(hashp->SGSIZE, sizeof(SEGMENT))) == NULL)
818 * If the split point is increasing (MAX_BUCKET's log base 2
819 * * increases), we need to copy the current contents of the spare
820 * split bucket to the next bucket.
822 spare_ndx = __log2(hashp->MAX_BUCKET + 1);
823 if (spare_ndx > hashp->OVFL_POINT) {
824 hashp->SPARES[spare_ndx] = hashp->SPARES[hashp->OVFL_POINT];
825 hashp->OVFL_POINT = spare_ndx;
828 if (new_bucket > hashp->HIGH_MASK) {
829 /* Starting a new doubling */
830 hashp->LOW_MASK = hashp->HIGH_MASK;
831 hashp->HIGH_MASK = new_bucket | hashp->LOW_MASK;
833 /* Relocate records to the new bucket */
834 return (__split_page(hashp, old_bucket, new_bucket));
838 * If realloc guarantees that the pointer is not destroyed if the realloc
839 * fails, then this routine can go away.
842 hash_realloc(SEGMENT **p_ptr, int oldsize, int newsize)
846 if ( (p = malloc(newsize)) ) {
847 memmove(p, *p_ptr, oldsize);
848 memset((char *)p + oldsize, 0, newsize - oldsize);
856 __call_hash(HTAB *hashp, char *k, int len)
858 unsigned int n, bucket;
860 n = hashp->hash(k, len);
861 bucket = n & hashp->HIGH_MASK;
862 if (bucket > hashp->MAX_BUCKET)
863 bucket = bucket & hashp->LOW_MASK;
868 * Allocate segment table. On error, destroy the table and set errno.
870 * Returns 0 on success
873 alloc_segs(HTAB *hashp, int nsegs)
881 (SEGMENT *)calloc(hashp->DSIZE, sizeof(SEGMENT *))) == NULL) {
883 (void)hdestroy(hashp);
887 hashp->nsegs = nsegs;
890 /* Allocate segments */
891 if ((store = (SEGMENT)calloc(nsegs << hashp->SSHIFT,
892 sizeof(SEGMENT))) == NULL) {
894 (void)hdestroy(hashp);
898 for (i = 0; i < nsegs; i++)
899 hashp->dir[i] = &store[i << hashp->SSHIFT];
903 #if BYTE_ORDER == LITTLE_ENDIAN
905 * Hashp->hdr needs to be byteswapped.
908 swap_header_copy(HASHHDR *srcp, HASHHDR *destp)
912 P_32_COPY(srcp->magic, destp->magic);
913 P_32_COPY(srcp->version, destp->version);
914 P_32_COPY(srcp->lorder, destp->lorder);
915 P_32_COPY(srcp->bsize, destp->bsize);
916 P_32_COPY(srcp->bshift, destp->bshift);
917 P_32_COPY(srcp->dsize, destp->dsize);
918 P_32_COPY(srcp->ssize, destp->ssize);
919 P_32_COPY(srcp->sshift, destp->sshift);
920 P_32_COPY(srcp->ovfl_point, destp->ovfl_point);
921 P_32_COPY(srcp->last_freed, destp->last_freed);
922 P_32_COPY(srcp->max_bucket, destp->max_bucket);
923 P_32_COPY(srcp->high_mask, destp->high_mask);
924 P_32_COPY(srcp->low_mask, destp->low_mask);
925 P_32_COPY(srcp->ffactor, destp->ffactor);
926 P_32_COPY(srcp->nkeys, destp->nkeys);
927 P_32_COPY(srcp->hdrpages, destp->hdrpages);
928 P_32_COPY(srcp->h_charkey, destp->h_charkey);
929 for (i = 0; i < NCACHED; i++) {
930 P_32_COPY(srcp->spares[i], destp->spares[i]);
931 P_16_COPY(srcp->bitmaps[i], destp->bitmaps[i]);
936 swap_header(HTAB *hashp)
943 M_32_SWAP(hdrp->magic);
944 M_32_SWAP(hdrp->version);
945 M_32_SWAP(hdrp->lorder);
946 M_32_SWAP(hdrp->bsize);
947 M_32_SWAP(hdrp->bshift);
948 M_32_SWAP(hdrp->dsize);
949 M_32_SWAP(hdrp->ssize);
950 M_32_SWAP(hdrp->sshift);
951 M_32_SWAP(hdrp->ovfl_point);
952 M_32_SWAP(hdrp->last_freed);
953 M_32_SWAP(hdrp->max_bucket);
954 M_32_SWAP(hdrp->high_mask);
955 M_32_SWAP(hdrp->low_mask);
956 M_32_SWAP(hdrp->ffactor);
957 M_32_SWAP(hdrp->nkeys);
958 M_32_SWAP(hdrp->hdrpages);
959 M_32_SWAP(hdrp->h_charkey);
960 for (i = 0; i < NCACHED; i++) {
961 M_32_SWAP(hdrp->spares[i]);
962 M_16_SWAP(hdrp->bitmaps[i]);