299 lines
7.0 KiB
C
299 lines
7.0 KiB
C
/*
|
|
* Copyright (c) 1983 The Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef lint
|
|
char copyright[] =
|
|
"@(#) Copyright (c) 1983 The Regents of the University of California.\n\
|
|
All rights reserved.\n";
|
|
#endif /* not lint */
|
|
|
|
#ifndef lint
|
|
static char sccsid[] = "@(#)main.c 5.8 (Berkeley) 6/1/90";
|
|
#endif /* not lint */
|
|
|
|
/*
|
|
* Modified to recursively extract all files within a subtree
|
|
* (supressed by the h option) and recreate the heirarchical
|
|
* structure of that subtree and move extracted files to their
|
|
* proper homes (supressed by the m option).
|
|
* Includes the s (skip files) option for use with multiple
|
|
* dumps on a single tape.
|
|
* 8/29/80 by Mike Litzkow
|
|
*
|
|
* Modified to work on the new file system and to recover from
|
|
* tape read errors.
|
|
* 1/19/82 by Kirk McKusick
|
|
*
|
|
* Full incremental restore running entirely in user code and
|
|
* interactive tape browser.
|
|
* 1/19/83 by Kirk McKusick
|
|
*/
|
|
|
|
#include "restore.h"
|
|
#include <protocols/dumprestore.h>
|
|
#include <sys/signal.h>
|
|
#include "pathnames.h"
|
|
|
|
int bflag = 0, cvtflag = 0, dflag = 0, vflag = 0, yflag = 0;
|
|
int hflag = 1, mflag = 1, Nflag = 0;
|
|
char command = '\0';
|
|
long dumpnum = 1;
|
|
long volno = 0;
|
|
long ntrec;
|
|
char *dumpmap;
|
|
char *clrimap;
|
|
ino_t maxino;
|
|
time_t dumptime;
|
|
time_t dumpdate;
|
|
FILE *terminal;
|
|
|
|
main(argc, argv)
|
|
int argc;
|
|
char *argv[];
|
|
{
|
|
register char *cp;
|
|
ino_t ino;
|
|
char *inputdev = _PATH_DEFTAPE;
|
|
char *symtbl = "./restoresymtable";
|
|
char name[MAXPATHLEN];
|
|
void onintr();
|
|
|
|
if (signal(SIGINT, onintr) == SIG_IGN)
|
|
(void) signal(SIGINT, SIG_IGN);
|
|
if (signal(SIGTERM, onintr) == SIG_IGN)
|
|
(void) signal(SIGTERM, SIG_IGN);
|
|
setlinebuf(stderr);
|
|
if (argc < 2) {
|
|
usage:
|
|
fprintf(stderr, "Usage:\n%s%s%s%s%s",
|
|
"\trestore tfhsvy [file file ...]\n",
|
|
"\trestore xfhmsvy [file file ...]\n",
|
|
"\trestore ifhmsvy\n",
|
|
"\trestore rfsvy\n",
|
|
"\trestore Rfsvy\n");
|
|
done(1);
|
|
}
|
|
argv++;
|
|
argc -= 2;
|
|
command = '\0';
|
|
for (cp = *argv++; *cp; cp++) {
|
|
switch (*cp) {
|
|
case '-':
|
|
break;
|
|
case 'c':
|
|
cvtflag++;
|
|
break;
|
|
case 'd':
|
|
dflag++;
|
|
break;
|
|
case 'h':
|
|
hflag = 0;
|
|
break;
|
|
case 'm':
|
|
mflag = 0;
|
|
break;
|
|
case 'N':
|
|
Nflag++;
|
|
break;
|
|
case 'v':
|
|
vflag++;
|
|
break;
|
|
case 'y':
|
|
yflag++;
|
|
break;
|
|
case 'f':
|
|
if (argc < 1) {
|
|
fprintf(stderr, "missing device specifier\n");
|
|
done(1);
|
|
}
|
|
inputdev = *argv++;
|
|
argc--;
|
|
break;
|
|
case 'b':
|
|
/*
|
|
* change default tape blocksize
|
|
*/
|
|
bflag++;
|
|
if (argc < 1) {
|
|
fprintf(stderr, "missing block size\n");
|
|
done(1);
|
|
}
|
|
ntrec = atoi(*argv++);
|
|
if (ntrec <= 0) {
|
|
fprintf(stderr, "Block size must be a positive integer\n");
|
|
done(1);
|
|
}
|
|
argc--;
|
|
break;
|
|
case 's':
|
|
/*
|
|
* dumpnum (skip to) for multifile dump tapes
|
|
*/
|
|
if (argc < 1) {
|
|
fprintf(stderr, "missing dump number\n");
|
|
done(1);
|
|
}
|
|
dumpnum = atoi(*argv++);
|
|
if (dumpnum <= 0) {
|
|
fprintf(stderr, "Dump number must be a positive integer\n");
|
|
done(1);
|
|
}
|
|
argc--;
|
|
break;
|
|
case 't':
|
|
case 'R':
|
|
case 'r':
|
|
case 'x':
|
|
case 'i':
|
|
if (command != '\0') {
|
|
fprintf(stderr,
|
|
"%c and %c are mutually exclusive\n",
|
|
*cp, command);
|
|
goto usage;
|
|
}
|
|
command = *cp;
|
|
break;
|
|
default:
|
|
fprintf(stderr, "Bad key character %c\n", *cp);
|
|
goto usage;
|
|
}
|
|
}
|
|
if (command == '\0') {
|
|
fprintf(stderr, "must specify i, t, r, R, or x\n");
|
|
goto usage;
|
|
}
|
|
setinput(inputdev);
|
|
if (argc == 0) {
|
|
argc = 1;
|
|
*--argv = ".";
|
|
}
|
|
switch (command) {
|
|
/*
|
|
* Interactive mode.
|
|
*/
|
|
case 'i':
|
|
setup();
|
|
extractdirs(1);
|
|
initsymtable((char *)0);
|
|
runcmdshell();
|
|
done(0);
|
|
/*
|
|
* Incremental restoration of a file system.
|
|
*/
|
|
case 'r':
|
|
setup();
|
|
if (dumptime > 0) {
|
|
/*
|
|
* This is an incremental dump tape.
|
|
*/
|
|
vprintf(stdout, "Begin incremental restore\n");
|
|
initsymtable(symtbl);
|
|
extractdirs(1);
|
|
removeoldleaves();
|
|
vprintf(stdout, "Calculate node updates.\n");
|
|
treescan(".", ROOTINO, nodeupdates);
|
|
findunreflinks();
|
|
removeoldnodes();
|
|
} else {
|
|
/*
|
|
* This is a level zero dump tape.
|
|
*/
|
|
vprintf(stdout, "Begin level 0 restore\n");
|
|
initsymtable((char *)0);
|
|
extractdirs(1);
|
|
vprintf(stdout, "Calculate extraction list.\n");
|
|
treescan(".", ROOTINO, nodeupdates);
|
|
}
|
|
createleaves(symtbl);
|
|
createlinks();
|
|
setdirmodes();
|
|
checkrestore();
|
|
if (dflag) {
|
|
vprintf(stdout, "Verify the directory structure\n");
|
|
treescan(".", ROOTINO, verifyfile);
|
|
}
|
|
dumpsymtable(symtbl, (long)1);
|
|
done(0);
|
|
/*
|
|
* Resume an incremental file system restoration.
|
|
*/
|
|
case 'R':
|
|
initsymtable(symtbl);
|
|
skipmaps();
|
|
skipdirs();
|
|
createleaves(symtbl);
|
|
createlinks();
|
|
setdirmodes();
|
|
checkrestore();
|
|
dumpsymtable(symtbl, (long)1);
|
|
done(0);
|
|
/*
|
|
* List contents of tape.
|
|
*/
|
|
case 't':
|
|
setup();
|
|
extractdirs(0);
|
|
initsymtable((char *)0);
|
|
while (argc--) {
|
|
canon(*argv++, name);
|
|
ino = dirlookup(name);
|
|
if (ino == 0)
|
|
continue;
|
|
treescan(name, ino, listfile);
|
|
}
|
|
done(0);
|
|
/*
|
|
* Batch extraction of tape contents.
|
|
*/
|
|
case 'x':
|
|
setup();
|
|
extractdirs(1);
|
|
initsymtable((char *)0);
|
|
while (argc--) {
|
|
canon(*argv++, name);
|
|
ino = dirlookup(name);
|
|
if (ino == 0)
|
|
continue;
|
|
if (mflag)
|
|
pathcheck(name);
|
|
treescan(name, ino, addfile);
|
|
}
|
|
createfiles();
|
|
createlinks();
|
|
setdirmodes();
|
|
if (dflag)
|
|
checkrestore();
|
|
done(0);
|
|
}
|
|
}
|