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