mirror of
https://git.hardenedbsd.org/hardenedbsd/HardenedBSD.git
synced 2024-12-20 07:14:26 +01:00
76131e39c3
and due to buffering they would sometimes come out after the actual error message when mkheaders() failed due to an unknown device, so you'd get an error messages followed by 20 or 30 lines of harmless warnings. There are lots of other warning messages in config(8) that are printed on stdout, but these were the most egregious (at least with LINT).
238 lines
5.8 KiB
C
238 lines
5.8 KiB
C
/*
|
|
* Copyright (c) 1980, 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. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. 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.
|
|
*/
|
|
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)mkheaders.c 8.1 (Berkeley) 6/6/93";
|
|
#endif
|
|
static const char rcsid[] =
|
|
"$FreeBSD$";
|
|
#endif /* not lint */
|
|
|
|
/*
|
|
* Make all the .h files for the optional entries
|
|
*/
|
|
|
|
#include <ctype.h>
|
|
#include <err.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <sys/param.h>
|
|
#include "config.h"
|
|
#include "y.tab.h"
|
|
|
|
static int do_header(char *, int);
|
|
static char *toheader(char *);
|
|
static char *tomacro(char *);
|
|
|
|
void
|
|
headers(void)
|
|
{
|
|
struct file_list *fl;
|
|
struct device *dp;
|
|
int match;
|
|
int errors;
|
|
|
|
errors = 0;
|
|
STAILQ_FOREACH(fl, &ftab, f_next) {
|
|
if (fl->f_needs != 0) {
|
|
match = 0;
|
|
STAILQ_FOREACH(dp, &dtab, d_next) {
|
|
if (eq(dp->d_name, fl->f_needs)) {
|
|
match++;
|
|
dp->d_done |= DEVDONE;
|
|
}
|
|
}
|
|
if (fl->f_flags & NEED_COUNT)
|
|
errors += do_header(fl->f_needs, match);
|
|
}
|
|
}
|
|
STAILQ_FOREACH(dp, &dtab, d_next) {
|
|
if (!(dp->d_done & DEVDONE)) {
|
|
warnx("Error: device \"%s\" is unknown",
|
|
dp->d_name);
|
|
errors++;
|
|
}
|
|
if (dp->d_count == UNKNOWN)
|
|
continue;
|
|
match = 0;
|
|
STAILQ_FOREACH(fl, &ftab, f_next) {
|
|
if (fl->f_needs == 0)
|
|
continue;
|
|
if ((fl->f_flags & NEED_COUNT) == 0)
|
|
continue;
|
|
if (eq(dp->d_name, fl->f_needs)) {
|
|
match++;
|
|
break;
|
|
}
|
|
}
|
|
if (match == 0) {
|
|
warnx("Error: device \"%s\" does not take a count",
|
|
dp->d_name);
|
|
errors++;
|
|
}
|
|
}
|
|
if (errors)
|
|
errx(1, "%d errors", errors);
|
|
}
|
|
|
|
static int
|
|
do_header(char *dev, int match)
|
|
{
|
|
char *file, *name, *inw;
|
|
struct file_list *fl, *tflp;
|
|
struct file_list_head fl_head;
|
|
struct device *dp;
|
|
FILE *inf, *outf;
|
|
int inc, oldcount;
|
|
int count, hicount;
|
|
int errors;
|
|
|
|
/*
|
|
* After this loop, "count" will be the actual number of units,
|
|
* and "hicount" will be the highest unit declared. do_header()
|
|
* must use this higher of these values.
|
|
*/
|
|
errors = 0;
|
|
hicount = count = 0;
|
|
STAILQ_FOREACH(dp, &dtab, d_next) {
|
|
if (eq(dp->d_name, dev)) {
|
|
if (dp->d_count == UNKNOWN) {
|
|
warnx("Device \"%s\" requires a count", dev);
|
|
return 1;
|
|
}
|
|
count = dp->d_count;
|
|
break;
|
|
}
|
|
}
|
|
file = toheader(dev);
|
|
name = tomacro(dev);
|
|
if (match)
|
|
fprintf(stderr,
|
|
"FYI: static unit limits for %s are set: %s=%d\n",
|
|
dev, name, count);
|
|
remember(file);
|
|
inf = fopen(file, "r");
|
|
oldcount = -1;
|
|
if (inf == 0) {
|
|
outf = fopen(file, "w");
|
|
if (outf == 0)
|
|
err(1, "%s", file);
|
|
fprintf(outf, "#define %s %d\n", name, count);
|
|
(void) fclose(outf);
|
|
return 0;
|
|
}
|
|
STAILQ_INIT(&fl_head);
|
|
for (;;) {
|
|
char *cp;
|
|
if ((inw = get_word(inf)) == 0 || inw == (char *)EOF)
|
|
break;
|
|
if ((inw = get_word(inf)) == 0 || inw == (char *)EOF)
|
|
break;
|
|
inw = ns(inw);
|
|
cp = get_word(inf);
|
|
if (cp == 0 || cp == (char *)EOF)
|
|
break;
|
|
inc = atoi(cp);
|
|
if (eq(inw, name)) {
|
|
oldcount = inc;
|
|
inc = count;
|
|
}
|
|
cp = get_word(inf);
|
|
if (cp == (char *)EOF)
|
|
break;
|
|
fl = (struct file_list *) malloc(sizeof *fl);
|
|
bzero(fl, sizeof(*fl));
|
|
fl->f_fn = inw; /* malloced */
|
|
fl->f_type = inc;
|
|
STAILQ_INSERT_HEAD(&fl_head, fl, f_next);
|
|
}
|
|
(void) fclose(inf);
|
|
if (count == oldcount) {
|
|
for (fl = STAILQ_FIRST(&fl_head); fl != NULL; fl = tflp) {
|
|
tflp = STAILQ_NEXT(fl, f_next);
|
|
free(fl->f_fn);
|
|
free(fl);
|
|
}
|
|
return 0;
|
|
}
|
|
if (oldcount == -1) {
|
|
fl = (struct file_list *) malloc(sizeof *fl);
|
|
bzero(fl, sizeof(*fl));
|
|
fl->f_fn = ns(name);
|
|
fl->f_type = count;
|
|
STAILQ_INSERT_HEAD(&fl_head, fl, f_next);
|
|
}
|
|
outf = fopen(file, "w");
|
|
if (outf == 0)
|
|
err(1, "%s", file);
|
|
for (fl = STAILQ_FIRST(&fl_head); fl != NULL; fl = tflp) {
|
|
fprintf(outf,
|
|
"#define %s %u\n", fl->f_fn, count ? fl->f_type : 0);
|
|
tflp = STAILQ_NEXT(fl, f_next);
|
|
free(fl->f_fn);
|
|
free(fl);
|
|
}
|
|
(void) fclose(outf);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* convert a dev name to a .h file name
|
|
*/
|
|
static char *
|
|
toheader(char *dev)
|
|
{
|
|
static char hbuf[MAXPATHLEN];
|
|
|
|
snprintf(hbuf, sizeof(hbuf), "%s.h", path(dev));
|
|
return (hbuf);
|
|
}
|
|
|
|
/*
|
|
* convert a dev name to a macro name
|
|
*/
|
|
static char *
|
|
tomacro(char *dev)
|
|
{
|
|
static char mbuf[20];
|
|
char *cp;
|
|
|
|
cp = mbuf;
|
|
*cp++ = 'N';
|
|
while (*dev)
|
|
*cp++ = islower(*dev) ? toupper(*dev++) : *dev++;
|
|
*cp++ = 0;
|
|
return (mbuf);
|
|
}
|