1 %{ 2 /*- 3 * Copyright (c) 1980, 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 1. Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 4. Neither the name of the University nor the names of its contributors 15 * may be used to endorse or promote products derived from this software 16 * without specific prior written permission. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 * SUCH DAMAGE. 29 * 30 * @(#)lang.l 8.1 (Berkeley) 6/6/93 31 * $FreeBSD$ 32 */ 33 34 #include <assert.h> 35 #include <ctype.h> 36 #include <err.h> 37 #include <string.h> 38 #include "y.tab.h" 39 #include "config.h" 40 41 #define YY_NO_UNPUT 42 43 /* 44 * Data for returning to previous files from include files. 45 */ 46 struct incl { 47 struct incl *in_prev; /* previous includes in effect, if any */ 48 YY_BUFFER_STATE in_buf; /* previous lex state */ 49 const char *in_fname; /* previous file name */ 50 int in_lineno; /* previous line number */ 51 int in_ateof; /* token to insert at EOF */ 52 }; 53 static struct incl *inclp; 54 static const char *lastfile; 55 56 /* 57 * Key word table 58 */ 59 60 struct kt { 61 const char *kt_name; 62 int kt_val; 63 } key_words[] = { 64 { "config", CONFIG }, 65 { "cpu", CPU }, 66 { "nocpu", NOCPU }, 67 { "device", DEVICE }, 68 { "devices", DEVICE }, 69 { "nodevice", NODEVICE }, 70 { "nodevices", NODEVICE }, 71 { "env", ENV }, 72 { "hints", HINTS }, 73 { "ident", IDENT }, 74 { "machine", ARCH }, /* MACHINE is defined in /sys/param.h */ 75 { "makeoption", MAKEOPTIONS }, 76 { "makeoptions", MAKEOPTIONS }, 77 { "nomakeoption", NOMAKEOPTION }, 78 { "nomakeoptions", NOMAKEOPTION }, 79 { "maxusers", MAXUSERS }, 80 { "profile", PROFILE }, 81 { "option", OPTIONS }, 82 { "options", OPTIONS }, 83 { "nooption", NOOPTION }, 84 { "nooptions", NOOPTION }, 85 { "include", INCLUDE }, 86 { "files", FILES }, 87 { 0, 0 }, 88 }; 89 90 91 static int endinclude(void); 92 int include(const char *, int); 93 int kw_lookup(char *); 94 unsigned int octal(const char *); 95 unsigned int hex(const char *); 96 int yyerror(const char *); 97 98 %} 99 ID [A-Za-z_][-A-Za-z_0-9]* 100 PATH [./][-/.%^A-Za-z_0-9]+ 101 %START TOEOL 102 %% 103 {ID} { 104 int i; 105 106 BEGIN 0; 107 if ((i = kw_lookup(yytext)) == -1) 108 { 109 yylval.str = strdup(yytext); 110 return ID; 111 } 112 return i; 113 } 114 \\\"[^"]+\\\" { 115 BEGIN 0; 116 yytext[yyleng-2] = '"'; 117 yytext[yyleng-1] = '\0'; 118 yylval.str = strdup(yytext + 1); 119 return ID; 120 } 121 \"[^"]+\" { 122 BEGIN 0; 123 yytext[yyleng-1] = '\0'; 124 yylval.str = strdup(yytext + 1); 125 return ID; 126 } 127 <TOEOL>[^# \t\n]* { 128 BEGIN 0; 129 yylval.str = strdup(yytext); 130 return ID; 131 } 132 0[0-7]* { 133 yylval.val = octal(yytext); 134 return NUMBER; 135 } 136 0x[0-9a-fA-F]+ { 137 yylval.val = hex(yytext); 138 return NUMBER; 139 } 140 -?[1-9][0-9]* { 141 yylval.val = atoi(yytext); 142 return NUMBER; 143 } 144 "?" { 145 yylval.val = -1; 146 return NUMBER; 147 } 148 \n/[ \t] { 149 yyline++; 150 } 151 \n { 152 yyline++; 153 return SEMICOLON; 154 } 155 #.* { /* Ignored (comment) */; } 156 [ \t\f]* { /* Ignored (white space) */; } 157 ";" { return SEMICOLON; } 158 "," { return COMMA; } 159 "=" { BEGIN TOEOL; return EQUALS; } 160 "+=" { BEGIN TOEOL; return PLUSEQUALS; } 161 <<EOF>> { 162 int tok; 163 164 if (inclp == NULL) 165 return YY_NULL; 166 tok = endinclude(); 167 if (tok != 0) 168 return tok; 169 /* otherwise continue scanning */ 170 } 171 {PATH} { 172 BEGIN 0; 173 yylval.str = strdup(yytext); 174 return PATH; 175 } 176 . { return yytext[0]; } 177 178 %% 179 /* 180 * kw_lookup 181 * Look up a string in the keyword table. Returns a -1 if the 182 * string is not a keyword otherwise it returns the keyword number 183 */ 184 185 int 186 kw_lookup(char *word) 187 { 188 struct kt *kp; 189 190 for (kp = key_words; kp->kt_name != 0; kp++) 191 if (eq(word, kp->kt_name)) 192 return kp->kt_val; 193 return -1; 194 } 195 196 /* 197 * Number conversion routines 198 */ 199 200 unsigned int 201 octal(const char *str) 202 { 203 unsigned int num; 204 205 (void) sscanf(str, "%o", &num); 206 return num; 207 } 208 209 unsigned int 210 hex(const char *str) 211 { 212 unsigned int num; 213 214 (void) sscanf(str+2, "%x", &num); 215 return num; 216 } 217 218 void 219 cfgfile_add(const char *fname) 220 { 221 struct cfgfile *cf; 222 223 cf = calloc(1, sizeof(*cf)); 224 if (cf == NULL) 225 err(EXIT_FAILURE, "calloc"); 226 assert(cf != NULL); 227 asprintf(&cf->cfg_path, "%s", fname); 228 STAILQ_INSERT_TAIL(&cfgfiles, cf, cfg_next); 229 } 230 231 void 232 cfgfile_removeall(void) 233 { 234 struct cfgfile *cf; 235 236 while (!STAILQ_EMPTY(&cfgfiles)) { 237 cf = STAILQ_FIRST(&cfgfiles); 238 STAILQ_REMOVE_HEAD(&cfgfiles, cfg_next); 239 if (cf->cfg_path != NULL) 240 free(cf->cfg_path); 241 free(cf); 242 } 243 } 244 245 /* 246 * Open the named file for inclusion at the current point. Returns 0 on 247 * success (file opened and previous state pushed), nonzero on failure 248 * (fopen failed, complaint made). The `ateof' parameter controls the 249 * token to be inserted at the end of the include file. If ateof == 0, 250 * then nothing is inserted. 251 */ 252 int 253 include(const char *fname, int ateof) 254 { 255 FILE *fp; 256 struct incl *in; 257 char *fnamebuf; 258 259 fnamebuf = NULL; 260 fp = fopen(fname, "r"); 261 if (fp == NULL && fname[0] != '.' && fname[0] != '/') { 262 asprintf(&fnamebuf, "../../conf/%s", fname); 263 if (fnamebuf != NULL) { 264 fp = fopen(fnamebuf, "r"); 265 free(fnamebuf); 266 } 267 } 268 if (fp == NULL) { 269 yyerror("cannot open included file"); 270 return (-1); 271 } 272 cfgfile_add(fnamebuf == NULL ? fname : fnamebuf); 273 in = malloc(sizeof(*in)); 274 assert(in != NULL); 275 in->in_prev = inclp; 276 in->in_buf = YY_CURRENT_BUFFER; 277 in->in_fname = yyfile; 278 in->in_lineno = yyline; 279 in->in_ateof = ateof; 280 inclp = in; 281 yy_switch_to_buffer(yy_create_buffer(fp, YY_BUF_SIZE)); 282 yyfile = fname; 283 yyline = 0; 284 return (0); 285 } 286 287 /* 288 * Terminate the most recent inclusion. 289 */ 290 static int 291 endinclude(void) 292 { 293 struct incl *in; 294 int ateof; 295 296 in = inclp; 297 assert(in != NULL); 298 inclp = in->in_prev; 299 lastfile = yyfile; 300 yy_delete_buffer(YY_CURRENT_BUFFER); 301 (void)fclose(yyin); 302 yy_switch_to_buffer(in->in_buf); 303 yyfile = in->in_fname; 304 yyline = in->in_lineno; 305 ateof = in->in_ateof; 306 free(in); 307 308 return (ateof); 309 } 310