2 * SPDX-License-Identifier: BSD-4-Clause
5 * Bill Paul <wpaul@ctr.columbia.edu>. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by Bill Paul.
18 * 4. Neither the name of the author nor the names of any co-contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY Bill Paul AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL Bill Paul OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 #include <sys/types.h>
42 * This hash function is stolen directly from the
43 * Berkeley DB package. It already exists inside libc, but
44 * it's declared static which prevents us from calling it
48 * OZ's original sdbm hash
51 hash(const void *keyarg, size_t len)
57 #define HASHC h = *key++ + 65599 * h
62 loop = (len + 8 - 1) >> 3;
64 switch (len & (8 - 1)) {
96 * Generate a hash value for a given key (character string).
97 * We mask off all but the lower 8 bits since our table array
98 * can only hole 256 elements.
100 u_int32_t hashkey(char *key)
105 return(hash((void *)key, strlen(key)) & HASH_MASK);
108 /* Find an entry in the hash table (may be hanging off a linked list). */
109 struct grouplist *lookup(struct member_entry *table[], char *key)
111 struct member_entry *cur;
113 cur = table[hashkey(key)];
116 if (!strcmp(cur->key, key))
124 struct grouplist dummy = { 99999, NULL };
127 * Store a group member entry and/or update its grouplist.
129 void mstore (struct member_entry *table[], char *key, int gid, int dup)
131 struct member_entry *cur, *new;
132 struct grouplist *tmp;
139 tmp = (struct grouplist *)malloc(sizeof(struct grouplist));
144 /* Check if all we have to do is insert a new groupname. */
146 if (!dup && !strcmp(cur->key, key)) {
147 tmp->next = cur->groups;
154 /* Didn't find a match -- add the whole mess to the table. */
155 new = (struct member_entry *)malloc(sizeof(struct member_entry));
156 new->key = strdup(key);
160 new->groups = (struct grouplist *)&dummy;
161 new->next = table[i];