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 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static char sccsid[] = "@(#)cache.c 8.1 (Berkeley) 5/31/93";
39 #include <sys/cdefs.h>
40 __FBSDID("$FreeBSD$");
42 #include <sys/types.h>
54 * routines that control user, group, uid and gid caches (for the archive
55 * member print routine).
57 * these routines cache BOTH hits and misses, a major performance improvement
60 static int pwopn = 0; /* is password file open */
61 static int gropn = 0; /* is group file open */
62 static UIDC **uidtb = NULL; /* uid to name cache */
63 static GIDC **gidtb = NULL; /* gid to name cache */
64 static UIDC **usrtb = NULL; /* user name to uid cache */
65 static GIDC **grptb = NULL; /* group name to gid cache */
69 * creates an an empty uidtb
71 * 0 if ok, -1 otherwise
83 if ((uidtb = (UIDC **)calloc(UID_SZ, sizeof(UIDC *))) == NULL) {
85 paxwarn(1, "Unable to allocate memory for user id cache table");
93 * creates an an empty gidtb
95 * 0 if ok, -1 otherwise
107 if ((gidtb = (GIDC **)calloc(GID_SZ, sizeof(GIDC *))) == NULL) {
109 paxwarn(1, "Unable to allocate memory for group id cache table");
117 * creates an an empty usrtb
119 * 0 if ok, -1 otherwise
131 if ((usrtb = (UIDC **)calloc(UNM_SZ, sizeof(UIDC *))) == NULL) {
133 paxwarn(1, "Unable to allocate memory for user name cache table");
141 * creates an an empty grptb
143 * 0 if ok, -1 otherwise
155 if ((grptb = (GIDC **)calloc(GNM_SZ, sizeof(GIDC *))) == NULL) {
157 paxwarn(1,"Unable to allocate memory for group name cache table");
165 * caches the name (if any) for the uid. If frc set, we always return the
166 * the stored name (if valid or invalid match). We use a simple hash table.
168 * Pointer to stored name (or an empty string).
172 name_uid(uid_t uid, int frc)
177 if ((uidtb == NULL) && (uidtb_start() < 0))
181 * see if we have this uid cached
183 ptr = uidtb[uid % UID_SZ];
184 if ((ptr != NULL) && (ptr->valid > 0) && (ptr->uid == uid)) {
186 * have an entry for this uid
188 if (frc || (ptr->valid == VALID))
194 * No entry for this uid, we will add it
201 ptr = uidtb[uid % UID_SZ] = (UIDC *)malloc(sizeof(UIDC));
203 if ((pw = getpwuid(uid)) == NULL) {
205 * no match for this uid in the local password file
206 * a string that is the uid in numeric format
211 ptr->valid = INVALID;
213 (void)snprintf(ptr->name, sizeof(ptr->name), "%u", uid);
215 (void)snprintf(ptr->name, sizeof(ptr->name), "%lu",
222 * there is an entry for this uid in the password file
227 (void)strncpy(ptr->name, pw->pw_name, UNMLEN - 1);
228 ptr->name[UNMLEN-1] = '\0';
236 * caches the name (if any) for the gid. If frc set, we always return the
237 * the stored name (if valid or invalid match). We use a simple hash table.
239 * Pointer to stored name (or an empty string).
243 name_gid(gid_t gid, int frc)
248 if ((gidtb == NULL) && (gidtb_start() < 0))
252 * see if we have this gid cached
254 ptr = gidtb[gid % GID_SZ];
255 if ((ptr != NULL) && (ptr->valid > 0) && (ptr->gid == gid)) {
257 * have an entry for this gid
259 if (frc || (ptr->valid == VALID))
265 * No entry for this gid, we will add it
272 ptr = gidtb[gid % GID_SZ] = (GIDC *)malloc(sizeof(GIDC));
274 if ((gr = getgrgid(gid)) == NULL) {
276 * no match for this gid in the local group file, put in
277 * a string that is the gid in numeric format
282 ptr->valid = INVALID;
284 (void)snprintf(ptr->name, sizeof(ptr->name), "%u", gid);
286 (void)snprintf(ptr->name, sizeof(ptr->name), "%lu",
293 * there is an entry for this group in the group file
298 (void)strncpy(ptr->name, gr->gr_name, GNMLEN - 1);
299 ptr->name[GNMLEN-1] = '\0';
307 * caches the uid for a given user name. We use a simple hash table.
309 * the uid (if any) for a user name, or a -1 if no match can be found
313 uid_name(char *name, uid_t *uid)
320 * return -1 for mangled names
322 if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
324 if ((usrtb == NULL) && (usrtb_start() < 0))
328 * look up in hash table, if found and valid return the uid,
329 * if found and invalid, return a -1
331 ptr = usrtb[st_hash(name, namelen, UNM_SZ)];
332 if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
333 if (ptr->valid == INVALID)
345 ptr = usrtb[st_hash(name, namelen, UNM_SZ)] =
346 (UIDC *)malloc(sizeof(UIDC));
349 * no match, look it up, if no match store it as an invalid entry,
350 * or store the matching uid
353 if ((pw = getpwnam(name)) == NULL)
358 (void)strncpy(ptr->name, name, UNMLEN - 1);
359 ptr->name[UNMLEN-1] = '\0';
360 if ((pw = getpwnam(name)) == NULL) {
361 ptr->valid = INVALID;
365 *uid = ptr->uid = pw->pw_uid;
371 * caches the gid for a given group name. We use a simple hash table.
373 * the gid (if any) for a group name, or a -1 if no match can be found
377 gid_name(char *name, gid_t *gid)
384 * return -1 for mangled names
386 if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
388 if ((grptb == NULL) && (grptb_start() < 0))
392 * look up in hash table, if found and valid return the uid,
393 * if found and invalid, return a -1
395 ptr = grptb[st_hash(name, namelen, GID_SZ)];
396 if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
397 if (ptr->valid == INVALID)
408 ptr = grptb[st_hash(name, namelen, GID_SZ)] =
409 (GIDC *)malloc(sizeof(GIDC));
412 * no match, look it up, if no match store it as an invalid entry,
413 * or store the matching gid
416 if ((gr = getgrnam(name)) == NULL)
422 (void)strncpy(ptr->name, name, GNMLEN - 1);
423 ptr->name[GNMLEN-1] = '\0';
424 if ((gr = getgrnam(name)) == NULL) {
425 ptr->valid = INVALID;
429 *gid = ptr->gid = gr->gr_gid;