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