SCCS-vsn: sys/ufs/ffs/ufsmount.h 7.2
SCCS-vsn: sys/ufs/ufs/ufsmount.h 7.2
SCCS-vsn: sys/ufs/ffs/ffs_inode.c 7.4
SCCS-vsn: sys/ufs/ffs/ufs_inode.c 7.4
SCCS-vsn: sys/ufs/lfs/lfs_inode.c 7.4
SCCS-vsn: sys/ufs/ufs/ufs_inode.c 7.4
SCCS-vsn: sys/ufs/ffs/ffs_subr.c 7.5
SCCS-vsn: sys/kern/vfs_lookup.c 7.4
SCCS-vsn: sys/ufs/ffs/ufs_lookup.c 7.4
SCCS-vsn: sys/ufs/ufs/ufs_lookup.c 7.4
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)vfs_lookup.c 7.3 (Berkeley) %G%
+ * @(#)vfs_lookup.c 7.4 (Berkeley) %G%
} else if (ndp->ni_dent.d_ino == ROOTINO &&
dp->i_number == ROOTINO) {
for (i = 1; i < NMOUNT; i++)
} else if (ndp->ni_dent.d_ino == ROOTINO &&
dp->i_number == ROOTINO) {
for (i = 1; i < NMOUNT; i++)
- if (mount[i].m_bufp != NULL &&
+ if (mount[i].m_fs != NULL &&
mount[i].m_dev == dp->i_dev) {
iput(dp);
dp = mount[i].m_inodp;
mount[i].m_dev == dp->i_dev) {
iput(dp);
dp = mount[i].m_inodp;
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)ffs_inode.c 7.3 (Berkeley) %G%
+ * @(#)ffs_inode.c 7.4 (Berkeley) %G%
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
if(mp->m_inodp == ip) {
dev = mp->m_dev;
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
if(mp->m_inodp == ip) {
dev = mp->m_dev;
- fs = mp->m_bufp->b_un.b_fs;
ino = ROOTINO;
goto loop;
}
ino = ROOTINO;
goto loop;
}
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)ffs_subr.c 7.4 (Berkeley) %G%
+ * @(#)ffs_subr.c 7.5 (Berkeley) %G%
* of each file system is still in the buffer cache.
*/
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++) {
* of each file system is still in the buffer cache.
*/
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++) {
- if (mp->m_bufp == NULL || mp->m_dev == NODEV)
+ if (mp->m_fs == NULL || mp->m_dev == NODEV)
- fs = mp->m_bufp->b_un.b_fs;
if (fs->fs_fmod == 0)
continue;
if (fs->fs_ronly != 0) { /* XXX */
if (fs->fs_fmod == 0)
continue;
if (fs->fs_ronly != 0) { /* XXX */
register struct fs *fs;
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++) {
register struct fs *fs;
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++) {
- if (mp->m_bufp == NULL || mp->m_dev != dev)
+ if (mp->m_fs == NULL || mp->m_dev != dev)
- fs = mp->m_bufp->b_un.b_fs;
if (fs->fs_magic != FS_MAGIC) {
printf("dev = 0x%x, fs = %s\n", dev, fs->fs_fsmnt);
panic("getfs: bad magic");
if (fs->fs_magic != FS_MAGIC) {
printf("dev = 0x%x, fs = %s\n", dev, fs->fs_fsmnt);
panic("getfs: bad magic");
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)ufs_inode.c 7.3 (Berkeley) %G%
+ * @(#)ufs_inode.c 7.4 (Berkeley) %G%
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
if(mp->m_inodp == ip) {
dev = mp->m_dev;
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
if(mp->m_inodp == ip) {
dev = mp->m_dev;
- fs = mp->m_bufp->b_un.b_fs;
ino = ROOTINO;
goto loop;
}
ino = ROOTINO;
goto loop;
}
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)ufs_lookup.c 7.3 (Berkeley) %G%
+ * @(#)ufs_lookup.c 7.4 (Berkeley) %G%
} else if (ndp->ni_dent.d_ino == ROOTINO &&
dp->i_number == ROOTINO) {
for (i = 1; i < NMOUNT; i++)
} else if (ndp->ni_dent.d_ino == ROOTINO &&
dp->i_number == ROOTINO) {
for (i = 1; i < NMOUNT; i++)
- if (mount[i].m_bufp != NULL &&
+ if (mount[i].m_fs != NULL &&
mount[i].m_dev == dp->i_dev) {
iput(dp);
dp = mount[i].m_inodp;
mount[i].m_dev == dp->i_dev) {
iput(dp);
dp = mount[i].m_inodp;
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)ufsmount.h 7.1 (Berkeley) %G%
+ * @(#)ufsmount.h 7.2 (Berkeley) %G%
struct mount
{
dev_t m_dev; /* device mounted */
struct mount
{
dev_t m_dev; /* device mounted */
- struct buf *m_bufp; /* pointer to superblock */
+ struct fs *m_fs; /* pointer to superblock */
struct inode *m_inodp; /* pointer to mounted on inode */
struct inode *m_qinod; /* QUOTA: pointer to quota file */
};
struct inode *m_inodp; /* pointer to mounted on inode */
struct inode *m_qinod; /* QUOTA: pointer to quota file */
};
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)lfs_inode.c 7.3 (Berkeley) %G%
+ * @(#)lfs_inode.c 7.4 (Berkeley) %G%
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
if(mp->m_inodp == ip) {
dev = mp->m_dev;
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
if(mp->m_inodp == ip) {
dev = mp->m_dev;
- fs = mp->m_bufp->b_un.b_fs;
ino = ROOTINO;
goto loop;
}
ino = ROOTINO;
goto loop;
}
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)ufs_inode.c 7.3 (Berkeley) %G%
+ * @(#)ufs_inode.c 7.4 (Berkeley) %G%
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
if(mp->m_inodp == ip) {
dev = mp->m_dev;
for (mp = &mount[0]; mp < &mount[NMOUNT]; mp++)
if(mp->m_inodp == ip) {
dev = mp->m_dev;
- fs = mp->m_bufp->b_un.b_fs;
ino = ROOTINO;
goto loop;
}
ino = ROOTINO;
goto loop;
}
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)ufs_lookup.c 7.3 (Berkeley) %G%
+ * @(#)ufs_lookup.c 7.4 (Berkeley) %G%
} else if (ndp->ni_dent.d_ino == ROOTINO &&
dp->i_number == ROOTINO) {
for (i = 1; i < NMOUNT; i++)
} else if (ndp->ni_dent.d_ino == ROOTINO &&
dp->i_number == ROOTINO) {
for (i = 1; i < NMOUNT; i++)
- if (mount[i].m_bufp != NULL &&
+ if (mount[i].m_fs != NULL &&
mount[i].m_dev == dp->i_dev) {
iput(dp);
dp = mount[i].m_inodp;
mount[i].m_dev == dp->i_dev) {
iput(dp);
dp = mount[i].m_inodp;
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*
- * @(#)ufsmount.h 7.1 (Berkeley) %G%
+ * @(#)ufsmount.h 7.2 (Berkeley) %G%
struct mount
{
dev_t m_dev; /* device mounted */
struct mount
{
dev_t m_dev; /* device mounted */
- struct buf *m_bufp; /* pointer to superblock */
+ struct fs *m_fs; /* pointer to superblock */
struct inode *m_inodp; /* pointer to mounted on inode */
struct inode *m_qinod; /* QUOTA: pointer to quota file */
};
struct inode *m_inodp; /* pointer to mounted on inode */
struct inode *m_qinod; /* QUOTA: pointer to quota file */
};