92 lines
2.9 KiB
C
92 lines
2.9 KiB
C
/*
|
|
* Copyright (c) 1991, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
static char sccsid[] = "@(#)getgrouplist.c 8.1 (Berkeley) 6/4/93";
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
/*
|
|
* get credential
|
|
*/
|
|
#include <sys/types.h>
|
|
#include <string.h>
|
|
#include <grp.h>
|
|
|
|
int
|
|
getgrouplist(uname, agroup, groups, grpcnt)
|
|
const char *uname;
|
|
int agroup;
|
|
register int *groups;
|
|
int *grpcnt;
|
|
{
|
|
register struct group *grp;
|
|
register int i, ngroups;
|
|
int ret, maxgroups;
|
|
|
|
ret = 0;
|
|
ngroups = 0;
|
|
maxgroups = *grpcnt;
|
|
/*
|
|
* When installing primary group, duplicate it;
|
|
* the first element of groups is the effective gid
|
|
* and will be overwritten when a setgid file is executed.
|
|
*/
|
|
groups[ngroups++] = agroup;
|
|
if (maxgroups > 1)
|
|
groups[ngroups++] = agroup;
|
|
/*
|
|
* Scan the group file to find additional groups.
|
|
*/
|
|
setgrent();
|
|
while ( (grp = getgrent()) ) {
|
|
for (i = 0; i < ngroups; i++) {
|
|
if (grp->gr_gid == groups[i])
|
|
goto skip;
|
|
}
|
|
if (ngroups >= maxgroups) {
|
|
ret = -1;
|
|
break;
|
|
}
|
|
for (i = 0; grp->gr_mem[i]; i++) {
|
|
if (!strcmp(grp->gr_mem[i], uname)) {
|
|
groups[ngroups++] = grp->gr_gid;
|
|
break;
|
|
}
|
|
}
|
|
skip:
|
|
}
|
|
endgrent();
|
|
*grpcnt = ngroups;
|
|
return (ret);
|
|
}
|