260ba0bff1
Mainly focus on files that use BSD 2-Clause license, however the tool I was using mis-identified many licenses so this was mostly a manual - error prone - task. The Software Package Data Exchange (SPDX) group provides a specification to make it easier for automated tools to detect and summarize well known opensource licenses. We are gradually adopting the specification, noting that the tags are considered only advisory and do not, in any way, superceed or replace the license texts.
172 lines
4.6 KiB
C
172 lines
4.6 KiB
C
/*-
|
|
* SPDX-License-Identifier: BSD-2-Clause-FreeBSD
|
|
*
|
|
* Copyright (c) 2002 Juli Mallett. All rights reserved.
|
|
*
|
|
* This software was written by Juli Mallett <jmallett@FreeBSD.org> for the
|
|
* FreeBSD project. Redistribution and use in source and binary forms, with
|
|
* or without modification, are permitted provided that the following
|
|
* conditions are met:
|
|
*
|
|
* 1. Redistribution of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* 2. Redistribution in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
|
|
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
|
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/mount.h>
|
|
#include <sys/disklabel.h>
|
|
#include <sys/stat.h>
|
|
|
|
#include <ufs/ufs/ufsmount.h>
|
|
#include <ufs/ufs/dinode.h>
|
|
#include <ufs/ffs/fs.h>
|
|
|
|
#include <errno.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
|
|
#include <libufs.h>
|
|
|
|
static int superblocks[] = SBLOCKSEARCH;
|
|
|
|
int
|
|
sbread(struct uufsd *disk)
|
|
{
|
|
uint8_t block[MAXBSIZE];
|
|
struct fs *fs;
|
|
int sb, superblock;
|
|
int i, size, blks;
|
|
uint8_t *space;
|
|
|
|
ERROR(disk, NULL);
|
|
|
|
fs = &disk->d_fs;
|
|
superblock = superblocks[0];
|
|
|
|
for (sb = 0; (superblock = superblocks[sb]) != -1; sb++) {
|
|
if (bread(disk, superblock, disk->d_sb, SBLOCKSIZE) == -1) {
|
|
ERROR(disk, "non-existent or truncated superblock");
|
|
return (-1);
|
|
}
|
|
if (fs->fs_magic == FS_UFS1_MAGIC)
|
|
disk->d_ufs = 1;
|
|
if (fs->fs_magic == FS_UFS2_MAGIC &&
|
|
fs->fs_sblockloc == superblock)
|
|
disk->d_ufs = 2;
|
|
if (fs->fs_bsize <= MAXBSIZE &&
|
|
(size_t)fs->fs_bsize >= sizeof(*fs)) {
|
|
if (disk->d_ufs)
|
|
break;
|
|
}
|
|
disk->d_ufs = 0;
|
|
}
|
|
if (superblock == -1 || disk->d_ufs == 0) {
|
|
/*
|
|
* Other error cases will result in errno being set, here we
|
|
* must set it to indicate no superblock could be found with
|
|
* which to associate this disk/filesystem.
|
|
*/
|
|
ERROR(disk, "no usable known superblock found");
|
|
errno = ENOENT;
|
|
return (-1);
|
|
}
|
|
disk->d_bsize = fs->fs_fsize / fsbtodb(fs, 1);
|
|
disk->d_sblock = superblock / disk->d_bsize;
|
|
/*
|
|
* Read in the superblock summary information.
|
|
*/
|
|
size = fs->fs_cssize;
|
|
blks = howmany(size, fs->fs_fsize);
|
|
size += fs->fs_ncg * sizeof(int32_t);
|
|
space = malloc(size);
|
|
if (space == NULL) {
|
|
ERROR(disk, "failed to allocate space for summary information");
|
|
return (-1);
|
|
}
|
|
fs->fs_csp = (struct csum *)space;
|
|
for (i = 0; i < blks; i += fs->fs_frag) {
|
|
size = fs->fs_bsize;
|
|
if (i + fs->fs_frag > blks)
|
|
size = (blks - i) * fs->fs_fsize;
|
|
if (bread(disk, fsbtodb(fs, fs->fs_csaddr + i), block, size)
|
|
== -1) {
|
|
ERROR(disk, "Failed to read sb summary information");
|
|
free(fs->fs_csp);
|
|
return (-1);
|
|
}
|
|
bcopy(block, space, size);
|
|
space += size;
|
|
}
|
|
fs->fs_maxcluster = (uint32_t *)space;
|
|
disk->d_sbcsum = fs->fs_csp;
|
|
|
|
return (0);
|
|
}
|
|
|
|
int
|
|
sbwrite(struct uufsd *disk, int all)
|
|
{
|
|
struct fs *fs;
|
|
int blks, size;
|
|
uint8_t *space;
|
|
unsigned i;
|
|
|
|
ERROR(disk, NULL);
|
|
|
|
fs = &disk->d_fs;
|
|
|
|
if (!disk->d_sblock) {
|
|
disk->d_sblock = disk->d_fs.fs_sblockloc / disk->d_bsize;
|
|
}
|
|
|
|
if (bwrite(disk, disk->d_sblock, fs, SBLOCKSIZE) == -1) {
|
|
ERROR(disk, "failed to write superblock");
|
|
return (-1);
|
|
}
|
|
/*
|
|
* Write superblock summary information.
|
|
*/
|
|
blks = howmany(fs->fs_cssize, fs->fs_fsize);
|
|
space = (uint8_t *)disk->d_sbcsum;
|
|
for (i = 0; i < blks; i += fs->fs_frag) {
|
|
size = fs->fs_bsize;
|
|
if (i + fs->fs_frag > blks)
|
|
size = (blks - i) * fs->fs_fsize;
|
|
if (bwrite(disk, fsbtodb(fs, fs->fs_csaddr + i), space, size)
|
|
== -1) {
|
|
ERROR(disk, "Failed to write sb summary information");
|
|
return (-1);
|
|
}
|
|
space += size;
|
|
}
|
|
if (all) {
|
|
for (i = 0; i < fs->fs_ncg; i++)
|
|
if (bwrite(disk, fsbtodb(fs, cgsblock(fs, i)),
|
|
fs, SBLOCKSIZE) == -1) {
|
|
ERROR(disk, "failed to update a superblock");
|
|
return (-1);
|
|
}
|
|
}
|
|
return (0);
|
|
}
|