/* * 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 #include #include #include #include #include "config.h" #include "y.tab.h" static void do_header(char *, int); static void do_count(char *); static char *toheader(char *); static char *tomacro(char *); void headers(void) { struct file_list *fl; struct device *dp; for (fl = ftab; fl != 0; fl = fl->f_next) { if (fl->f_needs != 0) { for (dp = dtab; dp != 0; dp = dp->d_next) { if (eq(dp->d_name, fl->f_needs)) { if ((dp->d_type & TYPEMASK) == DEVICE) dp->d_type |= DEVDONE; } } if (fl->f_flags & NEED_COUNT) do_count(fl->f_needs); } } for (dp = dtab; dp != 0; dp = dp->d_next) { if ((dp->d_type & TYPEMASK) == DEVICE) { if (!(dp->d_type & DEVDONE)) printf("Warning: device \"%s\" is unknown\n", dp->d_name); } } } /* * count all the devices of a certain type and recurse to count * whatever the device is connected to */ static void do_count(char *dev) { struct device *dp; int count, hicount; /* * 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. */ for (hicount = count = 0, dp = dtab; dp != 0; dp = dp->d_next) { if (eq(dp->d_name, dev)) { count = dp->d_count != UNKNOWN ? dp->d_count : 1; break; } } do_header(dev, count); } static void do_header(char *dev, int count) { char *file, *name, *inw; struct file_list *fl, *fl_head, *tflp; FILE *inf, *outf; int inc, oldcount; file = toheader(dev); name = tomacro(dev); 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; } 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)); fl->f_fn = inw; /* malloced */ 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; free(fl->f_fn); free(fl); } return; } if (oldcount == -1) { fl = (struct file_list *) malloc(sizeof *fl); bzero(fl, sizeof(*fl)); fl->f_fn = ns(name); fl->f_type = count; fl->f_next = fl_head; fl_head = fl; } outf = fopen(file, "w"); if (outf == 0) err(1, "%s", file); 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; free(fl->f_fn); free(fl); } (void) fclose(outf); } /* * 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); }