Import the version from pax(1), with a few changes:
* Functions renamed to match libc interface. * Fixed to actually put entries into the hash tables! * Different hash function, simpler but with the same distribution.
This commit is contained in:
mycroft
parent
f9927bf246
commit
76428db157
@ -1,9 +1,13 @@
|
|||||||
/* $NetBSD: pwcache.c,v 1.9 1998/02/03 18:23:51 perry Exp $ */
|
/* $NetBSD: pwcache.c,v 1.10 1998/07/28 16:58:36 mycroft Exp $ */
|
||||||
|
|
||||||
/*
|
/*-
|
||||||
* Copyright (c) 1989, 1993
|
* Copyright (c) 1992 Keith Muller.
|
||||||
|
* Copyright (c) 1992, 1993
|
||||||
* The Regents of the University of California. All rights reserved.
|
* The Regents of the University of California. All rights reserved.
|
||||||
*
|
*
|
||||||
|
* This code is derived from software contributed to Berkeley by
|
||||||
|
* Keith Muller of the University of California, San Diego.
|
||||||
|
*
|
||||||
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
||||||
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
||||||
* are met:
|
* are met:
|
||||||
@ -34,94 +38,486 @@
|
|||||||
*/
|
*/
|
||||||
|
|
||||||
#include <sys/cdefs.h>
|
#include <sys/cdefs.h>
|
||||||
#if defined(LIBC_SCCS) && !defined(lint)
|
#ifndef lint
|
||||||
#if 0
|
#if 0
|
||||||
static char sccsid[] = "@(#)pwcache.c 8.1 (Berkeley) 6/4/93";
|
static char sccsid[] = "@(#)cache.c 8.1 (Berkeley) 5/31/93";
|
||||||
#else
|
#else
|
||||||
__RCSID("$NetBSD: pwcache.c,v 1.9 1998/02/03 18:23:51 perry Exp $");
|
__RCSID("$NetBSD: pwcache.c,v 1.10 1998/07/28 16:58:36 mycroft Exp $");
|
||||||
#endif
|
#endif
|
||||||
#endif /* LIBC_SCCS and not lint */
|
#endif /* not lint */
|
||||||
|
|
||||||
#include "namespace.h"
|
#include "namespace.h"
|
||||||
|
|
||||||
#include <sys/types.h>
|
#include <sys/types.h>
|
||||||
#include <sys/param.h>
|
#include <sys/param.h>
|
||||||
|
|
||||||
#include <grp.h>
|
#include <grp.h>
|
||||||
#include <pwd.h>
|
#include <pwd.h>
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <utmp.h>
|
#include <unistd.h>
|
||||||
|
|
||||||
|
#include "pwcache.h"
|
||||||
|
|
||||||
#ifdef __weak_alias
|
#ifdef __weak_alias
|
||||||
__weak_alias(user_from_uid,_user_from_uid);
|
__weak_alias(user_from_uid,_user_from_uid);
|
||||||
__weak_alias(group_from_gid,_group_from_gid);
|
__weak_alias(group_from_gid,_group_from_gid);
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#define NCACHE 64 /* power of 2 */
|
/*
|
||||||
#define MASK (NCACHE - 1) /* bits to store with */
|
* routines that control user, group, uid and gid caches (for the archive
|
||||||
|
* member print routine).
|
||||||
|
* IMPORTANT:
|
||||||
|
* these routines cache BOTH hits and misses, a major performance improvement
|
||||||
|
*/
|
||||||
|
|
||||||
char *
|
static int pwopn = 0; /* is password file open */
|
||||||
user_from_uid(uid, nouser)
|
static int gropn = 0; /* is group file open */
|
||||||
|
static UIDC **uidtb = NULL; /* uid to name cache */
|
||||||
|
static GIDC **gidtb = NULL; /* gid to name cache */
|
||||||
|
static UIDC **usrtb = NULL; /* user name to uid cache */
|
||||||
|
static GIDC **grptb = NULL; /* group name to gid cache */
|
||||||
|
|
||||||
|
static u_int st_hash __P((const char *, size_t, int));
|
||||||
|
static int uidtb_start __P((void));
|
||||||
|
static int gidtb_start __P((void));
|
||||||
|
static int usrtb_start __P((void));
|
||||||
|
static int grptb_start __P((void));
|
||||||
|
|
||||||
|
static u_int
|
||||||
|
st_hash(name, len, tabsz)
|
||||||
|
const char *name;
|
||||||
|
size_t len;
|
||||||
|
int tabsz;
|
||||||
|
{
|
||||||
|
u_int key = 0;
|
||||||
|
|
||||||
|
while (len--) {
|
||||||
|
key += *name++;
|
||||||
|
key = (key << 8) | (key >> 24);
|
||||||
|
}
|
||||||
|
|
||||||
|
return (key % tabsz);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* uidtb_start
|
||||||
|
* creates an an empty uidtb
|
||||||
|
* Return:
|
||||||
|
* 0 if ok, -1 otherwise
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if __STDC__
|
||||||
|
static int
|
||||||
|
uidtb_start(void)
|
||||||
|
#else
|
||||||
|
static int
|
||||||
|
uidtb_start()
|
||||||
|
#endif
|
||||||
|
{
|
||||||
|
static int fail = 0;
|
||||||
|
|
||||||
|
if (uidtb != NULL)
|
||||||
|
return (0);
|
||||||
|
if (fail)
|
||||||
|
return (-1);
|
||||||
|
if ((uidtb = (UIDC **)calloc(UID_SZ, sizeof(UIDC *))) == NULL) {
|
||||||
|
++fail;
|
||||||
|
return (-1);
|
||||||
|
}
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* gidtb_start
|
||||||
|
* creates an an empty gidtb
|
||||||
|
* Return:
|
||||||
|
* 0 if ok, -1 otherwise
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if __STDC__
|
||||||
|
int
|
||||||
|
gidtb_start(void)
|
||||||
|
#else
|
||||||
|
int
|
||||||
|
gidtb_start()
|
||||||
|
#endif
|
||||||
|
{
|
||||||
|
static int fail = 0;
|
||||||
|
|
||||||
|
if (gidtb != NULL)
|
||||||
|
return (0);
|
||||||
|
if (fail)
|
||||||
|
return (-1);
|
||||||
|
if ((gidtb = (GIDC **)calloc(GID_SZ, sizeof(GIDC *))) == NULL) {
|
||||||
|
++fail;
|
||||||
|
return (-1);
|
||||||
|
}
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* usrtb_start
|
||||||
|
* creates an an empty usrtb
|
||||||
|
* Return:
|
||||||
|
* 0 if ok, -1 otherwise
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if __STDC__
|
||||||
|
int
|
||||||
|
usrtb_start(void)
|
||||||
|
#else
|
||||||
|
int
|
||||||
|
usrtb_start()
|
||||||
|
#endif
|
||||||
|
{
|
||||||
|
static int fail = 0;
|
||||||
|
|
||||||
|
if (usrtb != NULL)
|
||||||
|
return (0);
|
||||||
|
if (fail)
|
||||||
|
return (-1);
|
||||||
|
if ((usrtb = (UIDC **)calloc(UNM_SZ, sizeof(UIDC *))) == NULL) {
|
||||||
|
++fail;
|
||||||
|
return (-1);
|
||||||
|
}
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* grptb_start
|
||||||
|
* creates an an empty grptb
|
||||||
|
* Return:
|
||||||
|
* 0 if ok, -1 otherwise
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if __STDC__
|
||||||
|
int
|
||||||
|
grptb_start(void)
|
||||||
|
#else
|
||||||
|
int
|
||||||
|
grptb_start()
|
||||||
|
#endif
|
||||||
|
{
|
||||||
|
static int fail = 0;
|
||||||
|
|
||||||
|
if (grptb != NULL)
|
||||||
|
return (0);
|
||||||
|
if (fail)
|
||||||
|
return (-1);
|
||||||
|
if ((grptb = (GIDC **)calloc(GNM_SZ, sizeof(GIDC *))) == NULL) {
|
||||||
|
++fail;
|
||||||
|
return (-1);
|
||||||
|
}
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* name_uid()
|
||||||
|
* caches the name (if any) for the uid. If noname clear, we always return the
|
||||||
|
* the stored name (if valid or invalid match). We use a simple hash table.
|
||||||
|
* Return
|
||||||
|
* Pointer to stored name (or a empty string)
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if __STDC__
|
||||||
|
const char *
|
||||||
|
user_from_uid(uid_t uid, int noname)
|
||||||
|
#else
|
||||||
|
const char *
|
||||||
|
user_from_uid(uid, noname)
|
||||||
uid_t uid;
|
uid_t uid;
|
||||||
int nouser;
|
int noname;
|
||||||
|
#endif
|
||||||
{
|
{
|
||||||
static struct ncache {
|
|
||||||
uid_t uid;
|
|
||||||
char name[MAXLOGNAME + 1];
|
|
||||||
} c_uid[NCACHE];
|
|
||||||
static int pwopen;
|
|
||||||
static char nbuf[15]; /* 32 bits == 10 digits */
|
|
||||||
struct passwd *pw;
|
struct passwd *pw;
|
||||||
struct ncache *cp;
|
UIDC *ptr, **pptr;
|
||||||
|
|
||||||
cp = c_uid + (uid & MASK);
|
if ((uidtb == NULL) && (uidtb_start() < 0))
|
||||||
if (cp->uid != uid || !*cp->name) {
|
return (NULL);
|
||||||
if (pwopen == 0) {
|
|
||||||
setpassent(1);
|
/*
|
||||||
pwopen = 1;
|
* see if we have this uid cached
|
||||||
}
|
*/
|
||||||
if ((pw = getpwuid(uid)) == NULL) {
|
pptr = uidtb + (uid % UID_SZ);
|
||||||
if (nouser)
|
ptr = *pptr;
|
||||||
return (NULL);
|
|
||||||
(void)snprintf(nbuf, sizeof(nbuf), "%u", uid);
|
if ((ptr != NULL) && (ptr->valid > 0) && (ptr->uid == uid)) {
|
||||||
return (nbuf);
|
/*
|
||||||
}
|
* have an entry for this uid
|
||||||
cp->uid = uid;
|
*/
|
||||||
(void)strncpy(cp->name, pw->pw_name, MAXLOGNAME);
|
if (!noname || (ptr->valid == VALID))
|
||||||
cp->name[MAXLOGNAME] = '\0';
|
return (ptr->name);
|
||||||
|
return (NULL);
|
||||||
}
|
}
|
||||||
return (cp->name);
|
|
||||||
|
/*
|
||||||
|
* No entry for this uid, we will add it
|
||||||
|
*/
|
||||||
|
if (!pwopn) {
|
||||||
|
setpassent(1);
|
||||||
|
++pwopn;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (ptr == NULL)
|
||||||
|
ptr = (UIDC *)malloc(sizeof(UIDC));
|
||||||
|
*pptr = ptr;
|
||||||
|
|
||||||
|
if ((pw = getpwuid(uid)) == NULL) {
|
||||||
|
/*
|
||||||
|
* no match for this uid in the local password file
|
||||||
|
* a string that is the uid in numberic format
|
||||||
|
*/
|
||||||
|
if (ptr == NULL)
|
||||||
|
return (NULL);
|
||||||
|
ptr->uid = uid;
|
||||||
|
# ifdef NET2_STAT
|
||||||
|
(void)snprintf(ptr->name, UNMLEN, "%u", uid);
|
||||||
|
# else
|
||||||
|
(void)snprintf(ptr->name, UNMLEN, "%lu", (long) uid);
|
||||||
|
# endif
|
||||||
|
ptr->valid = INVALID;
|
||||||
|
if (noname)
|
||||||
|
return (NULL);
|
||||||
|
} else {
|
||||||
|
/*
|
||||||
|
* there is an entry for this uid in the password file
|
||||||
|
*/
|
||||||
|
if (ptr == NULL)
|
||||||
|
return (pw->pw_name);
|
||||||
|
ptr->uid = uid;
|
||||||
|
(void)strncpy(ptr->name, pw->pw_name, UNMLEN);
|
||||||
|
ptr->name[UNMLEN-1] = '\0';
|
||||||
|
ptr->valid = VALID;
|
||||||
|
}
|
||||||
|
return (ptr->name);
|
||||||
}
|
}
|
||||||
|
|
||||||
char *
|
/*
|
||||||
group_from_gid(gid, nogroup)
|
* group_from_gid()
|
||||||
|
* caches the name (if any) for the gid. If noname clear, we always return the
|
||||||
|
* the stored name (if valid or invalid match). We use a simple hash table.
|
||||||
|
* Return
|
||||||
|
* Pointer to stored name (or a empty string)
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if __STDC__
|
||||||
|
const char *
|
||||||
|
group_from_gid(gid_t gid, int noname)
|
||||||
|
#else
|
||||||
|
const char *
|
||||||
|
group_from_gid(gid, noname)
|
||||||
gid_t gid;
|
gid_t gid;
|
||||||
int nogroup;
|
int noname;
|
||||||
|
#endif
|
||||||
{
|
{
|
||||||
static struct ncache {
|
|
||||||
gid_t gid;
|
|
||||||
char name[MAXLOGNAME + 1];
|
|
||||||
} c_gid[NCACHE];
|
|
||||||
static int gropen;
|
|
||||||
static char nbuf[15]; /* 32 bits == 10 digits */
|
|
||||||
struct group *gr;
|
struct group *gr;
|
||||||
struct ncache *cp;
|
GIDC *ptr, **pptr;
|
||||||
|
|
||||||
cp = c_gid + (gid & MASK);
|
if ((gidtb == NULL) && (gidtb_start() < 0))
|
||||||
if (cp->gid != gid || !*cp->name) {
|
return (NULL);
|
||||||
if (gropen == 0) {
|
|
||||||
setgroupent(1);
|
/*
|
||||||
gropen = 1;
|
* see if we have this gid cached
|
||||||
}
|
*/
|
||||||
if ((gr = getgrgid(gid)) == NULL) {
|
pptr = gidtb + (gid % GID_SZ);
|
||||||
if (nogroup)
|
ptr = *pptr;
|
||||||
return (NULL);
|
|
||||||
(void)snprintf(nbuf, sizeof(nbuf), "%u", gid);
|
if ((ptr != NULL) && (ptr->valid > 0) && (ptr->gid == gid)) {
|
||||||
return (nbuf);
|
/*
|
||||||
}
|
* have an entry for this gid
|
||||||
cp->gid = gid;
|
*/
|
||||||
(void)strncpy(cp->name, gr->gr_name, MAXLOGNAME);
|
if (!noname || (ptr->valid == VALID))
|
||||||
cp->name[MAXLOGNAME] = '\0';
|
return (ptr->name);
|
||||||
|
return (NULL);
|
||||||
}
|
}
|
||||||
return (cp->name);
|
|
||||||
|
/*
|
||||||
|
* No entry for this gid, we will add it
|
||||||
|
*/
|
||||||
|
if (!gropn) {
|
||||||
|
setgroupent(1);
|
||||||
|
++gropn;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (ptr == NULL)
|
||||||
|
ptr = (GIDC *)malloc(sizeof(GIDC));
|
||||||
|
*pptr = ptr;
|
||||||
|
|
||||||
|
if ((gr = getgrgid(gid)) == NULL) {
|
||||||
|
/*
|
||||||
|
* no match for this gid in the local group file, put in
|
||||||
|
* a string that is the gid in numberic format
|
||||||
|
*/
|
||||||
|
if (ptr == NULL)
|
||||||
|
return (NULL);
|
||||||
|
ptr->gid = gid;
|
||||||
|
# ifdef NET2_STAT
|
||||||
|
(void)snprintf(ptr->name, GNMLEN, "%u", gid);
|
||||||
|
# else
|
||||||
|
(void)snprintf(ptr->name, GNMLEN, "%lu", (long) gid);
|
||||||
|
# endif
|
||||||
|
ptr->valid = INVALID;
|
||||||
|
if (noname)
|
||||||
|
return (NULL);
|
||||||
|
} else {
|
||||||
|
/*
|
||||||
|
* there is an entry for this group in the group file
|
||||||
|
*/
|
||||||
|
if (ptr == NULL)
|
||||||
|
return (gr->gr_name);
|
||||||
|
ptr->gid = gid;
|
||||||
|
(void)strncpy(ptr->name, gr->gr_name, GNMLEN);
|
||||||
|
ptr->name[GNMLEN-1] = '\0';
|
||||||
|
ptr->valid = VALID;
|
||||||
|
}
|
||||||
|
return (ptr->name);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* uid_from_user()
|
||||||
|
* caches the uid for a given user name. We use a simple hash table.
|
||||||
|
* Return
|
||||||
|
* the uid (if any) for a user name, or a -1 if no match can be found
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if __STDC__
|
||||||
|
int
|
||||||
|
uid_from_user(const char *name, uid_t *uid)
|
||||||
|
#else
|
||||||
|
int
|
||||||
|
uid_from_user(name, uid)
|
||||||
|
const char *name;
|
||||||
|
uid_t *uid;
|
||||||
|
#endif
|
||||||
|
{
|
||||||
|
struct passwd *pw;
|
||||||
|
UIDC *ptr, **pptr;
|
||||||
|
size_t namelen;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* return -1 for mangled names
|
||||||
|
*/
|
||||||
|
if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
|
||||||
|
return (-1);
|
||||||
|
if ((usrtb == NULL) && (usrtb_start() < 0))
|
||||||
|
return (-1);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* look up in hash table, if found and valid return the uid,
|
||||||
|
* if found and invalid, return a -1
|
||||||
|
*/
|
||||||
|
pptr = usrtb + st_hash(name, namelen, UNM_SZ);
|
||||||
|
ptr = *pptr;
|
||||||
|
|
||||||
|
if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
|
||||||
|
if (ptr->valid == INVALID)
|
||||||
|
return (-1);
|
||||||
|
*uid = ptr->uid;
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!pwopn) {
|
||||||
|
setpassent(1);
|
||||||
|
++pwopn;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (ptr == NULL)
|
||||||
|
ptr = (UIDC *)malloc(sizeof(UIDC));
|
||||||
|
*pptr = ptr;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* no match, look it up, if no match store it as an invalid entry,
|
||||||
|
* or store the matching uid
|
||||||
|
*/
|
||||||
|
if (ptr == NULL) {
|
||||||
|
if ((pw = getpwnam(name)) == NULL)
|
||||||
|
return (-1);
|
||||||
|
*uid = pw->pw_uid;
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
(void)strncpy(ptr->name, name, UNMLEN);
|
||||||
|
ptr->name[UNMLEN-1] = '\0';
|
||||||
|
if ((pw = getpwnam(name)) == NULL) {
|
||||||
|
ptr->valid = INVALID;
|
||||||
|
return (-1);
|
||||||
|
}
|
||||||
|
ptr->valid = VALID;
|
||||||
|
*uid = ptr->uid = pw->pw_uid;
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* gid_from_group()
|
||||||
|
* caches the gid for a given group name. We use a simple hash table.
|
||||||
|
* Return
|
||||||
|
* the gid (if any) for a group name, or a -1 if no match can be found
|
||||||
|
*/
|
||||||
|
|
||||||
|
#if __STDC__
|
||||||
|
int
|
||||||
|
gid_from_group(const char *name, gid_t *gid)
|
||||||
|
#else
|
||||||
|
int
|
||||||
|
gid_from_group(name, gid)
|
||||||
|
const char *name;
|
||||||
|
gid_t *gid;
|
||||||
|
#endif
|
||||||
|
{
|
||||||
|
struct group *gr;
|
||||||
|
GIDC *ptr, **pptr;
|
||||||
|
size_t namelen;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* return -1 for mangled names
|
||||||
|
*/
|
||||||
|
if (((namelen = strlen(name)) == 0) || (name[0] == '\0'))
|
||||||
|
return (-1);
|
||||||
|
if ((grptb == NULL) && (grptb_start() < 0))
|
||||||
|
return (-1);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* look up in hash table, if found and valid return the uid,
|
||||||
|
* if found and invalid, return a -1
|
||||||
|
*/
|
||||||
|
pptr = grptb + st_hash(name, namelen, GID_SZ);
|
||||||
|
ptr = *pptr;
|
||||||
|
|
||||||
|
if ((ptr != NULL) && (ptr->valid > 0) && !strcmp(name, ptr->name)) {
|
||||||
|
if (ptr->valid == INVALID)
|
||||||
|
return (-1);
|
||||||
|
*gid = ptr->gid;
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!gropn) {
|
||||||
|
setgroupent(1);
|
||||||
|
++gropn;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (ptr == NULL)
|
||||||
|
ptr = (GIDC *)malloc(sizeof(GIDC));
|
||||||
|
*pptr = ptr;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* no match, look it up, if no match store it as an invalid entry,
|
||||||
|
* or store the matching gid
|
||||||
|
*/
|
||||||
|
if (ptr == NULL) {
|
||||||
|
if ((gr = getgrnam(name)) == NULL)
|
||||||
|
return (-1);
|
||||||
|
*gid = gr->gr_gid;
|
||||||
|
return (0);
|
||||||
|
}
|
||||||
|
|
||||||
|
(void)strncpy(ptr->name, name, GNMLEN);
|
||||||
|
ptr->name[GNMLEN-1] = '\0';
|
||||||
|
if ((gr = getgrnam(name)) == NULL) {
|
||||||
|
ptr->valid = INVALID;
|
||||||
|
return (-1);
|
||||||
|
}
|
||||||
|
ptr->valid = VALID;
|
||||||
|
*gid = ptr->gid = gr->gr_gid;
|
||||||
|
return (0);
|
||||||
}
|
}
|
||||||
|
|||||||
76
lib/libc/gen/pwcache.h
Normal file
76
lib/libc/gen/pwcache.h
Normal file
@ -0,0 +1,76 @@
|
|||||||
|
/* $NetBSD: pwcache.h,v 1.1 1998/07/28 16:58:37 mycroft Exp $ */
|
||||||
|
|
||||||
|
/*-
|
||||||
|
* Copyright (c) 1992 Keith Muller.
|
||||||
|
* Copyright (c) 1992, 1993
|
||||||
|
* The Regents of the University of California. All rights reserved.
|
||||||
|
*
|
||||||
|
* This code is derived from software contributed to Berkeley by
|
||||||
|
* Keith Muller of the University of California, San Diego.
|
||||||
|
*
|
||||||
|
* Redistribution and use in source and binary forms, with or without
|
||||||
|
* modification, are permitted provided that the following conditions
|
||||||
|
* are met:
|
||||||
|
* 1. Redistributions of source code must retain the above copyright
|
||||||
|
* notice, this list of conditions and the following disclaimer.
|
||||||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||||||
|
* notice, this list of conditions and the following disclaimer in the
|
||||||
|
* documentation and/or other materials provided with the distribution.
|
||||||
|
* 3. All advertising materials mentioning features or use of this software
|
||||||
|
* must display the following acknowledgement:
|
||||||
|
* This product includes software developed by the University of
|
||||||
|
* California, Berkeley and its contributors.
|
||||||
|
* 4. Neither the name of the University nor the names of its contributors
|
||||||
|
* may be used to endorse or promote products derived from this software
|
||||||
|
* without specific prior written permission.
|
||||||
|
*
|
||||||
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
||||||
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||||
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||||
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
||||||
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||||
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||||
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||||
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||||
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||||
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||||
|
* SUCH DAMAGE.
|
||||||
|
*
|
||||||
|
* @(#)cache.h 8.1 (Berkeley) 5/31/93
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Constants and data structures used to implement group and password file
|
||||||
|
* caches. Traditional passwd/group cache routines perform quite poorly with
|
||||||
|
* archives. The chances of hitting a valid lookup with an archive is quite a
|
||||||
|
* bit worse than with files already resident on the file system. These misses
|
||||||
|
* create a MAJOR performance cost. To adress this problem, these routines
|
||||||
|
* cache both hits and misses.
|
||||||
|
*
|
||||||
|
* NOTE: name lengths must be as large as those stored in ANY PROTOCOL and
|
||||||
|
* as stored in the passwd and group files. CACHE SIZES MUST BE PRIME
|
||||||
|
*/
|
||||||
|
#define UNMLEN 32 /* >= user name found in any protocol */
|
||||||
|
#define GNMLEN 32 /* >= group name found in any protocol */
|
||||||
|
#define UID_SZ 317 /* size of user_name/uid cache */
|
||||||
|
#define UNM_SZ 317 /* size of user_name/uid cache */
|
||||||
|
#define GID_SZ 251 /* size of group_name/gid cache */
|
||||||
|
#define GNM_SZ 251 /* size of group_name/gid cache */
|
||||||
|
#define VALID 1 /* entry and name are valid */
|
||||||
|
#define INVALID 2 /* entry valid, name NOT valid */
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Node structures used in the user, group, uid, and gid caches.
|
||||||
|
*/
|
||||||
|
|
||||||
|
typedef struct uidc {
|
||||||
|
int valid; /* is this a valid or a miss entry */
|
||||||
|
char name[UNMLEN]; /* uid name */
|
||||||
|
uid_t uid; /* cached uid */
|
||||||
|
} UIDC;
|
||||||
|
|
||||||
|
typedef struct gidc {
|
||||||
|
int valid; /* is this a valid or a miss entry */
|
||||||
|
char name[GNMLEN]; /* gid name */
|
||||||
|
gid_t gid; /* cached gid */
|
||||||
|
} GIDC;
|
||||||
Loading…
x
Reference in New Issue
Block a user