8a16b7a18f
Mainly focus on files that use BSD 3-Clause license. 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. Special thanks to Wind River for providing access to "The Duke of Highlander" tool: an older (2014) run over FreeBSD tree was useful as a starting point.
336 lines
7.9 KiB
C
336 lines
7.9 KiB
C
/* $NetBSD: preen.c,v 1.18 1998/07/26 20:02:36 mycroft Exp $ */
|
|
|
|
/*-
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
*
|
|
* Copyright (c) 1990, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions 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.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``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 REGENTS OR CONTRIBUTORS 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.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)preen.c 8.5 (Berkeley) 4/28/95";
|
|
#else
|
|
__RCSID("$NetBSD: preen.c,v 1.18 1998/07/26 20:02:36 mycroft Exp $");
|
|
#endif
|
|
#endif /* not lint */
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/wait.h>
|
|
#include <sys/queue.h>
|
|
|
|
#include <err.h>
|
|
#include <ctype.h>
|
|
#include <fstab.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
|
|
#include "fsutil.h"
|
|
|
|
struct partentry {
|
|
TAILQ_ENTRY(partentry) p_entries;
|
|
char *p_devname; /* device name */
|
|
char *p_mntpt; /* mount point */
|
|
char *p_type; /* file system type */
|
|
};
|
|
|
|
static TAILQ_HEAD(part, partentry) badh;
|
|
|
|
struct diskentry {
|
|
TAILQ_ENTRY(diskentry) d_entries;
|
|
char *d_name; /* disk base name */
|
|
TAILQ_HEAD(prt, partentry) d_part; /* list of partitions on disk */
|
|
int d_pid; /* 0 or pid of fsck proc */
|
|
};
|
|
|
|
static TAILQ_HEAD(disk, diskentry) diskh;
|
|
|
|
static int nrun = 0, ndisks = 0;
|
|
|
|
static struct diskentry *finddisk(const char *);
|
|
static void addpart(const char *, const char *, const char *);
|
|
static int startdisk(struct diskentry *,
|
|
int (*)(const char *, const char *, const char *, const char *, pid_t *));
|
|
static void printpart(void);
|
|
|
|
int
|
|
checkfstab(int flags, int (*docheck)(struct fstab *),
|
|
int (*checkit)(const char *, const char *, const char *, const char *, pid_t *))
|
|
{
|
|
struct fstab *fs;
|
|
struct diskentry *d, *nextdisk;
|
|
struct partentry *p;
|
|
int ret, pid, retcode, passno, sumstatus, status, nextpass;
|
|
const char *name;
|
|
|
|
TAILQ_INIT(&badh);
|
|
TAILQ_INIT(&diskh);
|
|
|
|
sumstatus = 0;
|
|
|
|
nextpass = 0;
|
|
for (passno = 1; nextpass != INT_MAX; passno = nextpass) {
|
|
if (flags & CHECK_DEBUG)
|
|
printf("pass %d\n", passno);
|
|
|
|
nextpass = INT_MAX;
|
|
if (setfsent() == 0) {
|
|
warnx("Can't open checklist file: %s\n", _PATH_FSTAB);
|
|
return (8);
|
|
}
|
|
while ((fs = getfsent()) != NULL) {
|
|
name = fs->fs_spec;
|
|
if (fs->fs_passno > passno && fs->fs_passno < nextpass)
|
|
nextpass = fs->fs_passno;
|
|
|
|
if (passno != fs->fs_passno)
|
|
continue;
|
|
|
|
if ((*docheck)(fs) == 0)
|
|
continue;
|
|
|
|
if (flags & CHECK_DEBUG)
|
|
printf("pass %d, name %s\n", passno, name);
|
|
|
|
if ((flags & CHECK_PREEN) == 0 || passno == 1 ||
|
|
(flags & DO_BACKGRD) != 0) {
|
|
if (name == NULL) {
|
|
if (flags & CHECK_PREEN)
|
|
return 8;
|
|
else
|
|
continue;
|
|
}
|
|
sumstatus = (*checkit)(fs->fs_vfstype,
|
|
name, fs->fs_file, NULL, NULL);
|
|
|
|
if (sumstatus)
|
|
return (sumstatus);
|
|
continue;
|
|
}
|
|
if (name == NULL) {
|
|
(void) fprintf(stderr,
|
|
"BAD DISK NAME %s\n", fs->fs_spec);
|
|
sumstatus |= 8;
|
|
continue;
|
|
}
|
|
addpart(fs->fs_vfstype, name, fs->fs_file);
|
|
}
|
|
|
|
if ((flags & CHECK_PREEN) == 0 || passno == 1 ||
|
|
(flags & DO_BACKGRD) != 0)
|
|
continue;
|
|
|
|
if (flags & CHECK_DEBUG) {
|
|
printf("Parallel start\n");
|
|
printpart();
|
|
}
|
|
|
|
TAILQ_FOREACH(nextdisk, &diskh, d_entries) {
|
|
if ((ret = startdisk(nextdisk, checkit)) != 0)
|
|
return ret;
|
|
}
|
|
|
|
if (flags & CHECK_DEBUG)
|
|
printf("Parallel wait\n");
|
|
while ((pid = wait(&status)) != -1) {
|
|
TAILQ_FOREACH(d, &diskh, d_entries)
|
|
if (d->d_pid == pid)
|
|
break;
|
|
|
|
if (d == NULL) {
|
|
warnx("Unknown pid %d\n", pid);
|
|
continue;
|
|
}
|
|
|
|
if (WIFEXITED(status))
|
|
retcode = WEXITSTATUS(status);
|
|
else
|
|
retcode = 0;
|
|
|
|
p = TAILQ_FIRST(&d->d_part);
|
|
|
|
if (flags & (CHECK_DEBUG|CHECK_VERBOSE))
|
|
(void) printf("done %s: %s (%s) = 0x%x\n",
|
|
p->p_type, p->p_devname, p->p_mntpt,
|
|
status);
|
|
|
|
if (WIFSIGNALED(status)) {
|
|
(void) fprintf(stderr,
|
|
"%s: %s (%s): EXITED WITH SIGNAL %d\n",
|
|
p->p_type, p->p_devname, p->p_mntpt,
|
|
WTERMSIG(status));
|
|
retcode = 8;
|
|
}
|
|
|
|
TAILQ_REMOVE(&d->d_part, p, p_entries);
|
|
|
|
if (retcode != 0) {
|
|
TAILQ_INSERT_TAIL(&badh, p, p_entries);
|
|
sumstatus |= retcode;
|
|
} else {
|
|
free(p->p_type);
|
|
free(p->p_devname);
|
|
free(p);
|
|
}
|
|
d->d_pid = 0;
|
|
nrun--;
|
|
|
|
if (TAILQ_EMPTY(&d->d_part)) {
|
|
TAILQ_REMOVE(&diskh, d, d_entries);
|
|
ndisks--;
|
|
} else {
|
|
if ((ret = startdisk(d, checkit)) != 0)
|
|
return ret;
|
|
}
|
|
}
|
|
if (flags & CHECK_DEBUG) {
|
|
printf("Parallel end\n");
|
|
printpart();
|
|
}
|
|
}
|
|
|
|
if (!(flags & CHECK_PREEN))
|
|
return 0;
|
|
|
|
if (sumstatus) {
|
|
p = TAILQ_FIRST(&badh);
|
|
if (p == NULL)
|
|
return (sumstatus);
|
|
|
|
(void) fprintf(stderr,
|
|
"THE FOLLOWING FILE SYSTEM%s HAD AN %s\n\t",
|
|
TAILQ_NEXT(p, p_entries) ? "S" : "",
|
|
"UNEXPECTED INCONSISTENCY:");
|
|
|
|
for (; p; p = TAILQ_NEXT(p, p_entries))
|
|
(void) fprintf(stderr,
|
|
"%s: %s (%s)%s", p->p_type, p->p_devname,
|
|
p->p_mntpt, TAILQ_NEXT(p, p_entries) ? ", " : "\n");
|
|
|
|
return sumstatus;
|
|
}
|
|
(void) endfsent();
|
|
return (0);
|
|
}
|
|
|
|
|
|
static struct diskentry *
|
|
finddisk(const char *name)
|
|
{
|
|
const char *p;
|
|
size_t len = 0;
|
|
struct diskentry *d;
|
|
|
|
p = strrchr(name, '/');
|
|
if (p == NULL)
|
|
p = name;
|
|
else
|
|
p++;
|
|
for (; *p && !isdigit(*p); p++)
|
|
continue;
|
|
for (; *p && isdigit(*p); p++)
|
|
continue;
|
|
len = p - name;
|
|
if (len == 0)
|
|
len = strlen(name);
|
|
|
|
TAILQ_FOREACH(d, &diskh, d_entries)
|
|
if (strncmp(d->d_name, name, len) == 0 && d->d_name[len] == 0)
|
|
return d;
|
|
|
|
d = emalloc(sizeof(*d));
|
|
d->d_name = estrdup(name);
|
|
d->d_name[len] = '\0';
|
|
TAILQ_INIT(&d->d_part);
|
|
d->d_pid = 0;
|
|
|
|
TAILQ_INSERT_TAIL(&diskh, d, d_entries);
|
|
ndisks++;
|
|
|
|
return d;
|
|
}
|
|
|
|
|
|
static void
|
|
printpart(void)
|
|
{
|
|
struct diskentry *d;
|
|
struct partentry *p;
|
|
|
|
TAILQ_FOREACH(d, &diskh, d_entries) {
|
|
(void) printf("disk %s: ", d->d_name);
|
|
TAILQ_FOREACH(p, &d->d_part, p_entries)
|
|
(void) printf("%s ", p->p_devname);
|
|
(void) printf("\n");
|
|
}
|
|
}
|
|
|
|
|
|
static void
|
|
addpart(const char *type, const char *dev, const char *mntpt)
|
|
{
|
|
struct diskentry *d = finddisk(dev);
|
|
struct partentry *p;
|
|
|
|
TAILQ_FOREACH(p, &d->d_part, p_entries)
|
|
if (strcmp(p->p_devname, dev) == 0) {
|
|
warnx("%s in fstab more than once!\n", dev);
|
|
return;
|
|
}
|
|
|
|
p = emalloc(sizeof(*p));
|
|
p->p_devname = estrdup(dev);
|
|
p->p_mntpt = estrdup(mntpt);
|
|
p->p_type = estrdup(type);
|
|
|
|
TAILQ_INSERT_TAIL(&d->d_part, p, p_entries);
|
|
}
|
|
|
|
|
|
static int
|
|
startdisk(struct diskentry *d, int (*checkit)(const char *, const char *,
|
|
const char *, const char *, pid_t *))
|
|
{
|
|
struct partentry *p = TAILQ_FIRST(&d->d_part);
|
|
int rv;
|
|
|
|
while ((rv = (*checkit)(p->p_type, p->p_devname, p->p_mntpt,
|
|
NULL, &d->d_pid)) != 0 && nrun > 0)
|
|
sleep(10);
|
|
|
|
if (rv == 0)
|
|
nrun++;
|
|
|
|
return rv;
|
|
}
|