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
37 * @(#)cache.c 8.1 (Berkeley) 5/31/93
38 * $FreeBSD: src/bin/pax/cache.c,v 1.12.2.1 2001/08/01 05:03:11 obrien Exp $
39 * $DragonFly: src/bin/pax/cache.c,v 1.2 2003/06/17 04:22:50 dillon Exp $
42 #include <sys/types.h>
55 * routines that control user, group, uid and gid caches (for the archive
56 * member print routine).
58 * these routines cache BOTH hits and misses, a major performance improvement
61 static int pwopn = 0; /* is password file open */
62 static int gropn = 0; /* is group file open */
63 static UIDC **uidtb = NULL; /* uid to name cache */
64 static GIDC **gidtb = NULL; /* gid to name cache */
65 static UIDC **usrtb = NULL; /* user name to uid cache */
66 static GIDC **grptb = NULL; /* group name to gid cache */
70 * creates an an empty uidtb
72 * 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 an empty gidtb
101 * 0 if ok, -1 otherwise
118 if ((gidtb = (GIDC **)calloc(GID_SZ, sizeof(GIDC *))) == NULL) {
120 paxwarn(1, "Unable to allocate memory for group id cache table");
128 * creates an an empty usrtb
130 * 0 if ok, -1 otherwise
147 if ((usrtb = (UIDC **)calloc(UNM_SZ, sizeof(UIDC *))) == NULL) {
149 paxwarn(1, "Unable to allocate memory for user name cache table");
157 * creates an an empty grptb
159 * 0 if ok, -1 otherwise
176 if ((grptb = (GIDC **)calloc(GNM_SZ, sizeof(GIDC *))) == NULL) {
178 paxwarn(1,"Unable to allocate memory for group name cache table");
186 * caches the name (if any) for the uid. If frc set, we always return the
187 * the stored name (if valid or invalid match). We use a simple hash table.
189 * Pointer to stored name (or a empty string)
194 name_uid(uid_t uid, int frc)
202 register struct passwd *pw;
205 if ((uidtb == NULL) && (uidtb_start() < 0))
209 * see if we have this uid cached
211 ptr = uidtb[uid % UID_SZ];
212 if ((ptr != NULL) && (ptr->valid > 0) && (ptr->uid == uid)) {
214 * have an entry for this uid
216 if (frc || (ptr->valid == VALID))
222 * No entry for this uid, we will add it
229 ptr = (UIDC *)malloc(sizeof(UIDC));
231 if ((pw = getpwuid(uid)) == NULL) {
233 * no match for this uid in the local password file
234 * a string that is the uid in numeric format
239 ptr->valid = INVALID;
241 (void)snprintf(ptr->name, sizeof(ptr->name), "%u", uid);
243 (void)snprintf(ptr->name, sizeof(ptr->name), "%lu",
250 * there is an entry for this uid in the password file
255 (void)strncpy(ptr->name, pw->pw_name, UNMLEN - 1);
256 ptr->name[UNMLEN-1] = '\0';
264 * caches the name (if any) for the gid. If frc set, we always return the
265 * the stored name (if valid or invalid match). We use a simple hash table.
267 * Pointer to stored name (or a empty string)
272 name_gid(gid_t gid, int frc)
280 register struct group *gr;
283 if ((gidtb == NULL) && (gidtb_start() < 0))
287 * see if we have this gid cached
289 ptr = gidtb[gid % GID_SZ];
290 if ((ptr != NULL) && (ptr->valid > 0) && (ptr->gid == gid)) {
292 * have an entry for this gid
294 if (frc || (ptr->valid == VALID))
300 * No entry for this gid, we will add it
307 ptr = (GIDC *)malloc(sizeof(GIDC));
309 if ((gr = getgrgid(gid)) == NULL) {
311 * no match for this gid in the local group file, put in
312 * a string that is the gid in numeric format
317 ptr->valid = INVALID;
319 (void)snprintf(ptr->name, sizeof(ptr->name), "%u", gid);
321 (void)snprintf(ptr->name, sizeof(ptr->name), "%lu",
328 * there is an entry for this group in the group file
333 (void)strncpy(ptr->name, gr->gr_name, GNMLEN - 1);
334 ptr->name[GNMLEN-1] = '\0';
342 * caches the uid for a given user name. We use a simple hash table.
344 * the uid (if any) for a user name, or a -1 if no match can be found
349 uid_name(char *name, uid_t *uid)
357 register struct passwd *pw;
359 register int namelen;
362 * return -1 for mangled names
364 if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
366 if ((usrtb == NULL) && (usrtb_start() < 0))
370 * look up in hash table, if found and valid return the uid,
371 * if found and invalid, return a -1
373 ptr = usrtb[st_hash(name, namelen, UNM_SZ)];
374 if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
375 if (ptr->valid == INVALID)
387 ptr = usrtb[st_hash(name, namelen, UNM_SZ)] =
388 (UIDC *)malloc(sizeof(UIDC));
391 * no match, look it up, if no match store it as an invalid entry,
392 * or store the matching uid
395 if ((pw = getpwnam(name)) == NULL)
400 (void)strncpy(ptr->name, name, UNMLEN - 1);
401 ptr->name[UNMLEN-1] = '\0';
402 if ((pw = getpwnam(name)) == NULL) {
403 ptr->valid = INVALID;
407 *uid = ptr->uid = pw->pw_uid;
413 * caches the gid for a given group name. We use a simple hash table.
415 * the gid (if any) for a group name, or a -1 if no match can be found
420 gid_name(char *name, gid_t *gid)
428 register struct group *gr;
430 register int namelen;
433 * return -1 for mangled names
435 if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
437 if ((grptb == NULL) && (grptb_start() < 0))
441 * look up in hash table, if found and valid return the uid,
442 * if found and invalid, return a -1
444 ptr = grptb[st_hash(name, namelen, GID_SZ)];
445 if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
446 if (ptr->valid == INVALID)
457 ptr = grptb[st_hash(name, namelen, GID_SZ)] =
458 (GIDC *)malloc(sizeof(GIDC));
461 * no match, look it up, if no match store it as an invalid entry,
462 * or store the matching gid
465 if ((gr = getgrnam(name)) == NULL)
471 (void)strncpy(ptr->name, name, GNMLEN - 1);
472 ptr->name[GNMLEN-1] = '\0';
473 if ((gr = getgrnam(name)) == NULL) {
474 ptr->valid = INVALID;
478 *gid = ptr->gid = gr->gr_gid;