/src/usr.sbin/fstyp/ |
ufs.c | 56 int sb, superblock; local in function:fstyp_ufs 62 * superblock corresponds to the size of the underlying provider. 66 for (sb = 0; (superblock = superblocks[sb]) != -1; sb++) { 67 fs = (struct fs *)read_buf(fp, superblock, SBLOCKSIZE); 107 if (fs->fs_sblockloc != superblock || fs->fs_ncg < 1 ||
|
/src/sys/fs/v7fs/ |
v7fs_impl.h | 112 /* in-core superblock access. (freeblock/freeinode) split? -uch */ 117 struct v7fs_superblock superblock; member in struct:v7fs_self
|
/src/usr.sbin/quot/ |
quot.c | 539 * Possible superblock locations ordered from most to least likely. 542 static char superblock[SBLOCKSIZE]; variable in typeref:typename:char[] 567 if (pread(fd, superblock, SBLOCKSIZE, sbloc) != SBLOCKSIZE) 569 fs = (struct fs *)superblock; 579 /* Not the main superblock */ 594 ffs_oldfscompat((struct fs *)superblock);
|
/src/dist/pf/sbin/pfctl/ |
pfctl_optimize.c | 56 * A container that lets us sort a superblock to optimize the skip step jumps 66 * A superblock is a block of adjacent rules of similar action. If there 67 * are five PASS rules in a row, they all become members of a superblock. 68 * Once we have a superblock, we are free to re-order any rules within it 72 struct superblock { struct 74 TAILQ_ENTRY(superblock) sb_entry; 75 struct superblock *sb_profiled_block; 78 TAILQ_HEAD(superblocks, superblock); 86 BREAK, /* the field may not differ between rules in a superblock */ 106 * superblock. Thus it will not be optimized. It also prevents th [all...] |
/src/usr.sbin/makefs/ |
ffs.c | 256 struct fs *superblock; local in function:ffs_makefs 298 /* update various superblock parameters */ 299 superblock = fsopts->superblock; 300 superblock->fs_fmod = 0; 301 superblock->fs_old_cstotal.cs_ndir = superblock->fs_cstotal.cs_ndir; 302 superblock->fs_old_cstotal.cs_nbfree = superblock->fs_cstotal.cs_nbfree; 303 superblock->fs_old_cstotal.cs_nifree = superblock->fs_cstotal.cs_nifree [all...] |
makefs.h | 163 void *superblock; /* superblock */ member in struct:makefs_fsinfo
|