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: src/usr.sbin/config/lang.l,v 1.27 1999/11/09 07:20:22 peter Exp $ 36 * $DragonFly: src/usr.sbin/config/lang.l,v 1.13 2007/01/19 07:23:43 dillon Exp $ 37 */ 38 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 * Key word table 48 */ 49 50 struct kt { 51 const char *kt_name; 52 int kt_val; 53 } key_words[] = { 54 { "at", AT }, 55 { "bus", BUS }, 56 { "conflicts", CONFLICTS }, 57 { "config", CONFIG }, 58 { "controller", CONTROLLER }, 59 { "cpu", CPU }, 60 { "device", DEVICE }, 61 { "disable", DISABLE }, 62 { "disk", DISK }, 63 { "drive", DRIVE }, 64 { "drq", DRQ }, 65 { "flags", FLAGS }, 66 { "ident", IDENT }, 67 { "iomem", IOMEM }, 68 { "iosiz", IOSIZ }, 69 { "irq", IRQ }, 70 { "machine", CONFIG_MACHINE }, 71 { "machine_arch", CONFIG_MACHINE_ARCH }, 72 { "makeoptions", MAKEOPTIONS }, 73 { "maxusers", MAXUSERS }, 74 { "nexus", NEXUS }, 75 { "option", OPTIONS }, 76 { "options", OPTIONS }, 77 { "platform", CONFIG_PLATFORM }, 78 { "port", PORT }, 79 { "pseudo-device",PSEUDO_DEVICE }, 80 { "tape", TAPE }, 81 { "target", TARGET }, 82 { "unit", UNIT }, 83 { 0, 0 }, 84 }; 85 86 87 int kw_lookup(char *); 88 int octal(char *); 89 int hex(char *); 90 91 %} 92 WORD [A-Za-z_][-A-Za-z_]* 93 ID [A-Za-z_][-A-Za-z_0-9]* 94 %START NONUM TOEOL 95 %% 96 <NONUM>{WORD} { 97 int i; 98 99 BEGIN 0; 100 if ((i = kw_lookup(yytext)) == -1) 101 { 102 yylval.str = strdup(yytext); 103 return(ID); 104 } 105 return(i); 106 } 107 <INITIAL>{WORD}/[0-9]* { 108 int i; 109 110 if ((i = kw_lookup(yytext)) == -1) 111 REJECT; 112 if (i == CONTROLLER || i == DEVICE || i == DISK || i == TAPE || 113 i == PSEUDO_DEVICE || i == AT) 114 BEGIN NONUM; 115 return(i); 116 } 117 <INITIAL>{ID} { 118 BEGIN 0; 119 yylval.str = strdup(yytext); 120 return(ID); 121 } 122 \\\"[^"]+\\\" { 123 BEGIN 0; 124 yytext[yyleng-2] = '"'; 125 yytext[yyleng-1] = '\0'; 126 yylval.str = strdup(yytext + 1); 127 return(ID); 128 } 129 \"[^"]+\" { 130 BEGIN 0; 131 yytext[yyleng-1] = '\0'; 132 yylval.str = strdup(yytext + 1); 133 return(ID); 134 } 135 <TOEOL>[^# \t\n]* { 136 BEGIN 0; 137 yylval.str = strdup(yytext); 138 return(ID); 139 } 140 0[0-7]* { 141 yylval.val = octal(yytext); 142 return(NUMBER); 143 } 144 0x[0-9a-fA-F]+ { 145 yylval.val = hex(yytext); 146 return(NUMBER); 147 } 148 -?[1-9][0-9]* { 149 yylval.val = atoi(yytext); 150 return(NUMBER); 151 } 152 [0-9]"."[0-9]* { 153 yylval.val = (int)(60 * atof(yytext) + 0.5); 154 return(FPNUMBER); 155 } 156 "?" { 157 yylval.val = -1; 158 return(NUMBER); 159 } 160 \n/[ \t] { 161 yyline++; 162 } 163 \n { 164 yyline++; 165 return(SEMICOLON); 166 } 167 #.* { /* Ignored (comment) */; } 168 [ \t\f]* { /* Ignored (white space) */; } 169 ";" { return(SEMICOLON); } 170 "," { return(COMMA); } 171 "=" { BEGIN TOEOL; return(EQUALS); } 172 "@" { return(AT); } 173 . { return(yytext[0]); } 174 175 %% 176 /* 177 * kw_lookup 178 * Look up a string in the keyword table. Returns a -1 if the 179 * string is not a keyword otherwise it returns the keyword number 180 */ 181 182 int 183 kw_lookup(char *word) 184 { 185 struct kt *kp; 186 187 for (kp = key_words; kp->kt_name != NULL; kp++) 188 if (!strcmp(word, kp->kt_name)) 189 return(kp->kt_val); 190 return(-1); 191 } 192 193 /* 194 * Number conversion routines 195 */ 196 197 int 198 octal(char *str) 199 { 200 int num; 201 202 sscanf(str, "%o", &num); 203 return(num); 204 } 205 206 int 207 hex(char *str) 208 { 209 int num; 210 211 sscanf(str + 2, "%x", &num); 212 return(num); 213 } 214