getgrouplist.c revision 1.15 1 1.15 mycroft /* $NetBSD: getgrouplist.c,v 1.15 2000/01/22 22:19:10 mycroft 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.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.6 christos #include <sys/cdefs.h>
37 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
38 1.4 cgd #if 0
39 1.8 perry static char sccsid[] = "@(#)getgrouplist.c 8.2 (Berkeley) 12/8/94";
40 1.4 cgd #else
41 1.15 mycroft __RCSID("$NetBSD: getgrouplist.c,v 1.15 2000/01/22 22:19:10 mycroft Exp $");
42 1.4 cgd #endif
43 1.1 cgd #endif /* LIBC_SCCS and not lint */
44 1.1 cgd
45 1.1 cgd /*
46 1.1 cgd * get credential
47 1.1 cgd */
48 1.7 jtc #include "namespace.h"
49 1.12 lukem #include <sys/param.h>
50 1.12 lukem
51 1.13 lukem #include <assert.h>
52 1.12 lukem #include <grp.h>
53 1.1 cgd #include <string.h>
54 1.6 christos #include <unistd.h>
55 1.7 jtc
56 1.7 jtc #ifdef __weak_alias
57 1.15 mycroft __weak_alias(getgrouplist,_getgrouplist)
58 1.7 jtc #endif
59 1.1 cgd
60 1.1 cgd int
61 1.1 cgd getgrouplist(uname, agroup, groups, grpcnt)
62 1.1 cgd const char *uname;
63 1.6 christos gid_t agroup;
64 1.6 christos gid_t *groups;
65 1.1 cgd int *grpcnt;
66 1.1 cgd {
67 1.9 perry struct group *grp;
68 1.9 perry int i, ngroups;
69 1.1 cgd int ret, maxgroups;
70 1.13 lukem
71 1.13 lukem _DIAGASSERT(uname != NULL);
72 1.13 lukem _DIAGASSERT(groups != NULL);
73 1.13 lukem _DIAGASSERT(grpcnt != NULL);
74 1.1 cgd
75 1.1 cgd ret = 0;
76 1.1 cgd ngroups = 0;
77 1.1 cgd maxgroups = *grpcnt;
78 1.5 jtc
79 1.1 cgd /*
80 1.5 jtc * install primary group
81 1.1 cgd */
82 1.10 mycroft if (ngroups < maxgroups)
83 1.10 mycroft groups[ngroups] = agroup;
84 1.10 mycroft else
85 1.10 mycroft ret = -1;
86 1.10 mycroft ngroups++;
87 1.5 jtc
88 1.1 cgd /*
89 1.1 cgd * Scan the group file to find additional groups.
90 1.1 cgd */
91 1.1 cgd setgrent();
92 1.12 lukem nextgroup:
93 1.6 christos while ((grp = getgrent()) != NULL) {
94 1.1 cgd if (grp->gr_gid == agroup)
95 1.1 cgd continue;
96 1.1 cgd for (i = 0; grp->gr_mem[i]; i++) {
97 1.1 cgd if (!strcmp(grp->gr_mem[i], uname)) {
98 1.12 lukem for (i = 0; i < MIN(ngroups, maxgroups); i++) {
99 1.12 lukem if (grp->gr_gid == groups[i])
100 1.12 lukem goto nextgroup;
101 1.12 lukem }
102 1.10 mycroft if (ngroups < maxgroups)
103 1.10 mycroft groups[ngroups] = grp->gr_gid;
104 1.10 mycroft else
105 1.2 cgd ret = -1;
106 1.10 mycroft ngroups++;
107 1.1 cgd break;
108 1.1 cgd }
109 1.1 cgd }
110 1.1 cgd }
111 1.1 cgd endgrent();
112 1.1 cgd *grpcnt = ngroups;
113 1.1 cgd return (ret);
114 1.1 cgd }
115