2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_HEADER_START@
6 * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7 * Reserved. This file contains Original Code and/or Modifications of
8 * Original Code as defined in and that are subject to the Apple Public
9 * Source License Version 1.1 (the "License"). You may not use this file
10 * except in compliance with the License. Please obtain a copy of the
11 * License at http://www.apple.com/publicsource and read it before using
14 * The Original Code and all software distributed under the License are
15 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT. Please see the
19 * License for the specific language governing rights and limitations
22 * @APPLE_LICENSE_HEADER_END@
25 * Copyright (c) 1989, 1993
26 * The Regents of the University of California. All rights reserved.
28 * Redistribution and use in source and binary forms, with or without
29 * modification, are permitted provided that the following conditions
31 * 1. Redistributions of source code must retain the above copyright
32 * notice, this list of conditions and the following disclaimer.
33 * 2. Redistributions in binary form must reproduce the above copyright
34 * notice, this list of conditions and the following disclaimer in the
35 * documentation and/or other materials provided with the distribution.
36 * 3. All advertising materials mentioning features or use of this software
37 * must display the following acknowledgement:
38 * This product includes software developed by the University of
39 * California, Berkeley and its contributors.
40 * 4. Neither the name of the University nor the names of its contributors
41 * may be used to endorse or promote products derived from this software
42 * without specific prior written permission.
44 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
45 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
46 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
47 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
48 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
49 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
50 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
51 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
52 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
53 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
57 #if defined(LIBC_SCCS) && !defined(lint)
58 static char sccsid
[] = "@(#)getgrent.c 8.2 (Berkeley) 3/21/94";
59 #endif /* LIBC_SCCS and not lint */
61 #include <sys/types.h>
67 static struct group _gr_group
;
68 static int _gr_stayopen
;
69 static int grscan(), start_gr();
72 static char *members
[MAXGRP
];
73 #define MAXLINELENGTH 1024
74 static char line
[MAXLINELENGTH
];
79 if (!_gr_fp
&& !start_gr() || !grscan(0, 0, NULL
))
92 rval
= grscan(1, 0, name
);
95 return(rval ?
&_gr_group
: NULL
);
110 rval
= grscan(1, gid
, NULL
);
113 return(rval ?
&_gr_group
: NULL
);
123 return((_gr_fp
= fopen(_PATH_GROUP
, "r")) ?
1 : 0);
129 return(setgroupent(0));
133 setgroupent(stayopen
)
138 _gr_stayopen
= stayopen
;
146 (void)fclose(_gr_fp
);
152 grscan(search
, gid
, name
)
153 register int search
, gid
;
156 register char *cp
, **m
;
158 char *fgets(), *strsep(), *index();
161 if (!fgets(line
, sizeof(line
), _gr_fp
))
164 /* skip lines that are too big */
165 if (!index(line
, '\n')) {
168 while ((ch
= getc(_gr_fp
)) != '\n' && ch
!= EOF
)
172 _gr_group
.gr_name
= strsep(&bp
, ":\n");
173 if (search
&& name
&& strcmp(_gr_group
.gr_name
, name
))
175 _gr_group
.gr_passwd
= strsep(&bp
, ":\n");
176 if (!(cp
= strsep(&bp
, ":\n")))
178 _gr_group
.gr_gid
= atoi(cp
);
179 if (search
&& name
== NULL
&& _gr_group
.gr_gid
!= gid
)
182 for (m
= _gr_group
.gr_mem
= members
;; bp
++) {
183 if (m
== &members
[MAXGRP
- 1])
191 } else if (*bp
== '\0' || *bp
== '\n' || *bp
== ' ') {
197 } else if (cp
== NULL
)