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