3 * Bill Paul <wpaul@ctr.columbia.edu>. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by Bill Paul.
16 * 4. Neither the name of the author nor the names of any co-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 Bill Paul 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 Bill Paul 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
38 #include <sys/types.h>
42 static const char rcsid[] = "$Id$";
47 * This hash function is stolen directly from the
48 * Berkeley DB package. It already exists inside libc, but
49 * it's declared static which prevents us from calling it
53 * OZ's original sdbm hash
60 register const u_char *key;
64 #define HASHC h = *key++ + 65599 * h
69 loop = (len + 8 - 1) >> 3;
71 switch (len & (8 - 1)) {
103 * Generate a hash value for a given key (character string).
104 * We mask off all but the lower 8 bits since our table array
105 * can only hole 256 elements.
107 u_int32_t hashkey(key)
113 return(hash((void *)key, strlen(key)) & HASH_MASK);
116 /* Find an entry in the hash table (may be hanging off a linked list). */
117 struct grouplist *lookup(table, key)
118 struct member_entry *table[];
121 struct member_entry *cur;
123 cur = table[hashkey(key)];
126 if (!strcmp(cur->key, key))
134 struct grouplist dummy = { 99999, NULL };
137 * Store an group member entry and/or update its grouplist.
139 void mstore (table, key, gid, dup)
140 struct member_entry *table[];
145 struct member_entry *cur, *new;
146 struct grouplist *tmp;
153 tmp = (struct grouplist *)malloc(sizeof(struct grouplist));
158 /* Check if all we have to do is insert a new groupname. */
160 if (!dup && !strcmp(cur->key, key)) {
161 tmp->next = cur->groups;
168 /* Didn't find a match -- add the whole mess to the table. */
169 new = (struct member_entry *)malloc(sizeof(struct member_entry));
170 new->key = strdup(key);
174 new->groups = (struct grouplist *)&dummy;
175 new->next = table[i];