2 * Copyright (c) 1989, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Dave Borman at Cray Research, Inc.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)setmode.c 8.2 (Berkeley) 3/25/94
37 * $FreeBSD: src/lib/libc/gen/setmode.c,v 1.5.2.1 2001/03/05 09:34:10 obrien Exp $
38 * $DragonFly: src/lib/libc/gen/setmode.c,v 1.5 2005/01/31 22:29:15 dillon Exp $
41 #include "namespace.h"
42 #include <sys/types.h>
53 #include "un-namespace.h"
55 #define SET_LEN 6 /* initial # of bitcmd struct to malloc */
56 #define SET_LEN_INCR 4 /* # of bitcmd structs to add as needed */
58 typedef struct bitcmd {
66 #define CMD2_GBITS 0x04
67 #define CMD2_OBITS 0x08
68 #define CMD2_UBITS 0x10
70 static BITCMD *addcmd (BITCMD *, int, int, int, u_int);
71 static void compress_mode (BITCMD *);
73 static void dumpmode (BITCMD *);
77 * Given the old mode and an array of bitcmd structures, apply the operations
78 * described in the bitcmd structures to the old mode, and return the new mode.
79 * Note that there is no '=' command; a strict assignment is just a '-' (clear
80 * bits) followed by a '+' (set bits).
88 mode_t clrval, newmode, value;
92 for (value = 0;; set++)
95 * When copying the user, group or other bits around, we "know"
96 * where the bits are in the mode so that we can do shifts to
97 * copy them around. If we don't use shifts, it gets real
98 * grundgy with lots of single bit checks and bit sets.
101 value = (newmode & S_IRWXU) >> 6;
105 value = (newmode & S_IRWXG) >> 3;
109 value = newmode & S_IRWXO;
110 common: if (set->cmd2 & CMD2_CLR) {
112 (set->cmd2 & CMD2_SET) ? S_IRWXO : value;
113 if (set->cmd2 & CMD2_UBITS)
114 newmode &= ~((clrval<<6) & set->bits);
115 if (set->cmd2 & CMD2_GBITS)
116 newmode &= ~((clrval<<3) & set->bits);
117 if (set->cmd2 & CMD2_OBITS)
118 newmode &= ~(clrval & set->bits);
120 if (set->cmd2 & CMD2_SET) {
121 if (set->cmd2 & CMD2_UBITS)
122 newmode |= (value<<6) & set->bits;
123 if (set->cmd2 & CMD2_GBITS)
124 newmode |= (value<<3) & set->bits;
125 if (set->cmd2 & CMD2_OBITS)
126 newmode |= value & set->bits;
131 newmode |= set->bits;
135 newmode &= ~set->bits;
139 if (omode & (S_IFDIR|S_IXUSR|S_IXGRP|S_IXOTH))
140 newmode |= set->bits;
146 (void)printf("getmode:%04o -> %04o\n", omode, newmode);
152 #define ADDCMD(a, b, c, d) \
153 if (set >= endset) { \
155 setlen += SET_LEN_INCR; \
156 newset = realloc(saveset, sizeof(BITCMD) * setlen); \
159 set = newset + (set - saveset); \
161 endset = newset + (setlen - 2); \
163 set = addcmd(set, (a), (b), (c), (d))
165 #define STANDARD_BITS (S_ISUID|S_ISGID|S_IRWXU|S_IRWXG|S_IRWXO)
173 BITCMD *set, *saveset, *endset;
174 sigset_t sigset, sigoset;
176 int equalopdone=0, permXbits, setlen;
182 * Get a copy of the mask for the permissions that are mask relative.
183 * Flip the bits, we want what's not set. Since it's possible that
184 * the caller is opening files inside a signal handler, protect them
188 (void)_sigprocmask(SIG_BLOCK, &sigset, &sigoset);
189 (void)umask(mask = umask(0));
191 (void)_sigprocmask(SIG_SETMASK, &sigoset, NULL);
193 setlen = SET_LEN + 2;
195 if ((set = malloc((u_int)(sizeof(BITCMD) * setlen))) == NULL)
198 endset = set + (setlen - 2);
201 * If an absolute number, get it and return; disallow non-octal digits
204 if (isdigit((unsigned char)*p)) {
205 perm = (mode_t)strtol(p, NULL, 8);
206 if (perm & ~(STANDARD_BITS|S_ISTXT)) {
211 if (*p < '0' || *p > '7') {
215 ADDCMD('=', (STANDARD_BITS|S_ISTXT), perm, mask);
220 * Build list of structures to set/clear/copy bits as described by
221 * each clause of the symbolic mode.
224 /* First, find out which bits might be modified. */
225 for (who = 0;; ++p) {
228 who |= STANDARD_BITS;
231 who |= S_ISUID|S_IRWXU;
234 who |= S_ISGID|S_IRWXG;
244 getop: if ((op = *p++) != '+' && op != '-' && op != '=') {
252 for (perm = 0, permXbits = 0;; ++p) {
255 perm |= S_IRUSR|S_IRGRP|S_IROTH;
258 /* If only "other" bits ignore set-id. */
259 if (!who || who & ~S_IRWXO)
260 perm |= S_ISUID|S_ISGID;
263 /* If only "other" bits ignore sticky. */
264 if (!who || who & ~S_IRWXO) {
270 perm |= S_IWUSR|S_IWGRP|S_IWOTH;
273 permXbits = S_IXUSR|S_IXGRP|S_IXOTH;
276 perm |= S_IXUSR|S_IXGRP|S_IXOTH;
282 * When ever we hit 'u', 'g', or 'o', we have
283 * to flush out any partial mode that we have,
284 * and then do the copying of the mode bits.
287 ADDCMD(op, who, perm, mask);
292 if (op == '+' && permXbits) {
293 ADDCMD('X', who, permXbits, mask);
296 ADDCMD(*p, who, op, mask);
301 * Add any permissions that we haven't already
304 if (perm || (op == '=' && !equalopdone)) {
307 ADDCMD(op, who, perm, mask);
311 ADDCMD('X', who, permXbits, mask);
326 (void)printf("Before compress_mode()\n");
329 compress_mode(saveset);
331 (void)printf("After compress_mode()\n");
338 addcmd(set, op, who, oparg, mask)
347 set->bits = who ? who : STANDARD_BITS;
356 set->bits = (who ? who : mask) & oparg;
364 set->cmd2 = ((who & S_IRUSR) ? CMD2_UBITS : 0) |
365 ((who & S_IRGRP) ? CMD2_GBITS : 0) |
366 ((who & S_IROTH) ? CMD2_OBITS : 0);
369 set->cmd2 = CMD2_UBITS | CMD2_GBITS | CMD2_OBITS;
374 set->cmd2 |= CMD2_SET;
375 else if (oparg == '-')
376 set->cmd2 |= CMD2_CLR;
377 else if (oparg == '=')
378 set->cmd2 |= CMD2_SET|CMD2_CLR;
389 for (; set->cmd; ++set)
390 (void)printf("cmd: '%c' bits %04o%s%s%s%s%s%s\n",
391 set->cmd, set->bits, set->cmd2 ? " cmd2:" : "",
392 set->cmd2 & CMD2_CLR ? " CLR" : "",
393 set->cmd2 & CMD2_SET ? " SET" : "",
394 set->cmd2 & CMD2_UBITS ? " UBITS" : "",
395 set->cmd2 & CMD2_GBITS ? " GBITS" : "",
396 set->cmd2 & CMD2_OBITS ? " OBITS" : "");
401 * Given an array of bitcmd structures, compress by compacting consecutive
402 * '+', '-' and 'X' commands into at most 3 commands, one of each. The 'u',
403 * 'g' and 'o' commands continue to be separate. They could probably be
404 * compacted, but it's not worth the effort.
411 int setbits, clrbits, Xbits, op;
414 /* Copy over any 'u', 'g' and 'o' commands. */
415 while ((op = nset->cmd) != '+' && op != '-' && op != 'X') {
421 for (setbits = clrbits = Xbits = 0;; nset++) {
422 if ((op = nset->cmd) == '-') {
423 clrbits |= nset->bits;
424 setbits &= ~nset->bits;
425 Xbits &= ~nset->bits;
426 } else if (op == '+') {
427 setbits |= nset->bits;
428 clrbits &= ~nset->bits;
429 Xbits &= ~nset->bits;
430 } else if (op == 'X')
431 Xbits |= nset->bits & ~setbits;