| | 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.4 2005/11/19 22:32:53 swildner 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 | #include <unistd.h> |
| | 45 | |
| | 46 | static struct { |
| | 47 | char *name; |
| | 48 | u_long flag; |
| | 49 | int invert; |
| | 50 | } mapping[] = { |
| | 51 | /* shorter names per flag first, all prefixed by "no" */ |
| | 52 | { "nosappnd", SF_APPEND, 0 }, |
| | 53 | { "nosappend", SF_APPEND, 0 }, |
| | 54 | { "noarch", SF_ARCHIVED, 0 }, |
| | 55 | { "noarchived", SF_ARCHIVED, 0 }, |
| | 56 | { "noschg", SF_IMMUTABLE, 0 }, |
| | 57 | { "noschange", SF_IMMUTABLE, 0 }, |
| | 58 | { "nosimmutable", SF_IMMUTABLE, 0 }, |
| | 59 | { "nosunlnk", SF_NOUNLINK, 0 }, |
| | 60 | { "nosunlink", SF_NOUNLINK, 0 }, |
| | 61 | { "nouappnd", UF_APPEND, 0 }, |
| | 62 | { "nouappend", UF_APPEND, 0 }, |
| | 63 | { "nouchg", UF_IMMUTABLE, 0 }, |
| | 64 | { "nouchange", UF_IMMUTABLE, 0 }, |
| | 65 | { "nouimmutable", UF_IMMUTABLE, 0 }, |
| | 66 | { "nodump", UF_NODUMP, 1 }, |
| | 67 | { "noopaque", UF_OPAQUE, 0 }, |
| | 68 | { "nouunlnk", UF_NOUNLINK, 0 }, |
| | 69 | { "nouunlink", UF_NOUNLINK, 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 | */ |
| | 79 | char * |
| | 80 | fflagstostr(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(char **stringp, u_long *setp, u_long *clrp) |
| | 113 | { |
| | 114 | char *string, *p; |
| | 115 | int i; |
| | 116 | |
| | 117 | if (setp) |
| | 118 | *setp = 0; |
| | 119 | if (clrp) |
| | 120 | *clrp = 0; |
| | 121 | string = *stringp; |
| | 122 | while ((p = strsep(&string, "\t ,")) != NULL) { |
| | 123 | *stringp = p; |
| | 124 | if (*p == '\0') |
| | 125 | continue; |
| | 126 | for (i = 0; i < nmappings; i++) { |
| | 127 | if (strcmp(p, mapping[i].name + 2) == 0) { |
| | 128 | if (mapping[i].invert) { |
| | 129 | if (clrp) |
| | 130 | *clrp |= mapping[i].flag; |
| | 131 | } else { |
| | 132 | if (setp) |
| | 133 | *setp |= mapping[i].flag; |
| | 134 | } |
| | 135 | break; |
| | 136 | } else if (strcmp(p, mapping[i].name) == 0) { |
| | 137 | if (mapping[i].invert) { |
| | 138 | if (setp) |
| | 139 | *setp |= mapping[i].flag; |
| | 140 | } else { |
| | 141 | if (clrp) |
| | 142 | *clrp |= mapping[i].flag; |
| | 143 | } |
| | 144 | break; |
| | 145 | } |
| | 146 | } |
| | 147 | if (i == nmappings) |
| | 148 | return 1; |
| | 149 | } |
| | 150 | return 0; |
| | 151 | } |
projects / dragonfly.git / blame_incremental