3 * David L. Nugent. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY DAVID L. NUGENT AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL DAVID L. NUGENT OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * $FreeBSD: src/usr.sbin/pw/pw_group.c,v 1.12.2.1 2000/06/28 19:19:04 ache Exp $
27 * $DragonFly: src/usr.sbin/pw/pw_group.c,v 1.3 2004/09/25 20:38:21 dillon Exp $
39 static int print_group(struct group
* grp
, int pretty
);
40 static gid_t
gr_gidpolicy(struct userconf
* cnf
, struct cargs
* args
);
44 alldigits(const char *str
)
47 if (*str
< '0' || *str
> '9')
55 pw_group(struct userconf
* cnf
, int mode
, struct cargs
* args
)
58 struct carg
*a_name
= getarg(args
, 'n');
59 struct carg
*a_gid
= getarg(args
, 'g');
61 struct group
*grp
= NULL
;
63 char **members
= NULL
;
65 static struct group fakegroup
=
73 if (mode
== M_LOCK
|| mode
== M_UNLOCK
)
74 errx(EX_USAGE
, "'lock' command is not available for groups");
77 * With M_NEXT, we only need to return the
81 gid_t next
= gr_gidpolicy(cnf
, args
);
82 if (getarg(args
, 'q'))
84 printf("%ld\n", (long)next
);
88 if (mode
== M_PRINT
&& getarg(args
, 'a')) {
89 int pretty
= getarg(args
, 'P') != NULL
;
92 while ((grp
= GETGRENT()) != NULL
)
93 print_group(grp
, pretty
);
99 errx(EX_DATAERR
, "group name or id required");
101 if (mode
!= M_ADD
&& grp
== NULL
&& alldigits(a_name
->val
)) {
102 (a_gid
= a_name
)->ch
= 'g';
106 grp
= (a_name
!= NULL
) ? GETGRNAM(a_name
->val
) : GETGRGID((gid_t
) atoi(a_gid
->val
));
108 if (mode
== M_UPDATE
|| mode
== M_DELETE
|| mode
== M_PRINT
) {
109 if (a_name
== NULL
&& grp
== NULL
) /* Try harder */
110 grp
= GETGRGID(atoi(a_gid
->val
));
113 if (mode
== M_PRINT
&& getarg(args
, 'F')) {
116 fakegroup
.gr_name
= a_name
? a_name
->val
: "nogroup";
117 fakegroup
.gr_gid
= a_gid
? (gid_t
) atol(a_gid
->val
) : -1;
118 fakegroup
.gr_mem
= fmems
;
119 return print_group(&fakegroup
, getarg(args
, 'P') != NULL
);
121 errx(EX_DATAERR
, "unknown group `%s'", a_name
? a_name
->val
: a_gid
->val
);
123 if (a_name
== NULL
) /* Needed later */
124 a_name
= addarg(args
, 'n', grp
->gr_name
);
127 * Handle deletions now
129 if (mode
== M_DELETE
) {
130 gid_t gid
= grp
->gr_gid
;
134 err(EX_IOERR
, "group '%s' not available (NIS?)", grp
->gr_name
);
136 warn("group update");
139 pw_log(cnf
, mode
, W_GROUP
, "%s(%ld) removed", a_name
->val
, (long) gid
);
141 } else if (mode
== M_PRINT
)
142 return print_group(grp
, getarg(args
, 'P') != NULL
);
145 grp
->gr_gid
= (gid_t
) atoi(a_gid
->val
);
147 if ((arg
= getarg(args
, 'l')) != NULL
)
148 grp
->gr_name
= pw_checkname((u_char
*)arg
->val
, 0);
150 if (a_name
== NULL
) /* Required */
151 errx(EX_DATAERR
, "group name required");
152 else if (grp
!= NULL
) /* Exists */
153 errx(EX_DATAERR
, "group name `%s' already exists", a_name
->val
);
155 extendarray(&members
, &grmembers
, 200);
158 grp
->gr_name
= pw_checkname((u_char
*)a_name
->val
, 0);
159 grp
->gr_passwd
= "*";
160 grp
->gr_gid
= gr_gidpolicy(cnf
, args
);
161 grp
->gr_mem
= members
;
165 * This allows us to set a group password Group passwords is an
166 * antique idea, rarely used and insecure (no secure database) Should
167 * be discouraged, but it is apparently still supported by some
171 if ((arg
= getarg(args
, 'h')) != NULL
) {
172 if (strcmp(arg
->val
, "-") == 0)
173 grp
->gr_passwd
= "*"; /* No access */
175 int fd
= atoi(arg
->val
);
177 int istty
= isatty(fd
);
182 if (tcgetattr(fd
, &t
) == -1)
185 struct termios n
= t
;
188 n
.c_lflag
&= ~(ECHO
);
189 tcsetattr(fd
, TCSANOW
, &n
);
190 printf("%sassword for group %s:", (mode
== M_UPDATE
) ? "New p" : "P", grp
->gr_name
);
194 b
= read(fd
, line
, sizeof(line
) - 1);
195 if (istty
) { /* Restore state */
196 tcsetattr(fd
, TCSANOW
, &t
);
201 warn("-h file descriptor");
205 if ((p
= strpbrk(line
, " \t\r\n")) != NULL
)
208 errx(EX_DATAERR
, "empty password read on file descriptor %d", fd
);
209 grp
->gr_passwd
= pw_pwcrypt(line
);
213 if (((arg
= getarg(args
, 'M')) != NULL
|| (arg
= getarg(args
, 'm')) != NULL
) && arg
->val
) {
218 /* Make sure this is not stay NULL with -M "" */
219 extendarray(&members
, &grmembers
, 200);
220 if (arg
->ch
== 'm') {
223 while (grp
->gr_mem
[k
] != NULL
) {
224 if (extendarray(&members
, &grmembers
, i
+ 2) != -1) {
225 members
[i
++] = grp
->gr_mem
[k
];
230 for (p
= strtok(arg
->val
, ", \t"); p
!= NULL
; p
= strtok(NULL
, ", \t")) {
232 if ((pwd
= GETPWNAM(p
)) == NULL
) {
233 if (!isdigit((unsigned char)*p
) || (pwd
= getpwuid((uid_t
) atoi(p
))) == NULL
)
234 errx(EX_NOUSER
, "user `%s' does not exist", p
);
237 * Check for duplicates
239 for (j
= 0; j
< i
&& strcmp(members
[j
], pwd
->pw_name
)!=0; j
++)
241 if (j
== i
&& extendarray(&members
, &grmembers
, i
+ 2) != -1)
242 members
[i
++] = newstr(pwd
->pw_name
);
244 while (i
< grmembers
)
246 grp
->gr_mem
= members
;
249 if (getarg(args
, 'N') != NULL
)
250 return print_group(grp
, getarg(args
, 'P') != NULL
);
252 if (mode
== M_ADD
&& (rc
= addgrent(grp
)) != 0) {
254 warnx("group '%s' already exists", grp
->gr_name
);
256 warn("group update");
258 } else if (mode
== M_UPDATE
&& (rc
= chggrent(a_name
->val
, grp
)) != 0) {
260 warnx("group '%s' not available (NIS?)", grp
->gr_name
);
262 warn("group update");
265 /* grp may have been invalidated */
266 if ((grp
= GETGRNAM(a_name
->val
)) == NULL
)
267 errx(EX_SOFTWARE
, "group disappeared during update");
269 pw_log(cnf
, mode
, W_GROUP
, "%s(%ld)", grp
->gr_name
, (long) grp
->gr_gid
);
279 gr_gidpolicy(struct userconf
* cnf
, struct cargs
* args
)
282 gid_t gid
= (gid_t
) - 1;
283 struct carg
*a_gid
= getarg(args
, 'g');
286 * Check the given gid, if any
289 gid
= (gid_t
) atol(a_gid
->val
);
291 if ((grp
= GETGRGID(gid
)) != NULL
&& getarg(args
, 'o') == NULL
)
292 errx(EX_DATAERR
, "gid `%ld' has already been allocated", (long) grp
->gr_gid
);
297 * We need to allocate the next available gid under one of
298 * two policies a) Grab the first unused gid b) Grab the
299 * highest possible unused gid
301 if (cnf
->min_gid
>= cnf
->max_gid
) { /* Sanity claus^H^H^H^Hheck */
303 cnf
->max_gid
= 32000;
305 bm
= bm_alloc(cnf
->max_gid
- cnf
->min_gid
+ 1);
308 * Now, let's fill the bitmap from the password file
311 while ((grp
= GETGRENT()) != NULL
)
312 if ((gid_t
)grp
->gr_gid
>= (gid_t
)cnf
->min_gid
&&
313 (gid_t
)grp
->gr_gid
<= (gid_t
)cnf
->max_gid
)
314 bm_setbit(&bm
, grp
->gr_gid
- cnf
->min_gid
);
318 * Then apply the policy, with fallback to reuse if necessary
321 gid
= (gid_t
) (bm_firstunset(&bm
) + cnf
->min_gid
);
323 gid
= (gid_t
) (bm_lastset(&bm
) + 1);
324 if (!bm_isset(&bm
, gid
))
327 gid
= (gid_t
) (bm_firstunset(&bm
) + cnf
->min_gid
);
331 * Another sanity check
333 if (gid
< cnf
->min_gid
|| gid
> cnf
->max_gid
)
334 errx(EX_SOFTWARE
, "unable to allocate a new gid - range fully used");
342 print_group(struct group
* grp
, int pretty
)
348 fmtgrent(&buf
, &buflen
, grp
);
354 printf("Group Name: %-15s #%lu\n"
356 grp
->gr_name
, (long) grp
->gr_gid
);
357 for (i
= 0; grp
->gr_mem
[i
]; i
++)
358 printf("%s%s", i
? "," : "", grp
->gr_mem
[i
]);
359 fputs("\n\n", stdout
);