1 /* $OpenBSD: cache.c,v 1.17 2004/03/16 03:28:34 tedu Exp $ */
2 /* $NetBSD: cache.c,v 1.4 1995/03/21 09:07:10 cgd Exp $ */
5 * Copyright (c) 1992 Keith Muller.
6 * Copyright (c) 1992, 1993
7 * The Regents of the University of California. All rights reserved.
9 * This code is derived from software contributed to Berkeley by
10 * Keith Muller of the University of California, San Diego.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 static const char sccsid[] = "@(#)cache.c 8.1 (Berkeley) 5/31/93";
41 static const char rcsid[] = "$OpenBSD: cache.c,v 1.17 2004/03/16 03:28:34 tedu Exp $";
45 #include <sys/types.h>
48 #include <sys/param.h>
60 * routines that control user, group, uid and gid caches (for the archive
61 * member print routine).
63 * these routines cache BOTH hits and misses, a major performance improvement
66 static int pwopn = 0; /* is password file open */
67 static int gropn = 0; /* is group file open */
68 static UIDC **uidtb = NULL; /* uid to name cache */
69 static GIDC **gidtb = NULL; /* gid to name cache */
70 static UIDC **usrtb = NULL; /* user name to uid cache */
71 static GIDC **grptb = NULL; /* group name to gid cache */
75 * creates an empty uidtb
77 * 0 if ok, -1 otherwise
89 if ((uidtb = (UIDC **)calloc(UID_SZ, sizeof(UIDC *))) == NULL) {
91 paxwarn(1, "Unable to allocate memory for user id cache table");
99 * creates an empty gidtb
101 * 0 if ok, -1 otherwise
113 if ((gidtb = (GIDC **)calloc(GID_SZ, sizeof(GIDC *))) == NULL) {
115 paxwarn(1, "Unable to allocate memory for group id cache table");
123 * creates an empty usrtb
125 * 0 if ok, -1 otherwise
137 if ((usrtb = (UIDC **)calloc(UNM_SZ, sizeof(UIDC *))) == NULL) {
139 paxwarn(1, "Unable to allocate memory for user name cache table");
147 * creates an empty grptb
149 * 0 if ok, -1 otherwise
161 if ((grptb = (GIDC **)calloc(GNM_SZ, sizeof(GIDC *))) == NULL) {
163 paxwarn(1,"Unable to allocate memory for group name cache table");
171 * caches the name (if any) for the uid. If frc set, we always return the
172 * the stored name (if valid or invalid match). We use a simple hash table.
174 * Pointer to stored name (or a empty string)
178 name_uid(uid_t uid, int frc)
183 if ((uidtb == NULL) && (uidtb_start() < 0))
187 * see if we have this uid cached
189 ptr = uidtb[uid % UID_SZ];
190 if ((ptr != NULL) && (ptr->valid > 0) && (ptr->uid == uid)) {
192 * have an entry for this uid
194 if (frc || (ptr->valid == VALID))
200 * No entry for this uid, we will add it
211 ptr = uidtb[uid % UID_SZ] = malloc(sizeof(UIDC));
213 if ((pw = getpwuid(uid)) == NULL) {
215 * no match for this uid in the local password file
216 * a string that is the uid in numeric format
221 ptr->valid = INVALID;
222 (void)snprintf(ptr->name, sizeof(ptr->name), "%lu",
228 * there is an entry for this uid in the password file
233 (void)strlcpy(ptr->name, pw->pw_name, sizeof(ptr->name));
241 * caches the name (if any) for the gid. If frc set, we always return the
242 * the stored name (if valid or invalid match). We use a simple hash table.
244 * Pointer to stored name (or a empty string)
248 name_gid(gid_t gid, int frc)
253 if ((gidtb == NULL) && (gidtb_start() < 0))
257 * see if we have this gid cached
259 ptr = gidtb[gid % GID_SZ];
260 if ((ptr != NULL) && (ptr->valid > 0) && (ptr->gid == gid)) {
262 * have an entry for this gid
264 if (frc || (ptr->valid == VALID))
270 * No entry for this gid, we will add it
281 ptr = gidtb[gid % GID_SZ] = malloc(sizeof(GIDC));
283 if ((gr = getgrgid(gid)) == NULL) {
285 * no match for this gid in the local group file, put in
286 * a string that is the gid in numberic format
291 ptr->valid = INVALID;
292 (void)snprintf(ptr->name, sizeof(ptr->name), "%lu",
298 * there is an entry for this group in the group file
303 (void)strlcpy(ptr->name, gr->gr_name, sizeof(ptr->name));
311 * caches the uid for a given user name. We use a simple hash table.
313 * the uid (if any) for a user name, or a -1 if no match can be found
317 uid_name(char *name, uid_t *uid)
324 * return -1 for mangled names
326 if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
328 if ((usrtb == NULL) && (usrtb_start() < 0))
332 * look up in hash table, if found and valid return the uid,
333 * if found and invalid, return a -1
335 ptr = usrtb[st_hash(name, namelen, UNM_SZ)];
336 if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
337 if (ptr->valid == INVALID)
353 ptr = usrtb[st_hash(name, namelen, UNM_SZ)] =
354 (UIDC *)malloc(sizeof(UIDC));
357 * no match, look it up, if no match store it as an invalid entry,
358 * or store the matching uid
361 if ((pw = getpwnam(name)) == NULL)
366 (void)strlcpy(ptr->name, name, sizeof(ptr->name));
367 if ((pw = getpwnam(name)) == NULL) {
368 ptr->valid = INVALID;
372 *uid = ptr->uid = pw->pw_uid;
378 * caches the gid for a given group name. We use a simple hash table.
380 * the gid (if any) for a group name, or a -1 if no match can be found
384 gid_name(char *name, gid_t *gid)
391 * return -1 for mangled names
393 if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
395 if ((grptb == NULL) && (grptb_start() < 0))
399 * look up in hash table, if found and valid return the uid,
400 * if found and invalid, return a -1
402 ptr = grptb[st_hash(name, namelen, GID_SZ)];
403 if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
404 if (ptr->valid == INVALID)
419 ptr = grptb[st_hash(name, namelen, GID_SZ)] =
420 (GIDC *)malloc(sizeof(GIDC));
423 * no match, look it up, if no match store it as an invalid entry,
424 * or store the matching gid
427 if ((gr = getgrnam(name)) == NULL)
433 (void)strlcpy(ptr->name, name, sizeof(ptr->name));
434 if ((gr = getgrnam(name)) == NULL) {
435 ptr->valid = INVALID;
439 *gid = ptr->gid = gr->gr_gid;