1 /*- 2 * Copyright (c) 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 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. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 #if 0 36 static char sccsid[] = "@(#)stat_flags.c 8.1 (Berkeley) 5/31/93"; 37 #else 38 static const char rcsid[] = 39 "$FreeBSD$"; 40 #endif 41 #endif /* not lint */ 42 43 #include <sys/types.h> 44 #include <sys/stat.h> 45 46 #include <stddef.h> 47 #include <string.h> 48 49 static struct { 50 char *name; 51 u_long flag; 52 int invert; 53 } mapping[] = { 54 /* shorter names per flag first, all prefixed by "no" */ 55 { "nosappnd", SF_APPEND, 0 }, 56 { "nosappend", SF_APPEND, 0 }, 57 { "noarch", SF_ARCHIVED, 0 }, 58 { "noarchived", SF_ARCHIVED, 0 }, 59 { "noschg", SF_IMMUTABLE, 0 }, 60 { "noschange", SF_IMMUTABLE, 0 }, 61 { "nosimmutable", SF_IMMUTABLE, 0 }, 62 { "nosunlnk", SF_NOUNLINK, 0 }, 63 { "nosunlink", SF_NOUNLINK, 0 }, 64 { "nouappnd", UF_APPEND, 0 }, 65 { "nouappend", UF_APPEND, 0 }, 66 { "nouchg", UF_IMMUTABLE, 0 }, 67 { "nouchange", UF_IMMUTABLE, 0 }, 68 { "nouimmutable", UF_IMMUTABLE, 0 }, 69 { "nodump", UF_NODUMP, 1 }, 70 { "noopaque", UF_OPAQUE, 0 }, 71 { "nouunlnk", UF_NOUNLINK, 0 }, 72 { "nouunlink", UF_NOUNLINK, 0 } 73 }; 74 #define nmappings (sizeof(mapping) / sizeof(mapping[0])) 75 76 /* 77 * getflags -- 78 * Convert stat flags to a comma-separated string. If no flags 79 * are set, return the default string. 80 */ 81 char * 82 getflags(flags, def) 83 u_long flags; 84 char *def; 85 { 86 static char string[128]; 87 char *sp, *dp; 88 u_long setflags; 89 int i; 90 91 setflags = flags; 92 dp = string; 93 for (i = 0; i < nmappings; i++) { 94 if (setflags & mapping[i].flag) { 95 if (dp > string) 96 *dp++ = ','; 97 for (sp = mapping[i].invert ? mapping[i].name : 98 mapping[i].name + 2; *sp; *dp++ = *sp++) ; 99 setflags &= ~mapping[i].flag; 100 } 101 } 102 *dp = '\0'; 103 return (dp == string && def != NULL ? def : string); 104 } 105 106 /* 107 * setflags -- 108 * Take string of arguments and return stat flags. Return 0 on 109 * success, 1 on failure. On failure, stringp is set to point 110 * to the offending token. 111 */ 112 int 113 setflags(stringp, setp, clrp) 114 char **stringp; 115 u_long *setp, *clrp; 116 { 117 char *string, *p; 118 int i; 119 120 if (setp) 121 *setp = 0; 122 if (clrp) 123 *clrp = 0; 124 string = *stringp; 125 while ((p = strsep(&string, "\t ,")) != NULL) { 126 *stringp = p; 127 if (*p == '\0') 128 continue; 129 for (i = 0; i < nmappings; i++) { 130 if (strcmp(p, mapping[i].name + 2) == 0) { 131 if (mapping[i].invert) { 132 if (clrp) 133 *clrp |= mapping[i].flag; 134 } else { 135 if (setp) 136 *setp |= mapping[i].flag; 137 } 138 break; 139 } else if (strcmp(p, mapping[i].name) == 0) { 140 if (mapping[i].invert) { 141 if (setp) 142 *setp |= mapping[i].flag; 143 } else { 144 if (clrp) 145 *clrp |= mapping[i].flag; 146 } 147 break; 148 } 149 } 150 if (i == nmappings) 151 return 1; 152 } 153 return 0; 154 } 155