1/* 2 * Copyright (c) 2003 Apple Computer, Inc. All rights reserved. 3 * 4 * @APPLE_LICENSE_HEADER_START@ 5 * 6 * This file contains Original Code and/or Modifications of Original Code 7 * as defined in and that are subject to the Apple Public Source License 8 * Version 2.0 (the 'License'). You may not use this file except in 9 * compliance with the License. Please obtain a copy of the License at 10 * http://www.opensource.apple.com/apsl/ and read it before using this 11 * file. 12 * 13 * The Original Code and all software distributed under the License are 14 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER 15 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, 16 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, 17 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. 18 * Please see the License for the specific language governing rights and 19 * limitations under the License. 20 * 21 * @APPLE_LICENSE_HEADER_END@ 22 */ 23/*- 24 * Copyright (c) 1993 25 * The Regents of the University of California. All rights reserved. 26 * 27 * Redistribution and use in source and binary forms, with or without 28 * modification, are permitted provided that the following conditions 29 * are met: 30 * 1. Redistributions of source code must retain the above copyright 31 * notice, this list of conditions and the following disclaimer. 32 * 2. Redistributions in binary form must reproduce the above copyright 33 * notice, this list of conditions and the following disclaimer in the 34 * documentation and/or other materials provided with the distribution. 35 * 3. All advertising materials mentioning features or use of this software 36 * must display the following acknowledgement: 37 * This product includes software developed by the University of 38 * California, Berkeley and its contributors. 39 * 4. Neither the name of the University nor the names of its contributors 40 * may be used to endorse or promote products derived from this software 41 * without specific prior written permission. 42 * 43 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 44 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 45 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 46 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 47 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 48 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 49 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 50 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 51 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 52 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 53 * SUCH DAMAGE. 54 */ 55 56#ifndef lint 57#if 0 58static char sccsid[] = "@(#)stat_flags.c 8.1 (Berkeley) 5/31/93"; 59#else 60static const char rcsid[] = 61 "$FreeBSD: src/lib/libc/gen/strtofflags.c,v 1.18.2.1 2000/06/28 01:52:24 joe Exp $"; 62#endif 63#endif /* not lint */ 64 65#include <sys/types.h> 66#include <sys/stat.h> 67 68#include <stddef.h> 69#include <stdlib.h> 70#include <string.h> 71#include <unistd.h> 72 73static struct { 74 char *name; 75 u_long flag; 76 int invert; 77} mapping[] = { 78 /* shorter names per flag first, all prefixed by "no" */ 79 { "nosappnd", SF_APPEND, 0 }, 80 { "nosappend", SF_APPEND, 0 }, 81 { "noarch", SF_ARCHIVED, 0 }, 82 { "noarchived", SF_ARCHIVED, 0 }, 83 { "noschg", SF_IMMUTABLE, 0 }, 84 { "noschange", SF_IMMUTABLE, 0 }, 85 { "nosimmutable", SF_IMMUTABLE, 0 }, 86 { "nouappnd", UF_APPEND, 0 }, 87 { "nouappend", UF_APPEND, 0 }, 88 { "nouchg", UF_IMMUTABLE, 0 }, 89 { "nouchange", UF_IMMUTABLE, 0 }, 90 { "nouimmutable", UF_IMMUTABLE, 0 }, 91 { "nodump", UF_NODUMP, 1 }, 92 { "noopaque", UF_OPAQUE, 0 }, 93 { "nohidden", UF_HIDDEN, 0 }, 94 { "nocompressed", UF_COMPRESSED, 0 }, 95}; 96#define longestflaglen 12 97#define nmappings (sizeof(mapping) / sizeof(mapping[0])) 98 99/* 100 * fflagstostr -- 101 * Convert file flags to a comma-separated string. If no flags 102 * are set, return the empty string. 103 */ 104char * 105fflagstostr(flags) 106 u_long flags; 107{ 108 char *string; 109 char *sp, *dp; 110 u_long setflags; 111 int i; 112 113 if ((string = (char *)malloc(nmappings * (longestflaglen + 1))) == NULL) 114 return (NULL); 115 116 setflags = flags; 117 dp = string; 118 for (i = 0; i < nmappings; i++) { 119 if (setflags & mapping[i].flag) { 120 if (dp > string) 121 *dp++ = ','; 122 for (sp = mapping[i].invert ? mapping[i].name : 123 mapping[i].name + 2; *sp; *dp++ = *sp++) ; 124 setflags &= ~mapping[i].flag; 125 } 126 } 127 *dp = '\0'; 128 return (string); 129} 130 131/* 132 * strtofflags -- 133 * Take string of arguments and return file flags. Return 0 on 134 * success, 1 on failure. On failure, stringp is set to point 135 * to the offending token. 136 */ 137int 138strtofflags(stringp, setp, clrp) 139 char **stringp; 140 u_long *setp, *clrp; 141{ 142 char *string, *p; 143 int i; 144 145 if (setp) 146 *setp = 0; 147 if (clrp) 148 *clrp = 0; 149 string = *stringp; 150 while ((p = strsep(&string, "\t ,")) != NULL) { 151 *stringp = p; 152 if (*p == '\0') 153 continue; 154 for (i = 0; i < nmappings; i++) { 155 if (strcmp(p, mapping[i].name + 2) == 0) { 156 if (mapping[i].invert) { 157 if (clrp) 158 *clrp |= mapping[i].flag; 159 } else { 160 if (setp) 161 *setp |= mapping[i].flag; 162 } 163 break; 164 } else if (strcmp(p, mapping[i].name) == 0) { 165 if (mapping[i].invert) { 166 if (setp) 167 *setp |= mapping[i].flag; 168 } else { 169 if (clrp) 170 *clrp |= mapping[i].flag; 171 } 172 break; 173 } 174 } 175 if (i == nmappings) 176 return 1; 177 } 178 return 0; 179} 180