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 36 static char sccsid[] = "@(#)mkheaders.c 8.1 (Berkeley) 6/6/93"; 37 #endif 38 static const char rcsid[] = 39 "$FreeBSD$"; 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 53 static void do_header(char *, int); 54 static void do_count(char *); 55 static char *toheader(char *); 56 static char *tomacro(char *); 57 58 void 59 headers(void) 60 { 61 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 for (dp = dtab; dp != 0; dp = dp->d_next) { 67 if (eq(dp->d_name, fl->f_needs)) { 68 if ((dp->d_type & TYPEMASK) == DEVICE) 69 dp->d_type |= DEVDONE; 70 } 71 } 72 if (fl->f_flags & NEED_COUNT) 73 do_count(fl->f_needs); 74 } 75 } 76 for (dp = dtab; dp != 0; dp = dp->d_next) { 77 if ((dp->d_type & TYPEMASK) == DEVICE) { 78 if (!(dp->d_type & DEVDONE)) 79 printf("Warning: device \"%s\" is unknown\n", 80 dp->d_name); 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 */ 89 static void 90 do_count(char *dev) 91 { 92 struct device *dp; 93 int count, hicount; 94 95 /* 96 * After this loop, "count" will be the actual number of units, 97 * and "hicount" will be the highest unit declared. do_header() 98 * must use this higher of these values. 99 */ 100 for (hicount = count = 0, dp = dtab; dp != 0; dp = dp->d_next) { 101 if (eq(dp->d_name, dev)) { 102 count = 103 dp->d_count != UNKNOWN ? dp->d_count : 1; 104 break; 105 } 106 } 107 do_header(dev, count); 108 } 109 110 static void 111 do_header(char *dev, int count) 112 { 113 char *file, *name, *inw; 114 struct file_list *fl, *fl_head, *tflp; 115 FILE *inf, *outf; 116 int inc, oldcount; 117 118 file = toheader(dev); 119 name = tomacro(dev); 120 inf = fopen(file, "r"); 121 oldcount = -1; 122 if (inf == 0) { 123 outf = fopen(file, "w"); 124 if (outf == 0) 125 err(1, "%s", file); 126 fprintf(outf, "#define %s %d\n", name, count); 127 (void) fclose(outf); 128 return; 129 } 130 fl_head = NULL; 131 for (;;) { 132 char *cp; 133 if ((inw = get_word(inf)) == 0 || inw == (char *)EOF) 134 break; 135 if ((inw = get_word(inf)) == 0 || inw == (char *)EOF) 136 break; 137 inw = ns(inw); 138 cp = get_word(inf); 139 if (cp == 0 || cp == (char *)EOF) 140 break; 141 inc = atoi(cp); 142 if (eq(inw, name)) { 143 oldcount = inc; 144 inc = count; 145 } 146 cp = get_word(inf); 147 if (cp == (char *)EOF) 148 break; 149 fl = (struct file_list *) malloc(sizeof *fl); 150 bzero(fl, sizeof(*fl)); 151 fl->f_fn = inw; /* malloced */ 152 fl->f_type = inc; 153 fl->f_next = fl_head; 154 fl_head = fl; 155 } 156 (void) fclose(inf); 157 if (count == oldcount) { 158 for (fl = fl_head; fl != NULL; fl = tflp) { 159 tflp = fl->f_next; 160 free(fl->f_fn); 161 free(fl); 162 } 163 return; 164 } 165 if (oldcount == -1) { 166 fl = (struct file_list *) malloc(sizeof *fl); 167 bzero(fl, sizeof(*fl)); 168 fl->f_fn = ns(name); 169 fl->f_type = count; 170 fl->f_next = fl_head; 171 fl_head = fl; 172 } 173 outf = fopen(file, "w"); 174 if (outf == 0) 175 err(1, "%s", file); 176 for (fl = fl_head; fl != NULL; fl = tflp) { 177 fprintf(outf, 178 "#define %s %u\n", fl->f_fn, count ? fl->f_type : 0); 179 tflp = fl->f_next; 180 free(fl->f_fn); 181 free(fl); 182 } 183 (void) fclose(outf); 184 } 185 186 /* 187 * convert a dev name to a .h file name 188 */ 189 static char * 190 toheader(char *dev) 191 { 192 static char hbuf[80]; 193 194 (void) strcpy(hbuf, path(dev)); 195 (void) strcat(hbuf, ".h"); 196 return (hbuf); 197 } 198 199 /* 200 * convert a dev name to a macro name 201 */ 202 static char * 203 tomacro(char *dev) 204 { 205 static char mbuf[20]; 206 char *cp; 207 208 cp = mbuf; 209 *cp++ = 'N'; 210 while (*dev) 211 *cp++ = islower(*dev) ? toupper(*dev++) : *dev++; 212 *cp++ = 0; 213 return (mbuf); 214 } 215