spec.c revision 1.23 1 1.23 lukem /* $NetBSD: spec.c,v 1.23 2001/07/18 04:51:54 lukem Exp $ */
2 1.6 cgd
3 1.1 cgd /*-
4 1.5 cgd * Copyright (c) 1989, 1993
5 1.5 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.11 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.6 cgd #if 0
39 1.10 mrg static char sccsid[] = "@(#)spec.c 8.2 (Berkeley) 4/28/95";
40 1.6 cgd #else
41 1.23 lukem __RCSID("$NetBSD: spec.c,v 1.23 2001/07/18 04:51:54 lukem Exp $");
42 1.6 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #include <sys/types.h>
46 1.3 cgd #include <sys/stat.h>
47 1.21 simonb
48 1.11 lukem #include <ctype.h>
49 1.11 lukem #include <errno.h>
50 1.3 cgd #include <fts.h>
51 1.11 lukem #include <grp.h>
52 1.1 cgd #include <pwd.h>
53 1.11 lukem #include <stdio.h>
54 1.11 lukem #include <string.h>
55 1.3 cgd #include <unistd.h>
56 1.18 wennmach #include <vis.h>
57 1.11 lukem
58 1.1 cgd #include "mtree.h"
59 1.3 cgd #include "extern.h"
60 1.1 cgd
61 1.3 cgd int lineno; /* Current spec line number. */
62 1.1 cgd
63 1.21 simonb static void set(char *, NODE *);
64 1.21 simonb static void unset(char *, NODE *);
65 1.1 cgd
66 1.3 cgd NODE *
67 1.21 simonb spec(void)
68 1.1 cgd {
69 1.11 lukem NODE *centry, *last;
70 1.11 lukem char *p;
71 1.3 cgd NODE ginfo, *root;
72 1.3 cgd int c_cur, c_next;
73 1.1 cgd char buf[2048];
74 1.1 cgd
75 1.3 cgd root = NULL;
76 1.11 lukem centry = last = NULL;
77 1.11 lukem memset(&ginfo, 0, sizeof(ginfo));
78 1.3 cgd c_cur = c_next = 0;
79 1.3 cgd for (lineno = 1; fgets(buf, sizeof(buf), stdin);
80 1.3 cgd ++lineno, c_cur = c_next, c_next = 0) {
81 1.3 cgd /* Skip empty lines. */
82 1.3 cgd if (buf[0] == '\n')
83 1.3 cgd continue;
84 1.3 cgd
85 1.3 cgd /* Find end of line. */
86 1.11 lukem if ((p = strchr(buf, '\n')) == NULL)
87 1.13 wsanchez mtree_err("line %d too long", lineno);
88 1.3 cgd
89 1.3 cgd /* See if next line is continuation line. */
90 1.3 cgd if (p[-1] == '\\') {
91 1.3 cgd --p;
92 1.3 cgd c_next = 1;
93 1.1 cgd }
94 1.3 cgd
95 1.3 cgd /* Null-terminate the line. */
96 1.1 cgd *p = '\0';
97 1.3 cgd
98 1.3 cgd /* Skip leading whitespace. */
99 1.16 christos for (p = buf; *p && isspace((unsigned char)*p); ++p);
100 1.3 cgd
101 1.3 cgd /* If nothing but whitespace or comment char, continue. */
102 1.1 cgd if (!*p || *p == '#')
103 1.1 cgd continue;
104 1.1 cgd
105 1.3 cgd #ifdef DEBUG
106 1.3 cgd (void)fprintf(stderr, "line %d: {%s}\n", lineno, p);
107 1.3 cgd #endif
108 1.3 cgd if (c_cur) {
109 1.3 cgd set(p, centry);
110 1.3 cgd continue;
111 1.3 cgd }
112 1.3 cgd
113 1.3 cgd /* Grab file name, "$", "set", or "unset". */
114 1.3 cgd if ((p = strtok(p, "\n\t ")) == NULL)
115 1.13 wsanchez mtree_err("missing field");
116 1.1 cgd
117 1.23 lukem if (p[0] == '/') {
118 1.23 lukem if (strcmp(p + 1, "set") == 0)
119 1.3 cgd set(NULL, &ginfo);
120 1.23 lukem else if (strcmp(p + 1, "unset") == 0)
121 1.3 cgd unset(NULL, &ginfo);
122 1.23 lukem else
123 1.23 lukem mtree_err("invalid specification `%s'", p);
124 1.23 lukem continue;
125 1.23 lukem }
126 1.1 cgd
127 1.11 lukem if (strchr(p, '/'))
128 1.13 wsanchez mtree_err("slash character in file name");
129 1.1 cgd
130 1.1 cgd if (!strcmp(p, "..")) {
131 1.3 cgd /* Don't go up, if haven't gone down. */
132 1.1 cgd if (!root)
133 1.3 cgd goto noparent;
134 1.1 cgd if (last->type != F_DIR || last->flags & F_DONE) {
135 1.1 cgd if (last == root)
136 1.3 cgd goto noparent;
137 1.1 cgd last = last->parent;
138 1.1 cgd }
139 1.1 cgd last->flags |= F_DONE;
140 1.1 cgd continue;
141 1.3 cgd
142 1.13 wsanchez noparent: mtree_err("no parent node");
143 1.1 cgd }
144 1.1 cgd
145 1.3 cgd if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL)
146 1.13 wsanchez mtree_err("%s", strerror(errno));
147 1.1 cgd *centry = ginfo;
148 1.18 wennmach if (strunvis(centry->name, p) == -1)
149 1.22 christos mtree_err("strunvis failed on `%s'", p);
150 1.1 cgd #define MAGIC "?*["
151 1.1 cgd if (strpbrk(p, MAGIC))
152 1.1 cgd centry->flags |= F_MAGIC;
153 1.3 cgd set(NULL, centry);
154 1.1 cgd
155 1.1 cgd if (!root) {
156 1.1 cgd last = root = centry;
157 1.1 cgd root->parent = root;
158 1.1 cgd } else if (last->type == F_DIR && !(last->flags & F_DONE)) {
159 1.1 cgd centry->parent = last;
160 1.1 cgd last = last->child = centry;
161 1.1 cgd } else {
162 1.1 cgd centry->parent = last->parent;
163 1.1 cgd centry->prev = last;
164 1.1 cgd last = last->next = centry;
165 1.1 cgd }
166 1.1 cgd }
167 1.3 cgd return (root);
168 1.1 cgd }
169 1.1 cgd
170 1.3 cgd static void
171 1.21 simonb set(char *t, NODE *ip)
172 1.1 cgd {
173 1.11 lukem int type;
174 1.15 jwise char *kw, *val, *md;
175 1.3 cgd struct group *gr;
176 1.3 cgd struct passwd *pw;
177 1.19 enami void *m;
178 1.3 cgd int value;
179 1.3 cgd char *ep;
180 1.3 cgd
181 1.11 lukem val = NULL;
182 1.9 mikel for (; (kw = strtok(t, "= \t\n")) != NULL; t = NULL) {
183 1.3 cgd ip->flags |= type = parsekey(kw, &value);
184 1.3 cgd if (value && (val = strtok(NULL, " \t\n")) == NULL)
185 1.13 wsanchez mtree_err("missing value");
186 1.1 cgd switch(type) {
187 1.1 cgd case F_CKSUM:
188 1.3 cgd ip->cksum = strtoul(val, &ep, 10);
189 1.3 cgd if (*ep)
190 1.22 christos mtree_err("invalid checksum `%s'", val);
191 1.14 mrg break;
192 1.14 mrg case F_FLAGS:
193 1.14 mrg if (strcmp("none", val) == 0)
194 1.14 mrg ip->st_flags = 0;
195 1.14 mrg else if (string_to_flags(&val, &ip->st_flags, NULL) != 0)
196 1.22 christos mtree_err("invalid flag `%s'", val);
197 1.3 cgd break;
198 1.3 cgd case F_GID:
199 1.8 mikel ip->st_gid = (gid_t)strtoul(val, &ep, 10);
200 1.3 cgd if (*ep)
201 1.22 christos mtree_err("invalid gid `%s'", val);
202 1.3 cgd break;
203 1.3 cgd case F_GNAME:
204 1.3 cgd if ((gr = getgrnam(val)) == NULL)
205 1.22 christos mtree_err("unknown group `%s'", val);
206 1.3 cgd ip->st_gid = gr->gr_gid;
207 1.1 cgd break;
208 1.1 cgd case F_IGN:
209 1.1 cgd /* just set flag bit */
210 1.1 cgd break;
211 1.15 jwise case F_MD5:
212 1.15 jwise if (val[0]=='0' && val[1]=='x')
213 1.15 jwise md=&val[2];
214 1.15 jwise else
215 1.15 jwise md=val;
216 1.15 jwise if ((ip->md5sum = strdup(md)) == NULL)
217 1.15 jwise mtree_err("memory allocation error");
218 1.15 jwise break;
219 1.3 cgd case F_MODE:
220 1.3 cgd if ((m = setmode(val)) == NULL)
221 1.22 christos mtree_err("invalid file mode `%s'", val);
222 1.1 cgd ip->st_mode = getmode(m, 0);
223 1.12 itohy free(m);
224 1.1 cgd break;
225 1.1 cgd case F_NLINK:
226 1.8 mikel ip->st_nlink = (nlink_t)strtoul(val, &ep, 10);
227 1.3 cgd if (*ep)
228 1.22 christos mtree_err("invalid link count `%s'", val);
229 1.1 cgd break;
230 1.1 cgd case F_SIZE:
231 1.8 mikel ip->st_size = (off_t)strtoq(val, &ep, 10);
232 1.3 cgd if (*ep)
233 1.22 christos mtree_err("invalid size `%s'", val);
234 1.1 cgd break;
235 1.1 cgd case F_SLINK:
236 1.3 cgd if ((ip->slink = strdup(val)) == NULL)
237 1.15 jwise mtree_err("memory allocation error");
238 1.1 cgd break;
239 1.1 cgd case F_TIME:
240 1.8 mikel ip->st_mtimespec.tv_sec =
241 1.8 mikel (time_t)strtoul(val, &ep, 10);
242 1.5 cgd if (*ep != '.')
243 1.22 christos mtree_err("invalid time `%s'", val);
244 1.5 cgd val = ep + 1;
245 1.8 mikel ip->st_mtimespec.tv_nsec = strtol(val, &ep, 10);
246 1.3 cgd if (*ep)
247 1.22 christos mtree_err("invalid time `%s'", val);
248 1.1 cgd break;
249 1.1 cgd case F_TYPE:
250 1.23 lukem ip->type = parsetype(val);
251 1.1 cgd break;
252 1.3 cgd case F_UID:
253 1.8 mikel ip->st_uid = (uid_t)strtoul(val, &ep, 10);
254 1.3 cgd if (*ep)
255 1.22 christos mtree_err("invalid uid `%s'", val);
256 1.3 cgd break;
257 1.3 cgd case F_UNAME:
258 1.3 cgd if ((pw = getpwnam(val)) == NULL)
259 1.22 christos mtree_err("unknown user `%s'", val);
260 1.3 cgd ip->st_uid = pw->pw_uid;
261 1.3 cgd break;
262 1.1 cgd }
263 1.1 cgd }
264 1.1 cgd }
265 1.1 cgd
266 1.3 cgd static void
267 1.21 simonb unset(char *t, NODE *ip)
268 1.1 cgd {
269 1.11 lukem char *p;
270 1.1 cgd
271 1.9 mikel while ((p = strtok(t, "\n\t ")) != NULL)
272 1.3 cgd ip->flags &= ~parsekey(p, NULL);
273 1.1 cgd }
274