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