1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
/* group-member.c -- determine whether group id is in calling user's group list
Copyright (C) 1994 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
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
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. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdio.h>
#include <sys/types.h>
#ifdef STDC_HEADERS
# include <stdlib.h>
#endif
#ifdef HAVE_UNISTD_H
# include <unistd.h>
#endif
#include "group-member.h"
char *xmalloc ();
char *xrealloc ();
struct group_info
{
int n_groups;
GETGROUPS_T *group;
};
#ifdef HAVE_GETGROUPS
static void
free_group_info (g)
struct group_info *g;
{
free (g->group);
free (g);
}
static struct group_info *
get_group_info ()
{
int n_groups;
int n_group_slots;
struct group_info *gi;
GETGROUPS_T *group;
/* getgroups () returns the number of elements that it was able to
place into the array. We simply continue to call getgroups ()
until the number of elements placed into the array is smaller than
the physical size of the array. */
group = NULL;
n_groups = 0;
n_group_slots = 0;
while (n_groups == n_group_slots)
{
n_group_slots += 64;
group = (GETGROUPS_T *) xrealloc (group,
n_group_slots * sizeof (GETGROUPS_T));
n_groups = getgroups (n_group_slots, group);
}
/* In case of error, the user loses. */
if (n_groups < 0)
{
free (group);
return NULL;
}
gi = (struct group_info *) xmalloc (sizeof (*gi));
gi->n_groups = n_groups;
gi->group = group;
return gi;
}
#endif /* not HAVE_GETGROUPS */
/* Return non-zero if GID is one that we have in our groups list.
If there is no getgroups function, return non-zero if GID matches
either of the current or effective group IDs. */
int
group_member (gid)
gid_t gid;
{
#ifndef HAVE_GETGROUPS
return ((gid == getgid ()) || (gid == getegid ()));
#else
int i;
int found;
struct group_info *gi;
gi = get_group_info ();
if (gi == NULL)
return 0;
/* Search through the list looking for GID. */
found = 0;
for (i = 0; i < gi->n_groups; i++)
{
if (gid == gi->group[i])
{
found = 1;
break;
}
}
free_group_info (gi);
return found;
#endif /* HAVE_GETGROUPS */
}
#ifdef TEST
char *program_name;
int
main (int argc, char** argv)
{
int i;
program_name = argv[0];
for (i=1; i<argc; i++)
{
gid_t gid;
gid = atoi (argv[i]);
printf ("%d: %s\n", gid, group_member (gid) ? "yes" : "no");
}
exit (0);
}
#endif /* TEST */
|
