1 /* $NetBSD: hash.h,v 1.1.1.1 1999/11/19 04:30:56 mrg Exp $ */ 2 3 /*- 4 * SPDX-License-Identifier: BSD-4-Clause 5 * 6 * Copyright (c) 1988, 1989, 1990 The Regents of the University of California. 7 * Copyright (c) 1988, 1989 by Adam de Boor 8 * Copyright (c) 1989 by Berkeley Softworks 9 * All rights reserved. 10 * 11 * This code is derived from software contributed to Berkeley by 12 * Adam de Boor. 13 * 14 * Redistribution and use in source and binary forms, with or without 15 * modification, are permitted provided that the following conditions 16 * are met: 17 * 1. Redistributions of source code must retain the above copyright 18 * notice, this list of conditions and the following disclaimer. 19 * 2. Redistributions in binary form must reproduce the above copyright 20 * notice, this list of conditions and the following disclaimer in the 21 * documentation and/or other materials provided with the distribution. 22 * 3. All advertising materials mentioning features or use of this software 23 * must display the following acknowledgement: 24 * This product includes software developed by the University of 25 * California, Berkeley and its contributors. 26 * 4. Neither the name of the University nor the names of its contributors 27 * may be used to endorse or promote products derived from this software 28 * without specific prior written permission. 29 * 30 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 33 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 40 * SUCH DAMAGE. 41 * 42 * from: @(#)hash.h 8.1 (Berkeley) 6/6/93 43 */ 44 45 /* hash.h -- 46 * 47 * This file contains definitions used by the hash module, 48 * which maintains hash tables. 49 */ 50 51 #ifndef _HASH 52 #define _HASH 53 54 /* 55 * The following defines one entry in the hash table. 56 */ 57 58 typedef struct Hash_Entry { 59 struct Hash_Entry *next; /* Used to link together all the 60 * entries associated with the same 61 * bucket. */ 62 ClientData clientData; /* Arbitrary piece of data associated 63 * with key. */ 64 unsigned namehash; /* hash value of key */ 65 char name[1]; /* key string */ 66 } Hash_Entry; 67 68 typedef struct Hash_Table { 69 struct Hash_Entry **bucketPtr; 70 /* Pointers to Hash_Entry, one 71 * for each bucket in the table. */ 72 int size; /* Actual size of array. */ 73 int numEntries; /* Number of entries in the table. */ 74 int mask; /* Used to select bits for hashing. */ 75 } Hash_Table; 76 77 /* 78 * The following structure is used by the searching routines 79 * to record where we are in the search. 80 */ 81 82 typedef struct Hash_Search { 83 Hash_Table *tablePtr; /* Table being searched. */ 84 int nextIndex; /* Next bucket to check (after 85 * current). */ 86 Hash_Entry *hashEntryPtr; /* Next entry to check in current 87 * bucket. */ 88 } Hash_Search; 89 90 /* 91 * Macros. 92 */ 93 94 /* 95 * ClientData Hash_GetValue(h) 96 * Hash_Entry *h; 97 */ 98 99 #define Hash_GetValue(h) ((h)->clientData) 100 101 /* 102 * Hash_SetValue(h, val); 103 * Hash_Entry *h; 104 * char *val; 105 */ 106 107 #define Hash_SetValue(h, val) ((h)->clientData = (ClientData) (val)) 108 109 #ifdef ORDER 110 /* 111 * Hash_GetKey(h); 112 * Hash_Entry *h; 113 */ 114 115 #define Hash_GetKey(h) ((h)->name) 116 #endif /* ORDER */ 117 118 /* 119 * Hash_Size(n) returns the number of words in an object of n bytes 120 */ 121 122 #define Hash_Size(n) (((n) + sizeof (int) - 1) / sizeof (int)) 123 124 void Hash_InitTable(Hash_Table *, int); 125 void Hash_DeleteTable(Hash_Table *); 126 Hash_Entry *Hash_FindEntry(Hash_Table *, char *); 127 Hash_Entry *Hash_CreateEntry(Hash_Table *, char *, Boolean *); 128 void Hash_DeleteEntry(Hash_Table *, Hash_Entry *); 129 Hash_Entry *Hash_EnumFirst(Hash_Table *, Hash_Search *); 130 Hash_Entry *Hash_EnumNext(Hash_Search *); 131 132 #endif /* _HASH */ 133