2 * Copyright (c) 1992 Keith Muller.
3 * Copyright (c) 1992, 1993
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
7 * Keith Muller of the University of California, San Diego.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 static char sccsid[] = "@(#)cache.c 8.1 (Berkeley) 5/31/93";
42 static const char rcsid[] =
43 "$FreeBSD: src/bin/pax/cache.c,v 1.12.2.1 2001/08/01 05:03:11 obrien Exp $";
46 #include <sys/types.h>
59 * routines that control user, group, uid and gid caches (for the archive
60 * member print routine).
62 * these routines cache BOTH hits and misses, a major performance improvement
65 static int pwopn = 0; /* is password file open */
66 static int gropn = 0; /* is group file open */
67 static UIDC **uidtb = NULL; /* uid to name cache */
68 static GIDC **gidtb = NULL; /* gid to name cache */
69 static UIDC **usrtb = NULL; /* user name to uid cache */
70 static GIDC **grptb = NULL; /* group name to gid cache */
74 * creates an an empty uidtb
76 * 0 if ok, -1 otherwise
93 if ((uidtb = (UIDC **)calloc(UID_SZ, sizeof(UIDC *))) == NULL) {
95 paxwarn(1, "Unable to allocate memory for user id cache table");
103 * creates an an empty gidtb
105 * 0 if ok, -1 otherwise
122 if ((gidtb = (GIDC **)calloc(GID_SZ, sizeof(GIDC *))) == NULL) {
124 paxwarn(1, "Unable to allocate memory for group id cache table");
132 * creates an an empty usrtb
134 * 0 if ok, -1 otherwise
151 if ((usrtb = (UIDC **)calloc(UNM_SZ, sizeof(UIDC *))) == NULL) {
153 paxwarn(1, "Unable to allocate memory for user name cache table");
161 * creates an an empty grptb
163 * 0 if ok, -1 otherwise
180 if ((grptb = (GIDC **)calloc(GNM_SZ, sizeof(GIDC *))) == NULL) {
182 paxwarn(1,"Unable to allocate memory for group name cache table");
190 * caches the name (if any) for the uid. If frc set, we always return the
191 * the stored name (if valid or invalid match). We use a simple hash table.
193 * Pointer to stored name (or a empty string)
198 name_uid(uid_t uid, int frc)
206 register struct passwd *pw;
209 if ((uidtb == NULL) && (uidtb_start() < 0))
213 * see if we have this uid cached
215 ptr = uidtb[uid % UID_SZ];
216 if ((ptr != NULL) && (ptr->valid > 0) && (ptr->uid == uid)) {
218 * have an entry for this uid
220 if (frc || (ptr->valid == VALID))
226 * No entry for this uid, we will add it
233 ptr = (UIDC *)malloc(sizeof(UIDC));
235 if ((pw = getpwuid(uid)) == NULL) {
237 * no match for this uid in the local password file
238 * a string that is the uid in numeric format
243 ptr->valid = INVALID;
245 (void)snprintf(ptr->name, sizeof(ptr->name), "%u", uid);
247 (void)snprintf(ptr->name, sizeof(ptr->name), "%lu",
254 * there is an entry for this uid in the password file
259 (void)strncpy(ptr->name, pw->pw_name, UNMLEN - 1);
260 ptr->name[UNMLEN-1] = '\0';
268 * caches the name (if any) for the gid. If frc set, we always return the
269 * the stored name (if valid or invalid match). We use a simple hash table.
271 * Pointer to stored name (or a empty string)
276 name_gid(gid_t gid, int frc)
284 register struct group *gr;
287 if ((gidtb == NULL) && (gidtb_start() < 0))
291 * see if we have this gid cached
293 ptr = gidtb[gid % GID_SZ];
294 if ((ptr != NULL) && (ptr->valid > 0) && (ptr->gid == gid)) {
296 * have an entry for this gid
298 if (frc || (ptr->valid == VALID))
304 * No entry for this gid, we will add it
311 ptr = (GIDC *)malloc(sizeof(GIDC));
313 if ((gr = getgrgid(gid)) == NULL) {
315 * no match for this gid in the local group file, put in
316 * a string that is the gid in numeric format
321 ptr->valid = INVALID;
323 (void)snprintf(ptr->name, sizeof(ptr->name), "%u", gid);
325 (void)snprintf(ptr->name, sizeof(ptr->name), "%lu",
332 * there is an entry for this group in the group file
337 (void)strncpy(ptr->name, gr->gr_name, GNMLEN - 1);
338 ptr->name[GNMLEN-1] = '\0';
346 * caches the uid for a given user name. We use a simple hash table.
348 * the uid (if any) for a user name, or a -1 if no match can be found
353 uid_name(char *name, uid_t *uid)
361 register struct passwd *pw;
363 register int namelen;
366 * return -1 for mangled names
368 if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
370 if ((usrtb == NULL) && (usrtb_start() < 0))
374 * look up in hash table, if found and valid return the uid,
375 * if found and invalid, return a -1
377 ptr = usrtb[st_hash(name, namelen, UNM_SZ)];
378 if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
379 if (ptr->valid == INVALID)
391 ptr = usrtb[st_hash(name, namelen, UNM_SZ)] =
392 (UIDC *)malloc(sizeof(UIDC));
395 * no match, look it up, if no match store it as an invalid entry,
396 * or store the matching uid
399 if ((pw = getpwnam(name)) == NULL)
404 (void)strncpy(ptr->name, name, UNMLEN - 1);
405 ptr->name[UNMLEN-1] = '\0';
406 if ((pw = getpwnam(name)) == NULL) {
407 ptr->valid = INVALID;
411 *uid = ptr->uid = pw->pw_uid;
417 * caches the gid for a given group name. We use a simple hash table.
419 * the gid (if any) for a group name, or a -1 if no match can be found
424 gid_name(char *name, gid_t *gid)
432 register struct group *gr;
434 register int namelen;
437 * return -1 for mangled names
439 if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
441 if ((grptb == NULL) && (grptb_start() < 0))
445 * look up in hash table, if found and valid return the uid,
446 * if found and invalid, return a -1
448 ptr = grptb[st_hash(name, namelen, GID_SZ)];
449 if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
450 if (ptr->valid == INVALID)
461 ptr = grptb[st_hash(name, namelen, GID_SZ)] =
462 (GIDC *)malloc(sizeof(GIDC));
465 * no match, look it up, if no match store it as an invalid entry,
466 * or store the matching gid
469 if ((gr = getgrnam(name)) == NULL)
475 (void)strncpy(ptr->name, name, GNMLEN - 1);
476 ptr->name[GNMLEN-1] = '\0';
477 if ((gr = getgrnam(name)) == NULL) {
478 ptr->valid = INVALID;
482 *gid = ptr->gid = gr->gr_gid;