Home | History | Annotate | Line # | Download | only in libhack
getgrent.c revision 1.9
      1  1.9    lukem /*	$NetBSD: getgrent.c,v 1.9 2005/01/06 15:10:45 lukem Exp $	*/
      2  1.1      gwr 
      3  1.1      gwr /*
      4  1.9    lukem  * Copyright (c) 1989, 1991, 1993
      5  1.1      gwr  *	The Regents of the University of California.  All rights reserved.
      6  1.7      agc  *
      7  1.7      agc  * Redistribution and use in source and binary forms, with or without
      8  1.7      agc  * modification, are permitted provided that the following conditions
      9  1.7      agc  * are met:
     10  1.7      agc  * 1. Redistributions of source code must retain the above copyright
     11  1.7      agc  *    notice, this list of conditions and the following disclaimer.
     12  1.7      agc  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.7      agc  *    notice, this list of conditions and the following disclaimer in the
     14  1.7      agc  *    documentation and/or other materials provided with the distribution.
     15  1.7      agc  * 3. Neither the name of the University nor the names of its contributors
     16  1.7      agc  *    may be used to endorse or promote products derived from this software
     17  1.7      agc  *    without specific prior written permission.
     18  1.7      agc  *
     19  1.7      agc  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  1.7      agc  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  1.7      agc  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  1.7      agc  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  1.7      agc  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  1.7      agc  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  1.7      agc  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  1.7      agc  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  1.7      agc  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  1.7      agc  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  1.7      agc  * SUCH DAMAGE.
     30  1.7      agc  */
     31  1.7      agc 
     32  1.7      agc /*
     33  1.1      gwr  * Portions Copyright (c) 1994, Jason Downs. All Rights Reserved.
     34  1.1      gwr  *
     35  1.1      gwr  * Redistribution and use in source and binary forms, with or without
     36  1.1      gwr  * modification, are permitted provided that the following conditions
     37  1.1      gwr  * are met:
     38  1.1      gwr  * 1. Redistributions of source code must retain the above copyright
     39  1.1      gwr  *    notice, this list of conditions and the following disclaimer.
     40  1.1      gwr  * 2. Redistributions in binary form must reproduce the above copyright
     41  1.1      gwr  *    notice, this list of conditions and the following disclaimer in the
     42  1.1      gwr  *    documentation and/or other materials provided with the distribution.
     43  1.1      gwr  *
     44  1.8      agc  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS
     45  1.8      agc  * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
     46  1.8      agc  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
     47  1.8      agc  * DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT,
     48  1.8      agc  * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
     49  1.8      agc  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
     50  1.8      agc  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
     51  1.8      agc  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     52  1.1      gwr  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     53  1.1      gwr  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     54  1.1      gwr  * SUCH DAMAGE.
     55  1.1      gwr  */
     56  1.1      gwr 
     57  1.2      gwr /*
     58  1.2      gwr  * Copied from:  lib/libc/gen/getgrent.c
     59  1.6    elric  *     NetBSD: getgrent.c,v 1.46 2003/02/17 00:11:54 simonb Exp
     60  1.2      gwr  * and then gutted, leaving only /etc/group support.
     61  1.2      gwr  */
     62  1.1      gwr 
     63  1.4  tsutsui #include <sys/cdefs.h>
     64  1.4  tsutsui 
     65  1.4  tsutsui #ifdef __weak_alias
     66  1.4  tsutsui #define endgrent		_endgrent
     67  1.4  tsutsui #define getgrent		_getgrent
     68  1.4  tsutsui #define getgrgid		_getgrgid
     69  1.4  tsutsui #define getgrnam		_getgrnam
     70  1.4  tsutsui #define setgrent		_setgrent
     71  1.4  tsutsui #define setgroupent		_setgroupent
     72  1.9    lukem #define getgroupmembership	_getgroupmembership
     73  1.4  tsutsui 
     74  1.4  tsutsui __weak_alias(endgrent,_endgrent)
     75  1.4  tsutsui __weak_alias(getgrent,_getgrent)
     76  1.4  tsutsui __weak_alias(getgrgid,_getgrgid)
     77  1.4  tsutsui __weak_alias(getgrnam,_getgrnam)
     78  1.4  tsutsui __weak_alias(setgrent,_setgrent)
     79  1.4  tsutsui __weak_alias(setgroupent,_setgroupent)
     80  1.9    lukem __weak_alias(getgroupmembership,_getgroupmembership)
     81  1.4  tsutsui #endif
     82  1.1      gwr 
     83  1.9    lukem #include <sys/param.h>
     84  1.5    lukem 
     85  1.5    lukem #include <grp.h>
     86  1.5    lukem #include <limits.h>
     87  1.5    lukem #include <stdio.h>
     88  1.5    lukem #include <stdlib.h>
     89  1.5    lukem #include <string.h>
     90  1.5    lukem 
     91  1.5    lukem static FILE		*_gr_fp;
     92  1.5    lukem static struct group	_gr_group;
     93  1.6    elric static int		_gr_stayopen;
     94  1.5    lukem static int		_gr_filesdone;
     95  1.5    lukem 
     96  1.6    elric static int grscan(int, gid_t, const char *, const char *);
     97  1.5    lukem static int grstart(void);
     98  1.6    elric static int grmatchline(int, gid_t, const char *, const char *);
     99  1.1      gwr 
    100  1.1      gwr #define	MAXGRP		200
    101  1.1      gwr #define	MAXLINELENGTH	1024
    102  1.6    elric 
    103  1.6    elric static __aconst char	*members[MAXGRP];
    104  1.5    lukem static char		grline[MAXLINELENGTH];
    105  1.1      gwr 
    106  1.1      gwr struct group *
    107  1.5    lukem getgrent(void)
    108  1.1      gwr {
    109  1.6    elric 
    110  1.6    elric 	if ((!_gr_fp && !grstart()) || !grscan(0, 0, NULL, NULL))
    111  1.6    elric  		return (NULL);
    112  1.6    elric 	return &_gr_group;
    113  1.6    elric }
    114  1.6    elric 
    115  1.1      gwr struct group *
    116  1.5    lukem getgrnam(const char *name)
    117  1.1      gwr {
    118  1.1      gwr 	int rval;
    119  1.1      gwr 
    120  1.5    lukem 	if (!grstart())
    121  1.6    elric 		return NULL;
    122  1.6    elric 	rval = grscan(1, 0, name, NULL);
    123  1.1      gwr 	if (!_gr_stayopen)
    124  1.1      gwr 		endgrent();
    125  1.6    elric 	return (rval) ? &_gr_group : NULL;
    126  1.1      gwr }
    127  1.1      gwr 
    128  1.1      gwr struct group *
    129  1.1      gwr getgrgid(gid_t gid)
    130  1.1      gwr {
    131  1.1      gwr 	int rval;
    132  1.1      gwr 
    133  1.5    lukem 	if (!grstart())
    134  1.6    elric 		return NULL;
    135  1.6    elric 	rval = grscan(1, gid, NULL, NULL);
    136  1.1      gwr 	if (!_gr_stayopen)
    137  1.1      gwr 		endgrent();
    138  1.6    elric 	return (rval) ? &_gr_group : NULL;
    139  1.1      gwr }
    140  1.1      gwr 
    141  1.1      gwr static int
    142  1.5    lukem grstart(void)
    143  1.1      gwr {
    144  1.6    elric 
    145  1.5    lukem 	_gr_filesdone = 0;
    146  1.1      gwr 	if (_gr_fp) {
    147  1.1      gwr 		rewind(_gr_fp);
    148  1.6    elric 		return 1;
    149  1.1      gwr 	}
    150  1.6    elric 	return (_gr_fp = fopen(_PATH_GROUP, "r")) ? 1 : 0;
    151  1.1      gwr }
    152  1.1      gwr 
    153  1.1      gwr void
    154  1.5    lukem setgrent(void)
    155  1.1      gwr {
    156  1.6    elric 
    157  1.1      gwr 	(void) setgroupent(0);
    158  1.1      gwr }
    159  1.1      gwr 
    160  1.1      gwr int
    161  1.5    lukem setgroupent(int stayopen)
    162  1.1      gwr {
    163  1.6    elric 
    164  1.5    lukem 	if (!grstart())
    165  1.6    elric 		return 0;
    166  1.1      gwr 	_gr_stayopen = stayopen;
    167  1.6    elric 	return 1;
    168  1.1      gwr }
    169  1.1      gwr 
    170  1.1      gwr void
    171  1.5    lukem endgrent(void)
    172  1.1      gwr {
    173  1.6    elric 
    174  1.5    lukem 	_gr_filesdone = 0;
    175  1.1      gwr 	if (_gr_fp) {
    176  1.1      gwr 		(void)fclose(_gr_fp);
    177  1.1      gwr 		_gr_fp = NULL;
    178  1.1      gwr 	}
    179  1.1      gwr }
    180  1.1      gwr 
    181  1.9    lukem int
    182  1.9    lukem getgroupmembership(const char *uname, gid_t agroup,
    183  1.9    lukem     gid_t *groups, int maxgroups, int *grpcnt)
    184  1.9    lukem {
    185  1.9    lukem 	struct group *grp;
    186  1.9    lukem 	int i, ngroups, ret;
    187  1.9    lukem 
    188  1.9    lukem 	ret = 0;
    189  1.9    lukem 	ngroups = 0;
    190  1.9    lukem 
    191  1.9    lukem 	/*
    192  1.9    lukem 	 * install primary group
    193  1.9    lukem 	 */
    194  1.9    lukem 	if (ngroups < maxgroups)
    195  1.9    lukem 		groups[ngroups] = agroup;
    196  1.9    lukem 	else
    197  1.9    lukem 		ret = -1;
    198  1.9    lukem 	ngroups++;
    199  1.9    lukem 
    200  1.9    lukem 	/*
    201  1.9    lukem 	 * Scan the group file to find additional groups.
    202  1.9    lukem 	 */
    203  1.9    lukem 	setgrent();
    204  1.9    lukem  nextgroup:
    205  1.9    lukem 	while ((grp = getgrent()) != NULL) {
    206  1.9    lukem 		if (grp->gr_gid == agroup)
    207  1.9    lukem 			continue;
    208  1.9    lukem 		for (i = 0; grp->gr_mem[i]; i++) {
    209  1.9    lukem 			if (strcmp(grp->gr_mem[i], uname) != 0)
    210  1.9    lukem 				continue;
    211  1.9    lukem 			for (i = 0; i < MIN(ngroups, maxgroups); i++) {
    212  1.9    lukem 				if (grp->gr_gid == groups[i])
    213  1.9    lukem 					goto nextgroup;
    214  1.9    lukem 			}
    215  1.9    lukem 			if (ngroups < maxgroups)
    216  1.9    lukem 				groups[ngroups] = grp->gr_gid;
    217  1.9    lukem 			else
    218  1.9    lukem 				ret = -1;
    219  1.9    lukem 			ngroups++;
    220  1.9    lukem 			break;
    221  1.9    lukem 		}
    222  1.9    lukem 	}
    223  1.9    lukem 	endgrent();
    224  1.9    lukem 	*grpcnt = ngroups;
    225  1.9    lukem 	return ret;
    226  1.9    lukem }
    227  1.9    lukem 
    228  1.1      gwr static int
    229  1.6    elric grscan(int search, gid_t gid, const char *name, const char *user)
    230  1.1      gwr {
    231  1.6    elric 
    232  1.5    lukem 	if (_gr_filesdone)
    233  1.5    lukem 		return 0;
    234  1.1      gwr 	for (;;) {
    235  1.5    lukem 		if (!fgets(grline, sizeof(grline), _gr_fp)) {
    236  1.5    lukem 			if (!search)
    237  1.5    lukem 				_gr_filesdone = 1;
    238  1.5    lukem 			return 0;
    239  1.5    lukem 		}
    240  1.1      gwr 		/* skip lines that are too big */
    241  1.5    lukem 		if (!strchr(grline, '\n')) {
    242  1.1      gwr 			int ch;
    243  1.1      gwr 
    244  1.1      gwr 			while ((ch = getc(_gr_fp)) != '\n' && ch != EOF)
    245  1.1      gwr 				;
    246  1.1      gwr 			continue;
    247  1.1      gwr 		}
    248  1.6    elric 		if (grmatchline(search, gid, name, user))
    249  1.5    lukem 			return 1;
    250  1.1      gwr 	}
    251  1.1      gwr 	/* NOTREACHED */
    252  1.5    lukem }
    253  1.5    lukem 
    254  1.5    lukem static int
    255  1.6    elric grmatchline(int search, gid_t gid, const char *name, const char *user)
    256  1.5    lukem {
    257  1.5    lukem 	unsigned long	id;
    258  1.6    elric 	__aconst char	**m;
    259  1.5    lukem 	char		*cp, *bp, *ep;
    260  1.5    lukem 
    261  1.5    lukem 	/* name may be NULL if search is nonzero */
    262  1.5    lukem 
    263  1.5    lukem 	bp = grline;
    264  1.5    lukem 	_gr_group.gr_name = strsep(&bp, ":\n");
    265  1.5    lukem 	if (search && name && strcmp(_gr_group.gr_name, name))
    266  1.5    lukem 		return 0;
    267  1.5    lukem 	_gr_group.gr_passwd = strsep(&bp, ":\n");
    268  1.5    lukem 	if (!(cp = strsep(&bp, ":\n")))
    269  1.5    lukem 		return 0;
    270  1.5    lukem 	id = strtoul(cp, &ep, 10);
    271  1.5    lukem 	if (id > GID_MAX || *ep != '\0')
    272  1.5    lukem 		return 0;
    273  1.5    lukem 	_gr_group.gr_gid = (gid_t)id;
    274  1.5    lukem 	if (search && name == NULL && _gr_group.gr_gid != gid)
    275  1.5    lukem 		return 0;
    276  1.5    lukem 	cp = NULL;
    277  1.5    lukem 	if (bp == NULL)
    278  1.5    lukem 		return 0;
    279  1.5    lukem 	for (_gr_group.gr_mem = m = members;; bp++) {
    280  1.5    lukem 		if (m == &members[MAXGRP - 1])
    281  1.5    lukem 			break;
    282  1.5    lukem 		if (*bp == ',') {
    283  1.5    lukem 			if (cp) {
    284  1.5    lukem 				*bp = '\0';
    285  1.5    lukem 				*m++ = cp;
    286  1.5    lukem 				cp = NULL;
    287  1.5    lukem 			}
    288  1.5    lukem 		} else if (*bp == '\0' || *bp == '\n' || *bp == ' ') {
    289  1.5    lukem 			if (cp) {
    290  1.5    lukem 				*bp = '\0';
    291  1.5    lukem 				*m++ = cp;
    292  1.5    lukem 			}
    293  1.5    lukem 			break;
    294  1.5    lukem 		} else if (cp == NULL)
    295  1.5    lukem 			cp = bp;
    296  1.5    lukem 	}
    297  1.5    lukem 	*m = NULL;
    298  1.6    elric 	if (user) {
    299  1.6    elric 		for (m = members; *m; m++)
    300  1.6    elric 			if (!strcmp(user, *m))
    301  1.6    elric 				return 1;
    302  1.6    elric 		return 0;
    303  1.6    elric 	}
    304  1.5    lukem 	return 1;
    305  1.1      gwr }
    306