getgrouplist.c revision 1.17 1 1.17 agc /* $NetBSD: getgrouplist.c,v 1.17 2003/08/07 16:42:49 agc Exp $ */
2 1.4 cgd
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1991, 1993
5 1.1 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.17 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.6 christos #include <sys/cdefs.h>
33 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
34 1.4 cgd #if 0
35 1.8 perry static char sccsid[] = "@(#)getgrouplist.c 8.2 (Berkeley) 12/8/94";
36 1.4 cgd #else
37 1.17 agc __RCSID("$NetBSD: getgrouplist.c,v 1.17 2003/08/07 16:42:49 agc Exp $");
38 1.4 cgd #endif
39 1.1 cgd #endif /* LIBC_SCCS and not lint */
40 1.1 cgd
41 1.1 cgd /*
42 1.1 cgd * get credential
43 1.1 cgd */
44 1.7 jtc #include "namespace.h"
45 1.12 lukem #include <sys/param.h>
46 1.12 lukem
47 1.13 lukem #include <assert.h>
48 1.12 lukem #include <grp.h>
49 1.1 cgd #include <string.h>
50 1.6 christos #include <unistd.h>
51 1.7 jtc
52 1.7 jtc #ifdef __weak_alias
53 1.15 mycroft __weak_alias(getgrouplist,_getgrouplist)
54 1.7 jtc #endif
55 1.1 cgd
56 1.16 elric /*
57 1.16 elric * _getgrent_user() is a libc-private function defined in getgrent.c which
58 1.16 elric * use because certain name service types such as Hesiod lookup grouplists
59 1.16 elric * by username rather than just iterating over the list of groups.
60 1.16 elric */
61 1.16 elric struct group *_getgrent_user(const char *);
62 1.16 elric
63 1.1 cgd int
64 1.1 cgd getgrouplist(uname, agroup, groups, grpcnt)
65 1.1 cgd const char *uname;
66 1.6 christos gid_t agroup;
67 1.6 christos gid_t *groups;
68 1.1 cgd int *grpcnt;
69 1.1 cgd {
70 1.9 perry struct group *grp;
71 1.9 perry int i, ngroups;
72 1.1 cgd int ret, maxgroups;
73 1.13 lukem
74 1.13 lukem _DIAGASSERT(uname != NULL);
75 1.13 lukem _DIAGASSERT(groups != NULL);
76 1.13 lukem _DIAGASSERT(grpcnt != NULL);
77 1.1 cgd
78 1.1 cgd ret = 0;
79 1.1 cgd ngroups = 0;
80 1.1 cgd maxgroups = *grpcnt;
81 1.5 jtc
82 1.1 cgd /*
83 1.5 jtc * install primary group
84 1.1 cgd */
85 1.10 mycroft if (ngroups < maxgroups)
86 1.10 mycroft groups[ngroups] = agroup;
87 1.10 mycroft else
88 1.10 mycroft ret = -1;
89 1.10 mycroft ngroups++;
90 1.5 jtc
91 1.1 cgd /*
92 1.1 cgd * Scan the group file to find additional groups.
93 1.1 cgd */
94 1.1 cgd setgrent();
95 1.12 lukem nextgroup:
96 1.16 elric while ((grp = _getgrent_user(uname)) != NULL) {
97 1.1 cgd if (grp->gr_gid == agroup)
98 1.1 cgd continue;
99 1.16 elric for (i = 0; i < MIN(ngroups, maxgroups); i++) {
100 1.16 elric if (grp->gr_gid == groups[i])
101 1.16 elric goto nextgroup;
102 1.1 cgd }
103 1.16 elric if (ngroups < maxgroups)
104 1.16 elric groups[ngroups] = grp->gr_gid;
105 1.16 elric else
106 1.16 elric ret = -1;
107 1.16 elric ngroups++;
108 1.1 cgd }
109 1.1 cgd endgrent();
110 1.1 cgd *grpcnt = ngroups;
111 1.1 cgd return (ret);
112 1.1 cgd }
113