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 * @(#)stat_flags.c 8.1 (Berkeley) 5/31/93 34 * $FreeBSD: src/lib/libc/gen/strtofflags.c,v 1.18.2.1 2000/06/28 01:52:24 joe Exp $ 35 * $DragonFly: src/lib/libc/gen/strtofflags.c,v 1.2 2003/06/17 04:26:42 dillon Exp $ 36 */ 37 38 #include <sys/types.h> 39 #include <sys/stat.h> 40 41 #include <stddef.h> 42 #include <stdlib.h> 43 #include <string.h> 44 45 static struct { 46 char *name; 47 u_long flag; 48 int invert; 49 } mapping[] = { 50 /* shorter names per flag first, all prefixed by "no" */ 51 { "nosappnd", SF_APPEND, 0 }, 52 { "nosappend", SF_APPEND, 0 }, 53 { "noarch", SF_ARCHIVED, 0 }, 54 { "noarchived", SF_ARCHIVED, 0 }, 55 { "noschg", SF_IMMUTABLE, 0 }, 56 { "noschange", SF_IMMUTABLE, 0 }, 57 { "nosimmutable", SF_IMMUTABLE, 0 }, 58 { "nosunlnk", SF_NOUNLINK, 0 }, 59 { "nosunlink", SF_NOUNLINK, 0 }, 60 { "nouappnd", UF_APPEND, 0 }, 61 { "nouappend", UF_APPEND, 0 }, 62 { "nouchg", UF_IMMUTABLE, 0 }, 63 { "nouchange", UF_IMMUTABLE, 0 }, 64 { "nouimmutable", UF_IMMUTABLE, 0 }, 65 { "nodump", UF_NODUMP, 1 }, 66 { "noopaque", UF_OPAQUE, 0 }, 67 { "nouunlnk", UF_NOUNLINK, 0 }, 68 { "nouunlink", UF_NOUNLINK, 0 } 69 }; 70 #define longestflaglen 12 71 #define nmappings (sizeof(mapping) / sizeof(mapping[0])) 72 73 /* 74 * fflagstostr -- 75 * Convert file flags to a comma-separated string. If no flags 76 * are set, return the empty string. 77 */ 78 char * 79 fflagstostr(flags) 80 u_long flags; 81 { 82 char *string; 83 char *sp, *dp; 84 u_long setflags; 85 int i; 86 87 if ((string = (char *)malloc(nmappings * (longestflaglen + 1))) == NULL) 88 return (NULL); 89 90 setflags = flags; 91 dp = string; 92 for (i = 0; i < nmappings; i++) { 93 if (setflags & mapping[i].flag) { 94 if (dp > string) 95 *dp++ = ','; 96 for (sp = mapping[i].invert ? mapping[i].name : 97 mapping[i].name + 2; *sp; *dp++ = *sp++) ; 98 setflags &= ~mapping[i].flag; 99 } 100 } 101 *dp = '\0'; 102 return (string); 103 } 104 105 /* 106 * strtofflags -- 107 * Take string of arguments and return file flags. Return 0 on 108 * success, 1 on failure. On failure, stringp is set to point 109 * to the offending token. 110 */ 111 int 112 strtofflags(stringp, setp, clrp) 113 char **stringp; 114 u_long *setp, *clrp; 115 { 116 char *string, *p; 117 int i; 118 119 if (setp) 120 *setp = 0; 121 if (clrp) 122 *clrp = 0; 123 string = *stringp; 124 while ((p = strsep(&string, "\t ,")) != NULL) { 125 *stringp = p; 126 if (*p == '\0') 127 continue; 128 for (i = 0; i < nmappings; i++) { 129 if (strcmp(p, mapping[i].name + 2) == 0) { 130 if (mapping[i].invert) { 131 if (clrp) 132 *clrp |= mapping[i].flag; 133 } else { 134 if (setp) 135 *setp |= mapping[i].flag; 136 } 137 break; 138 } else if (strcmp(p, mapping[i].name) == 0) { 139 if (mapping[i].invert) { 140 if (setp) 141 *setp |= mapping[i].flag; 142 } else { 143 if (clrp) 144 *clrp |= mapping[i].flag; 145 } 146 break; 147 } 148 } 149 if (i == nmappings) 150 return 1; 151 } 152 return 0; 153 } 154