/* idcache.c -- map user and group IDs, cached for speed
- Copyright (C) 1985, 1988, 1989, 1990, 1997 Free Software Foundation, Inc.
+
+ Copyright (C) 1985, 1988, 1989, 1990, 1997, 1998, 2003, 2005 Free
+ Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
+ Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
#if HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdio.h>
+#include <string.h>
#include <sys/types.h>
#include <pwd.h>
#include <grp.h>
-#if defined(STDC_HEADERS) || defined(HAVE_STRING_H)
-# include <string.h>
-#else
-# include <strings.h>
-#endif
-
#if HAVE_UNISTD_H
# include <unistd.h>
#endif
-#ifndef _POSIX_VERSION
-struct passwd *getpwuid ();
-struct passwd *getpwnam ();
-struct group *getgrgid ();
-struct group *getgrnam ();
-#endif
+#include "xalloc.h"
-char *xmalloc ();
-char *xstrdup ();
+#ifdef __DJGPP__
+static char digits[] = "0123456789";
+#endif
struct userid
{
static struct userid *user_alist;
-#ifdef NOT_USED
/* The members of this list have names not in the local passwd file. */
static struct userid *nouser_alist;
-#endif /* NOT_USED */
-/* Translate UID to a login name, with cache.
- If UID cannot be resolved, return NULL.
- Cache lookup failures, too. */
+/* Translate UID to a login name, with cache, or NULL if unresolved. */
char *
-getuser (uid)
- uid_t uid;
+getuser (uid_t uid)
{
register struct userid *tail;
struct passwd *pwent;
return tail->name;
pwent = getpwuid (uid);
- tail = (struct userid *) xmalloc (sizeof (struct userid));
+ tail = xmalloc (sizeof (struct userid));
tail->id.u = uid;
- tail->name = (pwent ? xstrdup (pwent->pw_name) : NULL);
+ tail->name = pwent ? xstrdup (pwent->pw_name) : NULL;
/* Add to the head of the list, so most recently used is first. */
tail->next = user_alist;
return tail->name;
}
-#ifdef NOT_USED
-
/* Translate USER to a UID, with cache.
Return NULL if there is no such user.
(We also cache which user names have no passwd entry,
so we don't keep looking them up.) */
uid_t *
-getuidbyname (user)
- const char *user;
+getuidbyname (const char *user)
{
register struct userid *tail;
struct passwd *pwent;
return 0;
pwent = getpwnam (user);
+#ifdef __DJGPP__
+ /* We need to pretend to be the user USER, to make
+ pwd functions know about an arbitrary user name. */
+ if (!pwent && strspn (user, digits) < strlen (user))
+ {
+ setenv ("USER", user, 1);
+ pwent = getpwnam (user); /* now it will succeed */
+ }
+#endif
- tail = (struct userid *) xmalloc (sizeof (struct userid));
+ tail = xmalloc (sizeof (struct userid));
tail->name = xstrdup (user);
/* Add to the head of the list, so most recently used is first. */
return 0;
}
-#endif /* NOT_USED */
-
/* Use the same struct as for userids. */
static struct userid *group_alist;
-#ifdef NOT_USED
static struct userid *nogroup_alist;
-#endif
-/* Translate GID to a group name or a stringified number,
- with cache. */
+/* Translate GID to a group name, with cache, or NULL if unresolved. */
char *
-getgroup (gid)
- gid_t gid;
+getgroup (gid_t gid)
{
register struct userid *tail;
struct group *grent;
return tail->name;
grent = getgrgid (gid);
- tail = (struct userid *) xmalloc (sizeof (struct userid));
+ tail = xmalloc (sizeof (struct userid));
tail->id.g = gid;
- tail->name = (grent ? xstrdup (grent->gr_name) : NULL);
+ tail->name = grent ? xstrdup (grent->gr_name) : NULL;
/* Add to the head of the list, so most recently used is first. */
tail->next = group_alist;
return tail->name;
}
-#ifdef NOT_USED
-
/* Translate GROUP to a GID, with cache.
Return NULL if there is no such group.
(We also cache which group names have no group entry,
so we don't keep looking them up.) */
gid_t *
-getgidbyname (group)
- const char *group;
+getgidbyname (const char *group)
{
register struct userid *tail;
struct group *grent;
return 0;
grent = getgrnam (group);
+#ifdef __DJGPP__
+ /* We need to pretend to belong to group GROUP, to make
+ grp functions know about any arbitrary group name. */
+ if (!grent && strspn (group, digits) < strlen (group))
+ {
+ setenv ("GROUP", group, 1);
+ grent = getgrnam (group); /* now it will succeed */
+ }
+#endif
- tail = (struct userid *) xmalloc (sizeof (struct userid));
+ tail = xmalloc (sizeof (struct userid));
tail->name = xstrdup (group);
/* Add to the head of the list, so most recently used is first. */
nogroup_alist = tail;
return 0;
}
-
-#endif /* NOT_USED */