utilities.c revision 1.23 1 1.23 dholland /* $NetBSD: utilities.c,v 1.23 2013/01/22 09:39:13 dholland Exp $ */
2 1.9 cgd
3 1.1 cgd /*
4 1.5 mycroft * Copyright (c) 1983, 1993
5 1.5 mycroft * 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.17 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.12 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.9 cgd #if 0
35 1.13 lukem static char sccsid[] = "@(#)utilities.c 8.5 (Berkeley) 4/28/95";
36 1.9 cgd #else
37 1.23 dholland __RCSID("$NetBSD: utilities.c,v 1.23 2013/01/22 09:39:13 dholland Exp $");
38 1.9 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.3 cgd #include <sys/param.h>
42 1.3 cgd #include <sys/stat.h>
43 1.3 cgd
44 1.5 mycroft #include <ufs/ufs/dinode.h>
45 1.5 mycroft #include <ufs/ufs/dir.h>
46 1.3 cgd
47 1.18 bouyer #include <err.h>
48 1.3 cgd #include <errno.h>
49 1.3 cgd #include <stdio.h>
50 1.3 cgd #include <stdlib.h>
51 1.3 cgd #include <string.h>
52 1.3 cgd #include <unistd.h>
53 1.3 cgd
54 1.1 cgd #include "restore.h"
55 1.3 cgd #include "extern.h"
56 1.1 cgd
57 1.1 cgd /*
58 1.1 cgd * Insure that all the components of a pathname exist.
59 1.1 cgd */
60 1.3 cgd void
61 1.19 xtraeme pathcheck(char *name)
62 1.1 cgd {
63 1.11 lukem char *cp;
64 1.1 cgd struct entry *ep;
65 1.1 cgd char *start;
66 1.1 cgd
67 1.6 mycroft start = strchr(name, '/');
68 1.1 cgd if (start == 0)
69 1.1 cgd return;
70 1.1 cgd for (cp = start; *cp != '\0'; cp++) {
71 1.1 cgd if (*cp != '/')
72 1.1 cgd continue;
73 1.1 cgd *cp = '\0';
74 1.1 cgd ep = lookupname(name);
75 1.3 cgd if (ep == NULL) {
76 1.5 mycroft /* Safe; we know the pathname exists in the dump. */
77 1.3 cgd ep = addentry(name, pathsearch(name)->d_ino, NODE);
78 1.1 cgd newnode(ep);
79 1.1 cgd }
80 1.1 cgd ep->e_flags |= NEW|KEEP;
81 1.1 cgd *cp = '/';
82 1.1 cgd }
83 1.1 cgd }
84 1.1 cgd
85 1.1 cgd /*
86 1.1 cgd * Change a name to a unique temporary name.
87 1.1 cgd */
88 1.3 cgd void
89 1.19 xtraeme mktempname(struct entry *ep)
90 1.1 cgd {
91 1.1 cgd char oldname[MAXPATHLEN];
92 1.1 cgd
93 1.1 cgd if (ep->e_flags & TMPNAME)
94 1.1 cgd badentry(ep, "mktempname: called with TMPNAME");
95 1.1 cgd ep->e_flags |= TMPNAME;
96 1.1 cgd (void) strcpy(oldname, myname(ep));
97 1.1 cgd freename(ep->e_name);
98 1.1 cgd ep->e_name = savename(gentempname(ep));
99 1.1 cgd ep->e_namlen = strlen(ep->e_name);
100 1.1 cgd renameit(oldname, myname(ep));
101 1.1 cgd }
102 1.1 cgd
103 1.1 cgd /*
104 1.1 cgd * Generate a temporary name for an entry.
105 1.1 cgd */
106 1.1 cgd char *
107 1.19 xtraeme gentempname(struct entry *ep)
108 1.1 cgd {
109 1.1 cgd static char name[MAXPATHLEN];
110 1.1 cgd struct entry *np;
111 1.1 cgd long i = 0;
112 1.1 cgd
113 1.3 cgd for (np = lookupino(ep->e_ino);
114 1.3 cgd np != NULL && np != ep; np = np->e_links)
115 1.1 cgd i++;
116 1.3 cgd if (np == NULL)
117 1.1 cgd badentry(ep, "not on ino list");
118 1.22 christos (void)snprintf(name, sizeof(name), "%s%ld%llu", TMPHDR, (long) i,
119 1.22 christos (unsigned long long)ep->e_ino);
120 1.1 cgd return (name);
121 1.1 cgd }
122 1.1 cgd
123 1.1 cgd /*
124 1.1 cgd * Rename a file or directory.
125 1.1 cgd */
126 1.3 cgd void
127 1.21 christos renameit(char *from, const char *to)
128 1.1 cgd {
129 1.1 cgd if (!Nflag && rename(from, to) < 0) {
130 1.3 cgd fprintf(stderr, "warning: cannot rename %s to %s: %s\n",
131 1.3 cgd from, to, strerror(errno));
132 1.1 cgd return;
133 1.1 cgd }
134 1.1 cgd vprintf(stdout, "rename %s to %s\n", from, to);
135 1.1 cgd }
136 1.1 cgd
137 1.1 cgd /*
138 1.1 cgd * Create a new node (directory).
139 1.1 cgd */
140 1.3 cgd void
141 1.19 xtraeme newnode(struct entry *np)
142 1.1 cgd {
143 1.1 cgd char *cp;
144 1.1 cgd
145 1.1 cgd if (np->e_type != NODE)
146 1.1 cgd badentry(np, "newnode: not a node");
147 1.1 cgd cp = myname(np);
148 1.1 cgd if (!Nflag && mkdir(cp, 0777) < 0) {
149 1.1 cgd np->e_flags |= EXISTED;
150 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
151 1.1 cgd return;
152 1.1 cgd }
153 1.1 cgd vprintf(stdout, "Make node %s\n", cp);
154 1.1 cgd }
155 1.1 cgd
156 1.1 cgd /*
157 1.1 cgd * Remove an old node (directory).
158 1.1 cgd */
159 1.3 cgd void
160 1.19 xtraeme removenode(struct entry *ep)
161 1.1 cgd {
162 1.1 cgd char *cp;
163 1.1 cgd
164 1.1 cgd if (ep->e_type != NODE)
165 1.1 cgd badentry(ep, "removenode: not a node");
166 1.3 cgd if (ep->e_entries != NULL)
167 1.1 cgd badentry(ep, "removenode: non-empty directory");
168 1.1 cgd ep->e_flags |= REMOVED;
169 1.1 cgd ep->e_flags &= ~TMPNAME;
170 1.1 cgd cp = myname(ep);
171 1.1 cgd if (!Nflag && rmdir(cp) < 0) {
172 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
173 1.1 cgd return;
174 1.1 cgd }
175 1.1 cgd vprintf(stdout, "Remove node %s\n", cp);
176 1.1 cgd }
177 1.1 cgd
178 1.1 cgd /*
179 1.1 cgd * Remove a leaf.
180 1.1 cgd */
181 1.3 cgd void
182 1.19 xtraeme removeleaf(struct entry *ep)
183 1.1 cgd {
184 1.1 cgd char *cp;
185 1.1 cgd
186 1.1 cgd if (ep->e_type != LEAF)
187 1.1 cgd badentry(ep, "removeleaf: not a leaf");
188 1.1 cgd ep->e_flags |= REMOVED;
189 1.1 cgd ep->e_flags &= ~TMPNAME;
190 1.1 cgd cp = myname(ep);
191 1.1 cgd if (!Nflag && unlink(cp) < 0) {
192 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
193 1.1 cgd return;
194 1.1 cgd }
195 1.1 cgd vprintf(stdout, "Remove leaf %s\n", cp);
196 1.1 cgd }
197 1.1 cgd
198 1.1 cgd /*
199 1.1 cgd * Create a link.
200 1.1 cgd */
201 1.3 cgd int
202 1.19 xtraeme linkit(char *existing, char *new, int type)
203 1.1 cgd {
204 1.1 cgd
205 1.1 cgd if (type == SYMLINK) {
206 1.1 cgd if (!Nflag && symlink(existing, new) < 0) {
207 1.1 cgd fprintf(stderr,
208 1.3 cgd "warning: cannot create symbolic link %s->%s: %s\n",
209 1.3 cgd new, existing, strerror(errno));
210 1.1 cgd return (FAIL);
211 1.1 cgd }
212 1.1 cgd } else if (type == HARDLINK) {
213 1.1 cgd if (!Nflag && link(existing, new) < 0) {
214 1.1 cgd fprintf(stderr,
215 1.3 cgd "warning: cannot create hard link %s->%s: %s\n",
216 1.3 cgd new, existing, strerror(errno));
217 1.1 cgd return (FAIL);
218 1.1 cgd }
219 1.1 cgd } else {
220 1.1 cgd panic("linkit: unknown type %d\n", type);
221 1.1 cgd return (FAIL);
222 1.1 cgd }
223 1.1 cgd vprintf(stdout, "Create %s link %s->%s\n",
224 1.1 cgd type == SYMLINK ? "symbolic" : "hard", new, existing);
225 1.1 cgd return (GOOD);
226 1.7 mycroft }
227 1.7 mycroft
228 1.7 mycroft /*
229 1.7 mycroft * Create a whiteout.
230 1.7 mycroft */
231 1.7 mycroft int
232 1.19 xtraeme addwhiteout(char *name)
233 1.7 mycroft {
234 1.7 mycroft
235 1.7 mycroft if (!Nflag && mknod(name, S_IFWHT, 0) < 0) {
236 1.7 mycroft fprintf(stderr, "warning: cannot create whiteout %s: %s\n",
237 1.7 mycroft name, strerror(errno));
238 1.7 mycroft return (FAIL);
239 1.7 mycroft }
240 1.7 mycroft vprintf(stdout, "Create whiteout %s\n", name);
241 1.7 mycroft return (GOOD);
242 1.7 mycroft }
243 1.7 mycroft
244 1.7 mycroft /*
245 1.7 mycroft * Delete a whiteout.
246 1.7 mycroft */
247 1.7 mycroft void
248 1.19 xtraeme delwhiteout(struct entry *ep)
249 1.7 mycroft {
250 1.7 mycroft char *name;
251 1.7 mycroft
252 1.7 mycroft if (ep->e_type != LEAF)
253 1.7 mycroft badentry(ep, "delwhiteout: not a leaf");
254 1.7 mycroft ep->e_flags |= REMOVED;
255 1.7 mycroft ep->e_flags &= ~TMPNAME;
256 1.7 mycroft name = myname(ep);
257 1.7 mycroft if (!Nflag && undelete(name) < 0) {
258 1.7 mycroft fprintf(stderr, "warning: cannot delete whiteout %s: %s\n",
259 1.7 mycroft name, strerror(errno));
260 1.7 mycroft return;
261 1.7 mycroft }
262 1.7 mycroft vprintf(stdout, "Delete whiteout %s\n", name);
263 1.1 cgd }
264 1.1 cgd
265 1.1 cgd /*
266 1.1 cgd * find lowest number file (above "start") that needs to be extracted
267 1.1 cgd */
268 1.1 cgd ino_t
269 1.19 xtraeme lowerbnd(ino_t start)
270 1.1 cgd {
271 1.11 lukem struct entry *ep;
272 1.1 cgd
273 1.1 cgd for ( ; start < maxino; start++) {
274 1.1 cgd ep = lookupino(start);
275 1.3 cgd if (ep == NULL || ep->e_type == NODE)
276 1.1 cgd continue;
277 1.1 cgd if (ep->e_flags & (NEW|EXTRACT))
278 1.1 cgd return (start);
279 1.1 cgd }
280 1.1 cgd return (start);
281 1.1 cgd }
282 1.1 cgd
283 1.1 cgd /*
284 1.1 cgd * find highest number file (below "start") that needs to be extracted
285 1.1 cgd */
286 1.1 cgd ino_t
287 1.19 xtraeme upperbnd(ino_t start)
288 1.1 cgd {
289 1.11 lukem struct entry *ep;
290 1.1 cgd
291 1.23 dholland for ( ; start > UFS_ROOTINO; start--) {
292 1.1 cgd ep = lookupino(start);
293 1.3 cgd if (ep == NULL || ep->e_type == NODE)
294 1.1 cgd continue;
295 1.1 cgd if (ep->e_flags & (NEW|EXTRACT))
296 1.1 cgd return (start);
297 1.1 cgd }
298 1.1 cgd return (start);
299 1.1 cgd }
300 1.1 cgd
301 1.1 cgd /*
302 1.1 cgd * report on a badly formed entry
303 1.1 cgd */
304 1.3 cgd void
305 1.20 christos badentry(struct entry *ep, const char *message)
306 1.1 cgd {
307 1.1 cgd
308 1.15 lukem fprintf(stderr, "bad entry: %s\n", message);
309 1.1 cgd fprintf(stderr, "name: %s\n", myname(ep));
310 1.1 cgd fprintf(stderr, "parent name %s\n", myname(ep->e_parent));
311 1.3 cgd if (ep->e_sibling != NULL)
312 1.1 cgd fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling));
313 1.3 cgd if (ep->e_entries != NULL)
314 1.1 cgd fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries));
315 1.3 cgd if (ep->e_links != NULL)
316 1.1 cgd fprintf(stderr, "next link name: %s\n", myname(ep->e_links));
317 1.3 cgd if (ep->e_next != NULL)
318 1.3 cgd fprintf(stderr,
319 1.3 cgd "next hashchain name: %s\n", myname(ep->e_next));
320 1.1 cgd fprintf(stderr, "entry type: %s\n",
321 1.1 cgd ep->e_type == NODE ? "NODE" : "LEAF");
322 1.12 lukem fprintf(stderr, "inode number: %ld\n", (long)ep->e_ino);
323 1.1 cgd panic("flags: %s\n", flagvalues(ep));
324 1.1 cgd }
325 1.1 cgd
326 1.1 cgd /*
327 1.1 cgd * Construct a string indicating the active flag bits of an entry.
328 1.1 cgd */
329 1.1 cgd char *
330 1.19 xtraeme flagvalues(struct entry *ep)
331 1.1 cgd {
332 1.1 cgd static char flagbuf[BUFSIZ];
333 1.1 cgd
334 1.1 cgd (void) strcpy(flagbuf, "|NIL");
335 1.1 cgd flagbuf[0] = '\0';
336 1.1 cgd if (ep->e_flags & REMOVED)
337 1.1 cgd (void) strcat(flagbuf, "|REMOVED");
338 1.1 cgd if (ep->e_flags & TMPNAME)
339 1.1 cgd (void) strcat(flagbuf, "|TMPNAME");
340 1.1 cgd if (ep->e_flags & EXTRACT)
341 1.1 cgd (void) strcat(flagbuf, "|EXTRACT");
342 1.1 cgd if (ep->e_flags & NEW)
343 1.1 cgd (void) strcat(flagbuf, "|NEW");
344 1.1 cgd if (ep->e_flags & KEEP)
345 1.1 cgd (void) strcat(flagbuf, "|KEEP");
346 1.1 cgd if (ep->e_flags & EXISTED)
347 1.1 cgd (void) strcat(flagbuf, "|EXISTED");
348 1.1 cgd return (&flagbuf[1]);
349 1.1 cgd }
350 1.1 cgd
351 1.1 cgd /*
352 1.1 cgd * Check to see if a name is on a dump tape.
353 1.1 cgd */
354 1.1 cgd ino_t
355 1.19 xtraeme dirlookup(const char *name)
356 1.1 cgd {
357 1.5 mycroft struct direct *dp;
358 1.1 cgd ino_t ino;
359 1.4 cgd
360 1.5 mycroft ino = ((dp = pathsearch(name)) == NULL) ? 0 : dp->d_ino;
361 1.1 cgd
362 1.3 cgd if (ino == 0 || TSTINO(ino, dumpmap) == 0)
363 1.5 mycroft fprintf(stderr, "%s is not on the tape\n", name);
364 1.1 cgd return (ino);
365 1.1 cgd }
366 1.1 cgd
367 1.1 cgd /*
368 1.1 cgd * Elicit a reply.
369 1.1 cgd */
370 1.3 cgd int
371 1.20 christos reply(const char *question)
372 1.1 cgd {
373 1.1 cgd char c;
374 1.1 cgd
375 1.1 cgd do {
376 1.1 cgd fprintf(stderr, "%s? [yn] ", question);
377 1.1 cgd (void) fflush(stderr);
378 1.1 cgd c = getc(terminal);
379 1.1 cgd while (c != '\n' && getc(terminal) != '\n')
380 1.1 cgd if (feof(terminal))
381 1.1 cgd return (FAIL);
382 1.1 cgd } while (c != 'y' && c != 'n');
383 1.1 cgd if (c == 'y')
384 1.1 cgd return (GOOD);
385 1.1 cgd return (FAIL);
386 1.1 cgd }
387 1.1 cgd
388 1.1 cgd /*
389 1.1 cgd * handle unexpected inconsistencies
390 1.1 cgd */
391 1.3 cgd #include <stdarg.h>
392 1.3 cgd
393 1.3 cgd void
394 1.3 cgd panic(const char *fmt, ...)
395 1.3 cgd {
396 1.3 cgd va_list ap;
397 1.16 wiz
398 1.3 cgd va_start(ap, fmt);
399 1.3 cgd vfprintf(stderr, fmt, ap);
400 1.14 wiz va_end(ap);
401 1.1 cgd if (yflag)
402 1.1 cgd return;
403 1.1 cgd if (reply("abort") == GOOD) {
404 1.1 cgd if (reply("dump core") == GOOD)
405 1.1 cgd abort();
406 1.8 mycroft exit(1);
407 1.1 cgd }
408 1.1 cgd }
409 1.18 bouyer
410 1.18 bouyer void
411 1.18 bouyer writemtree(const char *name, const char *type,
412 1.18 bouyer const uid_t uid, const gid_t gid, const mode_t mode, const u_long flags)
413 1.18 bouyer {
414 1.20 christos const char *sep = "";
415 1.18 bouyer if ((name[0] != '.') || (name[1] != '/' && name[1] != '\0'))
416 1.18 bouyer fprintf(Mtreefile, "./");
417 1.18 bouyer fprintf(Mtreefile, "%s type=%s uid=%d gid=%d mode=%#4.4o",
418 1.18 bouyer name, type, uid, gid,
419 1.18 bouyer mode & (S_IRWXU | S_IRWXG | S_IRWXO | S_ISUID | S_ISGID | S_ISTXT));
420 1.18 bouyer if (flags != 0)
421 1.18 bouyer fprintf(Mtreefile, " flags=");
422 1.18 bouyer if (flags & UF_NODUMP) {
423 1.18 bouyer fprintf(Mtreefile, "nodump");
424 1.18 bouyer sep=",";
425 1.18 bouyer }
426 1.18 bouyer if (flags & UF_IMMUTABLE) {
427 1.18 bouyer fprintf(Mtreefile, "%suchg", sep);
428 1.18 bouyer sep=",";
429 1.18 bouyer }
430 1.18 bouyer if (flags & UF_APPEND) {
431 1.18 bouyer fprintf(Mtreefile, "%suappnd", sep);
432 1.18 bouyer sep=",";
433 1.18 bouyer }
434 1.18 bouyer if (flags & UF_OPAQUE) {
435 1.18 bouyer fprintf(Mtreefile, "%sopaque", sep);
436 1.18 bouyer sep=",";
437 1.18 bouyer }
438 1.18 bouyer if (flags & SF_ARCHIVED) {
439 1.18 bouyer fprintf(Mtreefile, "%sarch", sep);
440 1.18 bouyer sep=",";
441 1.18 bouyer }
442 1.18 bouyer if (flags & SF_IMMUTABLE) {
443 1.18 bouyer fprintf(Mtreefile, "%sschg", sep);
444 1.18 bouyer sep=",";
445 1.18 bouyer }
446 1.18 bouyer if (flags & SF_APPEND) {
447 1.18 bouyer fprintf(Mtreefile, "%ssappnd", sep);
448 1.18 bouyer sep=",";
449 1.18 bouyer }
450 1.18 bouyer fprintf(Mtreefile, "\n");
451 1.18 bouyer if (ferror(Mtreefile))
452 1.18 bouyer err(1, "error writing to mtree file");
453 1.18 bouyer }
454