lfs_inode.c revision 1.2.10.1
1 /* $NetBSD: lfs_inode.c,v 1.2.10.1 2001/07/02 17:48:11 perseant Exp $ */ 2 3 /*- 4 * Copyright (c) 1980, 1991, 1993, 1994 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. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 #ifndef lint 38 __COPYRIGHT("@(#) Copyright (c) 1980, 1991, 1993, 1994\n\ 39 The Regents of the University of California. All rights reserved.\n"); 40 #endif /* not lint */ 41 42 #ifndef lint 43 #if 0 44 static char sccsid[] = "@(#)main.c 8.6 (Berkeley) 5/1/95"; 45 #else 46 __RCSID("$NetBSD: lfs_inode.c,v 1.2.10.1 2001/07/02 17:48:11 perseant Exp $"); 47 #endif 48 #endif /* not lint */ 49 50 #include <sys/param.h> 51 #include <sys/time.h> 52 #include <sys/stat.h> 53 #include <ufs/ufs/dir.h> 54 #include <ufs/ufs/dinode.h> 55 #include <sys/mount.h> 56 #include <ufs/lfs/lfs.h> 57 58 #include <protocols/dumprestore.h> 59 60 #include <ctype.h> 61 #include <errno.h> 62 #include <fts.h> 63 #include <stdio.h> 64 #ifdef __STDC__ 65 #include <string.h> 66 #include <unistd.h> 67 #endif 68 69 #include "dump.h" 70 71 #define MAXIFPB (MAXBSIZE / sizeof(IFILE)) 72 73 #define HASDUMPEDFILE 0x1 74 #define HASSUBDIRS 0x2 75 76 struct lfs *sblock; 77 78 /* 79 * Read the superblock from disk, and check its magic number. 80 * Determine whether byte-swapping needs to be done on this filesystem. 81 */ 82 int 83 fs_read_sblock(char *sblock_buf) 84 { 85 int needswap = 0; 86 87 sblock = (struct lfs *)sblock_buf; 88 rawread(LFS_LABELPAD, (char *) sblock, LFS_SBPAD); 89 if (sblock->lfs_magic != LFS_MAGIC) { 90 #ifdef notyet 91 if (sblock->lfs_magic == bswap32(LFS_MAGIC)) { 92 lfs_sb_swap(sblock, sblock, 0); 93 needswap = 1; 94 } else 95 #endif 96 quit("bad sblock magic number\n"); 97 } 98 return needswap; 99 } 100 101 /* 102 * Fill in the ufsi struct, as well as the maxino and dev_bsize global 103 * variables. 104 */ 105 struct ufsi * 106 fs_parametrize(void) 107 { 108 static struct ufsi ufsi; 109 110 spcl.c_flags = iswap32(iswap32(spcl.c_flags) | DR_NEWINODEFMT); 111 112 ufsi.ufs_dsize = fsbtodb(sblock,sblock->lfs_size); 113 if (sblock->lfs_version == 1) 114 ufsi.ufs_dsize = sblock->lfs_size >> sblock->lfs_blktodb; 115 ufsi.ufs_bsize = sblock->lfs_bsize; 116 ufsi.ufs_bshift = sblock->lfs_bshift; 117 ufsi.ufs_fsize = sblock->lfs_fsize; 118 ufsi.ufs_frag = sblock->lfs_frag; 119 ufsi.ufs_fsatoda = sblock->lfs_fsbtodb; 120 if (sblock->lfs_version == 1) 121 ufsi.ufs_fsatoda = 0; 122 ufsi.ufs_nindir = sblock->lfs_nindir; 123 ufsi.ufs_inopb = sblock->lfs_inopb; 124 ufsi.ufs_maxsymlinklen = sblock->lfs_maxsymlinklen; 125 ufsi.ufs_bmask = ~(sblock->lfs_bmask); 126 ufsi.ufs_qbmask = sblock->lfs_bmask; 127 ufsi.ufs_fmask = ~(sblock->lfs_ffmask); 128 ufsi.ufs_qfmask = sblock->lfs_ffmask; 129 130 dev_bsize = sblock->lfs_bsize >> sblock->lfs_blktodb; 131 132 return &ufsi; 133 } 134 135 ino_t 136 fs_maxino(void) 137 { 138 return ((getino(sblock->lfs_ifile)->di_size 139 - (sblock->lfs_cleansz + sblock->lfs_segtabsz) 140 * sblock->lfs_bsize) 141 / sblock->lfs_bsize) * sblock->lfs_ifpb - 1; 142 } 143 144 /* 145 * XXX KS - I know there's a better way to do this. 146 */ 147 #define BASE_SINDIR (NDADDR) 148 #define BASE_DINDIR (NDADDR+NINDIR(fs)) 149 #define BASE_TINDIR (NDADDR+NINDIR(fs)+NINDIR(fs)*NINDIR(fs)) 150 151 #define D_UNITS (NINDIR(fs)) 152 #define T_UNITS (NINDIR(fs)*NINDIR(fs)) 153 154 static daddr_t 155 lfs_bmap(struct lfs *fs, struct dinode *idinode, ufs_daddr_t lbn) 156 { 157 ufs_daddr_t residue, up; 158 int off=0; 159 char bp[MAXBSIZE]; 160 161 if(lbn > 0 && lbn > lblkno(fs, idinode->di_size)) { 162 return UNASSIGNED; 163 } 164 /* 165 * Indirect blocks: if it is a first-level indirect, pull its 166 * address from the inode; otherwise, call ourselves to find the 167 * address of the parent indirect block, and load that to find 168 * the desired address. 169 */ 170 if(lbn < 0) { 171 lbn *= -1; 172 if(lbn == NDADDR) { 173 /* printf("lbn %d: single indir base\n", -lbn); */ 174 return idinode->di_ib[0]; /* single indirect */ 175 } else if(lbn == BASE_DINDIR+1) { 176 /* printf("lbn %d: double indir base\n", -lbn); */ 177 return idinode->di_ib[1]; /* double indirect */ 178 } else if(lbn == BASE_TINDIR+2) { 179 /* printf("lbn %d: triple indir base\n", -lbn); */ 180 return idinode->di_ib[2]; /* triple indirect */ 181 } 182 183 /* 184 * Find the immediate parent. This is essentially finding the 185 * residue of modulus, and then rounding accordingly. 186 */ 187 residue = (lbn-NDADDR) % NINDIR(fs); 188 if(residue == 1) { 189 /* Double indirect. Parent is the triple. */ 190 up = idinode->di_ib[2]; 191 off = (lbn-2-BASE_TINDIR)/(NINDIR(fs)*NINDIR(fs)); 192 if(up == UNASSIGNED || up == LFS_UNUSED_DADDR) 193 return UNASSIGNED; 194 /* printf("lbn %d: parent is the triple\n", -lbn); */ 195 bread(fsbtodb(sblock, up), bp, sblock->lfs_bsize); 196 return ((daddr_t *)bp)[off]; 197 } else /* residue == 0 */ { 198 /* Single indirect. Two cases. */ 199 if(lbn < BASE_TINDIR) { 200 /* Parent is the double, simple */ 201 up = -(BASE_DINDIR) - 1; 202 off = (lbn-BASE_DINDIR) / D_UNITS; 203 /* printf("lbn %d: parent is %d/%d\n", -lbn, up,off); */ 204 } else { 205 /* Ancestor is the triple, more complex */ 206 up = ((lbn-BASE_TINDIR) / T_UNITS) 207 * T_UNITS + BASE_TINDIR + 1; 208 off = (lbn/D_UNITS) - (up/D_UNITS); 209 up = -up; 210 /* printf("lbn %d: parent is %d/%d\n", -lbn, up,off); */ 211 } 212 } 213 } else { 214 /* Direct block. Its parent must be a single indirect. */ 215 if(lbn < NDADDR) 216 return idinode->di_db[lbn]; 217 else { 218 /* Parent is an indirect block. */ 219 up = -(((lbn-NDADDR) / D_UNITS) * D_UNITS + NDADDR); 220 off = (lbn-NDADDR) % D_UNITS; 221 /* printf("lbn %d: parent is %d/%d\n", lbn,up,off); */ 222 } 223 } 224 up = lfs_bmap(fs,idinode,up); 225 if(up == UNASSIGNED || up == LFS_UNUSED_DADDR) 226 return UNASSIGNED; 227 bread(fsbtodb(sblock, up), bp, sblock->lfs_bsize); 228 return ((daddr_t *)bp)[off]; 229 } 230 231 static struct ifile * 232 lfs_ientry(ino_t ino) 233 { 234 static struct ifile ifileblock[MAXIFPB]; 235 static daddr_t ifblkno; 236 ufs_daddr_t lbn; 237 daddr_t blkno; 238 239 lbn = ino/sblock->lfs_ifpb + sblock->lfs_cleansz + sblock->lfs_segtabsz; 240 blkno = lfs_bmap(sblock,getino(sblock->lfs_ifile),lbn); 241 if(blkno != ifblkno) 242 bread(fsbtodb(sblock, blkno), (char *)ifileblock, 243 sblock->lfs_bsize); 244 return ifileblock + (ino%sblock->lfs_ifpb); 245 } 246 247 /* Search a block for a specific dinode. */ 248 static struct dinode * 249 lfs_ifind(struct lfs *fs, ino_t ino, struct dinode *dip) 250 { 251 register int cnt; 252 253 for(cnt=0;cnt<INOPB(fs);cnt++) 254 if(dip[cnt].di_inumber == ino) 255 return &(dip[cnt]); 256 return NULL; 257 } 258 259 struct dinode * 260 getino(inum) 261 ino_t inum; 262 { 263 static daddr_t inoblkno; 264 daddr_t blkno; 265 static struct dinode inoblock[MAXINOPB]; 266 static struct dinode ifile_dinode; /* XXX fill this in */ 267 static struct dinode empty_dinode; /* Always stays zeroed */ 268 struct dinode *dp; 269 270 if(inum == sblock->lfs_ifile) { 271 /* Load the ifile inode if not already */ 272 if(ifile_dinode.di_u.inumber == 0) { 273 blkno = sblock->lfs_idaddr; 274 bread(fsbtodb(sblock, blkno), (char *)inoblock, 275 (int)sblock->lfs_bsize); 276 dp = lfs_ifind(sblock, inum, inoblock); 277 ifile_dinode = *dp; /* Structure copy */ 278 } 279 return &ifile_dinode; 280 } 281 282 curino = inum; 283 blkno = lfs_ientry(inum)->if_daddr; 284 if(blkno == LFS_UNUSED_DADDR) 285 return &empty_dinode; 286 287 if(blkno != inoblkno) { 288 bread(fsbtodb(sblock, blkno), (char *)inoblock, 289 (int)sblock->lfs_bsize); 290 #ifdef notyet 291 if (needswap) 292 for (i = 0; i < MAXINOPB; i++) 293 ffs_dinode_swap(&inoblock[i], &inoblock[i]); 294 #endif 295 } 296 return lfs_ifind(sblock, inum, inoblock); 297 } 298
Indexes created Tue Sep 30 17:09:57 GMT 2025