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 #if defined(LIBC_SCCS) && !defined(lint) 35 static char sccsid[] = "@(#)stat_flags.c 8.1 (Berkeley) 5/31/93"; 36 #endif /* LIBC_SCCS and not lint */ 37 #include <sys/cdefs.h> 38 #ifdef __FBSDID 39 __FBSDID("$FreeBSD$"); 40 #endif 41 42 #include <sys/types.h> 43 #include <sys/stat.h> 44 45 #include <stddef.h> 46 #include <stdlib.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 longestflaglen 12 75 #define nmappings (sizeof(mapping) / sizeof(mapping[0])) 76 77 /* 78 * fflagstostr -- 79 * Convert file flags to a comma-separated string. If no flags 80 * are set, return the empty string. 81 */ 82 char * 83 fflagstostr(flags) 84 u_long flags; 85 { 86 char *string; 87 char *sp, *dp; 88 u_long setflags; 89 int i; 90 91 if ((string = (char *)malloc(nmappings * (longestflaglen + 1))) == NULL) 92 return (NULL); 93 94 setflags = flags; 95 dp = string; 96 for (i = 0; i < nmappings; i++) { 97 if (setflags & mapping[i].flag) { 98 if (dp > string) 99 *dp++ = ','; 100 for (sp = mapping[i].invert ? mapping[i].name : 101 mapping[i].name + 2; *sp; *dp++ = *sp++) ; 102 setflags &= ~mapping[i].flag; 103 } 104 } 105 *dp = '\0'; 106 return (string); 107 } 108 109 /* 110 * strtofflags -- 111 * Take string of arguments and return file flags. Return 0 on 112 * success, 1 on failure. On failure, stringp is set to point 113 * to the offending token. 114 */ 115 int 116 strtofflags(stringp, setp, clrp) 117 char **stringp; 118 u_long *setp, *clrp; 119 { 120 char *string, *p; 121 int i; 122 123 if (setp) 124 *setp = 0; 125 if (clrp) 126 *clrp = 0; 127 string = *stringp; 128 while ((p = strsep(&string, "\t ,")) != NULL) { 129 *stringp = p; 130 if (*p == '\0') 131 continue; 132 for (i = 0; i < nmappings; i++) { 133 if (strcmp(p, mapping[i].name + 2) == 0) { 134 if (mapping[i].invert) { 135 if (clrp) 136 *clrp |= mapping[i].flag; 137 } else { 138 if (setp) 139 *setp |= mapping[i].flag; 140 } 141 break; 142 } else if (strcmp(p, mapping[i].name) == 0) { 143 if (mapping[i].invert) { 144 if (setp) 145 *setp |= mapping[i].flag; 146 } else { 147 if (clrp) 148 *clrp |= mapping[i].flag; 149 } 150 break; 151 } 152 } 153 if (i == nmappings) 154 return 1; 155 } 156 return 0; 157 } 158