utilities.c revision 1.17 1 1.17 agc /* $NetBSD: utilities.c,v 1.17 2003/08/07 10:04:38 agc 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.17 agc __RCSID("$NetBSD: utilities.c,v 1.17 2003/08/07 10:04:38 agc 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.3 cgd #include <errno.h>
48 1.3 cgd #include <stdio.h>
49 1.3 cgd #include <stdlib.h>
50 1.3 cgd #include <string.h>
51 1.3 cgd #include <unistd.h>
52 1.3 cgd
53 1.1 cgd #include "restore.h"
54 1.3 cgd #include "extern.h"
55 1.1 cgd
56 1.1 cgd /*
57 1.1 cgd * Insure that all the components of a pathname exist.
58 1.1 cgd */
59 1.3 cgd void
60 1.1 cgd pathcheck(name)
61 1.1 cgd 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.1 cgd mktempname(ep)
90 1.11 lukem struct entry *ep;
91 1.1 cgd {
92 1.1 cgd char oldname[MAXPATHLEN];
93 1.1 cgd
94 1.1 cgd if (ep->e_flags & TMPNAME)
95 1.1 cgd badentry(ep, "mktempname: called with TMPNAME");
96 1.1 cgd ep->e_flags |= TMPNAME;
97 1.1 cgd (void) strcpy(oldname, myname(ep));
98 1.1 cgd freename(ep->e_name);
99 1.1 cgd ep->e_name = savename(gentempname(ep));
100 1.1 cgd ep->e_namlen = strlen(ep->e_name);
101 1.1 cgd renameit(oldname, myname(ep));
102 1.1 cgd }
103 1.1 cgd
104 1.1 cgd /*
105 1.1 cgd * Generate a temporary name for an entry.
106 1.1 cgd */
107 1.1 cgd char *
108 1.1 cgd gentempname(ep)
109 1.1 cgd struct entry *ep;
110 1.1 cgd {
111 1.1 cgd static char name[MAXPATHLEN];
112 1.1 cgd struct entry *np;
113 1.1 cgd long i = 0;
114 1.1 cgd
115 1.3 cgd for (np = lookupino(ep->e_ino);
116 1.3 cgd np != NULL && np != ep; np = np->e_links)
117 1.1 cgd i++;
118 1.3 cgd if (np == NULL)
119 1.1 cgd badentry(ep, "not on ino list");
120 1.12 lukem (void) snprintf(name, sizeof(name), "%s%ld%d", TMPHDR, (long) i,
121 1.12 lukem ep->e_ino);
122 1.1 cgd return (name);
123 1.1 cgd }
124 1.1 cgd
125 1.1 cgd /*
126 1.1 cgd * Rename a file or directory.
127 1.1 cgd */
128 1.3 cgd void
129 1.1 cgd renameit(from, to)
130 1.1 cgd char *from, *to;
131 1.1 cgd {
132 1.1 cgd if (!Nflag && rename(from, to) < 0) {
133 1.3 cgd fprintf(stderr, "warning: cannot rename %s to %s: %s\n",
134 1.3 cgd from, to, strerror(errno));
135 1.1 cgd return;
136 1.1 cgd }
137 1.1 cgd vprintf(stdout, "rename %s to %s\n", from, to);
138 1.1 cgd }
139 1.1 cgd
140 1.1 cgd /*
141 1.1 cgd * Create a new node (directory).
142 1.1 cgd */
143 1.3 cgd void
144 1.1 cgd newnode(np)
145 1.1 cgd struct entry *np;
146 1.1 cgd {
147 1.1 cgd char *cp;
148 1.1 cgd
149 1.1 cgd if (np->e_type != NODE)
150 1.1 cgd badentry(np, "newnode: not a node");
151 1.1 cgd cp = myname(np);
152 1.1 cgd if (!Nflag && mkdir(cp, 0777) < 0) {
153 1.1 cgd np->e_flags |= EXISTED;
154 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
155 1.1 cgd return;
156 1.1 cgd }
157 1.1 cgd vprintf(stdout, "Make node %s\n", cp);
158 1.1 cgd }
159 1.1 cgd
160 1.1 cgd /*
161 1.1 cgd * Remove an old node (directory).
162 1.1 cgd */
163 1.3 cgd void
164 1.1 cgd removenode(ep)
165 1.11 lukem struct entry *ep;
166 1.1 cgd {
167 1.1 cgd char *cp;
168 1.1 cgd
169 1.1 cgd if (ep->e_type != NODE)
170 1.1 cgd badentry(ep, "removenode: not a node");
171 1.3 cgd if (ep->e_entries != NULL)
172 1.1 cgd badentry(ep, "removenode: non-empty directory");
173 1.1 cgd ep->e_flags |= REMOVED;
174 1.1 cgd ep->e_flags &= ~TMPNAME;
175 1.1 cgd cp = myname(ep);
176 1.1 cgd if (!Nflag && rmdir(cp) < 0) {
177 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
178 1.1 cgd return;
179 1.1 cgd }
180 1.1 cgd vprintf(stdout, "Remove node %s\n", cp);
181 1.1 cgd }
182 1.1 cgd
183 1.1 cgd /*
184 1.1 cgd * Remove a leaf.
185 1.1 cgd */
186 1.3 cgd void
187 1.1 cgd removeleaf(ep)
188 1.11 lukem struct entry *ep;
189 1.1 cgd {
190 1.1 cgd char *cp;
191 1.1 cgd
192 1.1 cgd if (ep->e_type != LEAF)
193 1.1 cgd badentry(ep, "removeleaf: not a leaf");
194 1.1 cgd ep->e_flags |= REMOVED;
195 1.1 cgd ep->e_flags &= ~TMPNAME;
196 1.1 cgd cp = myname(ep);
197 1.1 cgd if (!Nflag && unlink(cp) < 0) {
198 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
199 1.1 cgd return;
200 1.1 cgd }
201 1.1 cgd vprintf(stdout, "Remove leaf %s\n", cp);
202 1.1 cgd }
203 1.1 cgd
204 1.1 cgd /*
205 1.1 cgd * Create a link.
206 1.1 cgd */
207 1.3 cgd int
208 1.1 cgd linkit(existing, new, type)
209 1.1 cgd char *existing, *new;
210 1.1 cgd int type;
211 1.1 cgd {
212 1.1 cgd
213 1.1 cgd if (type == SYMLINK) {
214 1.1 cgd if (!Nflag && symlink(existing, new) < 0) {
215 1.1 cgd fprintf(stderr,
216 1.3 cgd "warning: cannot create symbolic link %s->%s: %s\n",
217 1.3 cgd new, existing, strerror(errno));
218 1.1 cgd return (FAIL);
219 1.1 cgd }
220 1.1 cgd } else if (type == HARDLINK) {
221 1.1 cgd if (!Nflag && link(existing, new) < 0) {
222 1.1 cgd fprintf(stderr,
223 1.3 cgd "warning: cannot create hard link %s->%s: %s\n",
224 1.3 cgd new, existing, strerror(errno));
225 1.1 cgd return (FAIL);
226 1.1 cgd }
227 1.1 cgd } else {
228 1.1 cgd panic("linkit: unknown type %d\n", type);
229 1.1 cgd return (FAIL);
230 1.1 cgd }
231 1.1 cgd vprintf(stdout, "Create %s link %s->%s\n",
232 1.1 cgd type == SYMLINK ? "symbolic" : "hard", new, existing);
233 1.1 cgd return (GOOD);
234 1.7 mycroft }
235 1.7 mycroft
236 1.7 mycroft /*
237 1.7 mycroft * Create a whiteout.
238 1.7 mycroft */
239 1.7 mycroft int
240 1.7 mycroft addwhiteout(name)
241 1.7 mycroft char *name;
242 1.7 mycroft {
243 1.7 mycroft
244 1.7 mycroft if (!Nflag && mknod(name, S_IFWHT, 0) < 0) {
245 1.7 mycroft fprintf(stderr, "warning: cannot create whiteout %s: %s\n",
246 1.7 mycroft name, strerror(errno));
247 1.7 mycroft return (FAIL);
248 1.7 mycroft }
249 1.7 mycroft vprintf(stdout, "Create whiteout %s\n", name);
250 1.7 mycroft return (GOOD);
251 1.7 mycroft }
252 1.7 mycroft
253 1.7 mycroft /*
254 1.7 mycroft * Delete a whiteout.
255 1.7 mycroft */
256 1.7 mycroft void
257 1.7 mycroft delwhiteout(ep)
258 1.11 lukem struct entry *ep;
259 1.7 mycroft {
260 1.7 mycroft char *name;
261 1.7 mycroft
262 1.7 mycroft if (ep->e_type != LEAF)
263 1.7 mycroft badentry(ep, "delwhiteout: not a leaf");
264 1.7 mycroft ep->e_flags |= REMOVED;
265 1.7 mycroft ep->e_flags &= ~TMPNAME;
266 1.7 mycroft name = myname(ep);
267 1.7 mycroft if (!Nflag && undelete(name) < 0) {
268 1.7 mycroft fprintf(stderr, "warning: cannot delete whiteout %s: %s\n",
269 1.7 mycroft name, strerror(errno));
270 1.7 mycroft return;
271 1.7 mycroft }
272 1.7 mycroft vprintf(stdout, "Delete whiteout %s\n", name);
273 1.1 cgd }
274 1.1 cgd
275 1.1 cgd /*
276 1.1 cgd * find lowest number file (above "start") that needs to be extracted
277 1.1 cgd */
278 1.1 cgd ino_t
279 1.1 cgd lowerbnd(start)
280 1.1 cgd ino_t start;
281 1.1 cgd {
282 1.11 lukem struct entry *ep;
283 1.1 cgd
284 1.1 cgd for ( ; start < maxino; start++) {
285 1.1 cgd ep = lookupino(start);
286 1.3 cgd if (ep == NULL || ep->e_type == NODE)
287 1.1 cgd continue;
288 1.1 cgd if (ep->e_flags & (NEW|EXTRACT))
289 1.1 cgd return (start);
290 1.1 cgd }
291 1.1 cgd return (start);
292 1.1 cgd }
293 1.1 cgd
294 1.1 cgd /*
295 1.1 cgd * find highest number file (below "start") that needs to be extracted
296 1.1 cgd */
297 1.1 cgd ino_t
298 1.1 cgd upperbnd(start)
299 1.1 cgd ino_t start;
300 1.1 cgd {
301 1.11 lukem struct entry *ep;
302 1.1 cgd
303 1.1 cgd for ( ; start > ROOTINO; start--) {
304 1.1 cgd ep = lookupino(start);
305 1.3 cgd if (ep == NULL || ep->e_type == NODE)
306 1.1 cgd continue;
307 1.1 cgd if (ep->e_flags & (NEW|EXTRACT))
308 1.1 cgd return (start);
309 1.1 cgd }
310 1.1 cgd return (start);
311 1.1 cgd }
312 1.1 cgd
313 1.1 cgd /*
314 1.1 cgd * report on a badly formed entry
315 1.1 cgd */
316 1.3 cgd void
317 1.15 lukem badentry(ep, message)
318 1.11 lukem struct entry *ep;
319 1.15 lukem char *message;
320 1.1 cgd {
321 1.1 cgd
322 1.15 lukem fprintf(stderr, "bad entry: %s\n", message);
323 1.1 cgd fprintf(stderr, "name: %s\n", myname(ep));
324 1.1 cgd fprintf(stderr, "parent name %s\n", myname(ep->e_parent));
325 1.3 cgd if (ep->e_sibling != NULL)
326 1.1 cgd fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling));
327 1.3 cgd if (ep->e_entries != NULL)
328 1.1 cgd fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries));
329 1.3 cgd if (ep->e_links != NULL)
330 1.1 cgd fprintf(stderr, "next link name: %s\n", myname(ep->e_links));
331 1.3 cgd if (ep->e_next != NULL)
332 1.3 cgd fprintf(stderr,
333 1.3 cgd "next hashchain name: %s\n", myname(ep->e_next));
334 1.1 cgd fprintf(stderr, "entry type: %s\n",
335 1.1 cgd ep->e_type == NODE ? "NODE" : "LEAF");
336 1.12 lukem fprintf(stderr, "inode number: %ld\n", (long)ep->e_ino);
337 1.1 cgd panic("flags: %s\n", flagvalues(ep));
338 1.1 cgd }
339 1.1 cgd
340 1.1 cgd /*
341 1.1 cgd * Construct a string indicating the active flag bits of an entry.
342 1.1 cgd */
343 1.1 cgd char *
344 1.1 cgd flagvalues(ep)
345 1.11 lukem struct entry *ep;
346 1.1 cgd {
347 1.1 cgd static char flagbuf[BUFSIZ];
348 1.1 cgd
349 1.1 cgd (void) strcpy(flagbuf, "|NIL");
350 1.1 cgd flagbuf[0] = '\0';
351 1.1 cgd if (ep->e_flags & REMOVED)
352 1.1 cgd (void) strcat(flagbuf, "|REMOVED");
353 1.1 cgd if (ep->e_flags & TMPNAME)
354 1.1 cgd (void) strcat(flagbuf, "|TMPNAME");
355 1.1 cgd if (ep->e_flags & EXTRACT)
356 1.1 cgd (void) strcat(flagbuf, "|EXTRACT");
357 1.1 cgd if (ep->e_flags & NEW)
358 1.1 cgd (void) strcat(flagbuf, "|NEW");
359 1.1 cgd if (ep->e_flags & KEEP)
360 1.1 cgd (void) strcat(flagbuf, "|KEEP");
361 1.1 cgd if (ep->e_flags & EXISTED)
362 1.1 cgd (void) strcat(flagbuf, "|EXISTED");
363 1.1 cgd return (&flagbuf[1]);
364 1.1 cgd }
365 1.1 cgd
366 1.1 cgd /*
367 1.1 cgd * Check to see if a name is on a dump tape.
368 1.1 cgd */
369 1.1 cgd ino_t
370 1.1 cgd dirlookup(name)
371 1.5 mycroft const char *name;
372 1.1 cgd {
373 1.5 mycroft struct direct *dp;
374 1.1 cgd ino_t ino;
375 1.4 cgd
376 1.5 mycroft ino = ((dp = pathsearch(name)) == NULL) ? 0 : dp->d_ino;
377 1.1 cgd
378 1.3 cgd if (ino == 0 || TSTINO(ino, dumpmap) == 0)
379 1.5 mycroft fprintf(stderr, "%s is not on the tape\n", name);
380 1.1 cgd return (ino);
381 1.1 cgd }
382 1.1 cgd
383 1.1 cgd /*
384 1.1 cgd * Elicit a reply.
385 1.1 cgd */
386 1.3 cgd int
387 1.1 cgd reply(question)
388 1.1 cgd char *question;
389 1.1 cgd {
390 1.1 cgd char c;
391 1.1 cgd
392 1.1 cgd do {
393 1.1 cgd fprintf(stderr, "%s? [yn] ", question);
394 1.1 cgd (void) fflush(stderr);
395 1.1 cgd c = getc(terminal);
396 1.1 cgd while (c != '\n' && getc(terminal) != '\n')
397 1.1 cgd if (feof(terminal))
398 1.1 cgd return (FAIL);
399 1.1 cgd } while (c != 'y' && c != 'n');
400 1.1 cgd if (c == 'y')
401 1.1 cgd return (GOOD);
402 1.1 cgd return (FAIL);
403 1.1 cgd }
404 1.1 cgd
405 1.1 cgd /*
406 1.1 cgd * handle unexpected inconsistencies
407 1.1 cgd */
408 1.3 cgd #include <stdarg.h>
409 1.3 cgd
410 1.3 cgd void
411 1.3 cgd panic(const char *fmt, ...)
412 1.3 cgd {
413 1.3 cgd va_list ap;
414 1.16 wiz
415 1.3 cgd va_start(ap, fmt);
416 1.3 cgd vfprintf(stderr, fmt, ap);
417 1.14 wiz va_end(ap);
418 1.1 cgd if (yflag)
419 1.1 cgd return;
420 1.1 cgd if (reply("abort") == GOOD) {
421 1.1 cgd if (reply("dump core") == GOOD)
422 1.1 cgd abort();
423 1.8 mycroft exit(1);
424 1.1 cgd }
425 1.1 cgd }
426