|
|
1.1 root 1: /*
2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7: * Reserved. This file contains Original Code and/or Modifications of
8: * Original Code as defined in and that are subject to the Apple Public
9: * Source License Version 1.1 (the "License"). You may not use this file
10: * except in compliance with the License. Please obtain a copy of the
11: * License at http://www.apple.com/publicsource and read it before using
12: * this file.
13: *
14: * The Original Code and all software distributed under the License are
15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
19: * License for the specific language governing rights and limitations
20: * under the License.
21: *
22: * @APPLE_LICENSE_HEADER_END@
23: */
24:
25: /*
26: * Copyright (c) 1980, 1993
27: * The Regents of the University of California. All rights reserved.
28: * (c) UNIX System Laboratories, Inc.
29: * All or some portions of this file are derived from material licensed
30: * to the University of California by American Telephone and Telegraph
31: * Co. or Unix System Laboratories, Inc. and are reproduced herein with
32: * the permission of UNIX System Laboratories, Inc.
33: *
34: * Redistribution and use in source and binary forms, with or without
35: * modification, are permitted provided that the following conditions
36: * are met:
37: * 1. Redistributions of source code must retain the above copyright
38: * notice, this list of conditions and the following disclaimer.
39: * 2. Redistributions in binary form must reproduce the above copyright
40: * notice, this list of conditions and the following disclaimer in the
41: * documentation and/or other materials provided with the distribution.
42: * 3. All advertising materials mentioning features or use of this software
43: * must display the following acknowledgement:
44: * This product includes software developed by the University of
45: * California, Berkeley and its contributors.
46: * 4. Neither the name of the University nor the names of its contributors
47: * may be used to endorse or promote products derived from this software
48: * without specific prior written permission.
49: *
50: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
51: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
52: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
53: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
54: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
55: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
56: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
57: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
58: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
59: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60: * SUCH DAMAGE.
61: *
62: * @(#)dumprestore.h 8.2 (Berkeley) 1/21/94
63: */
64:
65: #ifndef _DUMPRESTORE_H_
66: #define _DUMPRESTORE_H_
67:
68: /*
69: * TP_BSIZE is the size of file blocks on the dump tapes.
70: * Note that TP_BSIZE must be a multiple of DEV_BSIZE.
71: *
72: * NTREC is the number of TP_BSIZE blocks that are written
73: * in each tape record. HIGHDENSITYTREC is the number of
74: * TP_BSIZE blocks that are written in each tape record on
75: * 6250 BPI or higher density tapes.
76: *
77: * TP_NINDIR is the number of indirect pointers in a TS_INODE
78: * or TS_ADDR record. Note that it must be a power of two.
79: */
80: #define TP_BSIZE 1024
81: #define NTREC 10
82: #define HIGHDENSITYTREC 32
83: #define TP_NINDIR (TP_BSIZE/2)
84: #define LBLSIZE 16
85: #define NAMELEN 64
86:
87: #define OFS_MAGIC (int)60011
88: #define NFS_MAGIC (int)60012
89: #define CHECKSUM (int)84446
90:
91: union u_spcl {
92: char dummy[TP_BSIZE];
93: struct s_spcl {
94: long c_type; /* record type (see below) */
95: time_t c_date; /* date of this dump */
96: time_t c_ddate; /* date of previous dump */
97: long c_volume; /* dump volume number */
98: daddr_t c_tapea; /* logical block of this record */
99: ino_t c_inumber; /* number of inode */
100: long c_magic; /* magic number (see above) */
101: long c_checksum; /* record checksum */
102: struct dinode c_dinode; /* ownership and mode of inode */
103: long c_count; /* number of valid c_addr entries */
104: char c_addr[TP_NINDIR]; /* 1 => data; 0 => hole in inode */
105: char c_label[LBLSIZE]; /* dump label */
106: long c_level; /* level of this dump */
107: char c_filesys[NAMELEN]; /* name of dumpped file system */
108: char c_dev[NAMELEN]; /* name of dumpped device */
109: char c_host[NAMELEN]; /* name of dumpped host */
110: long c_flags; /* additional information */
111: long c_firstrec; /* first record on volume */
112: long c_spare[32]; /* reserved for future uses */
113: } s_spcl;
114: };
115:
116: /*
117: * special record types
118: */
119: #define TS_TAPE 1 /* dump tape header */
120: #define TS_INODE 2 /* beginning of file record */
121: #define TS_ADDR 4 /* continuation of file record */
122: #define TS_BITS 3 /* map of inodes on tape */
123: #define TS_CLRI 6 /* map of inodes deleted since last dump */
124: #define TS_END 5 /* end of volume marker */
125:
126: /*
127: * flag values
128: */
129: #define DR_NEWHEADER 0x0001 /* new format tape header */
130: #define DR_NEWINODEFMT 0x0002 /* new format inodes on tape */
131:
132: #define DUMPOUTFMT "%-16s %c %s" /* for printf */
133: /* name, level, ctime(date) */
134: #define DUMPINFMT "%16s %c %[^\n]\n" /* inverse for scanf */
135:
136: #endif /* !_DUMPRESTORE_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.