1*0Sstevel@tonic-gate /*
2*0Sstevel@tonic-gate  * Copyright (c) 1991, 1993
3*0Sstevel@tonic-gate  *	The Regents of the University of California.  All rights reserved.
4*0Sstevel@tonic-gate  *
5*0Sstevel@tonic-gate  * Redistribution and use in source and binary forms, with or without
6*0Sstevel@tonic-gate  * modification, are permitted provided that the following conditions
7*0Sstevel@tonic-gate  * are met:
8*0Sstevel@tonic-gate  * 1. Redistributions of source code must retain the above copyright
9*0Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer.
10*0Sstevel@tonic-gate  * 2. Redistributions in binary form must reproduce the above copyright
11*0Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer in the
12*0Sstevel@tonic-gate  *    documentation and/or other materials provided with the distribution.
13*0Sstevel@tonic-gate  * 3. All advertising materials mentioning features or use of this software
14*0Sstevel@tonic-gate  *    must display the following acknowledgement:
15*0Sstevel@tonic-gate  *	This product includes software developed by the University of
16*0Sstevel@tonic-gate  *	California, Berkeley and its contributors.
17*0Sstevel@tonic-gate  * 4. Neither the name of the University nor the names of its contributors
18*0Sstevel@tonic-gate  *    may be used to endorse or promote products derived from this software
19*0Sstevel@tonic-gate  *    without specific prior written permission.
20*0Sstevel@tonic-gate  *
21*0Sstevel@tonic-gate  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22*0Sstevel@tonic-gate  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23*0Sstevel@tonic-gate  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24*0Sstevel@tonic-gate  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25*0Sstevel@tonic-gate  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26*0Sstevel@tonic-gate  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27*0Sstevel@tonic-gate  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28*0Sstevel@tonic-gate  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29*0Sstevel@tonic-gate  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30*0Sstevel@tonic-gate  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31*0Sstevel@tonic-gate  * SUCH DAMAGE.
32*0Sstevel@tonic-gate  */
33*0Sstevel@tonic-gate 
34*0Sstevel@tonic-gate #include "includes.h"
35*0Sstevel@tonic-gate 
36*0Sstevel@tonic-gate #ifndef HAVE_GETGROUPLIST
37*0Sstevel@tonic-gate 
38*0Sstevel@tonic-gate #if defined(LIBC_SCCS) && !defined(lint)
39*0Sstevel@tonic-gate static char rcsid[] = "$OpenBSD: getgrouplist.c,v 1.7 1997/08/19 19:13:27 deraadt Exp $";
40*0Sstevel@tonic-gate #endif /* LIBC_SCCS and not lint */
41*0Sstevel@tonic-gate 
42*0Sstevel@tonic-gate /*
43*0Sstevel@tonic-gate  * get credential
44*0Sstevel@tonic-gate  */
45*0Sstevel@tonic-gate #include <sys/types.h>
46*0Sstevel@tonic-gate #include <string.h>
47*0Sstevel@tonic-gate #include <grp.h>
48*0Sstevel@tonic-gate 
49*0Sstevel@tonic-gate int
getgrouplist(uname,agroup,groups,grpcnt)50*0Sstevel@tonic-gate getgrouplist(uname, agroup, groups, grpcnt)
51*0Sstevel@tonic-gate 	const char *uname;
52*0Sstevel@tonic-gate 	gid_t agroup;
53*0Sstevel@tonic-gate 	register gid_t *groups;
54*0Sstevel@tonic-gate 	int *grpcnt;
55*0Sstevel@tonic-gate {
56*0Sstevel@tonic-gate 	register struct group *grp;
57*0Sstevel@tonic-gate 	register int i, ngroups;
58*0Sstevel@tonic-gate 	int ret, maxgroups;
59*0Sstevel@tonic-gate 	int bail;
60*0Sstevel@tonic-gate 
61*0Sstevel@tonic-gate 	ret = 0;
62*0Sstevel@tonic-gate 	ngroups = 0;
63*0Sstevel@tonic-gate 	maxgroups = *grpcnt;
64*0Sstevel@tonic-gate 
65*0Sstevel@tonic-gate 	/*
66*0Sstevel@tonic-gate 	 * install primary group
67*0Sstevel@tonic-gate 	 */
68*0Sstevel@tonic-gate 	if (ngroups >= maxgroups) {
69*0Sstevel@tonic-gate 		*grpcnt = ngroups;
70*0Sstevel@tonic-gate 		return (-1);
71*0Sstevel@tonic-gate 	}
72*0Sstevel@tonic-gate 	groups[ngroups++] = agroup;
73*0Sstevel@tonic-gate 
74*0Sstevel@tonic-gate 	/*
75*0Sstevel@tonic-gate 	 * Scan the group file to find additional groups.
76*0Sstevel@tonic-gate 	 */
77*0Sstevel@tonic-gate 	setgrent();
78*0Sstevel@tonic-gate 	while ((grp = getgrent())) {
79*0Sstevel@tonic-gate 		if (grp->gr_gid == agroup)
80*0Sstevel@tonic-gate 			continue;
81*0Sstevel@tonic-gate 		for (bail = 0, i = 0; bail == 0 && i < ngroups; i++)
82*0Sstevel@tonic-gate 			if (groups[i] == grp->gr_gid)
83*0Sstevel@tonic-gate 				bail = 1;
84*0Sstevel@tonic-gate 		if (bail)
85*0Sstevel@tonic-gate 			continue;
86*0Sstevel@tonic-gate 		for (i = 0; grp->gr_mem[i]; i++) {
87*0Sstevel@tonic-gate 			if (!strcmp(grp->gr_mem[i], uname)) {
88*0Sstevel@tonic-gate 				if (ngroups >= maxgroups) {
89*0Sstevel@tonic-gate 					ret = -1;
90*0Sstevel@tonic-gate 					goto out;
91*0Sstevel@tonic-gate 				}
92*0Sstevel@tonic-gate 				groups[ngroups++] = grp->gr_gid;
93*0Sstevel@tonic-gate 				break;
94*0Sstevel@tonic-gate 			}
95*0Sstevel@tonic-gate 		}
96*0Sstevel@tonic-gate 	}
97*0Sstevel@tonic-gate out:
98*0Sstevel@tonic-gate 	endgrent();
99*0Sstevel@tonic-gate 	*grpcnt = ngroups;
100*0Sstevel@tonic-gate 	return (ret);
101*0Sstevel@tonic-gate }
102*0Sstevel@tonic-gate 
103*0Sstevel@tonic-gate #endif /* HAVE_GETGROUPLIST */
104*0Sstevel@tonic-gate 
105*0Sstevel@tonic-gate #pragma ident	"%Z%%M%	%I%	%E% SMI"
106