* Copyright (c) 1980, 1991 The Regents of the University of California.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 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
static char sccsid
[] = "@(#)dumptape.c 5.18 (Berkeley) 4/24/91";
static char rcsid
[] = "$Header: /b/source/CVS/src/sbin/dump/dumptape.c,v 1.3 1993/03/23 00:27:15 cgd Exp $";
#include <protocols/dumprestore.h>
char (*tblock
)[TP_BSIZE
]; /* pointer to malloc()ed buffer for tape */
int writesize
; /* size of malloc()ed buffer for tape */
long lastspclrec
= -1; /* tape block number of last written header */
int trecno
= 0; /* next record to write in current block */
extern long blocksperfile
; /* number of blocks per output file */
long blocksthisvol
; /* number of blocks on current output file */
extern int ntrec
; /* blocking factor on tape */
int rmtopen(), rmtwrite();
void doslave(), enslave(), flushtape(), killall();
* Concurrent dump mods (Caltech) - disk block reading and tape writing
* are exported to several slave processes. While one slave writes the
* tape, the others read disk blocks; they pass control of the tape in
* a ring via flock(). The parent process traverses the filesystem and
* sends writeheader()'s and lists of daddr's to the slaves via pipes.
struct req
{ /* instruction packets sent to slaves */
#define SLAVES 3 /* 1 slave writing, 1 reading, 1 for slack */
int slavefd
[SLAVES
]; /* pipes from master to each slave */
int slavepid
[SLAVES
]; /* used by killall() */
int rotor
; /* next slave to be instructed */
int master
; /* pid of master, for sending error signals */
int tenths
; /* length of tape used per block written */
int pgoff
= getpagesize() - 1;
writesize
= ntrec
* TP_BSIZE
;
reqsiz
= ntrec
* sizeof(struct req
);
* CDC 92181's and 92185's make 0.8" gaps in 1600-bpi start/stop mode
* (see DEC TU80 User's Guide). The shorter gaps of 6250-bpi require
* repositioning after stopping, i.e, streaming mode, where the gap is
* variable, 0.30" to 0.45". The gap is maximal when the tape stops.
tenths
= writesize
/ density
+
(cartridge
? 16 : density
== 625 ? 5 : 8);
* Allocate tape buffer contiguous with the array of instruction
* packets, so flushtape() can write them together with one write().
* Align tape buffer on page boundary to speed up tape write().
req
= (struct req
*)malloc(reqsiz
+ writesize
+ pgoff
);
tblock
= (char (*)[TP_BSIZE
]) (((long)&req
[ntrec
] + pgoff
) &~ pgoff
);
req
= (struct req
*)tblock
- ntrec
;
req
[trecno
].dblk
= (daddr_t
)0;
*(union u_spcl
*)(*tblock
++) = *(union u_spcl
*)dp
; /* movc3 */
lastspclrec
= spcl
.c_tapea
;
int avail
, tpblks
, dblkno
;
dblkno
= fsbtodb(sblock
, blkno
);
tpblks
= size
>> tp_bshift
;
while ((avail
= MIN(tpblks
, ntrec
- trecno
)) > 0) {
req
[trecno
].dblk
= dblkno
;
req
[trecno
].count
= avail
;
dblkno
+= avail
<< (tp_bshift
- dev_bshift
);
msg("write error on %s\n", tape
);
quit("Cannot recover\n");
msg("write error %d blocks into volume %d\n", blocksthisvol
, tapeno
);
broadcast("DUMP WRITE ERROR!\n");
if (!query("Do you want to restart?"))
msg("Closing this volume. Prepare to restart with new media;\n");
msg("this dump volume will be rewritten.\n");
int siz
= (char *)tblock
- (char *)req
;
if (atomic(write
, slavefd
[rotor
], req
, siz
) != siz
)
quit("error writing command pipe: %s\n", strerror(errno
));
tblock
= (char (*)[TP_BSIZE
]) &req
[ntrec
];
if (!pipeout
&& (blocksperfile
?
(blocksthisvol
>= blocksperfile
) : (asize
> tsize
))) {
for (f
= 0; f
< SLAVES
; f
++)
while (wait((int *)NULL
) >= 0) /* wait for any signals from slaves */
msg("Closing %s\n", tape
);
while (rmtopen(tape
, 0) < 0)
while ((f
= open(tape
, 0)) < 0)
msg("Change Volumes: Mount volume #%d\n", tapeno
+1);
broadcast("CHANGE DUMP VOLUMES!\7\7\n");
while (!query("Is the new volume mounted and ready to go?"))
if (query("Do you want to abort?")) {
* We implement taking and restoring checkpoints on the tape level.
* When each tape is opened, a new process is created by forking; this
* saves all of the necessary context in the parent. The child
* continues the dump; the parent waits around, saving the context.
* If the child returns X_REWRITE, then it had problems writing that tape;
* this causes the parent to fork again, duplicating the context, and
* everything continues as if nothing had happened.
interrupt
= signal(SIGINT
, SIG_IGN
);
(void)signal(SIGINT
, interrupt
);
* All signals are inherited...
msg("Context save fork fails in parent %d\n", parentpid
);
* save the context by waiting
* until the child doing all of the work returns.
* don't catch the interrupt
msg("Tape: %d; parent process: %d child process %d\n",
tapeno
+1, parentpid
, childpid
);
while ((waitpid
= wait(&status
)) != childpid
)
msg("Parent %d waiting for child %d has another child %d return\n",
parentpid
, childpid
, waitpid
);
msg("Child %d returns LOB status %o\n",
status
= (status
>> 8) & 0xFF;
msg("Child %d finishes X_FINOK\n", childpid
);
msg("Child %d finishes X_ABORT\n", childpid
);
msg("Child %d finishes X_REWRITE\n", childpid
);
msg("Child %d finishes unknown %d\n",
goto restore_check_point
;
msg("Bad return code from dump: %d\n", status
);
} else { /* we are the child; just continue */
sleep(4); /* allow time for parent's message to get out */
msg("Child on Tape %d has parent %d, my pid = %d\n",
tapeno
+1, parentpid
, getpid());
* If we have a name like "/dev/rmt0,/dev/rmt1",
* use the name before the comma first, and save
* the remaining names for subsequent volumes.
tapeno
++; /* current tape sequence */
if (nexttape
|| index(tape
, ',')) {
if (nexttape
&& *nexttape
)
if (p
= index(tape
, ',')) {
msg("Dumping volume %d on %s\n", tapeno
, tape
);
while ((tapefd
= (host
? rmtopen(tape
, 2) :
pipeout
? 1 : open(tape
, O_WRONLY
|O_CREAT
, 0666))) < 0)
pipeout
? 1 : open(tape
, O_WRONLY
|O_CREAT
, 0666)) < 0)
msg("Cannot open output \"%s\".\n", tape
);
if (!query("Do you want to retry the open?"))
enslave(); /* Share open tape file descriptor with slaves */
newtape
++; /* new tape signal */
if (spcl
.c_type
!= TS_END
)
for (i
= 0; i
< spcl
.c_count
; i
++)
spcl
.c_count
= blks
+ 1 - spcl
.c_tapea
+ lastspclrec
;
spcl
.c_flags
|= DR_NEWHEADER
;
spcl
.c_flags
&=~ DR_NEWHEADER
;
msg("Volume %d begins with blocks from inode %d\n",
if (master
!= 0 && master
!= getpid())
kill(master
, SIGTERM
); /* Signals master to call dumpabort */
msg("The ENTIRE dump is aborted.\n");
msg("pid = %d exits with status %d\n", getpid(), status
);
* could use pipe() for this if flock() worked on pipes
strcpy(tmpname
, _PATH_LOCK
);
if ((fd
[1] = creat(tmpname
, 0400)) < 0)
quit("cannot create lockfile %s: %s\n",
tmpname
, strerror(errno
));
if ((fd
[0] = open(tmpname
, 0)) < 0)
quit("cannot reopen lockfile %s: %s\n",
tmpname
, strerror(errno
));
int first
[2], prev
[2], next
[2], cmd
[2]; /* file descriptors */
signal(SIGTERM
, dumpabort
); /* Slave sends SIGTERM on dumpabort() */
signal(SIGPIPE
, sigpipe
);
signal(SIGUSR1
, tperror
); /* Slave sends SIGUSR1 on tape errors */
for (i
= 0; i
< SLAVES
; i
++) {
next
[1] = first
[1]; /* Last slave loops back */
if (pipe(cmd
) < 0 || (slavepid
[i
] = fork()) < 0)
quit("too many slaves, %d (recompile smaller): %s\n",
if (slavepid
[i
] == 0) { /* Slave starts up here */
signal(SIGINT
, SIG_IGN
); /* Master handles this */
doslave(cmd
[0], prev
, next
);
for (i
= 0; i
< SLAVES
; i
++)
kill(slavepid
[i
], SIGKILL
);
* Synchronization - each process has a lockfile, and shares file
* descriptors to the following process's lockfile. When our write
* completes, we release our lock on the following process's lock-
* file, allowing the following process to lock it and proceed. We
* get the lock back for the next cycle by swapping descriptors.
register int cmd
, prev
[2], next
[2];
register int nread
, toggle
= 0;
* Need our own seek pointer.
if ((diskfd
= open(disk
, O_RDONLY
)) < 0)
quit("slave couldn't reopen disk: %s\n", strerror(errno
));
* Get list of blocks to dump, read the blocks into tape buffer
while ((nread
= atomic(read
, cmd
, req
, reqsiz
)) == reqsiz
) {
register struct req
*p
= req
;
for (trecno
= 0; trecno
< ntrec
; trecno
+= p
->count
, p
+= p
->count
) {
bread(p
->dblk
, tblock
[trecno
],
if (p
->count
!= 1 || atomic(read
, cmd
,
tblock
[trecno
], TP_BSIZE
) != TP_BSIZE
)
quit("master/slave protocol botched.\n");
flock(prev
[toggle
], LOCK_EX
); /* Wait our turn */
if ((nwrite
= (host
? rmtwrite(tblock
[0], writesize
)
: write(tapefd
, tblock
[0], writesize
))) != writesize
) {
if ((nwrite
= write(tapefd
, tblock
[0], writesize
))
msg("short write: got %d instead of %d\n",
flock(next
[toggle
], LOCK_UN
); /* Next slave's turn */
} /* Also jolts him awake */
quit("error reading command pipe: %s\n", strerror(errno
));
* Since a read from a pipe may not return all we asked for,
* or a write may not write all we ask if we get a signal,
* loop until the count is satisfied (or error).
atomic(func
, fd
, buf
, count
)
int (*func
)(), fd
, count
;
while ((got
= (*func
)(fd
, buf
, need
)) > 0 && (need
-= got
) > 0)
return (got
< 0 ? got
: count
- need
);