utilities.c revision 1.1.1.2 1 1.1 cgd /*
2 1.1.1.2 mycroft * Copyright (c) 1983, 1993
3 1.1.1.2 mycroft * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1.1.2 mycroft static char sccsid[] = "@(#)utilities.c 8.2 (Berkeley) 3/25/94";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1.1.2 mycroft #include <sys/param.h>
39 1.1.1.2 mycroft #include <sys/stat.h>
40 1.1.1.2 mycroft
41 1.1.1.2 mycroft #include <ufs/ufs/dinode.h>
42 1.1.1.2 mycroft #include <ufs/ufs/dir.h>
43 1.1.1.2 mycroft
44 1.1.1.2 mycroft #include <errno.h>
45 1.1.1.2 mycroft #include <stdio.h>
46 1.1.1.2 mycroft #include <stdlib.h>
47 1.1.1.2 mycroft #include <string.h>
48 1.1.1.2 mycroft #include <unistd.h>
49 1.1.1.2 mycroft
50 1.1 cgd #include "restore.h"
51 1.1.1.2 mycroft #include "extern.h"
52 1.1 cgd
53 1.1 cgd /*
54 1.1 cgd * Insure that all the components of a pathname exist.
55 1.1 cgd */
56 1.1.1.2 mycroft void
57 1.1 cgd pathcheck(name)
58 1.1 cgd char *name;
59 1.1 cgd {
60 1.1 cgd register char *cp;
61 1.1 cgd struct entry *ep;
62 1.1 cgd char *start;
63 1.1 cgd
64 1.1 cgd start = index(name, '/');
65 1.1 cgd if (start == 0)
66 1.1 cgd return;
67 1.1 cgd for (cp = start; *cp != '\0'; cp++) {
68 1.1 cgd if (*cp != '/')
69 1.1 cgd continue;
70 1.1 cgd *cp = '\0';
71 1.1 cgd ep = lookupname(name);
72 1.1.1.2 mycroft if (ep == NULL) {
73 1.1.1.2 mycroft /* Safe; we know the pathname exists in the dump. */
74 1.1.1.2 mycroft ep = addentry(name, pathsearch(name)->d_ino, NODE);
75 1.1 cgd newnode(ep);
76 1.1 cgd }
77 1.1 cgd ep->e_flags |= NEW|KEEP;
78 1.1 cgd *cp = '/';
79 1.1 cgd }
80 1.1 cgd }
81 1.1 cgd
82 1.1 cgd /*
83 1.1 cgd * Change a name to a unique temporary name.
84 1.1 cgd */
85 1.1.1.2 mycroft void
86 1.1 cgd mktempname(ep)
87 1.1 cgd register struct entry *ep;
88 1.1 cgd {
89 1.1 cgd char oldname[MAXPATHLEN];
90 1.1 cgd
91 1.1 cgd if (ep->e_flags & TMPNAME)
92 1.1 cgd badentry(ep, "mktempname: called with TMPNAME");
93 1.1 cgd ep->e_flags |= TMPNAME;
94 1.1 cgd (void) strcpy(oldname, myname(ep));
95 1.1 cgd freename(ep->e_name);
96 1.1 cgd ep->e_name = savename(gentempname(ep));
97 1.1 cgd ep->e_namlen = strlen(ep->e_name);
98 1.1 cgd renameit(oldname, myname(ep));
99 1.1 cgd }
100 1.1 cgd
101 1.1 cgd /*
102 1.1 cgd * Generate a temporary name for an entry.
103 1.1 cgd */
104 1.1 cgd char *
105 1.1 cgd gentempname(ep)
106 1.1 cgd struct entry *ep;
107 1.1 cgd {
108 1.1 cgd static char name[MAXPATHLEN];
109 1.1 cgd struct entry *np;
110 1.1 cgd long i = 0;
111 1.1 cgd
112 1.1.1.2 mycroft for (np = lookupino(ep->e_ino);
113 1.1.1.2 mycroft np != NULL && np != ep; np = np->e_links)
114 1.1 cgd i++;
115 1.1.1.2 mycroft if (np == NULL)
116 1.1 cgd badentry(ep, "not on ino list");
117 1.1 cgd (void) sprintf(name, "%s%d%d", TMPHDR, i, ep->e_ino);
118 1.1 cgd return (name);
119 1.1 cgd }
120 1.1 cgd
121 1.1 cgd /*
122 1.1 cgd * Rename a file or directory.
123 1.1 cgd */
124 1.1.1.2 mycroft void
125 1.1 cgd renameit(from, to)
126 1.1 cgd char *from, *to;
127 1.1 cgd {
128 1.1 cgd if (!Nflag && rename(from, to) < 0) {
129 1.1.1.2 mycroft fprintf(stderr, "warning: cannot rename %s to %s: %s\n",
130 1.1.1.2 mycroft from, to, strerror(errno));
131 1.1 cgd return;
132 1.1 cgd }
133 1.1 cgd vprintf(stdout, "rename %s to %s\n", from, to);
134 1.1 cgd }
135 1.1 cgd
136 1.1 cgd /*
137 1.1 cgd * Create a new node (directory).
138 1.1 cgd */
139 1.1.1.2 mycroft void
140 1.1 cgd newnode(np)
141 1.1 cgd 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.1.1.2 mycroft 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.1.1.2 mycroft void
160 1.1 cgd removenode(ep)
161 1.1 cgd register struct entry *ep;
162 1.1 cgd {
163 1.1 cgd char *cp;
164 1.1 cgd
165 1.1 cgd if (ep->e_type != NODE)
166 1.1 cgd badentry(ep, "removenode: not a node");
167 1.1.1.2 mycroft if (ep->e_entries != NULL)
168 1.1 cgd badentry(ep, "removenode: non-empty directory");
169 1.1 cgd ep->e_flags |= REMOVED;
170 1.1 cgd ep->e_flags &= ~TMPNAME;
171 1.1 cgd cp = myname(ep);
172 1.1 cgd if (!Nflag && rmdir(cp) < 0) {
173 1.1.1.2 mycroft fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
174 1.1 cgd return;
175 1.1 cgd }
176 1.1 cgd vprintf(stdout, "Remove node %s\n", cp);
177 1.1 cgd }
178 1.1 cgd
179 1.1 cgd /*
180 1.1 cgd * Remove a leaf.
181 1.1 cgd */
182 1.1.1.2 mycroft void
183 1.1 cgd removeleaf(ep)
184 1.1 cgd register struct entry *ep;
185 1.1 cgd {
186 1.1 cgd char *cp;
187 1.1 cgd
188 1.1 cgd if (ep->e_type != LEAF)
189 1.1 cgd badentry(ep, "removeleaf: not a leaf");
190 1.1 cgd ep->e_flags |= REMOVED;
191 1.1 cgd ep->e_flags &= ~TMPNAME;
192 1.1 cgd cp = myname(ep);
193 1.1 cgd if (!Nflag && unlink(cp) < 0) {
194 1.1.1.2 mycroft fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
195 1.1 cgd return;
196 1.1 cgd }
197 1.1 cgd vprintf(stdout, "Remove leaf %s\n", cp);
198 1.1 cgd }
199 1.1 cgd
200 1.1 cgd /*
201 1.1 cgd * Create a link.
202 1.1 cgd */
203 1.1.1.2 mycroft int
204 1.1 cgd linkit(existing, new, type)
205 1.1 cgd char *existing, *new;
206 1.1 cgd int type;
207 1.1 cgd {
208 1.1 cgd
209 1.1 cgd if (type == SYMLINK) {
210 1.1 cgd if (!Nflag && symlink(existing, new) < 0) {
211 1.1 cgd fprintf(stderr,
212 1.1.1.2 mycroft "warning: cannot create symbolic link %s->%s: %s\n",
213 1.1.1.2 mycroft new, existing, strerror(errno));
214 1.1 cgd return (FAIL);
215 1.1 cgd }
216 1.1 cgd } else if (type == HARDLINK) {
217 1.1 cgd if (!Nflag && link(existing, new) < 0) {
218 1.1 cgd fprintf(stderr,
219 1.1.1.2 mycroft "warning: cannot create hard link %s->%s: %s\n",
220 1.1.1.2 mycroft new, existing, strerror(errno));
221 1.1 cgd return (FAIL);
222 1.1 cgd }
223 1.1 cgd } else {
224 1.1 cgd panic("linkit: unknown type %d\n", type);
225 1.1 cgd return (FAIL);
226 1.1 cgd }
227 1.1 cgd vprintf(stdout, "Create %s link %s->%s\n",
228 1.1 cgd type == SYMLINK ? "symbolic" : "hard", new, existing);
229 1.1 cgd return (GOOD);
230 1.1 cgd }
231 1.1 cgd
232 1.1 cgd /*
233 1.1 cgd * find lowest number file (above "start") that needs to be extracted
234 1.1 cgd */
235 1.1 cgd ino_t
236 1.1 cgd lowerbnd(start)
237 1.1 cgd ino_t start;
238 1.1 cgd {
239 1.1 cgd register struct entry *ep;
240 1.1 cgd
241 1.1 cgd for ( ; start < maxino; start++) {
242 1.1 cgd ep = lookupino(start);
243 1.1.1.2 mycroft if (ep == NULL || ep->e_type == NODE)
244 1.1 cgd continue;
245 1.1 cgd if (ep->e_flags & (NEW|EXTRACT))
246 1.1 cgd return (start);
247 1.1 cgd }
248 1.1 cgd return (start);
249 1.1 cgd }
250 1.1 cgd
251 1.1 cgd /*
252 1.1 cgd * find highest number file (below "start") that needs to be extracted
253 1.1 cgd */
254 1.1 cgd ino_t
255 1.1 cgd upperbnd(start)
256 1.1 cgd ino_t start;
257 1.1 cgd {
258 1.1 cgd register struct entry *ep;
259 1.1 cgd
260 1.1 cgd for ( ; start > ROOTINO; start--) {
261 1.1 cgd ep = lookupino(start);
262 1.1.1.2 mycroft if (ep == NULL || ep->e_type == NODE)
263 1.1 cgd continue;
264 1.1 cgd if (ep->e_flags & (NEW|EXTRACT))
265 1.1 cgd return (start);
266 1.1 cgd }
267 1.1 cgd return (start);
268 1.1 cgd }
269 1.1 cgd
270 1.1 cgd /*
271 1.1 cgd * report on a badly formed entry
272 1.1 cgd */
273 1.1.1.2 mycroft void
274 1.1 cgd badentry(ep, msg)
275 1.1 cgd register struct entry *ep;
276 1.1 cgd char *msg;
277 1.1 cgd {
278 1.1 cgd
279 1.1 cgd fprintf(stderr, "bad entry: %s\n", msg);
280 1.1 cgd fprintf(stderr, "name: %s\n", myname(ep));
281 1.1 cgd fprintf(stderr, "parent name %s\n", myname(ep->e_parent));
282 1.1.1.2 mycroft if (ep->e_sibling != NULL)
283 1.1 cgd fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling));
284 1.1.1.2 mycroft if (ep->e_entries != NULL)
285 1.1 cgd fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries));
286 1.1.1.2 mycroft if (ep->e_links != NULL)
287 1.1 cgd fprintf(stderr, "next link name: %s\n", myname(ep->e_links));
288 1.1.1.2 mycroft if (ep->e_next != NULL)
289 1.1.1.2 mycroft fprintf(stderr,
290 1.1.1.2 mycroft "next hashchain name: %s\n", myname(ep->e_next));
291 1.1 cgd fprintf(stderr, "entry type: %s\n",
292 1.1 cgd ep->e_type == NODE ? "NODE" : "LEAF");
293 1.1 cgd fprintf(stderr, "inode number: %ld\n", ep->e_ino);
294 1.1 cgd panic("flags: %s\n", flagvalues(ep));
295 1.1 cgd }
296 1.1 cgd
297 1.1 cgd /*
298 1.1 cgd * Construct a string indicating the active flag bits of an entry.
299 1.1 cgd */
300 1.1 cgd char *
301 1.1 cgd flagvalues(ep)
302 1.1 cgd register struct entry *ep;
303 1.1 cgd {
304 1.1 cgd static char flagbuf[BUFSIZ];
305 1.1 cgd
306 1.1 cgd (void) strcpy(flagbuf, "|NIL");
307 1.1 cgd flagbuf[0] = '\0';
308 1.1 cgd if (ep->e_flags & REMOVED)
309 1.1 cgd (void) strcat(flagbuf, "|REMOVED");
310 1.1 cgd if (ep->e_flags & TMPNAME)
311 1.1 cgd (void) strcat(flagbuf, "|TMPNAME");
312 1.1 cgd if (ep->e_flags & EXTRACT)
313 1.1 cgd (void) strcat(flagbuf, "|EXTRACT");
314 1.1 cgd if (ep->e_flags & NEW)
315 1.1 cgd (void) strcat(flagbuf, "|NEW");
316 1.1 cgd if (ep->e_flags & KEEP)
317 1.1 cgd (void) strcat(flagbuf, "|KEEP");
318 1.1 cgd if (ep->e_flags & EXISTED)
319 1.1 cgd (void) strcat(flagbuf, "|EXISTED");
320 1.1 cgd return (&flagbuf[1]);
321 1.1 cgd }
322 1.1 cgd
323 1.1 cgd /*
324 1.1 cgd * Check to see if a name is on a dump tape.
325 1.1 cgd */
326 1.1 cgd ino_t
327 1.1 cgd dirlookup(name)
328 1.1.1.2 mycroft const char *name;
329 1.1 cgd {
330 1.1.1.2 mycroft struct direct *dp;
331 1.1 cgd ino_t ino;
332 1.1.1.2 mycroft
333 1.1.1.2 mycroft ino = ((dp = pathsearch(name)) == NULL) ? 0 : dp->d_ino;
334 1.1 cgd
335 1.1.1.2 mycroft if (ino == 0 || TSTINO(ino, dumpmap) == 0)
336 1.1.1.2 mycroft fprintf(stderr, "%s is not on the tape\n", name);
337 1.1 cgd return (ino);
338 1.1 cgd }
339 1.1 cgd
340 1.1 cgd /*
341 1.1 cgd * Elicit a reply.
342 1.1 cgd */
343 1.1.1.2 mycroft int
344 1.1 cgd reply(question)
345 1.1 cgd char *question;
346 1.1 cgd {
347 1.1 cgd char c;
348 1.1 cgd
349 1.1 cgd do {
350 1.1 cgd fprintf(stderr, "%s? [yn] ", question);
351 1.1 cgd (void) fflush(stderr);
352 1.1 cgd c = getc(terminal);
353 1.1 cgd while (c != '\n' && getc(terminal) != '\n')
354 1.1 cgd if (feof(terminal))
355 1.1 cgd return (FAIL);
356 1.1 cgd } while (c != 'y' && c != 'n');
357 1.1 cgd if (c == 'y')
358 1.1 cgd return (GOOD);
359 1.1 cgd return (FAIL);
360 1.1 cgd }
361 1.1 cgd
362 1.1 cgd /*
363 1.1 cgd * handle unexpected inconsistencies
364 1.1 cgd */
365 1.1.1.2 mycroft #if __STDC__
366 1.1.1.2 mycroft #include <stdarg.h>
367 1.1.1.2 mycroft #else
368 1.1.1.2 mycroft #include <varargs.h>
369 1.1.1.2 mycroft #endif
370 1.1.1.2 mycroft
371 1.1.1.2 mycroft void
372 1.1.1.2 mycroft #if __STDC__
373 1.1.1.2 mycroft panic(const char *fmt, ...)
374 1.1.1.2 mycroft #else
375 1.1.1.2 mycroft panic(fmt, va_alist)
376 1.1.1.2 mycroft char *fmt;
377 1.1.1.2 mycroft va_dcl
378 1.1.1.2 mycroft #endif
379 1.1.1.2 mycroft {
380 1.1.1.2 mycroft va_list ap;
381 1.1.1.2 mycroft #if __STDC__
382 1.1.1.2 mycroft va_start(ap, fmt);
383 1.1.1.2 mycroft #else
384 1.1.1.2 mycroft va_start(ap);
385 1.1.1.2 mycroft #endif
386 1.1 cgd
387 1.1.1.2 mycroft vfprintf(stderr, fmt, ap);
388 1.1 cgd if (yflag)
389 1.1 cgd return;
390 1.1 cgd if (reply("abort") == GOOD) {
391 1.1 cgd if (reply("dump core") == GOOD)
392 1.1 cgd abort();
393 1.1 cgd done(1);
394 1.1 cgd }
395 1.1 cgd }
396