dump.h revision 1.51 1 1.51 christos /* $NetBSD: dump.h,v 1.51 2013/06/15 01:27:19 christos Exp $ */
2 1.9 cgd
3 1.1 cgd /*-
4 1.7 mycroft * Copyright (c) 1980, 1993
5 1.7 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.37 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd *
31 1.13 lukem * @(#)dump.h 8.2 (Berkeley) 4/28/95
32 1.1 cgd */
33 1.15 bouyer
34 1.15 bouyer #include <machine/bswap.h>
35 1.51 christos #ifdef DUMP_LFS
36 1.51 christos #include <ufs/lfs/lfs.h>
37 1.51 christos #endif
38 1.51 christos #include <ufs/ufs/dinode.h>
39 1.51 christos #include <protocols/dumprestore.h>
40 1.1 cgd
41 1.36 fvdl union dinode {
42 1.36 fvdl struct ufs1_dinode dp1;
43 1.36 fvdl struct ufs2_dinode dp2;
44 1.51 christos #ifdef DUMP_LFS
45 1.51 christos struct ulfs1_dinode dlp1;
46 1.51 christos struct ulfs2_dinode dlp2;
47 1.51 christos #endif
48 1.36 fvdl };
49 1.36 fvdl #define DIP(dp, field) \
50 1.36 fvdl (is_ufs2 ? (dp)->dp2.di_##field : (dp)->dp1.di_##field)
51 1.1 cgd
52 1.42 skrll #define DIP_SET(dp, field, val) do { \
53 1.42 skrll if (is_ufs2) \
54 1.42 skrll (dp)->dp2.di_##field = (val); \
55 1.42 skrll else \
56 1.42 skrll (dp)->dp1.di_##field = (val); \
57 1.42 skrll } while (0)
58 1.42 skrll
59 1.1 cgd /*
60 1.19 perseant * Filestore-independent UFS data, so code can be more easily shared
61 1.19 perseant * between ffs, lfs, and maybe ext2fs and others as well.
62 1.19 perseant */
63 1.19 perseant struct ufsi {
64 1.28 lukem int64_t ufs_dsize; /* file system size, in sectors */
65 1.19 perseant int32_t ufs_bsize; /* block size */
66 1.19 perseant int32_t ufs_bshift; /* log2(ufs_bsize) */
67 1.19 perseant int32_t ufs_fsize; /* fragment size */
68 1.31 lukem int32_t ufs_frag; /* block size / frag size */
69 1.19 perseant int32_t ufs_fsatoda; /* disk address conversion constant */
70 1.19 perseant int32_t ufs_nindir; /* disk addresses per indirect block */
71 1.31 lukem int32_t ufs_inopb; /* inodes per block */
72 1.19 perseant int32_t ufs_maxsymlinklen; /* max symlink length */
73 1.31 lukem int32_t ufs_bmask; /* block mask */
74 1.31 lukem int32_t ufs_fmask; /* frag mask */
75 1.31 lukem int64_t ufs_qbmask; /* ~ufs_bmask */
76 1.31 lukem int64_t ufs_qfmask; /* ~ufs_fmask */
77 1.19 perseant };
78 1.19 perseant #define fsatoda(u,a) ((a) << (u)->ufs_fsatoda)
79 1.19 perseant #define ufs_fragroundup(u,size) /* calculates roundup(size, ufs_fsize) */ \
80 1.31 lukem (((size) + (u)->ufs_qfmask) & (u)->ufs_fmask)
81 1.19 perseant #define ufs_blkoff(u,loc) /* calculates (loc % u->ufs_bsize) */ \
82 1.31 lukem ((loc) & (u)->ufs_qbmask)
83 1.19 perseant #define ufs_dblksize(u,d,b) \
84 1.50 dholland ((((b) >= UFS_NDADDR || DIP((d), size) >= ((b)+1) << (u)->ufs_bshift \
85 1.19 perseant ? (u)->ufs_bsize \
86 1.36 fvdl : (ufs_fragroundup((u), ufs_blkoff(u, DIP((d), size)))))))
87 1.19 perseant struct ufsi *ufsib;
88 1.19 perseant
89 1.19 perseant /*
90 1.1 cgd * Dump maps used to describe what is to be dumped.
91 1.1 cgd */
92 1.1 cgd int mapsize; /* size of the state maps */
93 1.1 cgd char *usedinomap; /* map of allocated inodes */
94 1.1 cgd char *dumpdirmap; /* map of directories to be dumped */
95 1.1 cgd char *dumpinomap; /* map of files to be dumped */
96 1.1 cgd /*
97 1.1 cgd * Map manipulation macros.
98 1.1 cgd */
99 1.1 cgd #define SETINO(ino, map) \
100 1.1 cgd map[(u_int)((ino) - 1) / NBBY] |= 1 << ((u_int)((ino) - 1) % NBBY)
101 1.1 cgd #define CLRINO(ino, map) \
102 1.1 cgd map[(u_int)((ino) - 1) / NBBY] &= ~(1 << ((u_int)((ino) - 1) % NBBY))
103 1.1 cgd #define TSTINO(ino, map) \
104 1.1 cgd (map[(u_int)((ino) - 1) / NBBY] & (1 << ((u_int)((ino) - 1) % NBBY)))
105 1.1 cgd
106 1.1 cgd /*
107 1.1 cgd * All calculations done in 0.1" units!
108 1.1 cgd */
109 1.1 cgd char *disk; /* name of the disk file */
110 1.44 hannken char *disk_dev; /* name of the raw device we are dumping */
111 1.40 christos const char *tape; /* name of the tape file */
112 1.40 christos const char *dumpdates; /* name of the file containing dump date information*/
113 1.40 christos const char *temp; /* name of the file for doing rewrite of dumpdates */
114 1.1 cgd char lastlevel; /* dump level of previous dump */
115 1.1 cgd char level; /* dump level of this dump */
116 1.1 cgd int uflag; /* update flag */
117 1.24 tron int eflag; /* eject flag */
118 1.30 bouyer int lflag; /* autoload flag */
119 1.1 cgd int diskfd; /* disk file descriptor */
120 1.1 cgd int tapefd; /* tape file descriptor */
121 1.1 cgd int pipeout; /* true => output to standard output */
122 1.46 christos int trueinc; /* true => "true incremental", i.e use last 9 as ref */
123 1.1 cgd ino_t curino; /* current inumber; used globally */
124 1.1 cgd int newtape; /* new tape flag */
125 1.36 fvdl u_int64_t tapesize; /* estimated tape size, blocks */
126 1.1 cgd long tsize; /* tape size in 0.1" units */
127 1.1 cgd long asize; /* number of 0.1" units written on current tape */
128 1.1 cgd int etapes; /* estimated number of tapes */
129 1.7 mycroft int nonodump; /* if set, do not honor UF_NODUMP user flags */
130 1.33 lukem int unlimited; /* if set, write to end of medium */
131 1.1 cgd
132 1.22 christos extern int density; /* density in 0.1" units */
133 1.22 christos extern int notify; /* notify operator flag */
134 1.31 lukem extern int timestamp; /* timestamp messages */
135 1.22 christos extern int blockswritten; /* number of blocks written on current tape */
136 1.22 christos extern int tapeno; /* current tape number */
137 1.36 fvdl extern int is_ufs2;
138 1.22 christos
139 1.1 cgd time_t tstart_writing; /* when started writing the first tape block */
140 1.38 lukem time_t tstart_volume; /* when started writing the current volume */
141 1.10 lukem int xferrate; /* averaged transfer rate of all volumes */
142 1.19 perseant char sblock_buf[MAXBSIZE]; /* buffer to hold the superblock */
143 1.21 scw extern long dev_bsize; /* block size of underlying disk device */
144 1.1 cgd int dev_bshift; /* log2(dev_bsize) */
145 1.1 cgd int tp_bshift; /* log2(TP_BSIZE) */
146 1.14 bouyer int needswap; /* file system in swapped byte order */
147 1.38 lukem
148 1.38 lukem
149 1.38 lukem /* some inline functions to help the byte-swapping mess */
150 1.41 perry static inline u_int16_t iswap16(u_int16_t);
151 1.41 perry static inline u_int32_t iswap32(u_int32_t);
152 1.41 perry static inline u_int64_t iswap64(u_int64_t);
153 1.26 lukem
154 1.41 perry static inline u_int16_t iswap16(u_int16_t x)
155 1.26 lukem {
156 1.14 bouyer if (needswap)
157 1.14 bouyer return bswap16(x);
158 1.26 lukem else
159 1.26 lukem return x;
160 1.14 bouyer }
161 1.14 bouyer
162 1.41 perry static inline u_int32_t iswap32(u_int32_t x)
163 1.14 bouyer {
164 1.14 bouyer if (needswap)
165 1.14 bouyer return bswap32(x);
166 1.26 lukem else
167 1.26 lukem return x;
168 1.14 bouyer }
169 1.14 bouyer
170 1.41 perry static inline u_int64_t iswap64(u_int64_t x)
171 1.14 bouyer {
172 1.14 bouyer if (needswap)
173 1.14 bouyer return bswap64(x);
174 1.26 lukem else
175 1.26 lukem return x;
176 1.26 lukem }
177 1.19 perseant
178 1.19 perseant /* filestore-specific hooks */
179 1.26 lukem int fs_read_sblock(char *);
180 1.26 lukem struct ufsi *fs_parametrize(void);
181 1.26 lukem ino_t fs_maxino(void);
182 1.36 fvdl void fs_mapinodes(ino_t, u_int64_t *, int *);
183 1.7 mycroft
184 1.1 cgd /* operator interface functions */
185 1.40 christos void broadcast(const char *);
186 1.26 lukem void lastdump(char);
187 1.49 dholland void msg(const char *fmt, ...) __printflike(1, 2);
188 1.49 dholland void msgtail(const char *fmt, ...) __printflike(1, 2);
189 1.40 christos int query(const char *);
190 1.49 dholland void quit(const char *fmt, ...) __printflike(1, 2);
191 1.26 lukem time_t do_stats(void);
192 1.26 lukem void statussig(int);
193 1.26 lukem void timeest(void);
194 1.48 dholland time_t unctime(const char *);
195 1.1 cgd
196 1.10 lukem /* mapping routines */
197 1.36 fvdl union dinode;
198 1.36 fvdl int64_t blockest(union dinode *);
199 1.36 fvdl void mapfileino(ino_t, u_int64_t *, int *);
200 1.36 fvdl int mapfiles(ino_t, u_int64_t *, char *, char * const *);
201 1.36 fvdl int mapdirs(ino_t, u_int64_t *);
202 1.1 cgd
203 1.1 cgd /* file dumping routines */
204 1.36 fvdl void blksout32(int32_t *, int, ino_t);
205 1.36 fvdl void blksout64(int64_t *, int, ino_t);
206 1.36 fvdl void dumpino(union dinode *, ino_t);
207 1.45 matt #ifndef RRESTORE
208 1.26 lukem void dumpmap(char *, int, ino_t);
209 1.45 matt #endif
210 1.26 lukem void writeheader(ino_t);
211 1.16 bouyer
212 1.16 bouyer /* data block caching */
213 1.26 lukem void bread(daddr_t, char *, int);
214 1.26 lukem void rawread(daddr_t, char *, int);
215 1.26 lukem void initcache(int, int);
216 1.26 lukem void printcachestats(void);
217 1.1 cgd
218 1.1 cgd /* tape writing routines */
219 1.26 lukem int alloctape(void);
220 1.26 lukem void close_rewind(void);
221 1.26 lukem void dumpblock(daddr_t, int);
222 1.26 lukem void startnewtape(int);
223 1.26 lukem void trewind(int);
224 1.48 dholland void writerec(const char *, int);
225 1.26 lukem
226 1.26 lukem void Exit(int);
227 1.26 lukem void dumpabort(int);
228 1.26 lukem void getfstab(void);
229 1.1 cgd
230 1.26 lukem char *rawname(char *);
231 1.36 fvdl union dinode *getino(ino_t);
232 1.1 cgd
233 1.27 lukem void *xcalloc(size_t, size_t);
234 1.27 lukem void *xmalloc(size_t);
235 1.27 lukem char *xstrdup(const char *);
236 1.27 lukem
237 1.43 perseant /* LFS snapshot hooks */
238 1.43 perseant #ifdef DUMP_LFS
239 1.43 perseant int lfs_wrap_stop(char *);
240 1.43 perseant void lfs_wrap_go(void);
241 1.43 perseant #endif
242 1.43 perseant
243 1.7 mycroft /* rdump routines */
244 1.23 christos #if defined(RDUMP) || defined(RRESTORE)
245 1.26 lukem void rmtclose(void);
246 1.40 christos int rmthost(const char *);
247 1.40 christos int rmtopen(const char *, int, int);
248 1.40 christos int rmtwrite(const char *, int);
249 1.30 bouyer int rmtioctl(int, int);
250 1.23 christos #endif /* RDUMP || RRESTORE */
251 1.7 mycroft
252 1.26 lukem void interrupt(int); /* in case operator bangs on console */
253 1.1 cgd
254 1.1 cgd /*
255 1.1 cgd * Exit status codes
256 1.1 cgd */
257 1.1 cgd #define X_FINOK 0 /* normal exit */
258 1.32 lukem #define X_STARTUP 1 /* startup error */
259 1.1 cgd #define X_REWRITE 2 /* restart writing from the check point */
260 1.6 cgd #define X_ABORT 3 /* abort dump; don't attempt checkpointing */
261 1.1 cgd
262 1.1 cgd #define OPGRENT "operator" /* group entry to notify */
263 1.1 cgd #define DIALUP "ttyd" /* prefix for dialups */
264 1.1 cgd
265 1.27 lukem struct fstab *fstabsearch(const char *); /* search fs_file and fs_spec */
266 1.39 christos struct statvfs *mntinfosearch(const char *key);
267 1.6 cgd
268 1.6 cgd #ifndef NAME_MAX
269 1.6 cgd #define NAME_MAX 255
270 1.6 cgd #endif
271 1.1 cgd
272 1.1 cgd /*
273 1.1 cgd * The contents of the file _PATH_DUMPDATES is maintained both on
274 1.1 cgd * a linked list, and then (eventually) arrayified.
275 1.1 cgd */
276 1.1 cgd struct dumpdates {
277 1.6 cgd char dd_name[NAME_MAX+3];
278 1.1 cgd char dd_level;
279 1.1 cgd time_t dd_ddate;
280 1.1 cgd };
281 1.22 christos
282 1.22 christos extern int nddates; /* number of records (might be zero) */
283 1.22 christos extern struct dumpdates **ddatev; /* the arrayfied version */
284 1.22 christos
285 1.26 lukem void initdumptimes(void);
286 1.26 lukem void getdumptime(void);
287 1.26 lukem void putdumptime(void);
288 1.1 cgd #define ITITERATE(i, ddp) \
289 1.32 lukem if (ddatev != NULL) \
290 1.32 lukem for (ddp = ddatev[i = 0]; i < nddates; ddp = ddatev[++i])
291 1.1 cgd
292 1.26 lukem void sig(int signo);
293 1.1 cgd
294 1.7 mycroft #ifndef _PATH_FSTAB
295 1.7 mycroft #define _PATH_FSTAB "/etc/fstab"
296 1.1 cgd #endif
297