version 1.42, 2010/02/16 23:20:30 |
version 1.42.12.1, 2013/02/25 00:28:06 |
Line 146 ckinode(struct ufs1_dinode *dp, struct i |
|
Line 146 ckinode(struct ufs1_dinode *dp, struct i |
|
ndb = howmany(dino.di_size, fs->lfs_bsize); |
ndb = howmany(dino.di_size, fs->lfs_bsize); |
|
|
thisvp = vget(fs, idesc->id_number); |
thisvp = vget(fs, idesc->id_number); |
for (lbn = 0; lbn < NDADDR; lbn++) { |
for (lbn = 0; lbn < UFS_NDADDR; lbn++) { |
ap = dino.di_db + lbn; |
ap = dino.di_db + lbn; |
if (thisvp) |
if (thisvp) |
idesc->id_numfrags = |
idesc->id_numfrags = |
Line 189 ckinode(struct ufs1_dinode *dp, struct i |
|
Line 189 ckinode(struct ufs1_dinode *dp, struct i |
|
return (ret); |
return (ret); |
} |
} |
idesc->id_numfrags = fs->lfs_frag; |
idesc->id_numfrags = fs->lfs_frag; |
remsize = dino.di_size - fs->lfs_bsize * NDADDR; |
remsize = dino.di_size - fs->lfs_bsize * UFS_NDADDR; |
sizepb = fs->lfs_bsize; |
sizepb = fs->lfs_bsize; |
for (ap = &dino.di_ib[0], n = 1; n <= NIADDR; ap++, n++) { |
for (ap = &dino.di_ib[0], n = 1; n <= UFS_NIADDR; ap++, n++) { |
if (*ap) { |
if (*ap) { |
idesc->id_blkno = *ap; |
idesc->id_blkno = *ap; |
ret = iblock(idesc, n, remsize); |
ret = iblock(idesc, n, remsize); |
Line 357 cacheino(struct ufs1_dinode * dp, ino_t |
|
Line 357 cacheino(struct ufs1_dinode * dp, ino_t |
|
unsigned int blks; |
unsigned int blks; |
|
|
blks = howmany(dp->di_size, fs->lfs_bsize); |
blks = howmany(dp->di_size, fs->lfs_bsize); |
if (blks > NDADDR) |
if (blks > UFS_NDADDR) |
blks = NDADDR + NIADDR; |
blks = UFS_NDADDR + UFS_NIADDR; |
inp = emalloc(sizeof(*inp) + (blks - 1) * sizeof(ufs_daddr_t)); |
inp = emalloc(sizeof(*inp) + (blks - 1) * sizeof(ufs_daddr_t)); |
inpp = &inphead[inumber % numdirs]; |
inpp = &inphead[inumber % numdirs]; |
inp->i_nexthash = *inpp; |
inp->i_nexthash = *inpp; |
*inpp = inp; |
*inpp = inp; |
inp->i_child = inp->i_sibling = inp->i_parentp = 0; |
inp->i_child = inp->i_sibling = inp->i_parentp = 0; |
if (inumber == ROOTINO) |
if (inumber == UFS_ROOTINO) |
inp->i_parent = ROOTINO; |
inp->i_parent = UFS_ROOTINO; |
else |
else |
inp->i_parent = (ino_t) 0; |
inp->i_parent = (ino_t) 0; |
inp->i_dotdot = (ino_t) 0; |
inp->i_dotdot = (ino_t) 0; |
Line 509 findino(struct inodesc * idesc) |
|
Line 509 findino(struct inodesc * idesc) |
|
if (dirp->d_ino == 0) |
if (dirp->d_ino == 0) |
return (KEEPON); |
return (KEEPON); |
if (strcmp(dirp->d_name, idesc->id_name) == 0 && |
if (strcmp(dirp->d_name, idesc->id_name) == 0 && |
dirp->d_ino >= ROOTINO && dirp->d_ino < maxino) { |
dirp->d_ino >= UFS_ROOTINO && dirp->d_ino < maxino) { |
idesc->id_parent = dirp->d_ino; |
idesc->id_parent = dirp->d_ino; |
return (STOP | FOUND); |
return (STOP | FOUND); |
} |
} |
Line 523 pinode(ino_t ino) |
|
Line 523 pinode(ino_t ino) |
|
struct passwd *pw; |
struct passwd *pw; |
|
|
printf(" I=%llu ", (unsigned long long)ino); |
printf(" I=%llu ", (unsigned long long)ino); |
if (ino < ROOTINO || ino >= maxino) |
if (ino < UFS_ROOTINO || ino >= maxino) |
return; |
return; |
dp = ginode(ino); |
dp = ginode(ino); |
if (dp) { |
if (dp) { |
Line 584 allocino(ino_t request, int type) |
|
Line 584 allocino(ino_t request, int type) |
|
struct ubuf *bp; |
struct ubuf *bp; |
|
|
if (request == 0) |
if (request == 0) |
request = ROOTINO; |
request = UFS_ROOTINO; |
else if (statemap[request] != USTATE) |
else if (statemap[request] != USTATE) |
return (0); |
return (0); |
for (ino = request; ino < maxino; ino++) |
for (ino = request; ino < maxino; ino++) |