]>
Commit | Line | Data |
---|---|---|
03fb6eb0 A |
1 | /* |
2 | * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_LICENSE_HEADER_START@ | |
5 | * | |
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 | |
12 | * this file. | |
13 | * | |
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 | |
20 | * under the License. | |
21 | * | |
22 | * @APPLE_LICENSE_HEADER_END@ | |
23 | */ | |
24 | /* | |
25 | * Copyright (c) 1989, 1993 | |
26 | * The Regents of the University of California. All rights reserved. | |
27 | * | |
28 | * Redistribution and use in source and binary forms, with or without | |
29 | * modification, are permitted provided that the following conditions | |
30 | * are met: | |
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. | |
43 | * | |
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 | |
54 | * SUCH DAMAGE. | |
55 | */ | |
56 | ||
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 */ | |
60 | ||
61 | #include <sys/types.h> | |
62 | #include <stdio.h> | |
63 | #include <stdlib.h> | |
3b7c7bd7 | 64 | #include <string.h> |
03fb6eb0 A |
65 | #include <grp.h> |
66 | ||
67 | static FILE *_gr_fp; | |
68 | static struct group _gr_group; | |
69 | static int _gr_stayopen; | |
70 | static int grscan(), start_gr(); | |
71 | ||
72 | #define MAXGRP 200 | |
73 | static char *members[MAXGRP]; | |
74 | #define MAXLINELENGTH 1024 | |
75 | static char line[MAXLINELENGTH]; | |
76 | ||
77 | struct group * | |
78 | getgrent() | |
79 | { | |
3b7c7bd7 | 80 | if ((!_gr_fp && !start_gr()) || !grscan(0, 0, NULL)) |
03fb6eb0 A |
81 | return(NULL); |
82 | return(&_gr_group); | |
83 | } | |
84 | ||
85 | struct group * | |
86 | getgrnam(name) | |
87 | const char *name; | |
88 | { | |
89 | int rval; | |
90 | ||
91 | if (!start_gr()) | |
92 | return(NULL); | |
93 | rval = grscan(1, 0, name); | |
94 | if (!_gr_stayopen) | |
95 | endgrent(); | |
96 | return(rval ? &_gr_group : NULL); | |
97 | } | |
98 | ||
99 | struct group * | |
100 | #ifdef __STDC__ | |
101 | getgrgid(gid_t gid) | |
102 | #else | |
103 | getgrgid(gid) | |
104 | gid_t gid; | |
105 | #endif | |
106 | { | |
107 | int rval; | |
108 | ||
109 | if (!start_gr()) | |
110 | return(NULL); | |
111 | rval = grscan(1, gid, NULL); | |
112 | if (!_gr_stayopen) | |
113 | endgrent(); | |
114 | return(rval ? &_gr_group : NULL); | |
115 | } | |
116 | ||
3b7c7bd7 | 117 | static int |
03fb6eb0 A |
118 | start_gr() |
119 | { | |
120 | if (_gr_fp) { | |
121 | rewind(_gr_fp); | |
122 | return(1); | |
123 | } | |
124 | return((_gr_fp = fopen(_PATH_GROUP, "r")) ? 1 : 0); | |
125 | } | |
126 | ||
127 | int | |
128 | setgrent() | |
129 | { | |
130 | return(setgroupent(0)); | |
131 | } | |
132 | ||
133 | int | |
134 | setgroupent(stayopen) | |
135 | int stayopen; | |
136 | { | |
137 | if (!start_gr()) | |
138 | return(0); | |
139 | _gr_stayopen = stayopen; | |
140 | return(1); | |
141 | } | |
142 | ||
143 | void | |
144 | endgrent() | |
145 | { | |
146 | if (_gr_fp) { | |
147 | (void)fclose(_gr_fp); | |
148 | _gr_fp = NULL; | |
149 | } | |
150 | } | |
151 | ||
3b7c7bd7 | 152 | static int |
03fb6eb0 A |
153 | grscan(search, gid, name) |
154 | register int search, gid; | |
155 | register char *name; | |
156 | { | |
157 | register char *cp, **m; | |
158 | char *bp; | |
159 | char *fgets(), *strsep(), *index(); | |
160 | ||
161 | for (;;) { | |
162 | if (!fgets(line, sizeof(line), _gr_fp)) | |
163 | return(0); | |
164 | bp = line; | |
165 | /* skip lines that are too big */ | |
166 | if (!index(line, '\n')) { | |
167 | int ch; | |
168 | ||
169 | while ((ch = getc(_gr_fp)) != '\n' && ch != EOF) | |
170 | ; | |
171 | continue; | |
172 | } | |
173 | _gr_group.gr_name = strsep(&bp, ":\n"); | |
174 | if (search && name && strcmp(_gr_group.gr_name, name)) | |
175 | continue; | |
176 | _gr_group.gr_passwd = strsep(&bp, ":\n"); | |
177 | if (!(cp = strsep(&bp, ":\n"))) | |
178 | continue; | |
179 | _gr_group.gr_gid = atoi(cp); | |
180 | if (search && name == NULL && _gr_group.gr_gid != gid) | |
181 | continue; | |
182 | cp = NULL; | |
183 | for (m = _gr_group.gr_mem = members;; bp++) { | |
184 | if (m == &members[MAXGRP - 1]) | |
185 | break; | |
186 | if (*bp == ',') { | |
187 | if (cp) { | |
188 | *bp = '\0'; | |
189 | *m++ = cp; | |
190 | cp = NULL; | |
191 | } | |
192 | } else if (*bp == '\0' || *bp == '\n' || *bp == ' ') { | |
193 | if (cp) { | |
194 | *bp = '\0'; | |
195 | *m++ = cp; | |
196 | } | |
197 | break; | |
198 | } else if (cp == NULL) | |
199 | cp = bp; | |
200 | } | |
201 | *m = NULL; | |
202 | return(1); | |
203 | } | |
204 | /* NOTREACHED */ | |
205 | } |