]>
Commit | Line | Data |
---|---|---|
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 | |
58 | static char sccsid[] = "@(#)stat_flags.c 8.1 (Berkeley) 5/31/93"; | |
59 | static const char rcsid[] = | |
60 | "$FreeBSD: src/lib/libc/gen/strtofflags.c,v 1.18.2.1 2000/06/28 01:52:24 joe Exp $"; | |
61 | #endif | |
62 | #endif /* not lint */ | |
63 | ||
64 | #include <sys/types.h> | |
65 | #include <sys/stat.h> | |
66 | ||
67 | #include <stddef.h> | |
68 | #include <stdlib.h> | |
69 | #include <string.h> | |
70 | #include <unistd.h> | |
71 | ||
72 | static struct { | |
73 | char *name; | |
74 | u_long flag; | |
75 | int invert; | |
76 | } mapping[] = { | |
77 | /* shorter names per flag first, all prefixed by "no" */ | |
78 | { "nosappnd", SF_APPEND, 0 }, | |
79 | { "nosappend", SF_APPEND, 0 }, | |
80 | { "noarch", SF_ARCHIVED, 0 }, | |
81 | { "noarchived", SF_ARCHIVED, 0 }, | |
82 | { "noschg", SF_IMMUTABLE, 0 }, | |
83 | { "noschange", SF_IMMUTABLE, 0 }, | |
84 | { "nosimmutable", SF_IMMUTABLE, 0 }, | |
85 | { "norestricted", SF_RESTRICTED, 0 }, | |
86 | { "nosunlnk", SF_NOUNLINK, 0 }, | |
87 | { "nosunlink", SF_NOUNLINK, 0 }, | |
88 | { "nouappnd", UF_APPEND, 0 }, | |
89 | { "nouappend", UF_APPEND, 0 }, | |
90 | { "nouchg", UF_IMMUTABLE, 0 }, | |
91 | { "nouchange", UF_IMMUTABLE, 0 }, | |
92 | { "nouimmutable", UF_IMMUTABLE, 0 }, | |
93 | { "nodump", UF_NODUMP, 1 }, | |
94 | { "noopaque", UF_OPAQUE, 0 }, | |
95 | { "nohidden", UF_HIDDEN, 0 }, | |
96 | { "nocompressed", UF_COMPRESSED, 0 }, | |
97 | { "nodatavault", UF_DATAVAULT, 0 }, | |
98 | { "nodataless", SF_DATALESS, 0 }, | |
99 | }; | |
100 | #define longestflaglen 12 | |
101 | #define nmappings (sizeof(mapping) / sizeof(mapping[0])) | |
102 | ||
103 | /* | |
104 | * fflagstostr -- | |
105 | * Convert file flags to a comma-separated string. If no flags | |
106 | * are set, return the empty string. | |
107 | */ | |
108 | char * | |
109 | fflagstostr(flags) | |
110 | u_long flags; | |
111 | { | |
112 | char *string; | |
113 | char *sp, *dp; | |
114 | u_long setflags; | |
115 | int i; | |
116 | ||
117 | if ((string = (char *)malloc(nmappings * (longestflaglen + 1))) == NULL) | |
118 | return (NULL); | |
119 | ||
120 | setflags = flags; | |
121 | dp = string; | |
122 | for (i = 0; i < nmappings; i++) { | |
123 | if (setflags & mapping[i].flag) { | |
124 | if (dp > string) | |
125 | *dp++ = ','; | |
126 | for (sp = mapping[i].invert ? mapping[i].name : | |
127 | mapping[i].name + 2; *sp; *dp++ = *sp++) ; | |
128 | setflags &= ~mapping[i].flag; | |
129 | } | |
130 | } | |
131 | *dp = '\0'; | |
132 | return (string); | |
133 | } | |
134 | ||
135 | /* | |
136 | * strtofflags -- | |
137 | * Take string of arguments and return file flags. Return 0 on | |
138 | * success, 1 on failure. On failure, stringp is set to point | |
139 | * to the offending token. | |
140 | */ | |
141 | int | |
142 | strtofflags(stringp, setp, clrp) | |
143 | char **stringp; | |
144 | u_long *setp, *clrp; | |
145 | { | |
146 | char *string, *p; | |
147 | int i; | |
148 | ||
149 | if (setp) | |
150 | *setp = 0; | |
151 | if (clrp) | |
152 | *clrp = 0; | |
153 | string = *stringp; | |
154 | while ((p = strsep(&string, "\t ,")) != NULL) { | |
155 | *stringp = p; | |
156 | if (*p == '\0') | |
157 | continue; | |
158 | for (i = 0; i < nmappings; i++) { | |
159 | if (strcmp(p, mapping[i].name + 2) == 0) { | |
160 | if (mapping[i].invert) { | |
161 | if (clrp) | |
162 | *clrp |= mapping[i].flag; | |
163 | } else { | |
164 | if (setp) | |
165 | *setp |= mapping[i].flag; | |
166 | } | |
167 | break; | |
168 | } else if (strcmp(p, mapping[i].name) == 0) { | |
169 | if (mapping[i].invert) { | |
170 | if (setp) | |
171 | *setp |= mapping[i].flag; | |
172 | } else { | |
173 | if (clrp) | |
174 | *clrp |= mapping[i].flag; | |
175 | } | |
176 | break; | |
177 | } | |
178 | } | |
179 | if (i == nmappings) | |
180 | return 1; | |
181 | } | |
182 | return 0; | |
183 | } |