1 /* $NetBSD: ufs.c,v 1.74 2015/09/01 06:16:58 dholland Exp $ */
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * The Mach Operating System project at Carnegie-Mellon University.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * Copyright (c) 1990, 1991 Carnegie Mellon University
36 * All Rights Reserved.
40 * Permission to use, copy, modify and distribute this software and its
41 * documentation is hereby granted, provided that both the copyright
42 * notice and this permission notice appear in all copies of the
43 * software, derivative works or modified versions, and any portions
44 * thereof, and that both notices appear in supporting documentation.
46 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
47 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
48 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
50 * Carnegie Mellon requests users of this software to return to
52 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
53 * School of Computer Science
54 * Carnegie Mellon University
55 * Pittsburgh PA 15213-3890
57 * any improvements or extensions that they make and grant Carnegie the
58 * rights to redistribute these changes.
62 * Stand-alone file reading package for UFS and LFS filesystems.
65 #include <sys/param.h>
67 #include <ufs/ufs/dinode.h>
68 #include <ufs/ufs/dir.h>
70 #include <sys/queue.h>
71 #include <sys/condvar.h>
72 #include <sys/mount.h> /* XXX for MNAMELEN */
73 #include <ufs/lfs/lfs.h>
75 #include <ufs/ffs/fs.h>
78 #include <lib/libkern/libkern.h>
90 /* If this file is compiled by itself, build ufs (aka ffsv1) support */
91 #if !defined(LIBSA_FFSv2) && !defined(LIBSA_LFS)
95 #if defined(LIBSA_FS_SINGLECOMPONENT) && !defined(LIBSA_NO_FS_SYMLINK)
96 #define LIBSA_NO_FS_SYMLINK
98 #if defined(COMPAT_UFS) && defined(LIBSA_NO_COMPAT_UFS)
104 * In-core LFS superblock - just the on-disk one.
111 unsigned lfs_is64
: 1,
113 lfs_hasolddirfmt
: 1;
115 /* Get lfs accessors that use struct salfs. */
116 #define STRUCT_LFS struct salfs
117 #include <ufs/lfs/lfs_accessors.h>
119 /* override this to avoid a mess with the dinode accessors */
120 #define lfs_dino_getsize(fs, dp) ((dp)->di_size)
122 typedef struct salfs FS
;
123 #define fs_magic lfs_dlfs_u.u_32.dlfs_magic
124 #define fs_maxsymlinklen lfs_dlfs_u.u_32.dlfs_maxsymlinklen
126 #define FS_MAGIC LFS_MAGIC
127 #define SBLOCKSIZE LFS_SBPAD
128 #define SBLOCKOFFSET LFS_LABELPAD
130 /* NB ufs2 doesn't use the common superblock code... */
131 typedef struct fs FS
;
132 #define FS_MAGIC FS_UFS1_MAGIC
133 #define SBLOCKOFFSET SBLOCK_UFS1
136 #if defined(LIBSA_NO_TWIDDLE)
141 #if defined(LIBSA_FFSv2)
142 #define cgstart(fc, c) cgstart_ufs2((fs), (c))
144 #define cgstart(fc, c) cgstart_ufs1((fs), (c))
148 #define ufs_dinode ufs1_dinode
151 #define indp_t int32_t
153 typedef uint32_t ino32_t
;
156 #define FSBTODB(fs, indp) FFS_FSBTODB(fs, indp)
159 #define UFS_NINDIR FFS_NINDIR
162 #define ufs_blkoff ffs_blkoff
165 #define ufs_lblkno ffs_lblkno
169 * To avoid having a lot of filesystem-block sized buffers lurking (which
170 * could be 32k) we only keep a few entries of the indirect block map.
171 * With 8k blocks, 2^8 blocks is ~500k so we reread the indirect block
172 * ~13 times pulling in a 6M kernel.
173 * The cache size must be smaller than the smallest filesystem block,
174 * so LN2_IND_CACHE_SZ <= 9 (UFS2 and 4k blocks).
176 #define LN2_IND_CACHE_SZ 6
177 #define IND_CACHE_SZ (1 << LN2_IND_CACHE_SZ)
178 #define IND_CACHE_MASK (IND_CACHE_SZ - 1)
184 off_t f_seekp
; /* seek pointer */
185 FS
*f_fs
; /* pointer to super-block */
186 struct ufs_dinode f_di
; /* copy of on-disk inode */
187 uint f_nishift
; /* for blocks in indirect block */
188 indp_t f_ind_cache_block
;
189 indp_t f_ind_cache
[IND_CACHE_SZ
];
191 char *f_buf
; /* buffer for data block */
192 size_t f_buf_size
; /* size of data block */
193 daddr_t f_buf_blkno
; /* block number of data block */
196 static int read_inode(ino32_t
, struct open_file
*);
197 static int block_map(struct open_file
*, indp_t
, indp_t
*);
198 static int buf_read_file(struct open_file
*, char **, size_t *);
199 static int search_directory(const char *, int, struct open_file
*, ino32_t
*);
201 static void ffs_oldfscompat(FS
*);
204 static int ffs_find_superblock(struct open_file
*, FS
*);
210 * Find an inode's block. Look it up in the ifile. Whee!
213 find_inode_sector(ino32_t inumber
, struct open_file
*f
, daddr_t
*isp
)
215 struct file
*fp
= (struct file
*)f
->f_fsdata
;
217 daddr_t ifileent_blkno
;
219 size_t buf_after_ent
;
223 rc
= read_inode(LFS_IFILE_INUM
, f
);
227 entsize
= fs
->lfs_is64
? sizeof(IFILE64
) :
228 (lfs_sb_getversion(fs
) > 1 ? sizeof(IFILE32
) : sizeof(IFILE_V1
));
230 (inumber
/ lfs_sb_getifpb(fs
)) + lfs_sb_getcleansz(fs
) + lfs_sb_getsegtabsz(fs
);
231 fp
->f_seekp
= (off_t
)ifileent_blkno
* lfs_sb_getbsize(fs
) +
232 (inumber
% lfs_sb_getifpb(fs
)) * entsize
;
233 rc
= buf_read_file(f
, &ent_in_buf
, &buf_after_ent
);
236 /* make sure something's not badly wrong, but don't panic. */
237 if (buf_after_ent
< entsize
)
240 *isp
= FSBTODB(fs
, lfs_if_getdaddr(fs
, (IFILE
*)ent_in_buf
));
241 if (*isp
== LFS_UNUSED_DADDR
) /* again, something badly wrong */
248 * Read a new inode into a file structure.
251 read_inode(ino32_t inumber
, struct open_file
*f
)
253 struct file
*fp
= (struct file
*)f
->f_fsdata
;
258 daddr_t inode_sector
= 0; /* XXX: gcc */
260 struct ufs_dinode
*dip
;
265 if (inumber
== LFS_IFILE_INUM
)
266 inode_sector
= FSBTODB(fs
, lfs_sb_getidaddr(fs
));
267 else if ((rc
= find_inode_sector(inumber
, f
, &inode_sector
)) != 0)
270 inode_sector
= FSBTODB(fs
, ino_to_fsba(fs
, inumber
));
274 * Read inode and save it.
278 rc
= DEV_STRATEGY(f
->f_dev
)(f
->f_devdata
, F_READ
,
279 inode_sector
, fs
->fs_bsize
, buf
, &rsize
);
282 if (rsize
!= fs
->fs_bsize
)
287 dip
= (struct ufs_dinode
*)buf
+ (cnt
- 1);
288 for (; dip
->di_inumber
!= inumber
; --dip
) {
289 /* kernel code panics, but boot blocks which panic are Bad. */
295 fp
->f_di
= ((struct ufs_dinode
*)buf
)[ino_to_fsbo(fs
, inumber
)];
299 * Clear out the old buffers
301 fp
->f_ind_cache_block
= ~0;
302 fp
->f_buf_blkno
= -1;
307 * Given an offset in a file, find the disk block number that
308 * contains that block.
311 block_map(struct open_file
*f
, indp_t file_block
, indp_t
*disk_block_p
)
313 struct file
*fp
= (struct file
*)f
->f_fsdata
;
317 indp_t ind_block_num
;
320 indp_t
*buf
= (void *)fp
->f_buf
;
323 * Index structure of an inode:
325 * di_db[0..UFS_NDADDR-1] hold block numbers for blocks
328 * di_ib[0] index block 0 is the single indirect block
329 * holds block numbers for blocks
330 * UFS_NDADDR .. UFS_NDADDR + UFS_NINDIR(fs)-1
332 * di_ib[1] index block 1 is the double indirect block
333 * holds block numbers for INDEX blocks for blocks
334 * UFS_NDADDR + UFS_NINDIR(fs) ..
335 * UFS_NDADDR + UFS_NINDIR(fs) + UFS_NINDIR(fs)**2 - 1
337 * di_ib[2] index block 2 is the triple indirect block
338 * holds block numbers for double-indirect
340 * UFS_NDADDR + UFS_NINDIR(fs) + UFS_NINDIR(fs)**2 ..
341 * UFS_NDADDR + UFS_NINDIR(fs) + UFS_NINDIR(fs)**2
342 * + UFS_NINDIR(fs)**3 - 1
345 if (file_block
< UFS_NDADDR
) {
347 *disk_block_p
= fp
->f_di
.di_db
[file_block
];
351 file_block
-= UFS_NDADDR
;
353 ind_cache
= file_block
>> LN2_IND_CACHE_SZ
;
354 if (ind_cache
== fp
->f_ind_cache_block
) {
355 *disk_block_p
= fp
->f_ind_cache
[file_block
& IND_CACHE_MASK
];
360 level
+= fp
->f_nishift
;
361 if (file_block
< (indp_t
)1 << level
)
363 if (level
> UFS_NIADDR
* fp
->f_nishift
)
364 /* Block number too high */
366 file_block
-= (indp_t
)1 << level
;
369 ind_block_num
= fp
->f_di
.di_ib
[level
/ fp
->f_nishift
- 1];
372 level
-= fp
->f_nishift
;
373 if (ind_block_num
== 0) {
374 *disk_block_p
= 0; /* missing */
380 * If we were feeling brave, we could work out the number
381 * of the disk sector and read a single disk sector instead
382 * of a filesystem block.
383 * However we don't do this very often anyway...
385 rc
= DEV_STRATEGY(f
->f_dev
)(f
->f_devdata
, F_READ
,
386 FSBTODB(fp
->f_fs
, ind_block_num
), fs
->fs_bsize
,
390 if (rsize
!= fs
->fs_bsize
)
392 ind_block_num
= buf
[file_block
>> level
];
395 file_block
&= (1 << level
) - 1;
398 /* Save the part of the block that contains this sector */
399 memcpy(fp
->f_ind_cache
, &buf
[file_block
& ~IND_CACHE_MASK
],
400 IND_CACHE_SZ
* sizeof fp
->f_ind_cache
[0]);
401 fp
->f_ind_cache_block
= ind_cache
;
403 *disk_block_p
= ind_block_num
;
409 * Read a portion of a file into an internal buffer.
410 * Return the location in the buffer and the amount in the buffer.
413 buf_read_file(struct open_file
*f
, char **buf_p
, size_t *size_p
)
415 struct file
*fp
= (struct file
*)f
->f_fsdata
;
422 off
= ufs_blkoff(fs
, fp
->f_seekp
);
423 file_block
= ufs_lblkno(fs
, fp
->f_seekp
);
425 block_size
= dblksize(fs
, &fp
->f_di
, file_block
);
427 block_size
= ffs_sblksize(fs
, (int64_t)fp
->f_di
.di_size
, file_block
);
430 if (file_block
!= fp
->f_buf_blkno
) {
431 indp_t disk_block
= 0; /* XXX: gcc */
432 rc
= block_map(f
, file_block
, &disk_block
);
436 if (disk_block
== 0) {
437 memset(fp
->f_buf
, 0, block_size
);
438 fp
->f_buf_size
= block_size
;
441 rc
= DEV_STRATEGY(f
->f_dev
)(f
->f_devdata
, F_READ
,
442 FSBTODB(fs
, disk_block
),
443 block_size
, fp
->f_buf
, &fp
->f_buf_size
);
448 fp
->f_buf_blkno
= file_block
;
452 * Return address of byte in buffer corresponding to
453 * offset, and size of remainder of buffer after that
456 *buf_p
= fp
->f_buf
+ off
;
457 *size_p
= block_size
- off
;
460 * But truncate buffer at end of file.
462 if (*size_p
> fp
->f_di
.di_size
- fp
->f_seekp
)
463 *size_p
= fp
->f_di
.di_size
- fp
->f_seekp
;
469 * Search a directory for a name and return its
473 search_directory(const char *name
, int length
, struct open_file
*f
,
476 struct file
*fp
= (struct file
*)f
->f_fsdata
;
485 while (fp
->f_seekp
< (off_t
)fp
->f_di
.di_size
) {
486 rc
= buf_read_file(f
, &buf
, &buf_size
);
490 dp
= (struct direct
*)buf
;
491 edp
= (struct direct
*)(buf
+ buf_size
);
492 for (;dp
< edp
; dp
= (void *)((char *)dp
+ dp
->d_reclen
)) {
493 if (dp
->d_reclen
<= 0)
495 if (dp
->d_ino
== (ino32_t
)0)
497 #if BYTE_ORDER == LITTLE_ENDIAN
498 if (fp
->f_fs
->fs_maxsymlinklen
<= 0)
502 namlen
= dp
->d_namlen
;
503 if (namlen
== length
&&
504 !memcmp(name
, dp
->d_name
, length
)) {
506 *inumber_p
= dp
->d_ino
;
510 fp
->f_seekp
+= buf_size
;
517 daddr_t sblock_try
[] = SBLOCKSEARCH
;
520 ffs_find_superblock(struct open_file
*f
, FS
*fs
)
525 for (i
= 0; sblock_try
[i
] != -1; i
++) {
526 rc
= DEV_STRATEGY(f
->f_dev
)(f
->f_devdata
, F_READ
,
527 sblock_try
[i
] / DEV_BSIZE
, SBLOCKSIZE
, fs
, &buf_size
);
528 if (rc
!= 0 || buf_size
!= SBLOCKSIZE
)
530 if (fs
->fs_sblockloc
!= sblock_try
[i
])
531 /* an alternate superblock - try again */
533 if (fs
->fs_magic
== FS_UFS2_MAGIC
) {
546 ufs_open(const char *path
, struct open_file
*f
)
548 #ifndef LIBSA_FS_SINGLECOMPONENT
549 const char *cp
, *ncp
;
556 #ifndef LIBSA_NO_FS_SYMLINK
557 ino32_t parent_inumber
;
559 char namebuf
[MAXPATHLEN
+1];
563 /* allocate file system specific data structure */
564 fp
= alloc(sizeof(struct file
));
565 memset(fp
, 0, sizeof(struct file
));
566 f
->f_fsdata
= (void *)fp
;
568 /* allocate space and read super block */
569 fs
= alloc(SBLOCKSIZE
);
574 rc
= ffs_find_superblock(f
, fs
);
580 rc
= DEV_STRATEGY(f
->f_dev
)(f
->f_devdata
, F_READ
,
581 SBLOCKOFFSET
/ DEV_BSIZE
, SBLOCKSIZE
, fs
, &buf_size
);
584 if (buf_size
!= SBLOCKSIZE
||
586 fs
->lfs_version
!= REQUIRED_LFS_VERSION
||
588 fs
->fs_magic
!= FS_MAGIC
) {
593 #if defined(LIBSA_LFS) && REQUIRED_LFS_VERSION == 2
595 * XXX We should check the second superblock and use the eldest
596 * of the two. See comments near the top of lfs_mountfs()
597 * in sys/ufs/lfs/lfs_vfsops.c.
598 * This may need a LIBSA_LFS_SMALL check as well.
601 #if defined(LIBSA_LFS)
603 fs
->lfs_dobyteswap
= 0;
604 fs
->lfs_hasolddirfmt
= (fs
->fs_maxsymlinklen
<= 0);
612 if (fs
->fs_bsize
> MAXBSIZE
||
613 (size_t)fs
->fs_bsize
< sizeof(FS
)) {
619 * Calculate indirect block levels.
626 * We note that the number of indirect blocks is always
627 * a power of 2. This lets us use shifts and masks instead
628 * of divide and remainder and avoinds pulling in the
629 * 64bit division routine into the boot code.
631 mult
= UFS_NINDIR(fs
);
633 if (mult
& (mult
- 1)) {
634 /* Hummm was't a power of 2 */
639 for (ln2
= 0; mult
!= 1; ln2
++)
645 /* alloc a block sized buffer used for all fs transfers */
646 fp
->f_buf
= alloc(fs
->fs_bsize
);
647 inumber
= UFS_ROOTINO
;
648 if ((rc
= read_inode(inumber
, f
)) != 0)
651 #ifndef LIBSA_FS_SINGLECOMPONENT
656 * Remove extra separators
664 * Check that current node is a directory.
666 if ((fp
->f_di
.di_mode
& IFMT
) != IFDIR
) {
672 * Get next component of path name.
675 while ((c
= *cp
) != '\0' && c
!= '/')
679 * Look up component in current directory.
680 * Save directory inumber in case we find a
683 #ifndef LIBSA_NO_FS_SYMLINK
684 parent_inumber
= inumber
;
686 rc
= search_directory(ncp
, cp
- ncp
, f
, &inumber
);
691 * Open next component.
693 if ((rc
= read_inode(inumber
, f
)) != 0)
696 #ifndef LIBSA_NO_FS_SYMLINK
698 * Check for symbolic link.
700 if ((fp
->f_di
.di_mode
& IFMT
) == IFLNK
) {
701 int link_len
= fp
->f_di
.di_size
;
706 if (link_len
+ len
> MAXPATHLEN
||
707 ++nlinks
> MAXSYMLINKS
) {
712 memmove(&namebuf
[link_len
], cp
, len
+ 1);
714 if (link_len
< fs
->fs_maxsymlinklen
) {
715 memcpy(namebuf
, fp
->f_di
.di_db
, link_len
);
718 * Read file for symbolic link
724 rc
= block_map(f
, (indp_t
)0, &disk_block
);
729 rc
= DEV_STRATEGY(f
->f_dev
)(f
->f_devdata
,
730 F_READ
, FSBTODB(fs
, disk_block
),
731 fs
->fs_bsize
, buf
, &buf_size
);
735 memcpy(namebuf
, buf
, link_len
);
739 * If relative pathname, restart at parent directory.
740 * If absolute pathname, restart at root.
744 inumber
= parent_inumber
;
746 inumber
= (ino32_t
)UFS_ROOTINO
;
748 if ((rc
= read_inode(inumber
, f
)) != 0)
751 #endif /* !LIBSA_NO_FS_SYMLINK */
755 * Found terminal component.
759 #else /* !LIBSA_FS_SINGLECOMPONENT */
761 /* look up component in the current (root) directory */
762 rc
= search_directory(path
, strlen(path
), f
, &inumber
);
767 rc
= read_inode(inumber
, f
);
769 #endif /* !LIBSA_FS_SINGLECOMPONENT */
771 fp
->f_seekp
= 0; /* reset seek pointer */
776 #ifdef FSMOD /* Only defined for lfs */
784 ufs_close(struct open_file
*f
)
786 struct file
*fp
= (struct file
*)f
->f_fsdata
;
793 dealloc(fp
->f_buf
, fp
->f_fs
->fs_bsize
);
794 dealloc(fp
->f_fs
, SBLOCKSIZE
);
795 dealloc(fp
, sizeof(struct file
));
800 * Copy a portion of a file into kernel memory.
801 * Cross block boundaries when necessary.
804 ufs_read(struct open_file
*f
, void *start
, size_t size
, size_t *resid
)
806 struct file
*fp
= (struct file
*)f
->f_fsdata
;
814 if (fp
->f_seekp
>= (off_t
)fp
->f_di
.di_size
)
817 rc
= buf_read_file(f
, &buf
, &buf_size
);
822 if (csize
> buf_size
)
825 memcpy(addr
, buf
, csize
);
827 fp
->f_seekp
+= csize
;
839 #ifndef LIBSA_NO_FS_WRITE
841 ufs_write(struct open_file
*f
, void *start
, size_t size
, size_t *resid
)
846 #endif /* !LIBSA_NO_FS_WRITE */
848 #ifndef LIBSA_NO_FS_SEEK
850 ufs_seek(struct open_file
*f
, off_t offset
, int where
)
852 struct file
*fp
= (struct file
*)f
->f_fsdata
;
856 fp
->f_seekp
= offset
;
859 fp
->f_seekp
+= offset
;
862 fp
->f_seekp
= fp
->f_di
.di_size
- offset
;
869 #endif /* !LIBSA_NO_FS_SEEK */
872 ufs_stat(struct open_file
*f
, struct stat
*sb
)
874 struct file
*fp
= (struct file
*)f
->f_fsdata
;
876 /* only important stuff */
877 memset(sb
, 0, sizeof *sb
);
878 sb
->st_mode
= fp
->f_di
.di_mode
;
879 sb
->st_uid
= fp
->f_di
.di_uid
;
880 sb
->st_gid
= fp
->f_di
.di_gid
;
881 sb
->st_size
= fp
->f_di
.di_size
;
885 #if defined(LIBSA_ENABLE_LS_OP)
889 static const char *const typestr
[] = {
908 ufs_ls(struct open_file
*f
, const char *pattern
)
910 struct file
*fp
= (struct file
*)f
->f_fsdata
;
913 lsentry_t
*names
= NULL
;
916 while (fp
->f_seekp
< (off_t
)fp
->f_di
.di_size
) {
917 struct direct
*dp
, *edp
;
918 int rc
= buf_read_file(f
, &buf
, &buf_size
);
921 /* some firmware might use block size larger than DEV_BSIZE */
922 if (buf_size
< UFS_DIRBLKSIZ
)
925 dp
= (struct direct
*)buf
;
926 edp
= (struct direct
*)(buf
+ buf_size
);
928 for (; dp
< edp
; dp
= (void *)((char *)dp
+ dp
->d_reclen
)) {
933 if (dp
->d_type
>= NELEM(typestr
) ||
934 !(t
= typestr
[dp
->d_type
])) {
936 * This does not handle "old"
937 * filesystems properly. On little
938 * endian machines, we get a bogus
939 * type name if the namlen matches a
940 * valid type identifier. We could
941 * check if we read namlen "0" and
942 * handle this case specially, if
943 * there were a pressing need...
945 printf("bad dir entry\n");
948 lsadd(&names
, pattern
, dp
->d_name
, strlen(dp
->d_name
),
951 fp
->f_seekp
+= buf_size
;
957 #if defined(__minix) && defined(LIBSA_ENABLE_LOAD_MODS_OP)
959 ufs_load_mods(struct open_file
*f
, const char *pattern
,
960 void (*funcp
)(char *), char *path
)
962 load_modsunsup("ufs");
964 #endif /* defined(__minix) && defined(LIBSA_ENABLE_LOAD_MODS_OP) */
965 #endif /* LIBSA_ENABLE_LS_OP */
969 * Sanity checks for old file systems.
971 * XXX - goes away some day.
972 * Stripped of stuff libsa doesn't need.....
975 ffs_oldfscompat(FS
*fs
)
980 * Newer Solaris versions have a slightly incompatible
981 * superblock - so always calculate this values on the fly, which
982 * is good enough for libsa purposes
984 if (fs
->fs_magic
== FS_UFS1_MAGIC
985 #ifndef COMPAT_SOLARIS_UFS
986 && fs
->fs_old_inodefmt
< FS_44INODEFMT
989 fs
->fs_qbmask
= ~fs
->fs_bmask
;
990 fs
->fs_qfmask
= ~fs
->fs_fmask
;