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