1dea673e9SRodney W. Grimes /* 2dea673e9SRodney W. Grimes * Copyright (c) 1980, 1993 3dea673e9SRodney W. Grimes * The Regents of the University of California. All rights reserved. 4dea673e9SRodney W. Grimes * 5dea673e9SRodney W. Grimes * Redistribution and use in source and binary forms, with or without 6dea673e9SRodney W. Grimes * modification, are permitted provided that the following conditions 7dea673e9SRodney W. Grimes * are met: 8dea673e9SRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 9dea673e9SRodney W. Grimes * notice, this list of conditions and the following disclaimer. 10dea673e9SRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 11dea673e9SRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 12dea673e9SRodney W. Grimes * documentation and/or other materials provided with the distribution. 13dea673e9SRodney W. Grimes * 3. All advertising materials mentioning features or use of this software 14dea673e9SRodney W. Grimes * must display the following acknowledgement: 15dea673e9SRodney W. Grimes * This product includes software developed by the University of 16dea673e9SRodney W. Grimes * California, Berkeley and its contributors. 17dea673e9SRodney W. Grimes * 4. Neither the name of the University nor the names of its contributors 18dea673e9SRodney W. Grimes * may be used to endorse or promote products derived from this software 19dea673e9SRodney W. Grimes * without specific prior written permission. 20dea673e9SRodney W. Grimes * 21dea673e9SRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22dea673e9SRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23dea673e9SRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24dea673e9SRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25dea673e9SRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26dea673e9SRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27dea673e9SRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28dea673e9SRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29dea673e9SRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30dea673e9SRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31dea673e9SRodney W. Grimes * SUCH DAMAGE. 32dea673e9SRodney W. Grimes */ 33dea673e9SRodney W. Grimes 34dea673e9SRodney W. Grimes #ifndef lint 35d5831691SPhilippe Charnier #if 0 36dea673e9SRodney W. Grimes static char sccsid[] = "@(#)mkheaders.c 8.1 (Berkeley) 6/6/93"; 37d5831691SPhilippe Charnier #endif 38d5831691SPhilippe Charnier static const char rcsid[] = 39cea24a2bSJoerg Wunsch "$Id: mkheaders.c,v 1.6 1997/09/15 06:37:09 charnier Exp $"; 40dea673e9SRodney W. Grimes #endif /* not lint */ 41dea673e9SRodney W. Grimes 42dea673e9SRodney W. Grimes /* 43dea673e9SRodney W. Grimes * Make all the .h files for the optional entries 44dea673e9SRodney W. Grimes */ 45dea673e9SRodney W. Grimes 46d5831691SPhilippe Charnier #include <ctype.h> 47d5831691SPhilippe Charnier #include <err.h> 48dea673e9SRodney W. Grimes #include <stdio.h> 495bd7b809SJoerg Wunsch #include <string.h> 50dea673e9SRodney W. Grimes #include "config.h" 511d95dc91SPoul-Henning Kamp #include "y.tab.h" 52dea673e9SRodney W. Grimes 535bd7b809SJoerg Wunsch #define ns(s) strdup(s) 545bd7b809SJoerg Wunsch 55d5831691SPhilippe Charnier void do_header __P((char *, char *, int)); 56d5831691SPhilippe Charnier void do_count __P((char *, char *, int)); 57d5831691SPhilippe Charnier 58d5831691SPhilippe Charnier void 59dea673e9SRodney W. Grimes headers() 60dea673e9SRodney W. Grimes { 61dea673e9SRodney W. Grimes register struct file_list *fl; 62cea24a2bSJoerg Wunsch struct device *dp; 63dea673e9SRodney W. Grimes 64dea673e9SRodney W. Grimes for (fl = ftab; fl != 0; fl = fl->f_next) 65dea673e9SRodney W. Grimes if (fl->f_needs != 0) 66dea673e9SRodney W. Grimes do_count(fl->f_needs, fl->f_needs, 1); 67cea24a2bSJoerg Wunsch for (dp = dtab; dp != 0; dp = dp->d_next) 68cea24a2bSJoerg Wunsch if ((dp->d_type & TYPEMASK) == PSEUDO_DEVICE) { 69cea24a2bSJoerg Wunsch if (!(dp->d_type & DEVDONE)) 70cea24a2bSJoerg Wunsch printf("Warning: pseudo-device \"%s\" is unknown\n", 71cea24a2bSJoerg Wunsch dp->d_name); 72cea24a2bSJoerg Wunsch else 73cea24a2bSJoerg Wunsch dp->d_type &= TYPEMASK; 74cea24a2bSJoerg Wunsch } 75dea673e9SRodney W. Grimes } 76dea673e9SRodney W. Grimes 77dea673e9SRodney W. Grimes /* 78dea673e9SRodney W. Grimes * count all the devices of a certain type and recurse to count 79dea673e9SRodney W. Grimes * whatever the device is connected to 80dea673e9SRodney W. Grimes */ 81d5831691SPhilippe Charnier void 82dea673e9SRodney W. Grimes do_count(dev, hname, search) 83dea673e9SRodney W. Grimes register char *dev, *hname; 84dea673e9SRodney W. Grimes int search; 85dea673e9SRodney W. Grimes { 86dea673e9SRodney W. Grimes register struct device *dp, *mp; 87dea673e9SRodney W. Grimes register int count, hicount; 88dea673e9SRodney W. Grimes 89dea673e9SRodney W. Grimes /* 90dea673e9SRodney W. Grimes * After this loop, "count" will be the actual number of units, 91dea673e9SRodney W. Grimes * and "hicount" will be the highest unit declared. do_header() 92dea673e9SRodney W. Grimes * must use this higher of these values. 93dea673e9SRodney W. Grimes */ 94dea673e9SRodney W. Grimes for (hicount = count = 0, dp = dtab; dp != 0; dp = dp->d_next) 95dea673e9SRodney W. Grimes if (dp->d_unit != -1 && eq(dp->d_name, dev)) { 96dea673e9SRodney W. Grimes if (dp->d_type == PSEUDO_DEVICE) { 97dea673e9SRodney W. Grimes count = 98dea673e9SRodney W. Grimes dp->d_slave != UNKNOWN ? dp->d_slave : 1; 99cea24a2bSJoerg Wunsch dp->d_type |= DEVDONE; 100dea673e9SRodney W. Grimes break; 101dea673e9SRodney W. Grimes } 102dea673e9SRodney W. Grimes count++; 103dea673e9SRodney W. Grimes /* 104dea673e9SRodney W. Grimes * Allow holes in unit numbering, 105dea673e9SRodney W. Grimes * assumption is unit numbering starts 106dea673e9SRodney W. Grimes * at zero. 107dea673e9SRodney W. Grimes */ 108dea673e9SRodney W. Grimes if (dp->d_unit + 1 > hicount) 109dea673e9SRodney W. Grimes hicount = dp->d_unit + 1; 110dea673e9SRodney W. Grimes if (search) { 111dea673e9SRodney W. Grimes mp = dp->d_conn; 112dea673e9SRodney W. Grimes if (mp != 0 && mp != TO_NEXUS && 113dea673e9SRodney W. Grimes mp->d_conn != 0 && mp->d_conn != TO_NEXUS) { 114dea673e9SRodney W. Grimes do_count(mp->d_name, hname, 0); 115dea673e9SRodney W. Grimes search = 0; 116dea673e9SRodney W. Grimes } 117dea673e9SRodney W. Grimes } 118dea673e9SRodney W. Grimes } 119dea673e9SRodney W. Grimes do_header(dev, hname, count > hicount ? count : hicount); 120dea673e9SRodney W. Grimes } 121dea673e9SRodney W. Grimes 122d5831691SPhilippe Charnier void 123dea673e9SRodney W. Grimes do_header(dev, hname, count) 124dea673e9SRodney W. Grimes char *dev, *hname; 125dea673e9SRodney W. Grimes int count; 126dea673e9SRodney W. Grimes { 127dea673e9SRodney W. Grimes char *file, *name, *inw, *toheader(), *tomacro(); 128dea673e9SRodney W. Grimes struct file_list *fl, *fl_head, *tflp; 129dea673e9SRodney W. Grimes FILE *inf, *outf; 130dea673e9SRodney W. Grimes int inc, oldcount; 131dea673e9SRodney W. Grimes 132dea673e9SRodney W. Grimes file = toheader(hname); 133dea673e9SRodney W. Grimes name = tomacro(dev); 134dea673e9SRodney W. Grimes inf = fopen(file, "r"); 135dea673e9SRodney W. Grimes oldcount = -1; 136dea673e9SRodney W. Grimes if (inf == 0) { 137dea673e9SRodney W. Grimes outf = fopen(file, "w"); 138d5831691SPhilippe Charnier if (outf == 0) 139d5831691SPhilippe Charnier err(1, "%s", file); 140dea673e9SRodney W. Grimes fprintf(outf, "#define %s %d\n", name, count); 141dea673e9SRodney W. Grimes (void) fclose(outf); 142dea673e9SRodney W. Grimes return; 143dea673e9SRodney W. Grimes } 144dea673e9SRodney W. Grimes fl_head = NULL; 145dea673e9SRodney W. Grimes for (;;) { 146dea673e9SRodney W. Grimes char *cp; 147dea673e9SRodney W. Grimes if ((inw = get_word(inf)) == 0 || inw == (char *)EOF) 148dea673e9SRodney W. Grimes break; 149dea673e9SRodney W. Grimes if ((inw = get_word(inf)) == 0 || inw == (char *)EOF) 150dea673e9SRodney W. Grimes break; 151dea673e9SRodney W. Grimes inw = ns(inw); 152dea673e9SRodney W. Grimes cp = get_word(inf); 153dea673e9SRodney W. Grimes if (cp == 0 || cp == (char *)EOF) 154dea673e9SRodney W. Grimes break; 155dea673e9SRodney W. Grimes inc = atoi(cp); 156dea673e9SRodney W. Grimes if (eq(inw, name)) { 157dea673e9SRodney W. Grimes oldcount = inc; 158dea673e9SRodney W. Grimes inc = count; 159dea673e9SRodney W. Grimes } 160dea673e9SRodney W. Grimes cp = get_word(inf); 161dea673e9SRodney W. Grimes if (cp == (char *)EOF) 162dea673e9SRodney W. Grimes break; 163dea673e9SRodney W. Grimes fl = (struct file_list *) malloc(sizeof *fl); 164dea673e9SRodney W. Grimes bzero(fl, sizeof(*fl)); 1656d41b96fSPeter Wemm fl->f_fn = inw; /* malloced */ 166dea673e9SRodney W. Grimes fl->f_type = inc; 167dea673e9SRodney W. Grimes fl->f_next = fl_head; 168dea673e9SRodney W. Grimes fl_head = fl; 169dea673e9SRodney W. Grimes } 170dea673e9SRodney W. Grimes (void) fclose(inf); 171dea673e9SRodney W. Grimes if (count == oldcount) { 172dea673e9SRodney W. Grimes for (fl = fl_head; fl != NULL; fl = tflp) { 173dea673e9SRodney W. Grimes tflp = fl->f_next; 1746d41b96fSPeter Wemm free(fl->f_fn); 175dea673e9SRodney W. Grimes free(fl); 176dea673e9SRodney W. Grimes } 177dea673e9SRodney W. Grimes return; 178dea673e9SRodney W. Grimes } 179dea673e9SRodney W. Grimes if (oldcount == -1) { 180dea673e9SRodney W. Grimes fl = (struct file_list *) malloc(sizeof *fl); 181dea673e9SRodney W. Grimes bzero(fl, sizeof(*fl)); 1825bd7b809SJoerg Wunsch fl->f_fn = ns(name); 183dea673e9SRodney W. Grimes fl->f_type = count; 184dea673e9SRodney W. Grimes fl->f_next = fl_head; 185dea673e9SRodney W. Grimes fl_head = fl; 186dea673e9SRodney W. Grimes } 187dea673e9SRodney W. Grimes outf = fopen(file, "w"); 188d5831691SPhilippe Charnier if (outf == 0) 189d5831691SPhilippe Charnier err(1, "%s", file); 190dea673e9SRodney W. Grimes for (fl = fl_head; fl != NULL; fl = tflp) { 191dea673e9SRodney W. Grimes fprintf(outf, 192dea673e9SRodney W. Grimes "#define %s %u\n", fl->f_fn, count ? fl->f_type : 0); 193dea673e9SRodney W. Grimes tflp = fl->f_next; 1946d41b96fSPeter Wemm free(fl->f_fn); 195dea673e9SRodney W. Grimes free(fl); 196dea673e9SRodney W. Grimes } 197dea673e9SRodney W. Grimes (void) fclose(outf); 198dea673e9SRodney W. Grimes } 199dea673e9SRodney W. Grimes 200dea673e9SRodney W. Grimes /* 201dea673e9SRodney W. Grimes * convert a dev name to a .h file name 202dea673e9SRodney W. Grimes */ 203dea673e9SRodney W. Grimes char * 204dea673e9SRodney W. Grimes toheader(dev) 205dea673e9SRodney W. Grimes char *dev; 206dea673e9SRodney W. Grimes { 207dea673e9SRodney W. Grimes static char hbuf[80]; 208dea673e9SRodney W. Grimes 209dea673e9SRodney W. Grimes (void) strcpy(hbuf, path(dev)); 210dea673e9SRodney W. Grimes (void) strcat(hbuf, ".h"); 211dea673e9SRodney W. Grimes return (hbuf); 212dea673e9SRodney W. Grimes } 213dea673e9SRodney W. Grimes 214dea673e9SRodney W. Grimes /* 215dea673e9SRodney W. Grimes * convert a dev name to a macro name 216dea673e9SRodney W. Grimes */ 217dea673e9SRodney W. Grimes char *tomacro(dev) 218dea673e9SRodney W. Grimes register char *dev; 219dea673e9SRodney W. Grimes { 220dea673e9SRodney W. Grimes static char mbuf[20]; 221dea673e9SRodney W. Grimes register char *cp; 222dea673e9SRodney W. Grimes 223dea673e9SRodney W. Grimes cp = mbuf; 224dea673e9SRodney W. Grimes *cp++ = 'N'; 225dea673e9SRodney W. Grimes while (*dev) 226dea673e9SRodney W. Grimes *cp++ = islower(*dev) ? toupper(*dev++) : *dev++; 227dea673e9SRodney W. Grimes *cp++ = 0; 228dea673e9SRodney W. Grimes return (mbuf); 229dea673e9SRodney W. Grimes } 230