1994-05-26 05:23:31 +00:00
|
|
|
/*
|
|
|
|
* 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
|
1997-09-15 06:37:10 +00:00
|
|
|
#if 0
|
1994-05-26 05:23:31 +00:00
|
|
|
static char sccsid[] = "@(#)mkheaders.c 8.1 (Berkeley) 6/6/93";
|
1997-09-15 06:37:10 +00:00
|
|
|
#endif
|
|
|
|
static const char rcsid[] =
|
1999-08-28 01:35:59 +00:00
|
|
|
"$FreeBSD$";
|
1994-05-26 05:23:31 +00:00
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make all the .h files for the optional entries
|
|
|
|
*/
|
|
|
|
|
1997-09-15 06:37:10 +00:00
|
|
|
#include <ctype.h>
|
|
|
|
#include <err.h>
|
1994-05-26 05:23:31 +00:00
|
|
|
#include <stdio.h>
|
1996-12-14 19:53:49 +00:00
|
|
|
#include <string.h>
|
1994-05-26 05:23:31 +00:00
|
|
|
#include "config.h"
|
1996-06-02 17:22:01 +00:00
|
|
|
#include "y.tab.h"
|
1994-05-26 05:23:31 +00:00
|
|
|
|
1999-04-17 14:41:41 +00:00
|
|
|
static void do_header __P((char *, char *, int));
|
|
|
|
static void do_count __P((char *, char *, int));
|
|
|
|
static char *toheader __P((char *));
|
|
|
|
static char *tomacro __P((char *));
|
1997-09-15 06:37:10 +00:00
|
|
|
|
|
|
|
void
|
1994-05-26 05:23:31 +00:00
|
|
|
headers()
|
|
|
|
{
|
|
|
|
register struct file_list *fl;
|
1997-10-28 07:21:04 +00:00
|
|
|
struct device *dp;
|
1994-05-26 05:23:31 +00:00
|
|
|
|
|
|
|
for (fl = ftab; fl != 0; fl = fl->f_next)
|
|
|
|
if (fl->f_needs != 0)
|
|
|
|
do_count(fl->f_needs, fl->f_needs, 1);
|
1999-06-03 20:37:19 +00:00
|
|
|
for (dp = dtab; dp != 0; dp = dp->d_next) {
|
1997-10-28 07:21:04 +00:00
|
|
|
if ((dp->d_type & TYPEMASK) == PSEUDO_DEVICE) {
|
|
|
|
if (!(dp->d_type & DEVDONE))
|
|
|
|
printf("Warning: pseudo-device \"%s\" is unknown\n",
|
|
|
|
dp->d_name);
|
|
|
|
}
|
1999-06-03 20:37:19 +00:00
|
|
|
if ((dp->d_type & TYPEMASK) == DEVICE) {
|
|
|
|
if (!(dp->d_type & DEVDONE))
|
|
|
|
printf("Warning: device \"%s\" is unknown\n",
|
|
|
|
dp->d_name);
|
1999-12-06 15:52:18 +00:00
|
|
|
}
|
1999-06-03 20:37:19 +00:00
|
|
|
}
|
1994-05-26 05:23:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* count all the devices of a certain type and recurse to count
|
|
|
|
* whatever the device is connected to
|
|
|
|
*/
|
1999-04-17 14:41:41 +00:00
|
|
|
static void
|
1994-05-26 05:23:31 +00:00
|
|
|
do_count(dev, hname, search)
|
|
|
|
register char *dev, *hname;
|
|
|
|
int search;
|
|
|
|
{
|
2000-01-08 15:57:22 +00:00
|
|
|
register struct device *dp;
|
1994-05-26 05:23:31 +00:00
|
|
|
register int count, hicount;
|
2000-01-08 15:57:22 +00:00
|
|
|
char *mp;
|
1994-05-26 05:23:31 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
2000-01-08 15:57:22 +00:00
|
|
|
for (dp = dtab; dp != 0; dp = dp->d_next) {
|
1999-12-06 15:52:18 +00:00
|
|
|
if (eq(dp->d_name, dev)) {
|
|
|
|
if ((dp->d_type & TYPEMASK) == PSEUDO_DEVICE)
|
|
|
|
dp->d_type |= DEVDONE;
|
|
|
|
else if ((dp->d_type & TYPEMASK) == DEVICE)
|
|
|
|
dp->d_type |= DEVDONE;
|
|
|
|
}
|
2000-01-08 15:57:22 +00:00
|
|
|
}
|
|
|
|
for (hicount = count = 0, dp = dtab; dp != 0; dp = dp->d_next) {
|
1994-05-26 05:23:31 +00:00
|
|
|
if (dp->d_unit != -1 && eq(dp->d_name, dev)) {
|
1997-11-07 00:09:40 +00:00
|
|
|
if ((dp->d_type & TYPEMASK) == PSEUDO_DEVICE) {
|
1994-05-26 05:23:31 +00:00
|
|
|
count =
|
Further cleanup. Also remove the following unused or defunct tokens:
and, bio, cam, master, minor, net, priority, sequential, size, slave, trace
1999-10-10 17:36:11 +00:00
|
|
|
dp->d_count != UNKNOWN ? dp->d_count : 1;
|
1994-05-26 05:23:31 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
count++;
|
|
|
|
/*
|
|
|
|
* Allow holes in unit numbering,
|
|
|
|
* assumption is unit numbering starts
|
|
|
|
* at zero.
|
|
|
|
*/
|
|
|
|
if (dp->d_unit + 1 > hicount)
|
|
|
|
hicount = dp->d_unit + 1;
|
|
|
|
if (search) {
|
|
|
|
mp = dp->d_conn;
|
2000-01-08 15:57:22 +00:00
|
|
|
if (mp != 0 && dp->d_connunit < 0)
|
|
|
|
mp = 0;
|
|
|
|
if (mp != 0 && eq(mp, "nexus"))
|
|
|
|
mp = 0;
|
|
|
|
if (mp != 0) {
|
|
|
|
do_count(mp, hname, 0);
|
1994-05-26 05:23:31 +00:00
|
|
|
search = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
1999-12-06 15:52:18 +00:00
|
|
|
}
|
1994-05-26 05:23:31 +00:00
|
|
|
do_header(dev, hname, count > hicount ? count : hicount);
|
|
|
|
}
|
|
|
|
|
1999-04-17 14:41:41 +00:00
|
|
|
static void
|
1994-05-26 05:23:31 +00:00
|
|
|
do_header(dev, hname, count)
|
|
|
|
char *dev, *hname;
|
|
|
|
int count;
|
|
|
|
{
|
1999-04-17 14:41:41 +00:00
|
|
|
char *file, *name, *inw;
|
1994-05-26 05:23:31 +00:00
|
|
|
struct file_list *fl, *fl_head, *tflp;
|
|
|
|
FILE *inf, *outf;
|
|
|
|
int inc, oldcount;
|
|
|
|
|
|
|
|
file = toheader(hname);
|
|
|
|
name = tomacro(dev);
|
|
|
|
inf = fopen(file, "r");
|
|
|
|
oldcount = -1;
|
|
|
|
if (inf == 0) {
|
|
|
|
outf = fopen(file, "w");
|
1997-09-15 06:37:10 +00:00
|
|
|
if (outf == 0)
|
|
|
|
err(1, "%s", file);
|
1994-05-26 05:23:31 +00:00
|
|
|
fprintf(outf, "#define %s %d\n", name, count);
|
|
|
|
(void) fclose(outf);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
fl_head = NULL;
|
|
|
|
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));
|
1995-12-11 10:52:34 +00:00
|
|
|
fl->f_fn = inw; /* malloced */
|
1994-05-26 05:23:31 +00:00
|
|
|
fl->f_type = inc;
|
|
|
|
fl->f_next = fl_head;
|
|
|
|
fl_head = fl;
|
|
|
|
}
|
|
|
|
(void) fclose(inf);
|
|
|
|
if (count == oldcount) {
|
|
|
|
for (fl = fl_head; fl != NULL; fl = tflp) {
|
|
|
|
tflp = fl->f_next;
|
1995-12-11 10:52:34 +00:00
|
|
|
free(fl->f_fn);
|
1994-05-26 05:23:31 +00:00
|
|
|
free(fl);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (oldcount == -1) {
|
|
|
|
fl = (struct file_list *) malloc(sizeof *fl);
|
|
|
|
bzero(fl, sizeof(*fl));
|
1996-12-14 19:53:49 +00:00
|
|
|
fl->f_fn = ns(name);
|
1994-05-26 05:23:31 +00:00
|
|
|
fl->f_type = count;
|
|
|
|
fl->f_next = fl_head;
|
|
|
|
fl_head = fl;
|
|
|
|
}
|
|
|
|
outf = fopen(file, "w");
|
1997-09-15 06:37:10 +00:00
|
|
|
if (outf == 0)
|
|
|
|
err(1, "%s", file);
|
1994-05-26 05:23:31 +00:00
|
|
|
for (fl = fl_head; fl != NULL; fl = tflp) {
|
|
|
|
fprintf(outf,
|
|
|
|
"#define %s %u\n", fl->f_fn, count ? fl->f_type : 0);
|
|
|
|
tflp = fl->f_next;
|
1995-12-11 10:52:34 +00:00
|
|
|
free(fl->f_fn);
|
1994-05-26 05:23:31 +00:00
|
|
|
free(fl);
|
|
|
|
}
|
|
|
|
(void) fclose(outf);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* convert a dev name to a .h file name
|
|
|
|
*/
|
1999-04-17 14:41:41 +00:00
|
|
|
static char *
|
1994-05-26 05:23:31 +00:00
|
|
|
toheader(dev)
|
|
|
|
char *dev;
|
|
|
|
{
|
|
|
|
static char hbuf[80];
|
|
|
|
|
|
|
|
(void) strcpy(hbuf, path(dev));
|
|
|
|
(void) strcat(hbuf, ".h");
|
|
|
|
return (hbuf);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* convert a dev name to a macro name
|
|
|
|
*/
|
1999-04-17 14:41:41 +00:00
|
|
|
static char *
|
|
|
|
tomacro(dev)
|
1994-05-26 05:23:31 +00:00
|
|
|
register char *dev;
|
|
|
|
{
|
|
|
|
static char mbuf[20];
|
|
|
|
register char *cp;
|
|
|
|
|
|
|
|
cp = mbuf;
|
|
|
|
*cp++ = 'N';
|
|
|
|
while (*dev)
|
|
|
|
*cp++ = islower(*dev) ? toupper(*dev++) : *dev++;
|
|
|
|
*cp++ = 0;
|
|
|
|
return (mbuf);
|
|
|
|
}
|