xref: /dragonfly/lib/libc/gen/strtofflags.c (revision 0f0f9bbde24983743d4bf075a2eb5053fe4690c2)
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. Neither the name of the University nor the names of its contributors
14  *    may be used to endorse or promote products derived from this software
15  *    without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27  * SUCH DAMAGE.
28  *
29  * @(#)stat_flags.c 8.1 (Berkeley) 5/31/93
30  * $FreeBSD: src/lib/libc/gen/strtofflags.c,v 1.18.2.1 2000/06/28 01:52:24 joe Exp $
31  * $DragonFly: src/lib/libc/gen/strtofflags.c,v 1.5 2008/06/02 20:17:07 dillon Exp $
32  */
33 
34 #include <sys/types.h>
35 #include <sys/stat.h>
36 
37 #include <stddef.h>
38 #include <stdlib.h>
39 #include <string.h>
40 #include <unistd.h>
41 
42 static struct {
43           const char *name;
44           u_long flag;
45           int invert;
46 } mapping[] = {
47           /* shorter names per flag first, all prefixed by "no" */
48           { "nosappnd",                 SF_APPEND,          0 },
49           { "nosappend",                SF_APPEND,          0 },
50           { "noarch",                   SF_ARCHIVED,        0 },
51           { "noarchived",               SF_ARCHIVED,        0 },
52           { "noschg",                   SF_IMMUTABLE,       0 },
53           { "noschange",                SF_IMMUTABLE,       0 },
54 #ifdef SF_NOHISTORY
55           { "noshistory",               SF_NOHISTORY,       1 },
56 #endif
57           { "nosimmutable",   SF_IMMUTABLE,       0 },
58           { "nosunlnk",                 SF_NOUNLINK,        1 },
59           { "nosunlink",                SF_NOUNLINK,        1 },
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 #ifdef UF_NOHISTORY
68           { "nouhistory",               UF_NOHISTORY,       1 },
69           { "nohistory",                UF_NOHISTORY,       1 },
70 #endif
71           { "nouunlnk",                 UF_NOUNLINK,        1 },
72           { "nouunlink",                UF_NOUNLINK,        1 },
73 #ifdef UF_CACHE
74           { "nocache",                  UF_CACHE, 0 },
75           { "noucache",                 UF_CACHE, 0 },
76           { "noscache",                 SF_NOCACHE,         1 },
77 #endif
78 #ifdef UF_XLINK
79           { "noxlink",                  UF_XLINK, 0 },
80           { "nouxlink",                 UF_XLINK, 0 },
81           { "nosxlink",                 SF_XLINK, 0 },
82 #endif
83 };
84 #define longestflaglen        12
85 #define nmappings   (sizeof(mapping) / sizeof(mapping[0]))
86 
87 /*
88  * fflagstostr --
89  *        Convert file flags to a comma-separated string.  If no flags
90  *        are set, return the empty string.
91  */
92 char *
fflagstostr(u_long flags)93 fflagstostr(u_long flags)
94 {
95           char *string;
96           const char *sp;
97           char *dp;
98           u_long setflags;
99           u_int i;
100 
101           if ((string = (char *)malloc(nmappings * (longestflaglen + 1))) == NULL)
102                     return (NULL);
103 
104           setflags = flags;
105           dp = string;
106           for (i = 0; i < nmappings; i++) {
107                     if (setflags & mapping[i].flag) {
108                               if (dp > string)
109                                         *dp++ = ',';
110                               for (sp = mapping[i].invert ? mapping[i].name :
111                                   mapping[i].name + 2; *sp; *dp++ = *sp++) ;
112                               setflags &= ~mapping[i].flag;
113                     }
114           }
115           *dp = '\0';
116           return (string);
117 }
118 
119 /*
120  * strtofflags --
121  *        Take string of arguments and return file flags.  Return 0 on
122  *        success, 1 on failure.  On failure, stringp is set to point
123  *        to the offending token.
124  */
125 int
strtofflags(char ** stringp,u_long * setp,u_long * clrp)126 strtofflags(char **stringp, u_long *setp, u_long *clrp)
127 {
128           char *string, *p;
129           u_int i;
130 
131           if (setp)
132                     *setp = 0;
133           if (clrp)
134                     *clrp = 0;
135           string = *stringp;
136           while ((p = strsep(&string, "\t ,")) != NULL) {
137                     *stringp = p;
138                     if (*p == '\0')
139                               continue;
140                     for (i = 0; i < nmappings; i++) {
141                               if (strcmp(p, mapping[i].name + 2) == 0) {
142                                         if (mapping[i].invert) {
143                                                   if (clrp)
144                                                             *clrp |= mapping[i].flag;
145                                         } else {
146                                                   if (setp)
147                                                             *setp |= mapping[i].flag;
148                                         }
149                                         break;
150                               } else if (strcmp(p, mapping[i].name) == 0) {
151                                         if (mapping[i].invert) {
152                                                   if (setp)
153                                                             *setp |= mapping[i].flag;
154                                         } else {
155                                                   if (clrp)
156                                                             *clrp |= mapping[i].flag;
157                                         }
158                                         break;
159                               }
160                     }
161                     if (i == nmappings)
162                               return 1;
163           }
164           return 0;
165 }
166