utilities.c revision 1.3 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1983 The Regents of the University of California.
3 1.1 cgd * 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.3 cgd /* from: static char sccsid[] = "@(#)utilities.c 5.10 (Berkeley) 12/2/92"; */
36 1.3 cgd static char *rcsid = "$Id: utilities.c,v 1.3 1993/12/22 10:32:18 cgd Exp $";
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.3 cgd #include <sys/param.h>
40 1.3 cgd #include <sys/stat.h>
41 1.3 cgd
42 1.3 cgd #include <ufs/dinode.h>
43 1.3 cgd #include <ufs/dir.h>
44 1.3 cgd #include <ufs/fs.h>
45 1.3 cgd
46 1.3 cgd #include <errno.h>
47 1.3 cgd #include <stdio.h>
48 1.3 cgd #include <stdlib.h>
49 1.3 cgd #include <string.h>
50 1.3 cgd #include <unistd.h>
51 1.3 cgd
52 1.1 cgd #include "restore.h"
53 1.3 cgd #include "extern.h"
54 1.1 cgd
55 1.1 cgd /*
56 1.1 cgd * Insure that all the components of a pathname exist.
57 1.1 cgd */
58 1.3 cgd void
59 1.1 cgd pathcheck(name)
60 1.1 cgd char *name;
61 1.1 cgd {
62 1.1 cgd register char *cp;
63 1.1 cgd struct entry *ep;
64 1.1 cgd char *start;
65 1.1 cgd
66 1.1 cgd start = index(name, '/');
67 1.1 cgd if (start == 0)
68 1.1 cgd return;
69 1.1 cgd for (cp = start; *cp != '\0'; cp++) {
70 1.1 cgd if (*cp != '/')
71 1.1 cgd continue;
72 1.1 cgd *cp = '\0';
73 1.1 cgd ep = lookupname(name);
74 1.3 cgd if (ep == NULL) {
75 1.3 cgd ep = addentry(name, pathsearch(name)->d_ino, NODE);
76 1.1 cgd newnode(ep);
77 1.1 cgd }
78 1.1 cgd ep->e_flags |= NEW|KEEP;
79 1.1 cgd *cp = '/';
80 1.1 cgd }
81 1.1 cgd }
82 1.1 cgd
83 1.1 cgd /*
84 1.1 cgd * Change a name to a unique temporary name.
85 1.1 cgd */
86 1.3 cgd void
87 1.1 cgd mktempname(ep)
88 1.1 cgd register struct entry *ep;
89 1.1 cgd {
90 1.1 cgd char oldname[MAXPATHLEN];
91 1.1 cgd
92 1.1 cgd if (ep->e_flags & TMPNAME)
93 1.1 cgd badentry(ep, "mktempname: called with TMPNAME");
94 1.1 cgd ep->e_flags |= TMPNAME;
95 1.1 cgd (void) strcpy(oldname, myname(ep));
96 1.1 cgd freename(ep->e_name);
97 1.1 cgd ep->e_name = savename(gentempname(ep));
98 1.1 cgd ep->e_namlen = strlen(ep->e_name);
99 1.1 cgd renameit(oldname, myname(ep));
100 1.1 cgd }
101 1.1 cgd
102 1.1 cgd /*
103 1.1 cgd * Generate a temporary name for an entry.
104 1.1 cgd */
105 1.1 cgd char *
106 1.1 cgd gentempname(ep)
107 1.1 cgd 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.1 cgd (void) sprintf(name, "%s%d%d", TMPHDR, i, ep->e_ino);
119 1.1 cgd return (name);
120 1.1 cgd }
121 1.1 cgd
122 1.1 cgd /*
123 1.1 cgd * Rename a file or directory.
124 1.1 cgd */
125 1.3 cgd void
126 1.1 cgd renameit(from, to)
127 1.1 cgd char *from, *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.1 cgd newnode(np)
142 1.1 cgd struct entry *np;
143 1.1 cgd {
144 1.1 cgd char *cp;
145 1.1 cgd
146 1.1 cgd if (np->e_type != NODE)
147 1.1 cgd badentry(np, "newnode: not a node");
148 1.1 cgd cp = myname(np);
149 1.1 cgd if (!Nflag && mkdir(cp, 0777) < 0) {
150 1.1 cgd np->e_flags |= EXISTED;
151 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
152 1.1 cgd return;
153 1.1 cgd }
154 1.1 cgd vprintf(stdout, "Make node %s\n", cp);
155 1.1 cgd }
156 1.1 cgd
157 1.1 cgd /*
158 1.1 cgd * Remove an old node (directory).
159 1.1 cgd */
160 1.3 cgd void
161 1.1 cgd removenode(ep)
162 1.1 cgd register struct entry *ep;
163 1.1 cgd {
164 1.1 cgd char *cp;
165 1.1 cgd
166 1.1 cgd if (ep->e_type != NODE)
167 1.1 cgd badentry(ep, "removenode: not a node");
168 1.3 cgd if (ep->e_entries != NULL)
169 1.1 cgd badentry(ep, "removenode: non-empty directory");
170 1.1 cgd ep->e_flags |= REMOVED;
171 1.1 cgd ep->e_flags &= ~TMPNAME;
172 1.1 cgd cp = myname(ep);
173 1.1 cgd if (!Nflag && rmdir(cp) < 0) {
174 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
175 1.1 cgd return;
176 1.1 cgd }
177 1.1 cgd vprintf(stdout, "Remove node %s\n", cp);
178 1.1 cgd }
179 1.1 cgd
180 1.1 cgd /*
181 1.1 cgd * Remove a leaf.
182 1.1 cgd */
183 1.3 cgd void
184 1.1 cgd removeleaf(ep)
185 1.1 cgd register struct entry *ep;
186 1.1 cgd {
187 1.1 cgd char *cp;
188 1.1 cgd
189 1.1 cgd if (ep->e_type != LEAF)
190 1.1 cgd badentry(ep, "removeleaf: not a leaf");
191 1.1 cgd ep->e_flags |= REMOVED;
192 1.1 cgd ep->e_flags &= ~TMPNAME;
193 1.1 cgd cp = myname(ep);
194 1.1 cgd if (!Nflag && unlink(cp) < 0) {
195 1.3 cgd fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
196 1.1 cgd return;
197 1.1 cgd }
198 1.1 cgd vprintf(stdout, "Remove leaf %s\n", cp);
199 1.1 cgd }
200 1.1 cgd
201 1.1 cgd /*
202 1.1 cgd * Create a link.
203 1.1 cgd */
204 1.3 cgd int
205 1.1 cgd linkit(existing, new, type)
206 1.1 cgd char *existing, *new;
207 1.1 cgd int type;
208 1.1 cgd {
209 1.1 cgd
210 1.1 cgd if (type == SYMLINK) {
211 1.1 cgd if (!Nflag && symlink(existing, new) < 0) {
212 1.1 cgd fprintf(stderr,
213 1.3 cgd "warning: cannot create symbolic link %s->%s: %s\n",
214 1.3 cgd new, existing, strerror(errno));
215 1.1 cgd return (FAIL);
216 1.1 cgd }
217 1.1 cgd } else if (type == HARDLINK) {
218 1.1 cgd if (!Nflag && link(existing, new) < 0) {
219 1.1 cgd fprintf(stderr,
220 1.3 cgd "warning: cannot create hard link %s->%s: %s\n",
221 1.3 cgd new, existing, strerror(errno));
222 1.1 cgd return (FAIL);
223 1.1 cgd }
224 1.1 cgd } else {
225 1.1 cgd panic("linkit: unknown type %d\n", type);
226 1.1 cgd return (FAIL);
227 1.1 cgd }
228 1.1 cgd vprintf(stdout, "Create %s link %s->%s\n",
229 1.1 cgd type == SYMLINK ? "symbolic" : "hard", new, existing);
230 1.1 cgd return (GOOD);
231 1.1 cgd }
232 1.1 cgd
233 1.1 cgd /*
234 1.1 cgd * find lowest number file (above "start") that needs to be extracted
235 1.1 cgd */
236 1.1 cgd ino_t
237 1.1 cgd lowerbnd(start)
238 1.1 cgd ino_t start;
239 1.1 cgd {
240 1.1 cgd register struct entry *ep;
241 1.1 cgd
242 1.1 cgd for ( ; start < maxino; start++) {
243 1.1 cgd ep = lookupino(start);
244 1.3 cgd if (ep == NULL || ep->e_type == NODE)
245 1.1 cgd continue;
246 1.1 cgd if (ep->e_flags & (NEW|EXTRACT))
247 1.1 cgd return (start);
248 1.1 cgd }
249 1.1 cgd return (start);
250 1.1 cgd }
251 1.1 cgd
252 1.1 cgd /*
253 1.1 cgd * find highest number file (below "start") that needs to be extracted
254 1.1 cgd */
255 1.1 cgd ino_t
256 1.1 cgd upperbnd(start)
257 1.1 cgd ino_t start;
258 1.1 cgd {
259 1.1 cgd register struct entry *ep;
260 1.1 cgd
261 1.1 cgd for ( ; start > ROOTINO; start--) {
262 1.1 cgd ep = lookupino(start);
263 1.3 cgd if (ep == NULL || ep->e_type == NODE)
264 1.1 cgd continue;
265 1.1 cgd if (ep->e_flags & (NEW|EXTRACT))
266 1.1 cgd return (start);
267 1.1 cgd }
268 1.1 cgd return (start);
269 1.1 cgd }
270 1.1 cgd
271 1.1 cgd /*
272 1.1 cgd * report on a badly formed entry
273 1.1 cgd */
274 1.3 cgd void
275 1.1 cgd badentry(ep, msg)
276 1.1 cgd register struct entry *ep;
277 1.1 cgd char *msg;
278 1.1 cgd {
279 1.1 cgd
280 1.1 cgd fprintf(stderr, "bad entry: %s\n", msg);
281 1.1 cgd fprintf(stderr, "name: %s\n", myname(ep));
282 1.1 cgd fprintf(stderr, "parent name %s\n", myname(ep->e_parent));
283 1.3 cgd if (ep->e_sibling != NULL)
284 1.1 cgd fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling));
285 1.3 cgd if (ep->e_entries != NULL)
286 1.1 cgd fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries));
287 1.3 cgd if (ep->e_links != NULL)
288 1.1 cgd fprintf(stderr, "next link name: %s\n", myname(ep->e_links));
289 1.3 cgd if (ep->e_next != NULL)
290 1.3 cgd fprintf(stderr,
291 1.3 cgd "next hashchain name: %s\n", myname(ep->e_next));
292 1.1 cgd fprintf(stderr, "entry type: %s\n",
293 1.1 cgd ep->e_type == NODE ? "NODE" : "LEAF");
294 1.1 cgd fprintf(stderr, "inode number: %ld\n", ep->e_ino);
295 1.1 cgd panic("flags: %s\n", flagvalues(ep));
296 1.1 cgd }
297 1.1 cgd
298 1.1 cgd /*
299 1.1 cgd * Construct a string indicating the active flag bits of an entry.
300 1.1 cgd */
301 1.1 cgd char *
302 1.1 cgd flagvalues(ep)
303 1.1 cgd register struct entry *ep;
304 1.1 cgd {
305 1.1 cgd static char flagbuf[BUFSIZ];
306 1.1 cgd
307 1.1 cgd (void) strcpy(flagbuf, "|NIL");
308 1.1 cgd flagbuf[0] = '\0';
309 1.1 cgd if (ep->e_flags & REMOVED)
310 1.1 cgd (void) strcat(flagbuf, "|REMOVED");
311 1.1 cgd if (ep->e_flags & TMPNAME)
312 1.1 cgd (void) strcat(flagbuf, "|TMPNAME");
313 1.1 cgd if (ep->e_flags & EXTRACT)
314 1.1 cgd (void) strcat(flagbuf, "|EXTRACT");
315 1.1 cgd if (ep->e_flags & NEW)
316 1.1 cgd (void) strcat(flagbuf, "|NEW");
317 1.1 cgd if (ep->e_flags & KEEP)
318 1.1 cgd (void) strcat(flagbuf, "|KEEP");
319 1.1 cgd if (ep->e_flags & EXISTED)
320 1.1 cgd (void) strcat(flagbuf, "|EXISTED");
321 1.1 cgd return (&flagbuf[1]);
322 1.1 cgd }
323 1.1 cgd
324 1.1 cgd /*
325 1.1 cgd * Check to see if a name is on a dump tape.
326 1.1 cgd */
327 1.1 cgd ino_t
328 1.1 cgd dirlookup(name)
329 1.1 cgd char *name;
330 1.1 cgd {
331 1.1 cgd ino_t ino;
332 1.1 cgd
333 1.3 cgd ino = pathsearch(name)->d_ino;
334 1.3 cgd if (ino == 0 || TSTINO(ino, dumpmap) == 0)
335 1.1 cgd fprintf(stderr, "%s is not on tape\n", name);
336 1.1 cgd return (ino);
337 1.1 cgd }
338 1.1 cgd
339 1.1 cgd /*
340 1.1 cgd * Elicit a reply.
341 1.1 cgd */
342 1.3 cgd int
343 1.1 cgd reply(question)
344 1.1 cgd char *question;
345 1.1 cgd {
346 1.1 cgd char c;
347 1.1 cgd
348 1.1 cgd do {
349 1.1 cgd fprintf(stderr, "%s? [yn] ", question);
350 1.1 cgd (void) fflush(stderr);
351 1.1 cgd c = getc(terminal);
352 1.1 cgd while (c != '\n' && getc(terminal) != '\n')
353 1.1 cgd if (feof(terminal))
354 1.1 cgd return (FAIL);
355 1.1 cgd } while (c != 'y' && c != 'n');
356 1.1 cgd if (c == 'y')
357 1.1 cgd return (GOOD);
358 1.1 cgd return (FAIL);
359 1.1 cgd }
360 1.1 cgd
361 1.1 cgd /*
362 1.1 cgd * handle unexpected inconsistencies
363 1.1 cgd */
364 1.3 cgd #if __STDC__
365 1.3 cgd #include <stdarg.h>
366 1.3 cgd #else
367 1.3 cgd #include <varargs.h>
368 1.3 cgd #endif
369 1.3 cgd
370 1.3 cgd void
371 1.3 cgd #if __STDC__
372 1.3 cgd panic(const char *fmt, ...)
373 1.3 cgd #else
374 1.3 cgd panic(fmt, va_alist)
375 1.3 cgd char *fmt;
376 1.3 cgd va_dcl
377 1.3 cgd #endif
378 1.3 cgd {
379 1.3 cgd va_list ap;
380 1.3 cgd #if __STDC__
381 1.3 cgd va_start(ap, fmt);
382 1.3 cgd #else
383 1.3 cgd va_start(ap);
384 1.3 cgd #endif
385 1.1 cgd
386 1.3 cgd vfprintf(stderr, fmt, ap);
387 1.1 cgd if (yflag)
388 1.1 cgd return;
389 1.1 cgd if (reply("abort") == GOOD) {
390 1.1 cgd if (reply("dump core") == GOOD)
391 1.1 cgd abort();
392 1.1 cgd done(1);
393 1.1 cgd }
394 1.1 cgd }
395