]> git.saurik.com Git - apple/libc.git/blame - gen/strtofflags.c
Libc-262.3.2.tar.gz
[apple/libc.git] / gen / strtofflags.c
CommitLineData
5b2abdfb
A
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
36static char sccsid[] = "@(#)stat_flags.c 8.1 (Berkeley) 5/31/93";
37#else
38static const char rcsid[] =
39 "$FreeBSD: src/lib/libc/gen/strtofflags.c,v 1.18.2.1 2000/06/28 01:52:24 joe Exp $";
40#endif
41#endif /* not lint */
42
43#include <sys/types.h>
44#include <sys/stat.h>
45
46#include <stddef.h>
47#include <stdlib.h>
48#include <string.h>
49
50static struct {
51 char *name;
52 u_long flag;
53 int invert;
54} mapping[] = {
55 /* shorter names per flag first, all prefixed by "no" */
56 { "nosappnd", SF_APPEND, 0 },
57 { "nosappend", SF_APPEND, 0 },
58 { "noarch", SF_ARCHIVED, 0 },
59 { "noarchived", SF_ARCHIVED, 0 },
60 { "noschg", SF_IMMUTABLE, 0 },
61 { "noschange", SF_IMMUTABLE, 0 },
62 { "nosimmutable", SF_IMMUTABLE, 0 },
63 { "nouappnd", UF_APPEND, 0 },
64 { "nouappend", UF_APPEND, 0 },
65 { "nouchg", UF_IMMUTABLE, 0 },
66 { "nouchange", UF_IMMUTABLE, 0 },
67 { "nouimmutable", UF_IMMUTABLE, 0 },
68 { "nodump", UF_NODUMP, 1 },
69 { "noopaque", UF_OPAQUE, 0 },
70};
71#define longestflaglen 12
72#define nmappings (sizeof(mapping) / sizeof(mapping[0]))
73
74/*
75 * fflagstostr --
76 * Convert file flags to a comma-separated string. If no flags
77 * are set, return the empty string.
78 */
79char *
80fflagstostr(flags)
81 u_long flags;
82{
83 char *string;
84 char *sp, *dp;
85 u_long setflags;
86 int i;
87
88 if ((string = (char *)malloc(nmappings * (longestflaglen + 1))) == NULL)
89 return (NULL);
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 (string);
104}
105
106/*
107 * strtofflags --
108 * Take string of arguments and return file flags. Return 0 on
109 * success, 1 on failure. On failure, stringp is set to point
110 * to the offending token.
111 */
112int
113strtofflags(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}