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 <sys/param.h> 51 #include "config.h" 52 #include "y.tab.h" 53 54 static int do_header(char *, int); 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 int match; 64 int errors; 65 66 errors = 0; 67 for (fl = ftab; fl != 0; fl = fl->f_next) { 68 if (fl->f_needs != 0) { 69 match = 0; 70 for (dp = dtab; dp != 0; dp = dp->d_next) { 71 if (eq(dp->d_name, fl->f_needs)) { 72 match++; 73 dp->d_done |= DEVDONE; 74 } 75 } 76 if (fl->f_flags & NEED_COUNT) 77 errors += do_header(fl->f_needs, match); 78 } 79 } 80 for (dp = dtab; dp != 0; dp = dp->d_next) { 81 if (!(dp->d_done & DEVDONE)) { 82 warnx("Error: device \"%s\" is unknown", 83 dp->d_name); 84 errors++; 85 } 86 if (dp->d_count == UNKNOWN) 87 continue; 88 match = 0; 89 for (fl = ftab; fl != 0; fl = fl->f_next) { 90 if (fl->f_needs == 0) 91 continue; 92 if ((fl->f_flags & NEED_COUNT) == 0) 93 continue; 94 if (eq(dp->d_name, fl->f_needs)) { 95 match++; 96 break; 97 } 98 } 99 if (match == 0) { 100 warnx("Error: device \"%s\" does not take a count", 101 dp->d_name); 102 errors++; 103 } 104 } 105 if (errors) 106 errx(1, "%d errors", errors); 107 } 108 109 static int 110 do_header(char *dev, int match) 111 { 112 char *file, *name, *inw; 113 struct file_list *fl, *fl_head, *tflp; 114 struct device *dp; 115 FILE *inf, *outf; 116 int inc, oldcount; 117 int count, hicount; 118 int errors; 119 120 /* 121 * After this loop, "count" will be the actual number of units, 122 * and "hicount" will be the highest unit declared. do_header() 123 * must use this higher of these values. 124 */ 125 errors = 0; 126 for (hicount = count = 0, dp = dtab; dp != 0; dp = dp->d_next) { 127 if (eq(dp->d_name, dev)) { 128 if (dp->d_count == UNKNOWN) { 129 warnx("Device \"%s\" requires a count", dev); 130 return 1; 131 } 132 count = dp->d_count; 133 break; 134 } 135 } 136 file = toheader(dev); 137 name = tomacro(dev); 138 if (match) 139 printf("FYI: static unit limits for %s are set: %s=%d\n", dev, name, count); 140 remember(file); 141 inf = fopen(file, "r"); 142 oldcount = -1; 143 if (inf == 0) { 144 outf = fopen(file, "w"); 145 if (outf == 0) 146 err(1, "%s", file); 147 fprintf(outf, "#define %s %d\n", name, count); 148 (void) fclose(outf); 149 return 0; 150 } 151 fl_head = NULL; 152 for (;;) { 153 char *cp; 154 if ((inw = get_word(inf)) == 0 || inw == (char *)EOF) 155 break; 156 if ((inw = get_word(inf)) == 0 || inw == (char *)EOF) 157 break; 158 inw = ns(inw); 159 cp = get_word(inf); 160 if (cp == 0 || cp == (char *)EOF) 161 break; 162 inc = atoi(cp); 163 if (eq(inw, name)) { 164 oldcount = inc; 165 inc = count; 166 } 167 cp = get_word(inf); 168 if (cp == (char *)EOF) 169 break; 170 fl = (struct file_list *) malloc(sizeof *fl); 171 bzero(fl, sizeof(*fl)); 172 fl->f_fn = inw; /* malloced */ 173 fl->f_type = inc; 174 fl->f_next = fl_head; 175 fl_head = fl; 176 } 177 (void) fclose(inf); 178 if (count == oldcount) { 179 for (fl = fl_head; fl != NULL; fl = tflp) { 180 tflp = fl->f_next; 181 free(fl->f_fn); 182 free(fl); 183 } 184 return 0; 185 } 186 if (oldcount == -1) { 187 fl = (struct file_list *) malloc(sizeof *fl); 188 bzero(fl, sizeof(*fl)); 189 fl->f_fn = ns(name); 190 fl->f_type = count; 191 fl->f_next = fl_head; 192 fl_head = fl; 193 } 194 outf = fopen(file, "w"); 195 if (outf == 0) 196 err(1, "%s", file); 197 for (fl = fl_head; fl != NULL; fl = tflp) { 198 fprintf(outf, 199 "#define %s %u\n", fl->f_fn, count ? fl->f_type : 0); 200 tflp = fl->f_next; 201 free(fl->f_fn); 202 free(fl); 203 } 204 (void) fclose(outf); 205 return 0; 206 } 207 208 /* 209 * convert a dev name to a .h file name 210 */ 211 static char * 212 toheader(char *dev) 213 { 214 static char hbuf[MAXPATHLEN]; 215 216 snprintf(hbuf, sizeof(hbuf), "%s.h", path(dev)); 217 return (hbuf); 218 } 219 220 /* 221 * convert a dev name to a macro name 222 */ 223 static char * 224 tomacro(char *dev) 225 { 226 static char mbuf[20]; 227 char *cp; 228 229 cp = mbuf; 230 *cp++ = 'N'; 231 while (*dev) 232 *cp++ = islower(*dev) ? toupper(*dev++) : *dev++; 233 *cp++ = 0; 234 return (mbuf); 235 } 236