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